Skip to content

refactor!: remove deprecated iter_upper_bound #381

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

Draft
maksymar wants to merge 1 commit into
base: main
Choose a base branch
from
Draft

refactor!: remove deprecated iter_upper_bound #381

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
13 changes: 0 additions & 13 deletions src/btreemap.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1203,19 +1203,6 @@ where
}
}

/// **Deprecated**: use `iter_from_prev_key` instead.
///
/// The name `iter_upper_bound` was misleading — it suggested an inclusive
/// upper bound. In reality, it starts from the largest key strictly less
/// than the given bound.
///
/// The new name, `iter_from_prev_key`, better reflects this behavior and
/// improves code clarity.
#[deprecated(note = "use `iter_from_prev_key` instead")]
pub fn iter_upper_bound(&self, bound: &K) -> Iter<'_, K, V, M> {
self.iter_from_prev_key(bound)
}

/// Returns an iterator over the keys of the map.
pub fn keys(&self) -> KeysIter<'_, K, V, M> {
self.iter_internal().into()
Expand Down
Loading