Capitalize "see" in binary search docs

src/map.rs

@@ -797,7 +797,7 @@ where
     /// Search over a sorted map with a comparator function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by`] for more details.
+    /// See [`slice::binary_search_by`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -811,7 +811,7 @@ where
     /// Search over a sorted map with an extraction function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by_key`] for more details.
+    /// See [`slice::binary_search_by_key`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -826,7 +826,7 @@ where
     /// Returns the index of the partition point of a sorted map according to the given predicate
     /// (the index of the first element of the second partition).
     ///
-    /// see [`slice::partition_point`] for more details.
+    /// See [`slice::partition_point`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[must_use]

src/map/slice.rs

@@ -205,7 +205,7 @@ impl<K, V> Slice<K, V> {
     /// Search over a sorted map for a key.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search`] for more details.
+    /// See [`slice::binary_search`] for more details.
     ///
     /// Computes in **O(log(n))** time,
     /// which is notably less scalable than looking the value up in the map this is a slice from.
@@ -219,7 +219,7 @@ impl<K, V> Slice<K, V> {
     /// Search over a sorted map with a comparator function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by`] for more details.
+    /// See [`slice::binary_search_by`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -233,7 +233,7 @@ impl<K, V> Slice<K, V> {
     /// Search over a sorted map with an extraction function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by_key`] for more details.
+    /// See [`slice::binary_search_by_key`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -248,7 +248,7 @@ impl<K, V> Slice<K, V> {
     /// Returns the index of the partition point of a sorted map according to the given predicate
     /// (the index of the first element of the second partition).
     ///
-    /// see [`slice::partition_point`] for more details.
+    /// See [`slice::partition_point`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[must_use]

src/set.rs

@@ -691,7 +691,7 @@ where
     /// Search over a sorted set with a comparator function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by`] for more details.
+    /// See [`slice::binary_search_by`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -705,7 +705,7 @@ where
     /// Search over a sorted set with an extraction function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by_key`] for more details.
+    /// See [`slice::binary_search_by_key`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -720,7 +720,7 @@ where
     /// Returns the index of the partition point of a sorted set according to the given predicate
     /// (the index of the first element of the second partition).
     ///
-    /// see [`slice::partition_point`] for more details.
+    /// See [`slice::partition_point`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[must_use]

src/set/slice.rs

@@ -113,7 +113,7 @@ impl<T> Slice<T> {
     /// Search over a sorted set for a value.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search`] for more details.
+    /// See [`slice::binary_search`] for more details.
     ///
     /// Computes in **O(log(n))** time,
     /// which is notably less scalable than looking the value up in the set this is a slice from.
@@ -127,7 +127,7 @@ impl<T> Slice<T> {
     /// Search over a sorted set with a comparator function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by`] for more details.
+    /// See [`slice::binary_search_by`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -141,7 +141,7 @@ impl<T> Slice<T> {
     /// Search over a sorted set with an extraction function.
     ///
     /// Returns the position where that value is present, or the position where it can be inserted to maintain the sort.
-    /// see [`slice::binary_search_by_key`] for more details.
+    /// See [`slice::binary_search_by_key`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[inline]
@@ -156,7 +156,7 @@ impl<T> Slice<T> {
     /// Returns the index of the partition point of a sorted set according to the given predicate
     /// (the index of the first element of the second partition).
     ///
-    /// see [`slice::partition_point`] for more details.
+    /// See [`slice::partition_point`] for more details.
     ///
     /// Computes in **O(log(n))** time.
     #[must_use]