Fix some uses of "map" instead of "set" in BTreeSet cursor API docs · model-checking/verify-rust-std@8835b0f (original) (raw)

Original file line number Diff line number Diff line change
@@ -1194,7 +1194,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
1194 1194 /// gap before the smallest element greater than `x`.
1195 1195 ///
1196 1196 /// Passing `Bound::Unbounded` will return a cursor pointing to the
1197 - /// gap before the smallest element in the map.
1197 + /// gap before the smallest element in the set.
1198 1198 ///
1199 1199 /// # Examples
1200 1200 ///
@@ -1237,7 +1237,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
1237 1237 /// gap before the smallest element greater than `x`.
1238 1238 ///
1239 1239 /// Passing `Bound::Unbounded` will return a cursor pointing to the
1240 - /// gap before the smallest element in the map.
1240 + /// gap before the smallest element in the set.
1241 1241 ///
1242 1242 /// # Examples
1243 1243 ///
@@ -1280,7 +1280,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
1280 1280 /// gap after the greatest element smaller than `x`.
1281 1281 ///
1282 1282 /// Passing `Bound::Unbounded` will return a cursor pointing to the
1283 - /// gap after the greatest element in the map.
1283 + /// gap after the greatest element in the set.
1284 1284 ///
1285 1285 /// # Examples
1286 1286 ///
@@ -1323,7 +1323,7 @@ impl<T, A: Allocator + Clone> BTreeSet<T, A> {
1323 1323 /// gap after the greatest element smaller than `x`.
1324 1324 ///
1325 1325 /// Passing `Bound::Unbounded` will return a cursor pointing to the
1326 - /// gap after the greatest element in the map.
1326 + /// gap after the greatest element in the set.
1327 1327 ///
1328 1328 /// # Examples
1329 1329 ///