OSDN Git Service

Add show one file log at dialog box.
[tortoisegit/TortoiseGitJp.git] / 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 \r
65         Lanes m_Lns;\r
66         int      m_FirstFreeLane;\r
67         MAP_HASH_REV m_HashMap;\r
68         void updateLanes(GitRev& c, Lanes& lns, CString &sha) ;\r
69         void setLane(CString& sha) ;\r
70         \r
71         \r
72 \r
73 \r
74 #if 0\r
75         /// Ascending date sorting.\r
76         struct AscDateSort\r
77         {\r
78                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
79                 {\r
80                         return pStart->tmDate < pEnd->tmDate;\r
81                 }\r
82         };\r
83         /// Descending date sorting.\r
84         struct DescDateSort\r
85         {\r
86                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
87                 {\r
88                         return pStart->tmDate > pEnd->tmDate;\r
89                 }\r
90         };\r
91         /// Ascending revision sorting.\r
92         struct AscRevSort\r
93         {\r
94                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
95                 {\r
96                         return pStart->Rev < pEnd->Rev;\r
97                 }\r
98         };\r
99         /// Descending revision sorting.\r
100         struct DescRevSort\r
101         {\r
102                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
103                 {\r
104                         return pStart->Rev > pEnd->Rev;\r
105                 }\r
106         };\r
107         /// Ascending author sorting.\r
108         struct AscAuthorSort\r
109         {\r
110                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
111                 {\r
112                         int ret = pStart->sAuthor.CompareNoCase(pEnd->sAuthor);\r
113                         if (ret == 0)\r
114                                 return pStart->Rev < pEnd->Rev;\r
115                         return ret<0;\r
116                 }\r
117         };\r
118         /// Descending author sorting.\r
119         struct DescAuthorSort\r
120         {\r
121                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
122                 {\r
123                         int ret = pStart->sAuthor.CompareNoCase(pEnd->sAuthor);\r
124                         if (ret == 0)\r
125                                 return pStart->Rev > pEnd->Rev;\r
126                         return ret>0;\r
127                 }\r
128         };\r
129         /// Ascending bugID sorting.\r
130         struct AscBugIDSort\r
131         {\r
132                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
133                 {\r
134                         int ret = pStart->sBugIDs.CompareNoCase(pEnd->sBugIDs);\r
135                         if (ret == 0)\r
136                                 return pStart->Rev < pEnd->Rev;\r
137                         return ret<0;\r
138                 }\r
139         };\r
140         /// Descending bugID sorting.\r
141         struct DescBugIDSort\r
142         {\r
143                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
144                 {\r
145                         int ret = pStart->sBugIDs.CompareNoCase(pEnd->sBugIDs);\r
146                         if (ret == 0)\r
147                                 return pStart->Rev > pEnd->Rev;\r
148                         return ret>0;\r
149                 }\r
150         };\r
151         /// Ascending message sorting.\r
152         struct AscMessageSort\r
153         {\r
154                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
155                 {\r
156                         return pStart->sShortMessage.CompareNoCase(pEnd->sShortMessage)<0;\r
157                 }\r
158         };\r
159         /// Descending message sorting.\r
160         struct DescMessageSort\r
161         {\r
162                 bool operator()(GitRev& pStart, GitRev& pEnd)\r
163                 {\r
164                         return pStart->sShortMessage.CompareNoCase(pEnd->sShortMessage)>0;\r
165                 }\r
166         };\r
167         /// Ascending action sorting\r
168         struct AscActionSort\r
169         {\r
170                 bool operator() (GitRev& pStart, GitRev& pEnd)\r
171                 {\r
172                         if (pStart->actions == pEnd->actions)\r
173                                 return pStart->Rev < pEnd->Rev;\r
174                         return pStart->actions < pEnd->actions;\r
175                 }\r
176         };\r
177         /// Descending action sorting\r
178         struct DescActionSort\r
179         {\r
180                 bool operator() (GitRev& pStart, GitRev& pEnd)\r
181                 {\r
182                         if (pStart->actions == pEnd->actions)\r
183                                 return pStart->Rev > pEnd->Rev;\r
184                         return pStart->actions > pEnd->actions;\r
185                 }\r
186         };\r
187 #endif\r
188 };\r