chore: clean up

Author: Neerajpathak07

lib/node_modules/@stdlib/dstructs/fifo/docs/repl.txt

@@ -1,4 +1,3 @@
-
 {{alias}}()
     First-in-first-out (FIFO) queue constructor.
 
@@ -58,11 +57,11 @@
     > q.push( 'foo' ).push( 'bar' ).push( 'baz' );
     > q.length
     3
-    > q[0]
+    > q.get( 0 )
     'foo'
-    > q[1]
+    > q.get( 1 )
     'bar'
-    > q[2]
+    > q.get( 2 )
     'baz'
     > q.pop()
     'foo'
@@ -100,11 +99,11 @@
     --------
     > var q = {{alias}}();
     > q.push( 1 ).push( 2 ).push( 3 );
-    > q.every( function predicate( v ) { return v > 0; } )
+    > q.every( function( v ) { return v > 0; } )
     true
-    > q.every( function predicate( v ) { return v > 2; } )
+    > q.every( function( v ) { return v > 2; } )
     false
-    > q.every( function predicate( v ) { return v % 2 === 0; } )
+    > q.every( function( v ) { return v % 2 === 0; } )
     false
 
 

lib/node_modules/@stdlib/dstructs/fifo/docs/types/index.d.ts

@@ -74,13 +74,15 @@ type Predicate<T, U> = NullaryPredicate<U> | UnaryPredicate<T, U> | BinaryPredic
 *
 * @template T - queue element type
 */
-declare class FIFO<T = any> {
+declare class FIFO<T = unknown> {
 	/**
 	* First-in-first-out queue constructor.
 	*
 	* @returns FIFO queue instance
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -105,6 +107,8 @@ declare class FIFO<T = any> {
 	* @returns queue instance
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -144,6 +148,8 @@ declare class FIFO<T = any> {
 	* @returns boolean indicating whether all elements pass a test
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* function predicate( v ) {
 	*     return v > 0;
 	* }
@@ -163,6 +169,8 @@ declare class FIFO<T = any> {
 	* @returns "oldest" queue value
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -182,6 +190,8 @@ declare class FIFO<T = any> {
 	* @returns queue element
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* queue.push( 'foo' ).push( 'bar' );
@@ -204,6 +214,8 @@ declare class FIFO<T = any> {
 	* @returns iterator
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -230,6 +242,8 @@ declare class FIFO<T = any> {
 	* @returns "newest" queue value
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -245,6 +259,8 @@ declare class FIFO<T = any> {
 	* Queue length.
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Examine the initial queue length:
@@ -266,6 +282,8 @@ declare class FIFO<T = any> {
 	* @returns removed value
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -290,6 +308,8 @@ declare class FIFO<T = any> {
 	* @returns queue instance
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -322,6 +342,8 @@ declare class FIFO<T = any> {
 	* @throws target queue lacks sufficient storage to accommodate source values
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* queue.push( 'foo' ).push( 'bar' ).set( 'beep', 0 );
@@ -347,6 +369,8 @@ declare class FIFO<T = any> {
 	* @returns queue values
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -368,6 +392,8 @@ declare class FIFO<T = any> {
 	* @returns serialized queue
 	*
 	* @example
+	* var FIFO = require( '@stdlib/dstructs/fifo' );
+	* 
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:
@@ -377,7 +403,7 @@ declare class FIFO<T = any> {
 	* var o = queue.toJSON();
 	* // returns { 'type': 'fifo', 'data': [ 'foo', 'bar' ] }
 	*/
-	toJSON(): any;
+	toJSON(): { type: string; data: Array<T> };
 }
 
 

lib/node_modules/@stdlib/dstructs/fifo/lib/main.js

@@ -524,14 +524,14 @@ setReadOnly( FIFO.prototype, 'push', function push( value ) {
 * // returns 'boop'
 */
 setReadOnly( FIFO.prototype, 'set', function set( value ) {
-	var idx;
 	var node;
+	var idx;
 	var i;
 
 	if ( !isFIFO( this ) ) {
 		throw new TypeError( 'invalid invocation. `this` is not a FIFO.' );
 	}
-	idx = arguments.length > 1 ? arguments[ 1 ] : 0;
+	idx = ( arguments.length > 1 ) ? arguments[ 1 ] : 0;
 	if ( !isNonNegativeInteger( idx ) ) {
 		throw new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );
 	}