Auto-generated commit

Author: stdlib-bot

CHANGELOG.md

@@ -4,7 +4,7 @@
 
 <section class="release" id="unreleased">
 
-## Unreleased (2025-11-26)
+## Unreleased (2025-12-02)
 
 <section class="features">
 
@@ -140,6 +140,7 @@ A total of 25 issues were closed in this release:
 
 <details>
 
+-   [`2662635`](https://github.com/stdlib-js/stdlib/commit/266263512efb9fdc594bcd1aca66b9d78c21443c) - **bench:** refactor to use string interpolation in `assert/contains` [(#8683)](https://github.com/stdlib-js/stdlib/pull/8683) _(by Aman Singh, Athan Reines)_
 -   [`f5f8c09`](https://github.com/stdlib-js/stdlib/commit/f5f8c0909696ae0d81abb67a5839f4317490ef2f) - **chore:** fix JavaScript lint errors [(#8561)](https://github.com/stdlib-js/stdlib/pull/8561) _(by kaushal-kumar-it, Athan Reines)_
 -   [`a8f91a0`](https://github.com/stdlib-js/stdlib/commit/a8f91a0b6ea2aff9ca80a61c764b246d1789889b) - **docs:** fix return annotations in TSDoc examples _(by Philipp Burckhardt)_
 -   [`8518e62`](https://github.com/stdlib-js/stdlib/commit/8518e622078185594b71f2ecf0ae34701e763733) - **fix:** make CLI scripts executable [(#8542)](https://github.com/stdlib-js/stdlib/pull/8542) _(by stdlib-bot)_
@@ -313,8 +314,9 @@ A total of 25 issues were closed in this release:
 
 ### Contributors
 
-A total of 23 people contributed to this release. Thank you to the following contributors:
+A total of 24 people contributed to this release. Thank you to the following contributors:
 
+-   Aman Singh
 -   Anshu Kumar
 -   Athan Reines
 -   Deepak Singh

contains/benchmark/benchmark.length.js

@@ -23,7 +23,7 @@
 var bench = require( '@stdlib/bench' );
 var isBoolean = require( './../../is-boolean' ).isPrimitive;
 var pow = require( '@stdlib/math/base/special/pow' );
-var randu = require( '@stdlib/random/base/randu' );
+var format = require( '@stdlib/string/format' );
 var pkg = require( './../package.json' ).name;
 var contains = require( './../lib' );
 
@@ -61,7 +61,7 @@ function createBenchmark( fcn, len ) {
 		b.tic();
 		for ( i = 0; i < b.iterations; i++ ) {
 			// Note: we are testing the worst case scenario where a function must scan the entire array before finding a value.
-			x[ len-2 ] = randu();
+			x[ len-2 ] -= 1;
 			bool = fcn( x, len-1 );
 			if ( typeof bool !== 'boolean' ) {
 				b.fail( 'should return a boolean' );
@@ -98,7 +98,7 @@ function main() {
 		len = pow( 10, i );
 
 		f = createBenchmark( contains, len );
-		bench( pkg+':len='+len, f );
+		bench( format( '%s:len=%d', pkg, len ), f );
 	}
 }