aboutsummaryrefslogtreecommitdiff
path: root/node_modules/array-uniq
diff options
context:
space:
mode:
Diffstat (limited to 'node_modules/array-uniq')
-rw-r--r--node_modules/array-uniq/index.js62
-rw-r--r--node_modules/array-uniq/license21
-rw-r--r--node_modules/array-uniq/package.json37
-rw-r--r--node_modules/array-uniq/readme.md30
4 files changed, 0 insertions, 150 deletions
diff --git a/node_modules/array-uniq/index.js b/node_modules/array-uniq/index.js
deleted file mode 100644
index edd09f811..000000000
--- a/node_modules/array-uniq/index.js
+++ /dev/null
@@ -1,62 +0,0 @@
-'use strict';
-
-// there's 3 implementations written in increasing order of efficiency
-
-// 1 - no Set type is defined
-function uniqNoSet(arr) {
- var ret = [];
-
- for (var i = 0; i < arr.length; i++) {
- if (ret.indexOf(arr[i]) === -1) {
- ret.push(arr[i]);
- }
- }
-
- return ret;
-}
-
-// 2 - a simple Set type is defined
-function uniqSet(arr) {
- var seen = new Set();
- return arr.filter(function (el) {
- if (!seen.has(el)) {
- seen.add(el);
- return true;
- }
-
- return false;
- });
-}
-
-// 3 - a standard Set type is defined and it has a forEach method
-function uniqSetWithForEach(arr) {
- var ret = [];
-
- (new Set(arr)).forEach(function (el) {
- ret.push(el);
- });
-
- return ret;
-}
-
-// V8 currently has a broken implementation
-// https://github.com/joyent/node/issues/8449
-function doesForEachActuallyWork() {
- var ret = false;
-
- (new Set([true])).forEach(function (el) {
- ret = el;
- });
-
- return ret === true;
-}
-
-if ('Set' in global) {
- if (typeof Set.prototype.forEach === 'function' && doesForEachActuallyWork()) {
- module.exports = uniqSetWithForEach;
- } else {
- module.exports = uniqSet;
- }
-} else {
- module.exports = uniqNoSet;
-}
diff --git a/node_modules/array-uniq/license b/node_modules/array-uniq/license
deleted file mode 100644
index 654d0bfe9..000000000
--- a/node_modules/array-uniq/license
+++ /dev/null
@@ -1,21 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
diff --git a/node_modules/array-uniq/package.json b/node_modules/array-uniq/package.json
deleted file mode 100644
index 106a3a95f..000000000
--- a/node_modules/array-uniq/package.json
+++ /dev/null
@@ -1,37 +0,0 @@
-{
- "name": "array-uniq",
- "version": "1.0.3",
- "description": "Create an array without duplicates",
- "license": "MIT",
- "repository": "sindresorhus/array-uniq",
- "author": {
- "name": "Sindre Sorhus",
- "email": "sindresorhus@gmail.com",
- "url": "sindresorhus.com"
- },
- "engines": {
- "node": ">=0.10.0"
- },
- "scripts": {
- "test": "xo && ava"
- },
- "files": [
- "index.js"
- ],
- "keywords": [
- "array",
- "arr",
- "set",
- "uniq",
- "unique",
- "es6",
- "duplicate",
- "remove"
- ],
- "devDependencies": {
- "ava": "*",
- "es6-set": "^0.1.0",
- "require-uncached": "^1.0.2",
- "xo": "*"
- }
-}
diff --git a/node_modules/array-uniq/readme.md b/node_modules/array-uniq/readme.md
deleted file mode 100644
index f0bd98c4f..000000000
--- a/node_modules/array-uniq/readme.md
+++ /dev/null
@@ -1,30 +0,0 @@
-# array-uniq [![Build Status](https://travis-ci.org/sindresorhus/array-uniq.svg?branch=master)](https://travis-ci.org/sindresorhus/array-uniq)
-
-> Create an array without duplicates
-
-It's already pretty fast, but will be much faster when [Set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set) becomes available in V8 (especially with large arrays).
-
-
-## Install
-
-```
-$ npm install --save array-uniq
-```
-
-
-## Usage
-
-```js
-const arrayUniq = require('array-uniq');
-
-arrayUniq([1, 1, 2, 3, 3]);
-//=> [1, 2, 3]
-
-arrayUniq(['foo', 'foo', 'bar', 'foo']);
-//=> ['foo', 'bar']
-```
-
-
-## License
-
-MIT © [Sindre Sorhus](https://sindresorhus.com)