src/TortoiseProc/LogDlgHelper.h

   1 // TortoiseGit - a Windows shell extension for easy version control\r
   2 \r
   3 // Copyright (C) 2003-2007 - TortoiseGit\r
   4 \r
   5 // This program is free software; you can redistribute it and/or\r
   6 // modify it under the terms of the GNU General Public License\r
   7 // as published by the Free Software Foundation; either version 2\r
   8 // of the License, or (at your option) any later version.\r
   9 \r
  10 // This program is distributed in the hope that it will be useful,\r
  11 // but WITHOUT ANY WARRANTY; without even the implied warranty of\r
  12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\r
  13 // GNU General Public License for more details.\r
  14 \r
  15 // You should have received a copy of the GNU General Public License\r
  16 // along with this program; if not, write to the Free Software Foundation,\r
  17 // 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\r
  18 //\r
  19 #pragma once\r
  20 #include "Git.h"\r
  21 #include "GitRev.h"\r
  22 #include "GitStatus.h"\r
  23 #include "ILogReceiver.h"\r
  24 #include "lanes.h"\r
  25 #include <set> \r
  26 \r
  27 class CLogDlg;\r
  28 \r
  29 /**\r
  30  * \ingroup TortoiseProc\r
  31  * Instances of CStoreSelection save the selection of the CLogDlg. When the instance\r
  32  * is deleted the destructor restores the selection.\r
  33  */\r
  34 typedef std::map<CString, int> MAP_HASH_REV;\r
  35 \r
  36 class CStoreSelection\r
  37 {\r
  38 public:\r
  39         CStoreSelection(CLogDlg* dlg);\r
  40         ~CStoreSelection();\r
  41 protected:\r
  42         CLogDlg* m_logdlg;\r
  43         std::set<LONG> m_SetSelectedRevisions;\r
  44 };\r
  45 \r
  46 \r
  47 /**\r
  48  * \ingroup TortoiseProc\r
  49  * Helper class for the log dialog, handles all the log entries, including\r
  50  * sorting.\r
  51  */\r
  52 class CLogDataVector :  public std::vector<GitRev>\r
  53 {\r
  54 public:\r
  55         /// De-allocates log items.\r
  56         CLogDataVector()\r
  57         {\r
  58                 m_FirstFreeLane=0;\r
  59         }\r
  60         void ClearAll();\r
  61         int  ParserFromLog(CTGitPath *path =NULL,int count = -1,int infomask=CGit::LOG_INFO_STAT|CGit::LOG_INFO_FILESTATE);\r
  62         int  ParserShortLog(CTGitPath *path ,CString &hash,int count=-1 ,int mask=CGit::LOG_INFO_ONLY_HASH );\r
  63         int FetchFullInfo(int i);\r
  64 //      void AddFullInfo(\r
  65 \r
  66         Lanes m_Lns;\r
  67         int      m_FirstFreeLane;\r
  68         MAP_HASH_REV m_HashMap;\r
  69         void updateLanes(GitRev& c, Lanes& lns, CString &sha) ;\r
  70         void setLane(CString& sha) ;\r
  71         \r
  72         \r
  73 \r
  74 \r
  75 #if 0\r
  76         /// Ascending date sorting.\r
  77         struct AscDateSort\r
  78         {\r
  79                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
  80                 {\r
  81                         return pStart->tmDate < pEnd->tmDate;\r
  82                 }\r
  83         };\r
  84         /// Descending date sorting.\r
  85         struct DescDateSort\r
  86         {\r
  87                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
  88                 {\r
  89                         return pStart->tmDate > pEnd->tmDate;\r
  90                 }\r
  91         };\r
  92         /// Ascending revision sorting.\r
  93         struct AscRevSort\r
  94         {\r
  95                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
  96                 {\r
  97                         return pStart->Rev < pEnd->Rev;\r
  98                 }\r
  99         };\r
 100         /// Descending revision sorting.\r
 101         struct DescRevSort\r
 102         {\r
 103                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 104                 {\r
 105                         return pStart->Rev > pEnd->Rev;\r
 106                 }\r
 107         };\r
 108         /// Ascending author sorting.\r
 109         struct AscAuthorSort\r
 110         {\r
 111                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 112                 {\r
 113                         int ret = pStart->sAuthor.CompareNoCase(pEnd->sAuthor);\r
 114                         if (ret == 0)\r
 115                                 return pStart->Rev < pEnd->Rev;\r
 116                         return ret<0;\r
 117                 }\r
 118         };\r
 119         /// Descending author sorting.\r
 120         struct DescAuthorSort\r
 121         {\r
 122                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 123                 {\r
 124                         int ret = pStart->sAuthor.CompareNoCase(pEnd->sAuthor);\r
 125                         if (ret == 0)\r
 126                                 return pStart->Rev > pEnd->Rev;\r
 127                         return ret>0;\r
 128                 }\r
 129         };\r
 130         /// Ascending bugID sorting.\r
 131         struct AscBugIDSort\r
 132         {\r
 133                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 134                 {\r
 135                         int ret = pStart->sBugIDs.CompareNoCase(pEnd->sBugIDs);\r
 136                         if (ret == 0)\r
 137                                 return pStart->Rev < pEnd->Rev;\r
 138                         return ret<0;\r
 139                 }\r
 140         };\r
 141         /// Descending bugID sorting.\r
 142         struct DescBugIDSort\r
 143         {\r
 144                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 145                 {\r
 146                         int ret = pStart->sBugIDs.CompareNoCase(pEnd->sBugIDs);\r
 147                         if (ret == 0)\r
 148                                 return pStart->Rev > pEnd->Rev;\r
 149                         return ret>0;\r
 150                 }\r
 151         };\r
 152         /// Ascending message sorting.\r
 153         struct AscMessageSort\r
 154         {\r
 155                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 156                 {\r
 157                         return pStart->sShortMessage.CompareNoCase(pEnd->sShortMessage)<0;\r
 158                 }\r
 159         };\r
 160         /// Descending message sorting.\r
 161         struct DescMessageSort\r
 162         {\r
 163                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
 164                 {\r
 165                         return pStart->sShortMessage.CompareNoCase(pEnd->sShortMessage)>0;\r
 166                 }\r
 167         };\r
 168         /// Ascending action sorting\r
 169         struct AscActionSort\r
 170         {\r
 171                 bool operator() (GitRev& pStart, GitRev& pEnd)\r
 172                 {\r
 173                         if (pStart->actions == pEnd->actions)\r
 174                                 return pStart->Rev < pEnd->Rev;\r
 175                         return pStart->actions < pEnd->actions;\r
 176                 }\r
 177         };\r
 178         /// Descending action sorting\r
 179         struct DescActionSort\r
 180         {\r
 181                 bool operator() (GitRev& pStart, GitRev& pEnd)\r
 182                 {\r
 183                         if (pStart->actions == pEnd->actions)\r
 184                                 return pStart->Rev > pEnd->Rev;\r
 185                         return pStart->actions > pEnd->actions;\r
 186                 }\r
 187         };\r
 188 #endif\r
 189 };\r