...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.
template<
typename Iterator
>
rtree
(
Iterator
first
,
Iterator
last
,
parameters_type
const &
parameters
=parameters_type
()
,
indexable_getter
const &
getter
=indexable_getter
()
,
value_equal
const &
equal
=value_equal
()
,
allocator_type
const &
allocator
=allocator_type
()
)
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. |