|
| void | insert (Key const &first, Key const &last, Value &&value) noexcept |
| | Insert half open range of keys.
|
| |
| void | optimize () noexcept |
| | Optimize range_map for improved lookup performance and reduced memory footprint.
|
| |
|
values_set | insert (p->values) |
| |
|
| for (auto i=p+1;i !=items.end();p=i++) |
| |
|
items | shrink_to_fit () |
| |
|
|
| values_set |
| |
|
auto | p = items.begin() |
| |
◆ insert()
template<typename Key , typename Value >
| void tt::range_map< Key, Value >::insert |
( |
Key const & | first, |
|
|
Key const & | last, |
|
|
Value && | value ) |
|
inlinenoexcept |
Insert half open range of keys.
Inserts may be slow, since it may require moves of large number of objects and allocations.
◆ optimize()
template<typename Key , typename Value >
Optimize range_map for improved lookup performance and reduced memory footprint.
The documentation for this class was generated from the following file:
