Update doc-comments for better descriptions of the functions behaviors

Co-authored-by: marin <postma.marin@protonmail.com>
RoaringBitmap · Oct 21, 2021 · f358f59 · f358f59
1 parent 3432ee0
commit f358f59
Show file tree

Hide file tree

Showing 2 changed files with 9 additions and 9 deletions.
diff --git a/src/bitmap/iter.rs b/src/bitmap/iter.rs
@@ -133,12 +133,12 @@ impl Extend<u32> for RoaringBitmap {
 impl RoaringBitmap {
     /// Create the set from a sorted iterator. Values must be sorted and deduplicated.
     ///
-    /// The values of the iterator must be ordered and strictly bigger than the biggest value
-    /// in the set. If a value in this iterator doesn't follow this rule it is not added
+    /// The values of the iterator must be ordered and strictly greater than the greatest value
+    /// in the set. If a value in the iterator doesn't satisfy this requirement, it is not added
     /// and the append operation is stopped.
     ///
     /// Returns `Ok` with the requested `RoaringBitmap`, `Err` with the number of elements
-    /// we tried to append before an error occurred.
+    /// that were correctly appended before failure.
     ///
     /// # Examples
     ///
@@ -161,8 +161,8 @@ impl RoaringBitmap {
 
     /// Extend the set with a sorted iterator.
     ///
-    /// The values of the iterator must be ordered and strictly bigger than the biggest value
-    /// in the set. If a value in this iterator doesn't follow this rule it is not added
+    /// The values of the iterator must be ordered and strictly greater than the greatest value
+    /// in the set. If a value in the iterator doesn't satisfy this requirement, it is not added
     /// and the append operation is stopped.
     ///
     /// Returns `Ok` with the number of elements appended to the set, `Err` with

diff --git a/src/treemap/iter.rs b/src/treemap/iter.rs
@@ -210,8 +210,8 @@ impl Extend<u64> for RoaringTreemap {
 impl RoaringTreemap {
     /// Create the set from a sorted iterator. Values must be sorted and deduplicated.
     ///
-    /// The values of the iterator must be ordered and strictly bigger than the biggest value
-    /// in the set. If a value in this iterator doesn't follow this rule it is not added
+    /// The values of the iterator must be ordered and strictly greater than the greatest value
+    /// in the set. If a value in the iterator doesn't satisfy this requirement, it is not added
     /// and the append operation is stopped.
     ///
     /// Returns `Ok` with the requested `RoaringTreemap`, `Err` with the number of elements
@@ -238,8 +238,8 @@ impl RoaringTreemap {
 
     /// Extend the set with a sorted iterator.
     ///
-    /// The values of the iterator must be ordered and strictly bigger than the biggest value
-    /// in the set. If a value in this iterator doesn't follow this rule it is not added
+    /// The values of the iterator must be ordered and strictly greater than the greatest value
+    /// in the set. If a value in the iterator doesn't satisfy this requirement, it is not added
     /// and the append operation is stopped.
     ///
     /// Returns `Ok` with the number of elements appended to the set, `Err` with