1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
|
// **************************************************************************
// * This file is part of the FreeFileSync project. It is distributed under *
// * GNU General Public License: http://www.gnu.org/licenses/gpl.html *
// * Copyright (C) Zenju (zenju AT gmx DOT de) - All Rights Reserved *
// **************************************************************************
#include "grid_view.h"
#include "sorting.h"
#include "../synchronization.h"
#include <zen/stl_tools.h>
//#include <zen/perf.h>
using namespace zen;
template <class StatusResult>
void getNumbers(const FileSystemObject& fsObj, StatusResult& result)
{
struct GetValues : public FSObjectVisitor
{
GetValues(StatusResult& res) : result_(res) {}
virtual void visit(const FilePair& fileObj)
{
if (!fileObj.isEmpty<LEFT_SIDE>())
{
result_.filesizeLeftView += fileObj.getFileSize<LEFT_SIDE>();
++result_.filesOnLeftView;
}
if (!fileObj.isEmpty<RIGHT_SIDE>())
{
result_.filesizeRightView += fileObj.getFileSize<RIGHT_SIDE>();
++result_.filesOnRightView;
}
}
virtual void visit(const SymlinkPair& linkObj)
{
if (!linkObj.isEmpty<LEFT_SIDE>())
++result_.filesOnLeftView;
if (!linkObj.isEmpty<RIGHT_SIDE>())
++result_.filesOnRightView;
}
virtual void visit(const DirPair& dirObj)
{
if (!dirObj.isEmpty<LEFT_SIDE>())
++result_.foldersOnLeftView;
if (!dirObj.isEmpty<RIGHT_SIDE>())
++result_.foldersOnRightView;
}
StatusResult& result_;
} getVal(result);
fsObj.accept(getVal);
}
template <class Predicate>
void GridView::updateView(Predicate pred)
{
viewRef.clear();
rowPositions.clear();
rowPositionsFirstChild.clear();
std::for_each(sortedRef.begin(), sortedRef.end(),
[&](const RefIndex& ref)
{
if (const FileSystemObject* fsObj = FileSystemObject::retrieve(ref.objId))
if (pred(*fsObj))
{
//save row position for direct random access to FilePair or DirPair
this->rowPositions.insert(std::make_pair(ref.objId, viewRef.size())); //costs: 0.28 µs per call - MSVC based on std::set
//"this->" required by two-pass lookup as enforced by GCC 4.7
//save row position to identify first child *on sorted subview* of DirPair or BaseDirPair in case latter are filtered out
const HierarchyObject* parent = &fsObj->parent();
for (;;) //map all yet unassociated parents to this row
{
const auto rv = this->rowPositionsFirstChild.insert(std::make_pair(parent, viewRef.size()));
if (!rv.second)
break;
if (auto dirObj = dynamic_cast<const DirPair*>(parent))
parent = &(dirObj->parent());
else
break;
}
//build subview
this->viewRef.push_back(ref.objId);
}
});
}
ptrdiff_t GridView::findRowDirect(FileSystemObject::ObjectIdConst objId) const
{
auto it = rowPositions.find(objId);
return it != rowPositions.end() ? it->second : -1;
}
ptrdiff_t GridView::findRowFirstChild(const HierarchyObject* hierObj) const
{
auto it = rowPositionsFirstChild.find(hierObj);
return it != rowPositionsFirstChild.end() ? it->second : -1;
}
GridView::StatusCmpResult::StatusCmpResult() :
existsLeftOnly (false),
existsRightOnly (false),
existsLeftNewer (false),
existsRightNewer(false),
existsDifferent (false),
existsEqual (false),
existsConflict (false),
filesOnLeftView (0),
foldersOnLeftView (0),
filesOnRightView (0),
foldersOnRightView(0) {}
GridView::StatusCmpResult GridView::updateCmpResult(bool hideFiltered, //maps sortedRef to viewRef
bool leftOnlyFilesActive,
bool rightOnlyFilesActive,
bool leftNewerFilesActive,
bool rightNewerFilesActive,
bool differentFilesActive,
bool equalFilesActive,
bool conflictFilesActive)
{
StatusCmpResult output;
updateView([&](const FileSystemObject& fsObj) -> bool
{
if (hideFiltered && !fsObj.isActive())
return false;
switch (fsObj.getCategory())
{
case FILE_LEFT_SIDE_ONLY:
output.existsLeftOnly = true;
if (!leftOnlyFilesActive) return false;
break;
case FILE_RIGHT_SIDE_ONLY:
output.existsRightOnly = true;
if (!rightOnlyFilesActive) return false;
break;
case FILE_LEFT_NEWER:
output.existsLeftNewer = true;
if (!leftNewerFilesActive) return false;
break;
case FILE_RIGHT_NEWER:
output.existsRightNewer = true;
if (!rightNewerFilesActive) return false;
break;
case FILE_DIFFERENT:
output.existsDifferent = true;
if (!differentFilesActive) return false;
break;
case FILE_EQUAL:
case FILE_DIFFERENT_METADATA: //= sub-category of equal
output.existsEqual = true;
if (!equalFilesActive) return false;
break;
case FILE_CONFLICT:
output.existsConflict = true;
if (!conflictFilesActive) return false;
break;
}
//calculate total number of bytes for each side
getNumbers(fsObj, output);
return true;
});
return output;
}
GridView::StatusSyncPreview::StatusSyncPreview() :
existsSyncCreateLeft (false),
existsSyncCreateRight(false),
existsSyncDeleteLeft (false),
existsSyncDeleteRight(false),
existsSyncDirLeft (false),
existsSyncDirRight (false),
existsSyncDirNone (false),
existsSyncEqual (false),
existsConflict (false),
filesOnLeftView (0),
foldersOnLeftView (0),
filesOnRightView (0),
foldersOnRightView(0) {}
GridView::StatusSyncPreview GridView::updateSyncPreview(bool hideFiltered, //maps sortedRef to viewRef
bool syncCreateLeftActive,
bool syncCreateRightActive,
bool syncDeleteLeftActive,
bool syncDeleteRightActive,
bool syncDirOverwLeftActive,
bool syncDirOverwRightActive,
bool syncDirNoneActive,
bool syncEqualActive,
bool conflictFilesActive)
{
StatusSyncPreview output;
updateView([&](const FileSystemObject& fsObj) -> bool
{
if (hideFiltered && !fsObj.isActive())
return false;
switch (fsObj.getSyncOperation()) //evaluate comparison result and sync direction
{
case SO_CREATE_NEW_LEFT:
output.existsSyncCreateLeft = true;
if (!syncCreateLeftActive) return false;
break;
case SO_CREATE_NEW_RIGHT:
output.existsSyncCreateRight = true;
if (!syncCreateRightActive) return false;
break;
case SO_DELETE_LEFT:
output.existsSyncDeleteLeft = true;
if (!syncDeleteLeftActive) return false;
break;
case SO_DELETE_RIGHT:
output.existsSyncDeleteRight = true;
if (!syncDeleteRightActive) return false;
break;
case SO_OVERWRITE_RIGHT:
case SO_COPY_METADATA_TO_RIGHT: //no extra button on screen
case SO_MOVE_RIGHT_SOURCE:
case SO_MOVE_RIGHT_TARGET:
output.existsSyncDirRight = true;
if (!syncDirOverwRightActive) return false;
break;
case SO_OVERWRITE_LEFT:
case SO_COPY_METADATA_TO_LEFT: //no extra button on screen
case SO_MOVE_LEFT_TARGET:
case SO_MOVE_LEFT_SOURCE:
output.existsSyncDirLeft = true;
if (!syncDirOverwLeftActive) return false;
break;
case SO_DO_NOTHING:
output.existsSyncDirNone = true;
if (!syncDirNoneActive) return false;
break;
case SO_EQUAL:
output.existsSyncEqual = true;
if (!syncEqualActive) return false;
break;
case SO_UNRESOLVED_CONFLICT:
output.existsConflict = true;
if (!conflictFilesActive) return false;
break;
}
//calculate total number of bytes for each side
getNumbers(fsObj, output);
return true;
});
return output;
}
std::vector<FileSystemObject*> GridView::getAllFileRef(const std::set<size_t>& rows)
{
std::vector<FileSystemObject*> output;
auto iterLast = rows.lower_bound(rowsOnView()); //loop over valid rows only!
std::for_each(rows.begin(), iterLast,
[&](size_t pos)
{
if (FileSystemObject* fsObj = FileSystemObject::retrieve(viewRef[pos]))
output.push_back(fsObj);
});
return output;
}
void GridView::removeInvalidRows()
{
viewRef.clear();
rowPositions.clear();
rowPositionsFirstChild.clear();
//remove rows that have been deleted meanwhile
vector_remove_if(sortedRef, [&](const RefIndex& refIdx) { return FileSystemObject::retrieve(refIdx.objId) == nullptr; });
}
class GridView::SerializeHierarchy
{
public:
static void execute(HierarchyObject& hierObj, std::vector<GridView::RefIndex>& sortedRef, size_t index) { SerializeHierarchy(sortedRef, index).recurse(hierObj); }
private:
SerializeHierarchy(std::vector<GridView::RefIndex>& sortedRef, size_t index) :
index_(index),
sortedRef_(sortedRef) {}
void recurse(HierarchyObject& hierObj)
{
for (FilePair& fileObj : hierObj.refSubFiles())
sortedRef_.push_back(RefIndex(index_, fileObj.getId()));
for (SymlinkPair& linkObj : hierObj.refSubLinks())
sortedRef_.push_back(RefIndex(index_, linkObj.getId()));
for (DirPair& dirObj : hierObj.refSubDirs())
{
sortedRef_.push_back(RefIndex(index_, dirObj.getId()));
recurse(dirObj); //add recursion here to list sub-objects directly below parent!
}
}
size_t index_;
std::vector<GridView::RefIndex>& sortedRef_;
};
void GridView::setData(FolderComparison& folderCmp)
{
//clear everything
std::vector<FileSystemObject::ObjectId>().swap(viewRef); //free mem
std::vector<RefIndex>().swap(sortedRef); //
currentSort.reset();
folderPairCount = std::count_if(begin(folderCmp), end(folderCmp),
[](const BaseDirPair& baseObj) //count non-empty pairs to distinguish single/multiple folder pair cases
{
return !baseObj.getBaseDirPf<LEFT_SIDE >().empty() ||
!baseObj.getBaseDirPf<RIGHT_SIDE>().empty();
});
for (auto it = begin(folderCmp); it != end(folderCmp); ++it)
SerializeHierarchy::execute(*it, sortedRef, it - begin(folderCmp));
}
//------------------------------------ SORTING TEMPLATES ------------------------------------------------
template <bool ascending>
class GridView::LessRelativeName : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
//presort by folder pair
if (a.folderIndex != b.folderIndex)
return ascending ?
a.folderIndex < b.folderIndex :
a.folderIndex > b.folderIndex;
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessRelativeName<ascending>(*fsObjA, *fsObjB);
}
};
template <bool ascending, zen::SelectedSide side>
class GridView::LessShortFileName : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessShortFileName<ascending, side>(*fsObjA, *fsObjB);
}
};
template <bool ascending, zen::SelectedSide side>
class GridView::LessFilesize : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessFilesize<ascending, side>(*fsObjA, *fsObjB);
}
};
template <bool ascending, zen::SelectedSide side>
class GridView::LessFiletime : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessFiletime<ascending, side>(*fsObjA, *fsObjB);
}
};
template <bool ascending, zen::SelectedSide side>
class GridView::LessExtension : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessExtension<ascending, side>(*fsObjA, *fsObjB);
}
};
template <bool ascending>
class GridView::LessCmpResult : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessCmpResult<ascending>(*fsObjA, *fsObjB);
}
};
template <bool ascending>
class GridView::LessSyncDirection : public std::binary_function<RefIndex, RefIndex, bool>
{
public:
bool operator()(const RefIndex a, const RefIndex b) const
{
const FileSystemObject* fsObjA = FileSystemObject::retrieve(a.objId);
const FileSystemObject* fsObjB = FileSystemObject::retrieve(b.objId);
if (!fsObjA) //invalid rows shall appear at the end
return false;
else if (!fsObjB)
return true;
return lessSyncDirection<ascending>(*fsObjA, *fsObjB);
}
};
//-------------------------------------------------------------------------------------------------------
bool GridView::getDefaultSortDirection(ColumnTypeRim type) //true: ascending; false: descending
{
switch (type)
{
case COL_TYPE_SIZE:
case COL_TYPE_DATE:
return false;
case COL_TYPE_DIRECTORY:
case COL_TYPE_FULL_PATH:
case COL_TYPE_REL_PATH:
case COL_TYPE_FILENAME:
case COL_TYPE_EXTENSION:
return true;
}
assert(false);
return true;
}
void GridView::sortView(ColumnTypeRim type, bool onLeft, bool ascending)
{
viewRef.clear();
rowPositions.clear();
rowPositionsFirstChild.clear();
currentSort = make_unique<SortInfo>(type, onLeft, ascending);
switch (type)
{
case COL_TYPE_FULL_PATH:
case COL_TYPE_REL_PATH:
if ( ascending) std::sort(sortedRef.begin(), sortedRef.end(), LessRelativeName<true>());
else if (!ascending) std::sort(sortedRef.begin(), sortedRef.end(), LessRelativeName<false>());
break;
case COL_TYPE_FILENAME:
if ( ascending && onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessShortFileName<true, LEFT_SIDE >());
else if ( ascending && !onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessShortFileName<true, RIGHT_SIDE>());
else if (!ascending && onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessShortFileName<false, LEFT_SIDE >());
else if (!ascending && !onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessShortFileName<false, RIGHT_SIDE>());
break;
case COL_TYPE_SIZE:
if ( ascending && onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFilesize<true, LEFT_SIDE >());
else if ( ascending && !onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFilesize<true, RIGHT_SIDE>());
else if (!ascending && onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFilesize<false, LEFT_SIDE >());
else if (!ascending && !onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFilesize<false, RIGHT_SIDE>());
break;
case COL_TYPE_DATE:
if ( ascending && onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFiletime<true, LEFT_SIDE >());
else if ( ascending && !onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFiletime<true, RIGHT_SIDE>());
else if (!ascending && onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFiletime<false, LEFT_SIDE >());
else if (!ascending && !onLeft) std::sort(sortedRef.begin(), sortedRef.end(), LessFiletime<false, RIGHT_SIDE>());
break;
case COL_TYPE_EXTENSION:
if ( ascending && onLeft) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessExtension<true, LEFT_SIDE >());
else if ( ascending && !onLeft) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessExtension<true, RIGHT_SIDE>());
else if (!ascending && onLeft) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessExtension<false, LEFT_SIDE >());
else if (!ascending && !onLeft) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessExtension<false, RIGHT_SIDE>());
break;
//case SORT_BY_CMP_RESULT:
// if ( ascending) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessCmpResult<true >());
// else if (!ascending) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessCmpResult<false>());
// break;
//case SORT_BY_SYNC_DIRECTION:
// if ( ascending) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessSyncDirection<true >());
// else if (!ascending) std::stable_sort(sortedRef.begin(), sortedRef.end(), LessSyncDirection<false>());
// break;
case COL_TYPE_DIRECTORY:
if ( ascending) std::stable_sort(sortedRef.begin(), sortedRef.end(), [](const RefIndex a, const RefIndex b) { return a.folderIndex < b.folderIndex; });
else if (!ascending) std::stable_sort(sortedRef.begin(), sortedRef.end(), [](const RefIndex a, const RefIndex b) { return a.folderIndex > b.folderIndex; });
break;
}
}
|