Add const qualifier

Author: kgryte

lib/node_modules/@stdlib/ndarray/ctor/include/stdlib/ndarray/ctor.h

@@ -266,7 +266,7 @@ uint8_t * stdlib_ndarray_get_ptr( const struct ndarray *arr, const int64_t *sub
 /**
 * Returns an underlying byte array pointer to an ndarray data element located at a specified linear index.
 */
-uint8_t * stdlib_ndarray_iget_ptr( const struct ndarray *arr, int64_t idx );
+uint8_t * stdlib_ndarray_iget_ptr( const struct ndarray *arr, const int64_t idx );
 
 /**
 * Sets an ndarray data element specified by a provided byte array pointer value.

lib/node_modules/@stdlib/ndarray/ctor/src/main.c

@@ -336,22 +336,26 @@ uint8_t * stdlib_ndarray_get_ptr( const struct ndarray *arr, const int64_t *sub
 * @param idx  linear view index
 * @return     underlying byte array pointer
 */
-uint8_t * stdlib_ndarray_iget_ptr( const struct ndarray *arr, int64_t idx ) {
+uint8_t * stdlib_ndarray_iget_ptr( const struct ndarray *arr, const int64_t idx ) {
 	int64_t *strides;
 	int64_t *shape;
 	int64_t ndims;
 	uint8_t *ind;
 	int64_t s;
 	int64_t i;
+	int64_t j;
 	int8_t io;
 
+	// Copy to a mutable variable:
+	j = idx;
+
 	// Resolve an ndarray index based on the ndarray index mode:
-	idx = stdlib_ndarray_ind( idx, (arr->length)-1, arr->imode );
-	if ( idx < 0 ) {
+	j = stdlib_ndarray_ind( j, (arr->length)-1, arr->imode );
+	if ( j < 0 ) {
 		return NULL;
 	}
 	// Convert the index to units of bytes:
-	idx *= arr->BYTES_PER_ELEMENT;
+	j *= arr->BYTES_PER_ELEMENT;
 
 	// Determine the pointer to the first indexed element:
 	ind = (arr->data) + (arr->offset); // pointer arithmetic
@@ -361,30 +365,30 @@ uint8_t * stdlib_ndarray_iget_ptr( const struct ndarray *arr, int64_t idx ) {
 
 	// Trivial case where we have all positive strides...
 	if ( io == 1 ) {
-		return ind + idx; // pointer arithmetic
+		return ind + j; // pointer arithmetic
 	}
 	// Trivial case where we have all negative strides...
 	if ( io == -1 ) {
-		return ind - idx; // pointer arithmetic
+		return ind - j; // pointer arithmetic
 	}
 	// The approach which follows is to resolve a view index to its subscripts and then plug the subscripts into the standard formula for computing the linear index in the underlying byte array...
 	ndims = arr->ndims;
 	shape = arr->shape;
 	strides = arr->strides;
 	if ( (arr->order) == STDLIB_NDARRAY_COLUMN_MAJOR ) {
 		for ( i = 0; i < ndims; i++ ) {
-			s = idx % shape[ i ];
-			idx -= s;
-			idx /= shape[ i ];
+			s = j % shape[ i ];
+			j -= s;
+			j /= shape[ i ];
 			ind += s * strides[ i ]; // pointer arithmetic
 		}
 		return ind;
 	}
 	// Case: row-major
 	for ( i = ndims-1; i >= 0; i-- ) {
-		s = idx % shape[ i ];
-		idx -= s;
-		idx /= shape[ i ];
+		s = j % shape[ i ];
+		j -= s;
+		j /= shape[ i ];
 		ind += s * strides[ i ]; // pointer arithmetic
 	}
 	return ind;