arr-map

Faster, node.js focused alternative to JavaScript's native array map.
JavaScript's native Array.map()
is slow, and other popular array map libraries are focused on browser compatibility. This implementation is focused on node.js usage keeping it light and fast.
Install with npm
npm i arr-map --save
Usage
var map = require('arr-map');
map(['a', 'b', 'c'], function (ele) {
return ele + ele;
});
map(['a', 'b', 'c'], function (ele, i) {
return i + ele;
});
Run benchmarks
Install dev dependencies:
node i -d && npm benchmark
Benchmarks from March 24, 2015
arr-map.js x 17,326 ops/sec ±0.74% (90 runs sampled)
array-map.js x 15,219 ops/sec ±0.72% (97 runs sampled)
native.js x 14,985 ops/sec ±0.66% (93 runs sampled)
arr-map.js x 356,497 ops/sec ±0.79% (90 runs sampled)
array-map.js x 285,448 ops/sec ±0.78% (95 runs sampled)
native.js x 284,534 ops/sec ±0.82% (97 runs sampled)
arr-map.js x 1,576,773 ops/sec ±0.72% (93 runs sampled)
array-map.js x 1,129,016 ops/sec ±0.67% (97 runs sampled)
native.js x 1,141,300 ops/sec ±0.71% (97 runs sampled)
Run tests
Install dev dependencies.
npm i -d && npm test
Contributing
Pull requests and stars are always welcome. For bugs and feature requests, please create an issue
Related
- arr-flatten: Recursively flatten an array or arrays. This is the fastest implementation of array flatten.
- arr-diff: Returns an array with only the unique values from the first array, by excluding all values from additional arrays using strict equality for comparisons.
- arr-filter: Faster alternative to javascript's native filter method.
- arr-reduce: Fast array reduce that also loops over sparse elements.
Author
Jon Schlinkert
License
Copyright (c) 2015 Jon Schlinkert
Released under the MIT license
This file was generated by verb-cli on March 24, 2015.