Update to latest libprimesieve

kimwalisch · Sep 9, 2023 · 0ddb06e · 0ddb06e
1 parent 1706ea9
commit 0ddb06e
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/lib/primesieve/include/primesieve/iterator.h b/lib/primesieve/include/primesieve/iterator.h
@@ -125,7 +125,7 @@ void primesieve_skipto(primesieve_iterator* it, uint64_t start, uint64_t stop_hi
  * primes >= start if the primes array is empty.
  * Note that this function also updates the i & size member variables
  * of the primesieve_iterator struct. The size of the primes array
- * varies, but it is usually close to 2^10.
+ * varies, but it is > 0 and usually close to 2^10.
  * If an error occurs primesieve_iterator.is_error is set to 1
  * and the primes array will contain PRIMESIEVE_ERROR.
  */
@@ -139,7 +139,7 @@ void primesieve_generate_next_primes(primesieve_iterator*);
  * primes <= start if the primes array is empty.
  * Note that this function also updates the i & size member variables
  * of the primesieve_iterator struct. The size of the primes array
- * varies, but it is ~ O(sqrt(n)).
+ * varies, but it is > 0 and ~ O(sqrt(n)).
  * If an error occurs primesieve_iterator.is_error is set to 1
  * and the primes array will contain PRIMESIEVE_ERROR.
  */

diff --git a/lib/primesieve/include/primesieve/iterator.hpp b/lib/primesieve/include/primesieve/iterator.hpp
@@ -100,7 +100,7 @@ struct iterator
   /// if the primes array is empty.
   /// Note that this method also updates the i & size member variables
   /// of this primesieve::iterator struct. The size of the primes array
-  /// varies, but it is usually close to 2^10.
+  /// varies, but it is > 0 and usually close to 2^10.
   ///
   void generate_next_primes();
 
@@ -111,7 +111,7 @@ struct iterator
   /// primes <= start if the primes array is empty.
   /// Note that this method also updates the i & size member variables
   /// of this primesieve::iterator struct. The size of the primes array
-  /// varies, but it is ~ O(sqrt(n)).
+  /// varies, but it is > 0 and ~ O(sqrt(n)).
   ///
   void generate_prev_primes();