IntervalTree< DataType, NumericalType, IntervalKind > Member List

This is the complete list of members for IntervalTree< DataType, NumericalType, IntervalKind >, including all inherited members.

begin()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
begin() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
cbegin() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
cend() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
clear()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
const_iterator typedef	IntervalTree< DataType, NumericalType, IntervalKind >
data_type typedef	IntervalTree< DataType, NumericalType, IntervalKind >
empty() const noexcept	IntervalTree< DataType, NumericalType, IntervalKind >	inline
end()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
end() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
erase(iterator iter)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find(interval_type const &ival, CompareFunctionT const &compare)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find(interval_type const &ival, CompareFunctionT const &compare) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find(interval_type const &ival)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find(interval_type const &ival) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_all(interval_type const &ival, FunctionT const &on_find, CompareFunctionT const &compare)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_all(interval_type const &ival, FunctionT const &on_find, CompareFunctionT const &compare) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_all(interval_type const &ival, FunctionT const &on_find)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_all(interval_type const &ival, FunctionT const &on_find) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_next_in_subtree(iterator from, interval_type const &ival, CompareFunctionT const &compare)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_next_in_subtree(iterator from, interval_type const &ival, CompareFunctionT const &compare) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_next_in_subtree(iterator from, interval_type const &ival)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
find_next_in_subtree(iterator from, interval_type const &ival) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
flatten()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
flatten_copy()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
highest() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
insert(interval_type &&ival)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
insert(interval_type const &ival)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
insert_overlap(interval_type const &ival, bool exclusive=false)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
insert_overlap(interval_type const &ival, data_type const &data, bool exclusive=false)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
insert_overlap(interval_type const &ival, data_type &&data, bool exclusive=false)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
interval_kind typedef	IntervalTree< DataType, NumericalType, IntervalKind >
interval_type typedef	IntervalTree< DataType, NumericalType, IntervalKind >
IntervalTree()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
IntervalTree(IntervalTree const &other)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
IntervalTree(IntervalTree &&)=default	IntervalTree< DataType, NumericalType, IntervalKind >
IntervalTreeIterator< node_type, false >	IntervalTree< DataType, NumericalType, IntervalKind >
IntervalTreeIterator< node_type, true >	IntervalTree< DataType, NumericalType, IntervalKind >
iterator typedef	IntervalTree< DataType, NumericalType, IntervalKind >
lowest() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
node_type typedef	IntervalTree< DataType, NumericalType, IntervalKind >
numerical_type typedef	IntervalTree< DataType, NumericalType, IntervalKind >
operator=(IntervalTree const &other)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
operator=(IntervalTree &&)=default	IntervalTree< DataType, NumericalType, IntervalKind >
overlap_find(interval_type const &ival, bool exclusive=false)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find(interval_type const &ival, bool exclusive=false) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find(numerical_type position)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find(numerical_type position) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find_all(interval_type const &ival, FunctionT const &on_find, bool exclusive=false)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find_all(interval_type const &ival, FunctionT const &on_find, bool exclusive=false) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find_all(numerical_type position, FunctionT const &on_find)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find_all(numerical_type position, FunctionT const &on_find) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find_next_in_subtree(iterator from, interval_type const &ival, bool exclusive=false)	IntervalTree< DataType, NumericalType, IntervalKind >	inline
overlap_find_next_in_subtree(const_iterator from, interval_type const &ival, bool exclusive=false) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
punch() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
punch(interval_type const &ival) const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
root()	IntervalTree< DataType, NumericalType, IntervalKind >	inline
root() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
self_type typedef	IntervalTree< DataType, NumericalType, IntervalKind >
size() const	IntervalTree< DataType, NumericalType, IntervalKind >	inline
tree_type typedef	IntervalTree< DataType, NumericalType, IntervalKind >
~IntervalTree()	IntervalTree< DataType, NumericalType, IntervalKind >	inline