Comparing version 2.0.0 to 2.0.1
/*! | ||
* arr-map <https://github.com/jonschlinkert/arr-map> | ||
* | ||
* Copyright (c) 2015, Jon Schlinkert. | ||
* Licensed under the MIT License. | ||
* Copyright (c) 2015, 2017, Jon Schlinkert. | ||
* Released under the MIT License. | ||
*/ | ||
@@ -7,0 +7,0 @@ |
{ | ||
"name": "arr-map", | ||
"description": "Faster, node.js focused alternative to JavaScript's native array map.", | ||
"version": "2.0.0", | ||
"version": "2.0.1", | ||
"homepage": "https://github.com/jonschlinkert/arr-map", | ||
"author": { | ||
"name": "Jon Schlinkert", | ||
"url": "https://github.com/jonschlinkert" | ||
}, | ||
"repository": { | ||
"type": "git", | ||
"url": "git://github.com/jonschlinkert/arr-map.git" | ||
}, | ||
"author": "Jon Schlinkert (https://github.com/jonschlinkert)", | ||
"repository": "jonschlinkert/arr-map", | ||
"bugs": { | ||
"url": "https://github.com/jonschlinkert/arr-map/issues" | ||
}, | ||
"license": { | ||
"type": "MIT", | ||
"url": "https://github.com/jonschlinkert/arr-map/blob/master/LICENSE" | ||
}, | ||
"license": "MIT", | ||
"files": [ | ||
@@ -33,17 +24,39 @@ "index.js" | ||
"dependencies": { | ||
"make-iterator": "^0.1.1" | ||
"make-iterator": "^1.0.0" | ||
}, | ||
"devDependencies": { | ||
"array-map": "0.0.0", | ||
"benchmarked": "^0.1.3", | ||
"braces": "^1.6.0", | ||
"chalk": "^0.5.1", | ||
"glob": "^4.3.5", | ||
"micromatch": "^1.2.2", | ||
"mocha": "*" | ||
"array-map": "^0.0.0", | ||
"benchmarked": "^0.2.5", | ||
"braces": "^2.0.3", | ||
"chalk": "^1.1.3", | ||
"glob": "^7.1.1", | ||
"gulp-format-md": "^0.1.11", | ||
"micromatch": "^2.3.11" | ||
}, | ||
"keywords": [ | ||
"arr", | ||
"array", | ||
"map" | ||
] | ||
], | ||
"verb": { | ||
"toc": false, | ||
"layout": "default", | ||
"tasks": [ | ||
"readme" | ||
], | ||
"related": { | ||
"list": [ | ||
"arr-diff", | ||
"arr-filter", | ||
"arr-flatten", | ||
"arr-reduce" | ||
] | ||
}, | ||
"plugins": [ | ||
"gulp-format-md" | ||
], | ||
"lint": { | ||
"reflinks": true | ||
} | ||
} | ||
} |
@@ -1,13 +0,17 @@ | ||
# arr-map [](http://badge.fury.io/js/arr-map) [](https://travis-ci.org/jonschlinkert/arr-map) | ||
# arr-map [](https://www.npmjs.com/package/arr-map) [](https://npmjs.org/package/arr-map) [](https://npmjs.org/package/arr-map) [](https://travis-ci.org/jonschlinkert/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 | ||
## Install with [npm](npmjs.org) | ||
Install with [npm](https://www.npmjs.com/): | ||
```bash | ||
npm i arr-map --save | ||
```sh | ||
$ npm install --save arr-map | ||
``` | ||
## Why use this? | ||
JavaScript's native `Array.map()` is slow, and other popular array map libraries are focused on browser compatibility, which makes them bloated or less than idea for non-browser usage. This implementation is focused on node.js usage keeping it light and fast. | ||
## Usage | ||
@@ -18,3 +22,3 @@ | ||
map(['a', 'b', 'c'], function (ele) { | ||
map(['a', 'b', 'c'], function(ele) { | ||
return ele + ele; | ||
@@ -24,3 +28,3 @@ }); | ||
map(['a', 'b', 'c'], function (ele, i) { | ||
map(['a', 'b', 'c'], function(ele, i) { | ||
return i + ele; | ||
@@ -31,58 +35,47 @@ }); | ||
## Run benchmarks | ||
## About | ||
Install dev dependencies: | ||
### Related projects | ||
```bash | ||
node i -d && npm benchmark | ||
``` | ||
* [arr-diff](https://www.npmjs.com/package/arr-diff): Returns an array with only the unique values from the first array, by excluding all… [more](https://github.com/jonschlinkert/arr-diff) | [homepage](https://github.com/jonschlinkert/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](https://www.npmjs.com/package/arr-filter): Faster alternative to javascript's native filter method. | [homepage](https://github.com/jonschlinkert/arr-filter "Faster alternative to javascript's native filter method.") | ||
* [arr-flatten](https://www.npmjs.com/package/arr-flatten): Recursively flatten an array or arrays. This is the fastest implementation of array flatten. | [homepage](https://github.com/jonschlinkert/arr-flatten "Recursively flatten an array or arrays. This is the fastest implementation of array flatten.") | ||
* [arr-reduce](https://www.npmjs.com/package/arr-reduce): Fast array reduce that also loops over sparse elements. | [homepage](https://github.com/jonschlinkert/arr-reduce "Fast array reduce that also loops over sparse elements.") | ||
[Benchmarks](./benchmark) from March 24, 2015 | ||
### Contributing | ||
```bash | ||
#1: long.js | ||
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) | ||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new). | ||
#2: med.js | ||
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) | ||
### Building docs | ||
#3: short.js | ||
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) | ||
``` | ||
_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_ | ||
## Run tests | ||
Install dev dependencies. | ||
To generate the readme, run the following command: | ||
```bash | ||
npm i -d && npm test | ||
```sh | ||
$ npm install -g verbose/verb#dev verb-generate-readme && verb | ||
``` | ||
## Contributing | ||
Pull requests and stars are always welcome. For bugs and feature requests, [please create an issue](https://github.com/jonschlinkert/arr-map/issues) | ||
### Running tests | ||
## Related | ||
* [arr-flatten](https://github.com/jonschlinkert/arr-flatten): Recursively flatten an array or arrays. This is the fastest implementation of array flatten. | ||
* [arr-diff](https://github.com/jonschlinkert/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](https://github.com/jonschlinkert/arr-filter): Faster alternative to javascript's native filter method. | ||
* [arr-reduce](https://github.com/jonschlinkert/arr-reduce): Fast array reduce that also loops over sparse elements. | ||
Running and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command: | ||
## Author | ||
```sh | ||
$ npm install && npm test | ||
``` | ||
### Author | ||
**Jon Schlinkert** | ||
+ [github/jonschlinkert](https://github.com/jonschlinkert) | ||
+ [twitter/jonschlinkert](http://twitter.com/jonschlinkert) | ||
## License | ||
Copyright (c) 2015 Jon Schlinkert | ||
Released under the MIT license | ||
* [github/jonschlinkert](https://github.com/jonschlinkert) | ||
* [twitter/jonschlinkert](https://twitter.com/jonschlinkert) | ||
### License | ||
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert). | ||
Released under the [MIT License](LICENSE). | ||
*** | ||
_This file was generated by [verb-cli](https://github.com/assemble/verb-cli) on March 24, 2015._ | ||
_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.4.2, on February 26, 2017._ |
Sorry, the diff of this file is not supported yet
No repository
Supply chain riskPackage does not have a linked source code repository. Without this field, a package will have no reference to the location of the source code use to generate the package.
Found 1 instance in 1 package
6287
78
1
+ Addedkind-of@6.0.3(transitive)
+ Addedmake-iterator@1.0.1(transitive)
- Removedfor-in@1.0.2(transitive)
- Removedfor-own@0.1.5(transitive)
- Removedmake-iterator@0.1.1(transitive)
Updatedmake-iterator@^1.0.0