Gecko [ unitednationsplay.com ]

Linux unitednationsplay.com 3.10.0-1160.45.1.el7.x86_64 #1 SMP Wed Oct 13 17:20:51 UTC 2021 x86_64
nginx/1.20.1
Server IP : 188.130.139.92 & Your IP : 3.141.164.253
Domains : Cant Read [ /etc/named.conf ]
User : web

Name	Size	Permission	Date
test	[ DIR ]	drwxr-xr-x	2021-02-04 21:24
.npmignore	98 B	-rw-r--r--	2013-03-24 14:25
LICENSE	1.06 KB	-rw-r--r--	2013-05-14 00:14
README.md	1.19 KB	-rw-r--r--	2013-03-31 02:52
package.json	1.42 KB	-rw-r--r--	2021-02-04 21:24
uniq.js	910 B	-rw-r--r--	2014-05-25 21:16

Rename

uniq
====
Removes all duplicates from an array in place.

Usage
=====
First install using npm:

npm install uniq
    
Then use it as follows:

```javascript

var arr = [1, 1, 2, 2, 3, 5]

require("uniq")(arr)
console.log(arr)

//Prints:
//
//  1,2,3,5
//
```

## `require("uniq")(array[, compare, sorted])`
Removes all duplicates from a sorted array in place.

* `array` is the array to remove items from
* `compare` is an optional comparison function that returns 0 when two items are equal, and something non-zero when they are different.  If unspecified, then the default equals will be used.
* `sorted` if true, then assume array is already sorted

**Returns:** A reference to `array`

**Time Complexity:** `O(array.length * log(arra.length))` or `O(array.length)` if `sorted`

## Why use this instead of underscore.uniq[ue]?
A few reasons:

* This library updates the array in place without making an extra copy (and so it is faster for large arrays)
* It also accepts a custom comparison function so you can remove duplicates from arrays containing object
* It is more modular in the sense that it doesn't come with a bazillion other utility grab bag functions.

# Credits
(c) 2013 Mikola Lysenko. MIT License