|
| Results (const ValueStorage< T > &values) |
|
template<typename K > |
bool | add (const Index< K > &index, const K &val) |
|
template<typename K > |
bool | add (const Index< K > &index, const K &min, const K &max) |
|
template<typename K > |
bool | add_since (const Index< K > &index, const typename Index< K >::const_iterator begin) |
|
template<typename K > |
bool | add_until (const Index< K > &index, const typename Index< K >::const_iterator end) |
|
void | add (Match< T > *f) |
|
template<typename OUTITER > |
void | copy_valptrs_to (OUTITER res) |
| Send results to res. More...
|
|
template<typename OUTITER > |
void | copy_indices_to (OUTITER res) |
| Send results to res. More...
|
|
bool | is_select_all () const |
| Check if we just select all elements.
|
|
bool | is_empty () const |
| Check if we just select all elements.
|
|
void | set_to_empty () |
| Disregard everything and just return no items.
|
|
void | add_union (std::unique_ptr< stl::Sequences< size_t >> seq) |
|
void | add_singleton (size_t singleton) |
| Add a set of one single element to intersect with the rest.
|
|
void | add_set (const std::set< size_t > &p) |
|
void | add_set (std::unique_ptr< std::set< size_t > > p) |
| Add a set, taking over its memory management.
|
|
template<typename T>
template<typename OUTITER >
Send results to res.
It empties all sequences, so it can only be used once.
template<typename T>
template<typename OUTITER >
Send results to res.
It empties all sequences, so it can only be used once.
The documentation for this struct was generated from the following files: