Auto-generated commit

Author: stdlib-bot

.github/.keepalive

@@ -12,6 +12,7 @@
 
 <details>
 
+-   [`dededfd`](https://github.com/stdlib-js/stdlib/commit/dededfdc6102931758f0a12955d0054df893d849) - **bench:** update random value generation [(#6682)](https://github.com/stdlib-js/stdlib/pull/6682) _(by Harsh)_
 -   [`8bf8285`](https://github.com/stdlib-js/stdlib/commit/8bf8285aba0ecbd00ae145c4c5c098cd28135814) - **chore:** minor clean-up _(by Philipp Burckhardt)_
 -   [`5b4c5ca`](https://github.com/stdlib-js/stdlib/commit/5b4c5cadb3d2fed46829dbf32f217726658e46bb) - **bench:** resolve lint errors _(by Athan Reines)_
 -   [`2777e4b`](https://github.com/stdlib-js/stdlib/commit/2777e4be161869d09406e3b17947d24c64b47af2) - **bench:** resolve lint errors in benchmarks _(by Athan Reines)_
@@ -26,9 +27,10 @@
 
 ### Contributors
 
-A total of 2 people contributed to this release. Thank you to the following contributors:
+A total of 3 people contributed to this release. Thank you to the following contributors:
 
 -   Athan Reines
+-   Harsh
 -   Philipp Burckhardt
 
 </section>

CHANGELOG.md

@@ -49,14 +49,14 @@ tape( 'the function returns `false` if provided a prime number', function test(
 	M = 2e4;
 	for ( i = 0; i < M; i++ ) {
 		v = PRIMES[ i ];
-		t.equal( isComposite( v ), false, 'returns false when provided '+v );
+		t.equal( isComposite( v ), false, 'returns expected value when provided '+v );
 	}
 	// Randomly test prime numbers chosen from the remainder of the list of known prime numbers...
 	N = PRIMES.length - 1;
 	for ( i = 0; i < 1e3; i++ ) {
 		j = discreteUniform( M, N );
 		v = PRIMES[ j ];
-		t.equal( isComposite( v ), false, 'returns false when provided '+v );
+		t.equal( isComposite( v ), false, 'returns expected value when provided '+v );
 	}
 	t.end();
 });
@@ -79,7 +79,7 @@ tape( 'the function returns `true` if provided a composite number', function tes
 		if ( hash[ i ] ) {
 			continue;
 		}
-		t.equal( isComposite( i ), true, 'returns true when provided '+i );
+		t.equal( isComposite( i ), true, 'returns expected value when provided '+i );
 	}
 	// Generate random composite integers among the list of primes...
 	MAX = PRIMES[ N-1 ];
@@ -92,7 +92,7 @@ tape( 'the function returns `true` if provided a composite number', function tes
 			i -= 1;
 			continue;
 		}
-		t.equal( isComposite( j ), true, 'returns true when provided '+j );
+		t.equal( isComposite( j ), true, 'returns expected value when provided '+j );
 	}
 	t.end();
 });
@@ -103,7 +103,7 @@ tape( 'the function returns `false` if not provided a positive integer', functio
 	for ( i = 0; i < 100; i++ ) {
 		v = ( randu()*100.0 ) - 50.0;
 		if ( trunc(v) !== v ) {
-			t.equal( isComposite( v ), false, 'returns false when provided '+v );
+			t.equal( isComposite( v ), false, 'returns expected value when provided '+v );
 		}
 	}
 	t.end();

test/test.js

@@ -62,14 +62,14 @@ tape( 'the function returns `false` if provided a prime number', opts, function
 	M = 2e4;
 	for ( i = 0; i < M; i++ ) {
 		v = PRIMES[ i ];
-		t.equal( isComposite( v ), false, 'returns false when provided ' + v );
+		t.equal( isComposite( v ), false, 'returns expected value when provided ' + v );
 	}
 	// Randomly test prime numbers chosen from the remainder of the list of known prime numbers...
 	N = PRIMES.length - 1;
 	for ( i = 0; i < 1e3; i++ ) {
 		j = discreteUniform( M, N );
 		v = PRIMES[ j ];
-		t.equal( isComposite( v ), false, 'returns false when provided ' + v );
+		t.equal( isComposite( v ), false, 'returns expected value when provided ' + v );
 	}
 	t.end();
 });
@@ -92,7 +92,7 @@ tape( 'the function returns `true` if provided a composite number', opts, functi
 		if ( hash[ i ] ) {
 			continue;
 		}
-		t.equal( isComposite( i ), true, 'returns true when provided ' + i );
+		t.equal( isComposite( i ), true, 'returns expected value when provided ' + i );
 	}
 	// Generate random composite integers among the list of primes...
 	MAX = PRIMES[ N-1 ];
@@ -105,7 +105,7 @@ tape( 'the function returns `true` if provided a composite number', opts, functi
 			i -= 1;
 			continue;
 		}
-		t.equal( isComposite( j ), true, 'returns true when provided ' + j );
+		t.equal( isComposite( j ), true, 'returns expected value when provided ' + j );
 	}
 	t.end();
 });
@@ -116,7 +116,7 @@ tape( 'the function returns `false` if not provided a positive integer', opts, f
 	for ( i = 0; i < 100; i++ ) {
 		v = ( randu()*100.0 ) - 50.0;
 		if ( trunc( v ) !== v ) {
-			t.equal( isComposite( v ), false, 'returns false when provided ' + v );
+			t.equal( isComposite( v ), false, 'returns expected value when provided ' + v );
 		}
 	}
 	t.end();