#include <interval_tree.h>
◆ TreeNode()
template<typename IT, typename LT>
◆ ~TreeNode()
template<typename IT, typename LT>
◆ build_tree()
template<typename IT, typename LT>
| TreeNode * Realm::IntervalTree< IT, LT >::TreeNode::build_tree |
( |
const std::vector< IT > & | pending_starts, |
|
|
const std::vector< IT > & | pending_ends, |
|
|
const std::vector< LT > & | pending_labels ) |
|
static |
◆ repopulate_pending()
template<typename IT, typename LT>
◆ test_interval()
template<typename IT, typename LT>
template<typename MARKER>
| void Realm::IntervalTree< IT, LT >::TreeNode::test_interval |
( |
IT | iv_start, |
|
|
IT | iv_end, |
|
|
MARKER & | marker ) const |
◆ test_sorted_intervals()
template<typename IT, typename LT>
template<typename IR, typename MARKER>
| void Realm::IntervalTree< IT, LT >::TreeNode::test_sorted_intervals |
( |
const IR & | iv_ranges, |
|
|
int | pos, |
|
|
int | count, |
|
|
MARKER & | marker ) const |
◆ ends
template<typename IT, typename LT>
◆ labels
template<typename IT, typename LT>
◆ left
template<typename IT, typename LT>
◆ right
template<typename IT, typename LT>
◆ sorted_by_end
template<typename IT, typename LT>
◆ sorted_by_start
template<typename IT, typename LT>
◆ split_val
template<typename IT, typename LT>
◆ starts
template<typename IT, typename LT>
The documentation for this struct was generated from the following file: