@@ -47,6 +47,45 @@ Navigate into the tests folder and build the source using the CMakeLists. You mi
47
47
Creates an interval where the borders are sorted so the lower border is the first one.
48
48
49
49
## Members of IntervalTree<Interval >
50
+
51
+ - [ Members of IntervalTree<Interval >] ( #members-of-intervaltreeinterval )
52
+ - [ iterator insert(interval_type const& ival)] ( #iterator-insertinterval_type-const-ival )
53
+ - [ Parameters] ( #parameters )
54
+ - [ iterator insert_overlap(interval_type const& ival)] ( #iterator-insert_overlapinterval_type-const-ival )
55
+ - [ Parameters] ( #parameters-1 )
56
+ - [ iterator erase(iterator iter)] ( #iterator-eraseiterator-iter )
57
+ - [ Parameters] ( #parameters-2 )
58
+ - [ size_type size() const] ( #size_type-size-const )
59
+ - [ (const)iterator find(interval_type const& ival)] ( #constiterator-findinterval_type-const-ival )
60
+ - [ Parameters] ( #parameters-3 )
61
+ - [ (const)iterator find(interval_type const& ival, CompareFunctionT const& compare)] ( #constiterator-findinterval_type-const-ival-comparefunctiont-const-compare )
62
+ - [ Parameters] ( #parameters-4 )
63
+ - [ (const)iterator find_all(interval_type const& ival, OnFindFunctionT const& on_find)] ( #constiterator-find_allinterval_type-const-ival-onfindfunctiont-const-on_find )
64
+ - [ Parameters] ( #parameters-5 )
65
+ - [ Example] ( #example-1 )
66
+ - [ (const)iterator find_all(interval_type const& ival, OnFindFunctionT const& on_find, CompareFunctionT const& compare)] ( #constiterator-find_allinterval_type-const-ival-onfindfunctiont-const-on_find-comparefunctiont-const-compare )
67
+ - [ Parameters] ( #parameters-6 )
68
+ - [ (const)iterator find_next_in_subtree(iterator from, interval_type const& ival)] ( #constiterator-find_next_in_subtreeiterator-from-interval_type-const-ival )
69
+ - [ Parameters] ( #parameters-7 )
70
+ - [ (const)iterator find_next(iterator from, interval_type const& ival, CompareFunctionT const& compare)] ( #constiterator-find_nextiterator-from-interval_type-const-ival-comparefunctiont-const-compare )
71
+ - [ Parameters] ( #parameters-8 )
72
+ - [ (const)iterator overlap_find(interval_type const& ival, bool exclusive)] ( #constiterator-overlap_findinterval_type-const-ival-bool-exclusive )
73
+ - [ Parameters] ( #parameters-9 )
74
+ - [ (const)iterator overlap_find_all(interval_type const& ival, OnFindFunctionT const& on_find, bool exclusive)] ( #constiterator-overlap_find_allinterval_type-const-ival-onfindfunctiont-const-on_find-bool-exclusive )
75
+ - [ Parameters] ( #parameters-10 )
76
+ - [ Example] ( #example-2 )
77
+ - [ (const)iterator overlap_find_next_in_subtree(interval_type const& ival, bool exclusive)] ( #constiterator-overlap_find_next_in_subtreeinterval_type-const-ival-bool-exclusive )
78
+ - [ Parameters] ( #parameters-11 )
79
+ - [ interval_tree& deoverlap()] ( #interval_tree-deoverlap )
80
+ - [ After deoverlap] ( #after-deoverlap )
81
+ - [ interval_tree& deoverlap_copy()] ( #interval_tree-deoverlap_copy )
82
+ - [ interval_tree punch(interval_type const& ival)] ( #interval_tree-punchinterval_type-const-ival )
83
+ - [ After punching (with [ 0, 50] )] ( #after-punching-with-0-50 )
84
+ - [ interval_tree punch()] ( #interval_tree-punch )
85
+ - [ bool empty() const noexcept] ( #bool-empty-const-noexcept )
86
+ - [ iterator begin()] ( #iterator-begin )
87
+ - [ iterator end()] ( #iterator-end )
88
+
50
89
### iterator insert(interval_type const& ival)
51
90
Adds an interval into the tree.
52
91
#### Parameters
@@ -235,6 +274,24 @@ Returns a past the end iterator.
235
274
---
236
275
237
276
## Members of Interval
277
+
278
+ - [ Members of Interval] ( #members-of-interval )
279
+ - [ using value_type] ( #using-value_type )
280
+ - [ using interval_kind] ( #using-interval_kind )
281
+ - [ friend bool operator==(interval const& lhs, interval const& other)] ( #friend-bool-operatorinterval-const-lhs-interval-const-other )
282
+ - [ friend bool operator!=(interval const& lhs, interval const& other)] ( #friend-bool-operatorinterval-const-lhs-interval-const-other-1 )
283
+ - [ value_type low() const] ( #value_type-low-const )
284
+ - [ value_type high() const] ( #value_type-high-const )
285
+ - [ bool overlaps(value_type l, value_type h) const] ( #bool-overlapsvalue_type-l-value_type-h-const )
286
+ - [ bool overlaps_exclusive(value_type l, value_type h) const] ( #bool-overlaps_exclusivevalue_type-l-value_type-h-const )
287
+ - [ bool overlaps(interval const& other) const] ( #bool-overlapsinterval-const-other-const )
288
+ - [ bool overlaps_exclusive(interval const& other) const] ( #bool-overlaps_exclusiveinterval-const-other-const )
289
+ - [ bool within(value_type value) const] ( #bool-withinvalue_type-value-const )
290
+ - [ bool within(interval const& other) const] ( #bool-withininterval-const-other-const )
291
+ - [ value_type operator-(interval const& other) const] ( #value_type-operator-interval-const-other-const )
292
+ - [ value_type size() const] ( #value_type-size-const )
293
+ - [ interval join(interval const& other) const] ( #interval-joininterval-const-other-const )
294
+
238
295
You can implement your own interval if you provide all the same functions.
239
296
### using value_type
240
297
The underlying interval numerical type
0 commit comments