style: replace tabs with spaces in examples indentation

gunjjoshi · Sep 11, 2024 · 3c5fc0d · 3c5fc0d
1 parent 44ebe3c
commit 3c5fc0d
Show file tree

Hide file tree

Showing 7 changed files with 43 additions and 43 deletions.
diff --git a/lib/node_modules/@stdlib/_tools/links/id2uri/lib/async.js b/lib/node_modules/@stdlib/_tools/links/id2uri/lib/async.js
@@ -49,11 +49,11 @@ var validate = require( './validate.js' );
 * id2uri( 'bibtex', clbk );
 *
 * function clbk( error, uri ) {
-*   if ( error ) {
-*       throw error;
-*   }
-*   console.log( uri );
-* 	// => 'http://www.bibtex.org/'
+*     if ( error ) {
+*         throw error;
+*     }
+*     console.log( uri );
+*     // => 'http://www.bibtex.org/'
 * }
 */
 function id2uri( id, options, clbk ) {

diff --git a/lib/node_modules/@stdlib/_tools/links/id2uri/lib/index.js b/lib/node_modules/@stdlib/_tools/links/id2uri/lib/index.js
@@ -29,11 +29,11 @@
 * id2uri( 'bibtex', clbk );
 *
 * function clbk( error, uri ) {
-*   if ( error ) {
-*       throw error;
-*   }
-*   console.log( uri );
-* 	// => 'http://www.bibtex.org/'
+*     if ( error ) {
+*         throw error;
+*     }
+*     console.log( uri );
+*     // => 'http://www.bibtex.org/'
 * }
 */
 

diff --git a/lib/node_modules/@stdlib/_tools/links/uri2id/lib/async.js b/lib/node_modules/@stdlib/_tools/links/uri2id/lib/async.js
@@ -49,11 +49,11 @@ var validate = require( './validate.js' );
 * uri2id( 'http://www.bibtex.org/', clbk );
 *
 * function clbk( error, id ) {
-*   if ( error ) {
-*       throw error;
-*   }
-*   console.log( id );
-* 	// => 'bibtex'
+*     if ( error ) {
+*         throw error;
+*     }
+*     console.log( id );
+*     // => 'bibtex'
 * }
 */
 function uri2id( uri, options, clbk ) {

diff --git a/lib/node_modules/@stdlib/_tools/links/uri2id/lib/index.js b/lib/node_modules/@stdlib/_tools/links/uri2id/lib/index.js
@@ -29,11 +29,11 @@
 * uri2id( 'http://www.bibtex.org/', clbk );
 *
 * function clbk( error, id ) {
-*   if ( error ) {
-*       throw error;
-*   }
-*   console.log( id );
-* 	// => 'bibtex'
+*     if ( error ) {
+*         throw error;
+*     }
+*     console.log( id );
+*     // => 'bibtex'
 * }
 */
 

diff --git a/lib/node_modules/@stdlib/_tools/links/validate/lib/async.js b/lib/node_modules/@stdlib/_tools/links/validate/lib/async.js
@@ -54,11 +54,11 @@ var check = require( './check.js' );
 * ], clbk );
 *
 * function clbk( error, validationErrors ) {
-*   if ( error ) {
-*       throw error;
-*   }
-*   console.log( validationErrors );
-* 	// => [...]
+*     if ( error ) {
+*         throw error;
+*     }
+*     console.log( validationErrors );
+*     // => [...]
 * }
 */
 function validateLinks( links, options, clbk ) {

diff --git a/lib/node_modules/@stdlib/utils/async/parallel/docs/types/index.d.ts b/lib/node_modules/@stdlib/utils/async/parallel/docs/types/index.d.ts
@@ -107,8 +107,8 @@ interface Parallel {
 	* var fcns = [ foo, bar ];
 	*
 	* var opts = {
-	* 	'thisArg': {},
-	* 	'limit': 2
+	*     'thisArg': {},
+	*     'limit': 2
 	* }
 	*
 	* parallel( fcns, opts, done );
@@ -218,8 +218,8 @@ interface Parallel {
 	* var fcns = [ a, b ];
 	*
 	* var opts = {
-	* 	'thisArg': {},
-	* 	'limit': 2
+	*     'thisArg': {},
+	*     'limit': 2
 	* }
 	*
 	* var run = parallel.factory( fcns, opts );

diff --git a/lib/node_modules/@stdlib/utils/named-typed-tuple/docs/types/index.d.ts b/lib/node_modules/@stdlib/utils/named-typed-tuple/docs/types/index.d.ts
@@ -405,7 +405,7 @@ interface Tuple {
 	*
 	* // Create a tuple factory which generates tuples having a custom tuple name:
 	* var opts = {
-	* 	'name': 'Point'
+	*     'name': 'Point'
 	* };
 	* factory = namedtypedtuple( [ 'x', 'y' ], opts );
 	*
@@ -518,7 +518,7 @@ interface Tuple {
 	* var tuple = factory( [ 1.0, -1.0 ] );
 	*
 	* function predicate( v ) {
-	* 	return ( v >= 0.0 );
+	*     return ( v >= 0.0 );
 	* }
 	*
 	* var bool = tuple.every( predicate );
@@ -624,7 +624,7 @@ interface Tuple {
 	* var tuple = factory( [ 1.0, 0.0, -1.0 ] );
 	*
 	* function predicate( v ) {
-	* 	return ( v < 0.0 );
+	*     return ( v < 0.0 );
 	* }
 	*
 	* var v = tuple.find( predicate );
@@ -645,7 +645,7 @@ interface Tuple {
 	* var tuple = factory( [ 1.0, 0.0, -1.0 ] );
 	*
 	* function predicate( v ) {
-	* 	return ( v < 0.0 );
+	*     return ( v < 0.0 );
 	* }
 	*
 	* var field = tuple.findField( predicate );
@@ -666,7 +666,7 @@ interface Tuple {
 	* var tuple = factory( [ 1.0, 0.0, -1.0 ] );
 	*
 	* function predicate( v ) {
-	* 	return ( v < 0.0 );
+	*     return ( v < 0.0 );
 	* }
 	*
 	* var idx = tuple.findIndex( predicate );
@@ -688,10 +688,10 @@ interface Tuple {
 	* var str = '';
 	*
 	* function fcn( v, i, f ) {
-	* 	str += f + '=' + v;
-	* 	if ( i < tuple.length-1 ) {
-	* 		str += ' ';
-	* 	}
+	*     str += f + '=' + v;
+	*     if ( i < tuple.length-1 ) {
+	*     	str += ' ';
+	*     }
 	* }
 	*
 	* tuple.forEach( fcn );
@@ -881,7 +881,7 @@ interface Tuple {
 	* var p1 = factory( [ 1.0, 0.0, -1.0 ] );
 	*
 	* function fcn( v ) {
-	* 	return v * 2.0;
+	*     return v * 2.0;
 	* }
 	*
 	* var p2 = p1.map( fcn );
@@ -915,7 +915,7 @@ interface Tuple {
 	* var tuple = factory( [ 2.0, 0.0, -3.0 ] );
 	*
 	* function fcn( acc, v ) {
-	* 	return acc + ( v*v );
+	*     return acc + ( v*v );
 	* }
 	*
 	* var v = tuple.reduce( fcn );
@@ -941,7 +941,7 @@ interface Tuple {
 	* var tuple = factory( [ 2.0, 0.0, -3.0 ] );
 	*
 	* function fcn( acc, v ) {
-	* 	return acc + ( v*v );
+	*     return acc + ( v*v );
 	* }
 	*
 	* var v = tuple.reduceRight( fcn );
@@ -1074,7 +1074,7 @@ interface Tuple {
 	* }
 	*
 	* var ctx = {
-	* 	'count': 0
+	*     'count': 0
 	* };
 	*
 	* var bool = tuple.some( predicate, ctx );
@@ -1131,7 +1131,7 @@ interface Tuple {
 	* // returns 2.0
 	*
 	* function descending( a, b ) {
-	* 	return b - a;
+	*     return b - a;
 	* }
 	*
 	* // Sort the tuple (in descending order):