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
|
/*
* 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 <algorithm>
#include <ZLResource.h>
#include "NetworkBookCollection.h"
NetworkBookCollection::NetworkBookCollection() {
myAuthorComparator = new NetworkAuthorComparator(myAuthorRates);
}
void NetworkBookCollection::clear() {
myBookList.clear();
myAuthorRates.clear();
myAuthorBooksMap.reset();
}
void NetworkBookCollection::addBook(shared_ptr<NetworkItem> bookPtr) {
if (bookPtr.isNull() || bookPtr->typeId() != NetworkBookItem::TYPE_ID) {
return;
}
myAuthorBooksMap.reset();
NetworkItem::List::iterator it = std::upper_bound(myBookList.begin(), myBookList.end(), bookPtr, NetworkBookItemComparator());
myBookList.insert(it, bookPtr);
NetworkBookItem &book = (NetworkBookItem &) *bookPtr;
for (std::vector<NetworkBookItem::AuthorData>::const_iterator jt = book.Authors.begin(); jt != book.Authors.end(); ++jt) {
const NetworkBookItem::AuthorData &author = *jt;
std::map<NetworkBookItem::AuthorData, unsigned int>::iterator kt = myAuthorRates.find(author);
if (kt == myAuthorRates.end()) {
myAuthorRates[author] = book.Index;
} else if (kt->second > book.Index) {
kt->second = book.Index;
}
}
}
const NetworkAuthorBooksMap &NetworkBookCollection::authorBooksMap() {
if (myAuthorBooksMap.isNull()) {
myAuthorBooksMap = new NetworkAuthorBooksMap(*myAuthorComparator);
NetworkAuthorBooksMap &bookMap = *myAuthorBooksMap;
for (NetworkItem::List::const_iterator it = myBookList.begin(); it != myBookList.end(); ++it) {
NetworkBookItem &book = (NetworkBookItem &) **it;
for (std::vector<NetworkBookItem::AuthorData>::const_iterator jt = book.Authors.begin(); jt != book.Authors.end(); ++jt) {
bookMap[*jt].push_back(*it);
}
}
}
return *myAuthorBooksMap;
}
|
