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
|
/*
* Fast index for tag data
*
* Copyright (C) 2005--2015 Enrico Zini <enrico@debian.org>
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <ept/debtags/coll/fast.h>
#include <ept/debtags/coll/set.h>
#include <ept/debtags/coll/operators.h>
using namespace std;
using namespace ept::debtags::coll::operators;
namespace ept {
namespace debtags {
namespace coll {
void Fast::insert(const std::set<std::string>& items, const std::set<std::string>& tags)
{
if (tags.empty())
return;
for (const auto& i: items)
insert(i, tags);
}
void Fast::insert(const std::string& item, const std::set<std::string>& tags)
{
if (tags.empty())
return;
auto iter = this->items.find(item);
if (iter == this->items.end())
this->items.insert(std::make_pair(item, tags));
else
iter->second |= tags;
for (typename std::set<std::string>::const_iterator i = tags.begin();
i != tags.end(); ++i)
{
typename std::map< std::string, std::set<std::string> >::iterator iter = this->tags.find(*i);
if (iter == this->tags.end())
this->tags.insert(std::make_pair(*i, std::set<std::string>() | item));
else
iter->second |= item;
}
}
void Fast::insert(const std::set<std::string>& items, const std::string& tag)
{
for (typename std::set<std::string>::const_iterator i = items.begin();
i != items.end(); ++i)
{
typename std::map< std::string, std::set<std::string> >::iterator iter = this->items.find(*i);
if (iter == this->items.end())
this->items.insert(std::make_pair(*i, std::set<std::string>() | tag));
else
iter->second |= tag;
}
typename std::map< std::string, std::set<std::string> >::iterator iter = this->tags.find(tag);
if (iter == this->tags.end())
this->tags.insert(std::make_pair(tag, items));
else
iter->second |= items;
}
std::set<std::string> Fast::getItemsHavingTag(const std::string& tag) const
{
typename map<std::string, std::set<std::string> >::const_iterator i = tags.find(tag);
if (i != tags.end())
return i->second;
else
return std::set<std::string>();
}
std::set<std::string> Fast::getItemsHavingTags(const std::set<std::string>& tags) const
{
if (tags.empty())
return std::set<std::string>();
auto i = tags.begin();
auto res = getItemsHavingTag(*i);
for (++i ; i != tags.end(); ++i)
res &= getItemsHavingTag(*i);
return res;
}
std::set<std::string> Fast::getTagsOfItem(const std::string& item) const
{
typename map<std::string, std::set<std::string> >::const_iterator i = items.find(item);
if (i != items.end())
return i->second;
else
return std::set<std::string>();
}
std::set<std::string> Fast::getTaggedItems() const
{
std::set<std::string> res;
for (typename map<std::string, std::set<std::string> >::const_iterator i = items.begin();
i != items.end(); i++)
res |= i->first;
return res;
}
std::set<std::string> Fast::getAllTags() const
{
std::set<std::string> res;
for (typename map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
i != tags.end(); i++)
res |= i->first;
return res;
}
std::vector<std::string> Fast::getAllTagsAsVector() const
{
std::vector<std::string> res;
for (typename map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
i != tags.end(); i++)
res.push_back(i->first);
return res;
}
std::set<std::string> Fast::getTagsImplying(const std::string& tag) const
{
// tag1 implies tag2 if the itemset of tag1 is a subset of the itemset of tag2
std::set<std::string> res;
std::set<std::string> itemsToCheck = getItemsHavingTag(tag);
// TODO: choose which one is the most efficient implementation
#if 0
// Roughly:
// O(n[pkgs per tag] * log(nitems) * log(n[items per pkg]) + n[tags per item] * n[items per tag])
std::set<std::string> tagsToCheck;
for (std::set<std::string>::const_iterator i = itemsToCheck.begin();
i != itemsToCheck.end(); ++i)
tagsToCheck |= getTags(*i);
for (std::set<std::string>::const_iterator i = tagsToCheck.begin();
i != tagsToCheck.end(); ++i)
if (utils::set_contains(itemsToCheck, getItems(*i)))
res |= *i;
#else
// O(ntags * n[items per tag])
for (typename std::map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
i != tags.end(); ++i)
if (utils::set_contains(itemsToCheck, getItemsHavingTag(i->first)))
res |= i->first;
#endif
return res - tag;
}
std::set<std::string> Fast::getItemsExactMatch(const std::set<std::string>& tags) const
{
std::set<std::string> res = this->getItemsHavingTags(tags);
typename std::set<std::string>::iterator i = res.begin();
while (i != res.end())
{
typename std::map<std::string, std::set<std::string> >::const_iterator t = items.find(*i);
if (t != items.end() && t->second != tags)
{
typename std::set<std::string>::iterator j = i;
++i;
res.erase(j);
} else
++i;
}
return res;
}
std::string Fast::findTagWithMaxCardinality(size_t& card) const
{
card = 0;
std::string res = std::string();
for (typename std::map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
i != tags.end(); ++i)
if (i->second.size() > card)
{
card = i->second.size();
res = i->first;
}
return res;
}
void Fast::removeTag(const std::string& tag)
{
typename std::map<std::string, std::set<std::string> >::iterator itag = tags.find(tag);
for (typename std::set<std::string>::const_iterator iitemset = itag->second.begin();
iitemset != itag->second.end(); ++iitemset)
{
typename std::map<std::string, std::set<std::string> >::iterator iitem = items.find(*iitemset);
iitem->second -= tag;
if (iitem->second.empty())
items.erase(iitem);
}
tags.erase(itag);
}
Fast Fast::getChildCollection(const std::string& tag) const
{
Fast res;
auto itag = tags.find(tag);
for (const auto& i: itag->second)
{
auto iitem = items.find(i);
res.insert(i, iitem->second);
}
res.removeTag(tag);
return res;
}
void Fast::removeTagsWithCardinalityLessThan(size_t card)
{
typename std::map<std::string, std::set<std::string> >::const_iterator i = tags.begin();
while (i != tags.end())
{
if (i->second.size() < card)
{
typename std::map<std::string, std::set<std::string> >::const_iterator j = i;
++i;
removeTag(j->first);
} else
++i;
}
}
}
}
}
|
