chore: clean up on docs

Author: Neerajpathak07

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

@@ -101,9 +101,9 @@
     > q.push( 1 ).push( 2 ).push( 3 );
     > q.every( function( v ) { return v > 0; } )
     true
-    > q.every( function( v ) { return v > 2; } )
+    > q.every( function( v ) { return v % 1 === 0; } )
     false
-    > q.every( function( v ) { return v % 2 === 0; } )
+    > q.every( function( v ) { return v > 2; } )
     false
 
 

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

@@ -393,7 +393,7 @@ declare class FIFO<T = unknown> {
 	*
 	* @example
 	* var FIFO = require( '@stdlib/dstructs/fifo' );
-	* 
+	*
 	* var queue = new FIFO();
 	*
 	* // Add values to the queue:

lib/node_modules/@stdlib/dstructs/fifo/examples/index.js

@@ -29,18 +29,18 @@ queue.push( 'bar' );
 queue.push( 'beep' );
 queue.push( 'boop' );
 
-// Inspect accessor-protocol implementation:
-queue.set( 'bop', 3 );
-v = queue.get( 3 );
-console.log( 'Value: %s', v );
-
 // Peek at the first and last queue values:
 var v = queue.first();
 console.log( 'First: %s', v );
 
 v = queue.last();
 console.log( 'Last: %s', v );
 
+// Inspect accessor-protocol implementation:
+queue.set( 'bop', 3 );
+v = queue.get( 3 );
+console.log( 'Value: %s', v );
+
 // Inspect the queue length:
 var len = queue.length;
 console.log( 'Queue length: %d', len );