We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.
The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.
When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.
To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!
stride2offset
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
Determine the index offset which specifies the location of the first indexed value in a strided array.
bash
npm install @stdlib/strided-base-stride2offset
javascript
var stride2offset = require( '@stdlib/strided-base-stride2offset' );
#### stride2offset( N, stride )
Returns the index offset which specifies the location of the first indexed value in a strided array.
javascript
var offset = stride2offset( 10, 10 );
// returns 0
offset = stride2offset( 10, -10 );
// returns 90
javascript
var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
var stride2offset = require( '@stdlib/strided-base-stride2offset' );
var opts = {
'dtype': 'generic'
};
// Define the number of indexed elements:
var N = 100;
// Define a maximum stride length:
var maxStride = 10;
// Create an array of random integers which can accommodate the maximum stride length:
var arr = discreteUniform( N*maxStride, 0, 255, opts );
// Generate random stride lengths:
var strides = discreteUniform( 10, -maxStride, maxStride, opts );
// Resolve values in the data array for the first indexed element based on various stride lengths...
var offset;
var i;
for ( i = 0; i < strides.length; i++ ) {
offset = stride2offset( N, strides[ i ] );
console.log( 'stride = %d. arr[%d] = %d.', strides[ i ], offset, arr[ offset ] );
}
c
#include "stdlib/strided/base/stride2offset.h"
#### stdlib_strided_stride2offset( N, stride )
Returns the index offset which specifies the location of the first indexed value in a strided array.
c
#include "stdlib/strided/base/stride2offset.h"
#include <stdint.h>
int64_t offset = stdlib_strided_stride2offset( 10, -10 );
// returns 90
The function accepts the following arguments:
- N: [in] int64_t
number of indexed elements.
- stride [in] int64_t
index increment.
c
int64_t stdlib_strided_stride2offset( int64_t N, int64_t stride );
c
#include "stdlib/strided/base/stride2offset.h"
#include <stdint.h>
#include <stdio.h>
#include <inttypes.h>
int main( void ) {
// Specify the number of indexed elements:
int64_t N = 6;
// Define a stride:
int64_t stride = -2;
// Compute the offset:
int64_t offset = stdlib_strided_stride2offset( N, stride )
// Print the results:
printf( "stride: %"PRId64" => offset: %"PRId64"\n", stride, offset );
}