RAUL
0.8.0
|
#include <PathTable.hpp>
Public Member Functions | |
Table< Path, T >::iterator | find_descendants_end (typename Table< Path, T >::iterator parent) |
Find all descendants of a Path key in the Table. | |
Table< Path, T >::const_iterator | find_descendants_end (typename Table< Path, T >::const_iterator parent) const |
![]() | |
Table (size_t capacity) | |
void | clear () |
bool | empty () const |
void | reserve (size_t n) |
size_t | size () const |
std::pair< iterator, bool > | insert (const std::pair< Path, T > &entry) |
void | erase (const Path &key) |
void | erase (iterator i) |
void | erase (iterator start, iterator end) |
void | erase_by_index (size_t start, size_t end) |
SharedPtr< Table< Path, T > > | yank (iterator start, iterator end) |
std::pair< iterator, bool > | cram (const Table< Path, T > &range) |
const_iterator | find (const_iterator start, const_iterator end, const Path &key) const |
const_iterator | find (const Path &key) const |
iterator | find (const_iterator start, const_iterator end, const Path &key) |
iterator | find (const Path &key) |
const_iterator | find_range_end (const_iterator left, bool(*comp)(const Path &, const Path &)) const |
iterator | find_range_end (iterator left, bool(*comp)(const Path &, const Path &)) |
T & | operator[] (const Path &key) |
const_iterator | begin () const |
iterator | begin () |
const_iterator | end () const |
iterator | end () |
Table of Paths.
|
inline |
Find all descendants of a Path key in the Table.
It is guaranteed that (parent, parent+1, parent+2, ..., ret-1) are all descendants of parent. The return value is never a descendent of parent, and may be end().
References Raul::Path::descendant_comparator(), and Raul::Table< Path, T >::find_range_end().