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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef ARY_SORTEDIDS_HXX
#define ARY_SORTEDIDS_HXX
// USED SERVICES
#include <algorithm>
#include <cosv/tpl/range.hxx>
namespace ary
{
/** Implementation of a set of children to an entity in the Autodoc
repository. The children are sorted.
@tpl COMPARE
Needs to provide types:
entity_base_type
id_type
key_type
and functions:
static entity_base_type &
EntityOf_(
id_type i_id );
static const key_type &
KeyOf_(
const entity_type & i_entity );
static bool Lesser_(
const key_type & i_1,
const key_type & i_2 );
*/
template<class COMPARE>
class SortedIds
{
public:
typedef typename COMPARE::id_type element_t;
typedef typename COMPARE::key_type key_t;
typedef std::vector<element_t> data_t;
typedef typename data_t::const_iterator const_iterator;
typedef typename data_t::iterator iterator;
typedef csv::range<const_iterator> search_result_t;
// LIFECYCLE
explicit SortedIds(
std::size_t i_reserve = 0 );
~SortedIds();
// OPERATIONS
void Add(
element_t i_elem );
// INQUIRY
const_iterator Begin() const;
const_iterator End() const;
element_t Search(
const key_t & i_key ) const;
search_result_t SearchAll(
const key_t & i_key ) const;
const_iterator LowerBound(
const key_t & i_key ) const;
private:
typedef typename COMPARE::entity_base_type entity_t;
// Locals
iterator LowerBound(
const key_t & i_key );
static const key_t &
KeyOf_(
element_t i_child );
template <class ITER>
static ITER impl_LowerBound_(
ITER i_begin,
ITER i_end,
const key_t & i_key );
// DATA
data_t aData;
};
// IMPLEMENTATION
template<class COMPARE>
inline const typename SortedIds<COMPARE>::key_t &
SortedIds<COMPARE>::KeyOf_(element_t i_child)
{
return COMPARE::KeyOf_(COMPARE::EntityOf_(i_child));
}
template<class COMPARE>
SortedIds<COMPARE>::SortedIds(std::size_t i_reserve)
: aData()
{
if (i_reserve > 0)
aData.reserve(i_reserve);
}
template<class COMPARE>
SortedIds<COMPARE>::~SortedIds()
{
}
template<class COMPARE>
void
SortedIds<COMPARE>::Add(element_t i_elem)
{
aData.insert( LowerBound( KeyOf_(i_elem) ),
i_elem );
}
template<class COMPARE>
inline typename SortedIds<COMPARE>::const_iterator
SortedIds<COMPARE>::Begin() const
{
return aData.begin();
}
template<class COMPARE>
inline typename SortedIds<COMPARE>::const_iterator
SortedIds<COMPARE>::End() const
{
return aData.end();
}
template<class COMPARE>
typename SortedIds<COMPARE>::element_t
SortedIds<COMPARE>::Search(const key_t & i_key) const
{
const_iterator
ret = LowerBound(i_key);
return ret != aData.end() AND NOT COMPARE::Lesser_(i_key, KeyOf_(*ret))
? *ret
: element_t(0);
}
template<class COMPARE>
typename SortedIds<COMPARE>::search_result_t
SortedIds<COMPARE>::SearchAll(const key_t & i_key) const
{
const_iterator
r1 = LowerBound(i_key);
const_iterator
r2 = r1;
while ( r2 != aData.end()
AND NOT COMPARE::Lesser_(i_key, KeyOf_(*r2)) )
{
++r2;
}
return csv::make_range(r1,r2);
}
template<class COMPARE>
inline typename SortedIds<COMPARE>::const_iterator
SortedIds<COMPARE>::LowerBound(const key_t & i_key) const
{
return impl_LowerBound_( aData.begin(),
aData.end(),
i_key );
}
template<class COMPARE>
inline typename SortedIds<COMPARE>::iterator
SortedIds<COMPARE>::LowerBound(const key_t & i_key)
{
return impl_LowerBound_( aData.begin(),
aData.end(),
i_key );
}
template<class COMPARE>
template <class ITER>
ITER
SortedIds<COMPARE>::impl_LowerBound_( ITER i_begin,
ITER i_end,
const key_t & i_key )
{
ITER i1 = i_begin;
ITER i2 = i_end;
for ( ITER it = i1 + (i2-i1)/2;
i1 != i2;
it = i1 + (i2-i1)/2 )
{
if ( COMPARE::Lesser_(KeyOf_(*it), i_key) )
{
i1 = it;
++i1;
}
else
{
i2 = it;
}
} // end for
return i1;
}
} // namespace ary
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
