1 // TortoiseGit - a Windows shell extension for easy version control
\r
3 // Copyright (C) 2003-2007 - TortoiseGit
\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
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
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
22 #include "GitStatus.h"
\r
23 #include "ILogReceiver.h"
\r
28 * \ingroup TortoiseProc
\r
29 * Instances of CStoreSelection save the selection of the CLogDlg. When the instance
\r
30 * is deleted the destructor restores the selection.
\r
32 class CStoreSelection
\r
35 CStoreSelection(CLogDlg* dlg);
\r
39 std::set<LONG> m_SetSelectedRevisions;
\r
43 * \ingroup TortoiseProc
\r
44 * Contains the data of one log entry, used in the log dialog
\r
47 typedef struct LogEntryData
\r
54 CString sShortMessage;
\r
56 DWORD dwFileChanges;
\r
57 LogChangedPathArray* pArChangedPaths;
\r
62 DWORD childStackDepth;
\r
63 } LOGENTRYDATA, *PLOGENTRYDATA;
\r
66 * \ingroup TortoiseProc
\r
67 * Helper class for the log dialog, handles all the log entries, including
\r
70 class CLogDataVector : public std::vector<GitRev>
\r
73 /// De-allocates log items.
\r
75 int ParserFromLog();
\r
77 /// Ascending date sorting.
\r
80 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
82 return pStart->tmDate < pEnd->tmDate;
\r
85 /// Descending date sorting.
\r
88 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
90 return pStart->tmDate > pEnd->tmDate;
\r
93 /// Ascending revision sorting.
\r
96 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
98 return pStart->Rev < pEnd->Rev;
\r
101 /// Descending revision sorting.
\r
104 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
106 return pStart->Rev > pEnd->Rev;
\r
109 /// Ascending author sorting.
\r
110 struct AscAuthorSort
\r
112 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
114 int ret = pStart->sAuthor.CompareNoCase(pEnd->sAuthor);
\r
116 return pStart->Rev < pEnd->Rev;
\r
120 /// Descending author sorting.
\r
121 struct DescAuthorSort
\r
123 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
125 int ret = pStart->sAuthor.CompareNoCase(pEnd->sAuthor);
\r
127 return pStart->Rev > pEnd->Rev;
\r
131 /// Ascending bugID sorting.
\r
132 struct AscBugIDSort
\r
134 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
136 int ret = pStart->sBugIDs.CompareNoCase(pEnd->sBugIDs);
\r
138 return pStart->Rev < pEnd->Rev;
\r
142 /// Descending bugID sorting.
\r
143 struct DescBugIDSort
\r
145 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
147 int ret = pStart->sBugIDs.CompareNoCase(pEnd->sBugIDs);
\r
149 return pStart->Rev > pEnd->Rev;
\r
153 /// Ascending message sorting.
\r
154 struct AscMessageSort
\r
156 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
158 return pStart->sShortMessage.CompareNoCase(pEnd->sShortMessage)<0;
\r
161 /// Descending message sorting.
\r
162 struct DescMessageSort
\r
164 bool operator()(GitRev& pStart, GitRev& pEnd)
\r
166 return pStart->sShortMessage.CompareNoCase(pEnd->sShortMessage)>0;
\r
169 /// Ascending action sorting
\r
170 struct AscActionSort
\r
172 bool operator() (GitRev& pStart, GitRev& pEnd)
\r
174 if (pStart->actions == pEnd->actions)
\r
175 return pStart->Rev < pEnd->Rev;
\r
176 return pStart->actions < pEnd->actions;
\r
179 /// Descending action sorting
\r
180 struct DescActionSort
\r
182 bool operator() (GitRev& pStart, GitRev& pEnd)
\r
184 if (pStart->actions == pEnd->actions)
\r
185 return pStart->Rev > pEnd->Rev;
\r
186 return pStart->actions > pEnd->actions;
\r