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
|
/*
* Copyright (C) 2009-2012 Geometer Plus <[email protected]>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA.
*/
#include <cstdlib>
#include "Book.h"
#include "Author.h"
#include "Tag.h"
bool BookComparator::operator() (
const shared_ptr<Book> book0,
const shared_ptr<Book> book1
) const {
const std::string &seriesTitle0 = book0->seriesTitle();
const std::string &seriesTitle1 = book1->seriesTitle();
int comp = seriesTitle0.compare(seriesTitle1);
if (comp == 0) {
if (!seriesTitle0.empty()) {
if (book0->indexInSeries() < book1->indexInSeries() &&
!(book0->indexInSeries() == book1->indexInSeries())) {
return true;
}
}
return book0->title() < book1->title();
}
if (seriesTitle0.empty()) {
return book0->title() < seriesTitle1;
}
if (seriesTitle1.empty()) {
return seriesTitle0 <= book1->title();
}
return comp < 0;
}
bool BookByFileNameComparator::operator() (
const shared_ptr<Book> book0,
const shared_ptr<Book> book1
) const {
return book0->file() < book1->file();
}
bool AuthorComparator::operator() (
const shared_ptr<Author> author0,
const shared_ptr<Author> author1
) const {
if (author0.isNull()) {
return !author1.isNull();
}
if (author1.isNull()) {
return false;
}
const int comp = author0->sortKey().compare(author1->sortKey());
return comp != 0 ? comp < 0 : author0->name() < author1->name();
}
bool TagComparator::operator() (
shared_ptr<Tag> tag0,
shared_ptr<Tag> tag1
) const {
if (tag0.isNull()) {
return !tag1.isNull();
}
if (tag1.isNull()) {
return false;
}
std::size_t level0 = tag0->level();
std::size_t level1 = tag1->level();
if (level0 > level1) {
for (; level0 > level1; --level0) {
tag0 = tag0->parent();
}
if (tag0 == tag1) {
return false;
}
} else if (level0 < level1) {
for (; level0 < level1; --level1) {
tag1 = tag1->parent();
}
if (tag0 == tag1) {
return true;
}
}
while (tag0->parent() != tag1->parent()) {
tag0 = tag0->parent();
tag1 = tag1->parent();
}
return tag0->name() < tag1->name();
}
|
