chore: follow-up fixes for recent commits

PR-URL: #12933
Reviewed-by: Athan Reines <kgryte@gmail.com>

Author: Planeshifter

lib/node_modules/@stdlib/fft/base/fftpack/cffti/lib/main.js

@@ -158,7 +158,7 @@ function cffti( N, workspace, strideW, offsetW ) {
 
 	// When a sub-sequence is a single data point, the FFT is the identity, so no initialization necessary...
 	if ( N === 1 ) {
-		return;
+		return workspace;
 	}
 	// Resolve the starting indices for storing twiddle factors and factorization results:
 	offsetT = offsetW + ( 2*N*strideW ); // index offset for twiddle factors

lib/node_modules/@stdlib/number/uint64/base/assert/is-equal/test/test.js

@@ -56,7 +56,7 @@ tape( 'the function tests whether two 64-bit unsigned integers are equal', funct
 	t.strictEqual( isEqual( a, b ), true, 'returns expected value' );
 
 	a = new Uint64( 1234 );
-	a = new Uint64( 5678 );
+	b = new Uint64( 5678 );
 	t.strictEqual( isEqual( a, b ), false, 'returns expected value' );
 
 	if ( HAS_BIGINT ) {

lib/node_modules/@stdlib/number/uint64/base/to-words/README.md

@@ -88,7 +88,7 @@ a = new Uint64( 10000000000 );
 w = toWords( a );
 // returns [ 2, 1410065408 ]
 
-a = new Uint64.of( 12, 34 );
+a = Uint64.of( 12, 34 );
 w = toWords( a );
 // returns [ 12, 34 ]
 ```

lib/node_modules/@stdlib/number/uint64/base/to-words/examples/index.js

@@ -31,7 +31,7 @@ w = toWords( a );
 console.log( w );
 // => [ 2, 1410065408 ]
 
-a = new Uint64.of( 12, 34 );
+a = Uint64.of( 12, 34 );
 w = toWords( a );
 console.log( w );
 // => [ 12, 34 ]