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
|
// file : libbutl/prefix-map.txx -*- C++ -*-
// license : MIT; see accompanying LICENSE file
namespace butl
{
template <typename M>
auto prefix_map_common<M>::
find_sub (const key_type& k) -> std::pair<iterator, iterator>
{
const auto& c (this->key_comp ());
std::pair<iterator, iterator> r;
r.first = this->lower_bound (k);
for (r.second = r.first; r.second != this->end (); ++r.second)
{
if (!c.prefix (k, r.second->first))
break;
}
return r;
}
template <typename M>
auto prefix_map_common<M>::
find_sub (const key_type& k) const ->
std::pair<const_iterator, const_iterator>
{
const auto& c (this->key_comp ());
std::pair<const_iterator, const_iterator> r;
r.first = this->lower_bound (k);
for (r.second = r.first; r.second != this->end (); ++r.second)
{
if (!c.prefix (k, r.second->first))
break;
}
return r;
}
template <typename M>
auto prefix_map_common<M>::
find_sup (const key_type& k) -> iterator
{
// There seems to be only two possible algorithms here:
//
// 1. Iterate over the key: get progressively outer prefixes and look
// for a match in the map.
//
// 2. Iterate over entries: get the upper bound for the key and iterate
// backwards looking for a prefix.
//
// The drawback of the first approach is that we have to create a new key
// which will most likely involve a memory allocation (we can probably
// limit it to a single allocation by reusing the key instance).
//
// The drawback of the second approch is that we may have a lot of entries
// between the lower bound and the prefix (in contrast, keys normally only
// have a handful of components).
//
// Tests have shown that (2) can be significantly faster than (1).
//
#if 0
const auto& c (this->key_comp ());
for (auto i (this->upper_bound (k)), b (this->begin ()); i != b; )
{
--i;
if (c.prefix (i->first, k))
return i;
}
return this->end ();
#else
// First look for the exact match before making any copies.
//
auto i (this->find (k)), e (this->end ());
if (i == e)
{
const auto& c (this->key_comp ());
for (key_type p (k); c.prefix (p); )
{
i = this->find (p);
if (i != e)
break;
}
}
return i;
#endif
}
template <typename M>
auto prefix_map_common<M>::
find_sup (const key_type& k) const -> const_iterator
{
#if 0
const auto& c (this->key_comp ());
for (auto i (this->upper_bound (k)), b (this->begin ()); i != b; )
{
--i;
if (c.prefix (i->first, k))
return i;
}
return this->end ();
#else
auto i (this->find (k)), e (this->end ());
if (i == e)
{
const auto& c (this->key_comp ());
for (key_type p (k); c.prefix (p); )
{
i = this->find (p);
if (i != e)
break;
}
}
return i;
#endif
}
template <typename M>
template <typename P>
auto prefix_map_common<M>::
find_sup_if (const key_type& k, P pred) -> iterator
{
#if 0
const auto& c (this->key_comp ());
for (auto i (this->upper_bound (k)), b (this->begin ()); i != b; )
{
--i;
if (c.prefix (i->first, k) && pred (*i))
return i;
}
return this->end ();
#else
auto i (this->find (k)), e (this->end ());
if (i == e || !pred (*i))
{
const auto& c (this->key_comp ());
for (key_type p (k); c.prefix (p); )
{
i = this->find (p);
if (i != e && pred (*i))
break;
}
}
return i;
#endif
}
template <typename M>
template <typename P>
auto prefix_map_common<M>::
find_sup_if (const key_type& k, P pred) const -> const_iterator
{
#if 0
const auto& c (this->key_comp ());
for (auto i (this->upper_bound (k)), b (this->begin ()); i != b; )
{
--i;
if (c.prefix (i->first, k) && pred (*i))
return i;
}
return this->end ();
#else
auto i (this->find (k)), e (this->end ());
if (i == e || !pred (*i))
{
const auto& c (this->key_comp ());
for (key_type p (k); c.prefix (p); )
{
i = this->find (p);
if (i != e && pred (*i))
break;
}
}
return i;
#endif
}
}
|
