Skip to content

[btree_cursors] Add explanations for lower_bound and upper_bound #147573

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

[btree_cursors] Add explanations for lower_bound and upper_bound #147573

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
0574c1a
Update map.rs
Xylenox Oct 10, 2025
5f1d462
Update set.rs
Xylenox Oct 10, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions library/alloc/src/collections/btree/map.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2670,6 +2670,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap before the smallest key in the map.
///
/// Represents the gap at the beginning of a range with the given bound as it's lower bound.
///
/// # Examples
///
/// ```
Expand Down Expand Up @@ -2723,6 +2725,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap before the smallest key in the map.
///
/// Represents the gap at the beginning of a range with the given bound as it's lower bound.
///
/// # Examples
///
/// ```
Expand Down Expand Up @@ -2793,6 +2797,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap after the greatest key in the map.
///
/// Represents the gap at the end of a range with the given bound as it's upper bound.
///
/// # Examples
///
/// ```
Expand Down Expand Up @@ -2846,6 +2852,8 @@ impl<K, V, A: Allocator + Clone> BTreeMap<K, V, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap after the greatest key in the map.
///
/// Represents the gap at the end of a range with the given bound as it's upper bound.
///
/// # Examples
///
/// ```
Expand Down
8 changes: 8 additions & 0 deletions library/alloc/src/collections/btree/set.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1309,6 +1309,8 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap before the smallest element in the set.
///
/// Represents the gap at the beginning of a range with the given bound as it's lower bound.
///
/// # Examples
///
/// ```
Expand Down Expand Up @@ -1352,6 +1354,8 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap before the smallest element in the set.
///
/// Represents the gap at the beginning of a range with the given bound as it's lower bound.
///
/// # Examples
///
/// ```
Expand Down Expand Up @@ -1395,6 +1399,8 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap after the greatest element in the set.
///
/// Represents the gap at the end of a range with the given bound as it's upper bound.
///
/// # Examples
///
/// ```
Expand Down Expand Up @@ -1438,6 +1444,8 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap after the greatest element in the set.
///
/// Represents the gap at the end of a range with the given bound as it's upper bound.
///
/// # Examples
///
/// ```
Expand Down
Loading