feat(lint): corrected linting for c files for the new package tinymt32

Author: abdelrahman04

lib/node_modules/@stdlib/random/base/tinymt32/README.md

@@ -234,10 +234,10 @@ var o = tinymt32.toJSON();
 
 ## Notes
 
--   [TinyMT32][tiny-mersenne-twister] is **not** a cryptographically secure PRNG, as the PRNG is based on a linear recursion. Any pseudorandom number sequence generated by a linear recursion is **insecure**, due to the fact that one can predict future generated outputs by observing a sufficiently long subsequence of generated values.
+-   [TinyMT32][tiny-mersenne-twister] is _not_ a cryptographically secure PRNG, as the PRNG is based on a linear recursion. Any pseudorandom number sequence generated by a linear recursion is _insecure_, due to the fact that one can predict future generated outputs by observing a sufficiently long subsequence of generated values.
 -   Compared to other PRNGs, [TinyMT32][tiny-mersenne-twister] has a small state size (`16 bytes`), making it suitable for memory-constrained environments. However, this comes at the cost of a shorter period length compared to the original Mersenne Twister.
--   A seed array of length `1` is considered **equivalent** to an integer seed equal to the lone seed array element and vice versa.
--   If PRNG state is "shared" (meaning a state array was provided during PRNG creation and **not** copied) and one sets the generator state to a state array having a different length, the PRNG does **not** update the existing shared state and, instead, points to the newly provided state array. In order to synchronize PRNG output according to the new shared state array, the state array for **each** relevant PRNG must be **explicitly** set.
+-   A seed array of length `1` is considered _equivalent_ to an integer seed equal to the lone seed array element and vice versa.
+-   If PRNG state is "shared" (meaning a state array was provided during PRNG creation and _not_ copied) and one sets the generator state to a state array having a different length, the PRNG does _not_ update the existing shared state and, instead, points to the newly provided state array. In order to synchronize PRNG output according to the new shared state array, the state array for _each_ relevant PRNG must be _explicitly_ set.
 -   If PRNG state is "shared" and one sets the generator state to a state array of the same length, the PRNG state is updated (along with the state of all other PRNGs sharing the PRNG's state array).
 
 </section>
@@ -279,7 +279,7 @@ console.log( bool );
 
 ## References
 
--   Saito, Makoto, and Mutsuo Saito. 2008. "SIMD-Oriented Fast Mersenne Twister: A 128-bit Pseudorandom Number Generator." In *Monte Carlo and Quasi-Monte Carlo Methods 2006*, edited by Alexander Keller, Stefan Heinrich, and Harald Niederreiter, 607–22. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:[10.1007/978-3-540-74496-2_36][saito-2008].
+-   Saito, Makoto, and Mutsuo Saito. 2008. "SIMD-Oriented Fast Mersenne Twister: A 128-bit Pseudorandom Number Generator." In _Monte Carlo and Quasi-Monte Carlo Methods 2006_, edited by Alexander Keller, Stefan Heinrich, and Harald Niederreiter, 607–22. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:[10.1007/978-3-540-74496-2_36][saito-2008].
 
 </section>
 
@@ -307,8 +307,10 @@ console.log( bool );
 
 [tiny-mersenne-twister]: https://github.com/MersenneTwister-Lab/TinyMT
 [saito-2008]: https://doi.org/10.1007/978-3-540-74496-2_36
-
-[@stdlib/array/uint32]: https://github.com/stdlib-js/stdlib
+[@stdlib/array/uint32]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/uint32
+[@stdlib/random/base/mt19937]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/random/base/mt19937
+[@stdlib/random/base/minstd]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/random/base/minstd
+[@stdlib/random/base/randu]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/random/base/randu
 
 </section>
 

lib/node_modules/@stdlib/random/base/tinymt32/benchmark/benchmark.factory.js

@@ -1,20 +1,20 @@
 /**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*     http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
+ * @license Apache-2.0
+ *
+ * Copyright (c) 2025 The Stdlib Authors.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
 
 'use strict';
 

lib/node_modules/@stdlib/random/base/tinymt32/benchmark/benchmark.js

@@ -1,20 +1,20 @@
 /**
-* @license Apache-2.0
-*
-* Copyright (c) 2025 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*     http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
+ * @license Apache-2.0
+ *
+ * Copyright (c) 2025 The Stdlib Authors.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
 
 'use strict';
 

lib/node_modules/@stdlib/random/base/tinymt32/benchmark/c/benchmark.c

@@ -39,7 +39,7 @@
 * Prints the TAP version.
 */
 void print_version() {
-    printf( "TAP version 13\n" );
+	printf( "TAP version 13\n" );
 }
 
 /**
@@ -49,12 +49,12 @@ void print_version() {
 * @param passing   total number of passing tests
 */
 void print_summary( int total, int passing ) {
-    printf( "#\n" );
-    printf( "1..%d\n", total ); // TAP plan
-    printf( "# total %d\n", total );
-    printf( "# pass  %d\n", passing );
-    printf( "#\n" );
-    printf( "# ok\n" );
+	printf( "#\n" );
+	printf( "1..%d\n", total ); // TAP plan
+	printf( "# total %d\n", total );
+	printf( "# pass  %d\n", passing );
+	printf( "#\n" );
+	printf( "# ok\n" );
 }
 
 /**
@@ -63,13 +63,13 @@ void print_summary( int total, int passing ) {
 * @return current time in microseconds
 */
 double tic() {
-    struct timeval t;
-    int ret = gettimeofday( &t, NULL );
-    if ( ret != 0 ) {
-        fprintf( stderr, "Error: Failed to get time.\n" );
-        exit( 1 );
-    }
-    return (double)t.tv_sec + (double)t.tv_usec*1.0e-6;
+	struct timeval t;
+	int ret = gettimeofday( &t, NULL );
+	if ( ret != 0 ) {
+		fprintf( stderr, "Error: Failed to get time.\n" );
+		exit( 1 );
+	}
+	return (double)t.tv_sec + (double)t.tv_usec*1.0e-6;
 }
 
 /**
@@ -79,36 +79,36 @@ double tic() {
 * @return random unsigned 32-bit integer
 */
 uint32_t next( uint32_t *state ) {
-    uint32_t y;
-    uint32_t x;
-
-    // Mix state
-    y = state[3];
-    x = (state[0] & 0x7FFFFFFF) ^ state[1] ^ state[2];
-    x ^= (x << 1);
-    y ^= (y >> 1) ^ x;
-    state[0] = state[1];
-    state[1] = state[2];
-    state[2] = x ^ (y << 10);
-    state[3] = y;
-
-    // Tempering
-    if (y & 1) {
-        state[1] ^= MAT1;
-        state[2] ^= MAT2;
-    }
-
-    y = state[0] + (state[2] >> 8);
-    return (y ^ TMAT);
+	uint32_t y;
+	uint32_t x;
+
+	// Mix state
+	y = state[3];
+	x = (state[0] & 0x7FFFFFFF) ^ state[1] ^ state[2];
+	x ^= (x << 1);
+	y ^= (y >> 1) ^ x;
+	state[0] = state[1];
+	state[1] = state[2];
+	state[2] = x ^ (y << 10);
+	state[3] = y;
+
+	// Tempering
+	if (y & 1) {
+		state[1] ^= MAT1;
+		state[2] ^= MAT2;
+	}
+
+	y = state[0] + (state[2] >> 8);
+	return (y ^ TMAT);
 }
 
 /**
 * Returns a normalized pseudorandom number on the interval [0,1).
 *
 * @return double normalized pseudorandom number
 */
-double tinymt32_normalized( tinymt32_t *ctx ) {
-	return (double)tinymt32_generate_uint32( ctx ) / (double)(UINT32_MAX + 1);
+double tinymt32_normalized( uint32_t *state ) {
+	return (double)next( state ) / (double)(UINT32_MAX + 1);
 }
 
 /**
@@ -117,48 +117,48 @@ double tinymt32_normalized( tinymt32_t *ctx ) {
 * @return elapsed time in seconds
 */
 double benchmark() {
-    double elapsed;
-    double t;
-    uint32_t state[4];
-    uint32_t v;
-    int i;
-
-    // Initialize state
-    state[0] = 12345;
-    state[1] = MAT1;
-    state[2] = MAT2;
-    state[3] = TMAT;
-
-    t = tic();
-    for ( i = 0; i < ITERATIONS; i++ ) {
-        v = tinymt32_normalized( &ctx );
-        if ( v < 0.0 || v >= 1.0 ) {
-            printf( "unexpected value: %f\n", v );
-            exit( 1 );
-        }
-    }
-    elapsed = tic() - t;
-    if ( v < 0.0 || v >= 1.0 ) {
-        printf( "Warning: Unexpected value: %f\n", v );
-    }
-    return elapsed;
+	double elapsed;
+	double t;
+	uint32_t state[4];
+	uint32_t v;
+	int i;
+
+	// Initialize state
+	state[0] = 12345;
+	state[1] = MAT1;
+	state[2] = MAT2;
+	state[3] = TMAT;
+
+	t = tic();
+	for ( i = 0; i < ITERATIONS; i++ ) {
+		v = tinymt32_normalized( state );
+		if ( v < 0.0 || v >= 1.0 ) {
+			printf( "unexpected value: %f\n", v );
+			exit( 1 );
+		}
+	}
+	elapsed = tic() - t;
+	if ( v < 0.0 || v >= 1.0 ) {
+		printf( "Warning: Unexpected value: %f\n", v );
+	}
+	return elapsed;
 }
 
 /**
 * Main execution sequence.
 */
 int main( void ) {
-    double elapsed;
-    int i;
+	double elapsed;
+	int i;
 
-    print_version();
+	print_version();
 
-    for ( i = 0; i < REPEATS; i++ ) {
-        printf( "# c::%s\n", NAME );
-        elapsed = benchmark();
-        printf( "ok %d benchmark finished in %0.9fs\n", i+1, elapsed );
-    }
-    print_summary( REPEATS, REPEATS );
+	for ( i = 0; i < REPEATS; i++ ) {
+		printf( "# c::%s\n", NAME );
+		elapsed = benchmark();
+		printf( "ok %d benchmark finished in %0.9fs\n", i+1, elapsed );
+	}
+	print_summary( REPEATS, REPEATS );
 
-    return 0;
+	return 0;
 }