...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
The tree is created using packing algorithm and a temporary packing allocator.
template<
typename Iterator
,
typename PackAlloc
>
rtree
(
Iterator
first
,
Iterator
last
,
parameters_type
const &
parameters
,
indexable_getter
const &
getter
,
value_equal
const &
equal
,
allocator_type
const &
allocator
,
PackAlloc const &
temp_allocator
)
Type |
Name |
Description |
---|---|---|
|
|
The beginning of the range of Values. |
|
|
The end of the range of Values. |
|
|
The parameters object. |
|
|
The function object extracting Indexable from Value. |
|
|
The function object comparing Values. |
|
|
The allocator object for persistent data in the tree. |
|
|
The temporary allocator object used when packing. |