boostorg/intrusive
1
0
Fork 1
mirror of https://github.com/boostorg/intrusive.git synced 2025-08-02 14:04:36 +02:00
Code Issues Packages Projects Releases Wiki Activity

Fixed wrong comment in bounded_range when lower and upper are equal.

Browse Source
This commit is contained in:
Ion Gaztañaga
2014-12-15 17:49:05 +01:00
parent 50f9f57f6c
commit 281629b94e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
include/boost/intrusive/bstree_algorithms.hpp
View File

@@ -758,7 +758,7 @@ class bstree_algorithms : public bstree_algorithms_base<NodeTraits>
//! ordering compatible with the strict weak ordering used to create the //! ordering compatible with the strict weak ordering used to create the
//! the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs. //! the tree. KeyNodePtrCompare can compare KeyType with tree's node_ptrs.
//! 'lower_key' must not be greater than 'upper_key' according to 'comp'. If //! 'lower_key' must not be greater than 'upper_key' according to 'comp'. If
//! 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be false. //! 'lower_key' == 'upper_key', ('left_closed' || 'right_closed') must be true.
//! //!
//! <b>Effects</b>: Returns an a pair with the following criteria: //! <b>Effects</b>: Returns an a pair with the following criteria:
//! //!
@@ -801,7 +801,7 @@ class bstree_algorithms : public bstree_algorithms_base<NodeTraits>
x = NodeTraits::get_left(x); x = NodeTraits::get_left(x);
} }
else{ else{
//x is inside the bounded range( x >= lower_key && x <= upper_key), //x is inside the bounded range(lower_key <= x <= upper_key),
//so we must split lower and upper searches //so we must split lower and upper searches
// //
//Sanity check: if lower_key and upper_key are equal, then both left_closed and right_closed can't be false //Sanity check: if lower_key and upper_key are equal, then both left_closed and right_closed can't be false