File tree Expand file tree Collapse file tree 1 file changed +15
-1
lines changed Expand file tree Collapse file tree 1 file changed +15
-1
lines changed Original file line number Diff line number Diff line change @@ -81,6 +81,8 @@ Creates an interval where the borders are sorted so the lower border is the firs
81
81
- [ bool empty() const noexcept] ( #bool-empty-const-noexcept )
82
82
- [ iterator begin()] ( #iterator-begin )
83
83
- [ iterator end()] ( #iterator-end )
84
+ - [ iterator cbegin()] ( #iterator-cbegin )
85
+ - [ iterator cend()] ( #iterator-cend )
84
86
85
87
### iterator insert(interval_type const& ival)
86
88
Adds an interval into the tree.
@@ -233,7 +235,7 @@ Merges all overlapping intervals within the tree. After calling deoverlap, the t
233
235
### After deoverlap
234
236
![ AfterDeoverlap] ( https://user-images.githubusercontent.com/6238896/55505612-c5a96c80-5653-11e9-81f8-28a8ae35a077.png )
235
237
236
- ### interval_tree& deoverlap_copy()
238
+ ### interval_tree deoverlap_copy()
237
239
Same as deoverlap, but not inplace
238
240
239
241
---
@@ -269,6 +271,18 @@ Returns a past the end iterator.
269
271
270
272
** Returns** : past the end iterator.
271
273
274
+ ---
275
+ ### iterator cbegin()
276
+ Returns the const_iterator of the interval with the lowest lower_bound.
277
+
278
+ ** Returns** : begin iterator.
279
+
280
+ ---
281
+ ### iterator cend()
282
+ Returns a past the end const_iterator.
283
+
284
+ ** Returns** : past the end const_iterator.
285
+
272
286
---
273
287
274
288
## Members of Interval
You can’t perform that action at this time.
0 commit comments