diff --git a/library/alloc/src/collections/btree/map.rs b/library/alloc/src/collections/btree/map.rs
index adcb444d08c66..8386fccffb7ed 100644
--- a/library/alloc/src/collections/btree/map.rs
+++ b/library/alloc/src/collections/btree/map.rs
@@ -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
     ///
     /// ```
@@ -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
     ///
     /// ```
@@ -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
     ///
     /// ```
@@ -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
     ///
     /// ```
diff --git a/library/alloc/src/collections/btree/set.rs b/library/alloc/src/collections/btree/set.rs
index 6e6996bcbd69b..8376a36c133aa 100644
--- a/library/alloc/src/collections/btree/set.rs
+++ b/library/alloc/src/collections/btree/set.rs
@@ -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
     ///
     /// ```
@@ -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
     ///
     /// ```
@@ -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
     ///
     /// ```
@@ -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
     ///
     /// ```