Fix some uses of "map" instead of "set" in BTreeSet cursor API docs

This commit is contained in:
Ken Micklas 2024-08-01 19:47:06 +01:00
parent 020476296b
commit 4560770451

View File

@ -1194,7 +1194,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// gap before the smallest element greater than `x`.
///
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap before the smallest element in the map.
/// gap before the smallest element in the set.
///
/// # Examples
///
@ -1237,7 +1237,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// gap before the smallest element greater than `x`.
///
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap before the smallest element in the map.
/// gap before the smallest element in the set.
///
/// # Examples
///
@ -1280,7 +1280,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// gap after the greatest element smaller than `x`.
///
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap after the greatest element in the map.
/// gap after the greatest element in the set.
///
/// # Examples
///
@ -1323,7 +1323,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
/// gap after the greatest element smaller than `x`.
///
/// Passing `Bound::Unbounded` will return a cursor pointing to the
/// gap after the greatest element in the map.
/// gap after the greatest element in the set.
///
/// # Examples
///