fix: remove base

Author: headlessNode

lib/node_modules/@stdlib/blas/ext/base/glast-index-of-row/lib/base.js

@@ -26,7 +26,7 @@ var isColumnMajor = require( '@stdlib/ndarray/base/assert/is-column-major-string
 var stride2offset = require( '@stdlib/strided/base/stride2offset' );
 var max = require( '@stdlib/math/base/special/fast/max' );
 var format = require( '@stdlib/string/format' );
-var base = require( './base.js' );
+var ndarray = require( './ndarray.js' );
 
 
 // MAIN //
@@ -78,7 +78,7 @@ function glastIndexOfRow( order, M, N, A, LDA, x, strideX ) {
 		sa1 = LDA;
 		sa2 = 1;
 	}
-	return base( M, N, A, sa1, sa2, 0, x, strideX, stride2offset( N, strideX ) ); // eslint-disable-line max-len
+	return ndarray( M, N, A, sa1, sa2, 0, x, strideX, stride2offset( N, strideX ) ); // eslint-disable-line max-len
 }
 
 

lib/node_modules/@stdlib/blas/ext/base/glast-index-of-row/lib/main.js

@@ -20,7 +20,10 @@
 
 // MODULES //
 
-var base = require( './base.js' );
+var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
+var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
+var ones = require( '@stdlib/array/base/ones' );
+var accessors = require( './accessors.js' );
 
 
 // MAIN //
@@ -51,7 +54,85 @@ var base = require( './base.js' );
 * // returns 2
 */
 function glastIndexOfRow( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX ) { // eslint-disable-line max-len
-	return base( M, N, A, strideA1, strideA2, offsetA, x, strideX, offsetX );
+	var matches;
+	var da0;
+	var da1;
+	var S0;
+	var S1;
+	var ia;
+	var ix;
+	var i0;
+	var i1;
+	var oa;
+	var ox;
+
+	// Check whether the matrix is an empty matrix...
+	if ( M <= 0 || N <= 0 ) {
+		return -1;
+	}
+	oa = arraylike2object( A );
+	ox = arraylike2object( x );
+	if ( oa.accessorProtocol || ox.accessorProtocol ) {
+		return accessors( M, N, oa, strideA1, strideA2, offsetA, ox, strideX, offsetX ); // eslint-disable-line max-len
+	}
+	// Search for the last row matching the search vector...
+	if ( isRowMajor( [ strideA1, strideA2 ] ) ) {
+		S0 = N;
+		S1 = M;
+
+		// Scan a row-major linear buffer from the last indexed element to the first indexed element, always moving in the same direction when both strides are the same sign, thus ensuring cache optimal traversal...
+		for ( i1 = S1-1; i1 >= 0; i1-- ) {
+			ia = offsetA + ( i1*strideA1 ) + ( (S0-1)*strideA2 );
+			ix = offsetX + ( (S0-1)*strideX );
+			for ( i0 = S0-1; i0 >= 0; i0-- ) {
+				if ( A[ ia ] !== x[ ix ] ) {
+					// We found an element which is not in the search vector...
+					break;
+				}
+				ia -= strideA2;
+				ix -= strideX;
+			}
+			// If we successfully iterated over all columns, then that means we've found a match...
+			if ( i0 === -1 ) {
+				return i1;
+			}
+		}
+		// If we've made it here, then no rows match the search vector:
+		return -1;
+	}
+	// Column-major...
+	S0 = M;
+	S1 = N;
+
+	// Resolve loop offset (pointer) increments:
+	da0 = -strideA1;
+	da1 = ( S0*strideA1 ) - strideA2;
+
+	// Create an array for tracking which rows contain matching elements:
+	matches = ones( M );
+
+	// Finding the last matching row when a matrix is stored in column-major order requires effectively performing a full linear scan. In order to ensure cache-efficient traversal, scan up each column (otherwise, if we went row-by-row, we'd hop around linear memory, resulting in poor cache behavior)...
+	ia = offsetA + ( (S0-1)*strideA1 ) + ( (S1-1)*strideA2 );
+	ix = offsetX + ( (S1-1)*strideX );
+	for ( i1 = S1-1; i1 >= 0; i1-- ) {
+		// Scan up the rows in a column looking for a matching element...
+		for ( i0 = S0-1; i0 >= 0; i0-- ) {
+			if ( A[ ia ] !== x[ ix ] ) {
+				// We found a non-matching element, which means we can exclude this row from the list of row candidates...
+				matches[ i0 ] = 0;
+			}
+			ia += da0;
+		}
+		ia += da1;
+		ix -= strideX;
+	}
+	// Search for the last matching row...
+	for ( i0 = S0-1; i0 >= 0; i0-- ) {
+		if ( matches[ i0 ] === 1 ) {
+			break;
+		}
+	}
+	return i0;
 }