uniq

WebJar for uniq

License	MIT
GroupId	org.webjars.npm
ArtifactId	uniq
Last Version	1.0.1
Release Date	Sep 16, 2017
Type	jar
Description	uniq WebJar for uniq
Project URL	http://webjars.org
Source Code Management	https://github.com/mikolalysenko/uniq

Download uniq

Filename	Size
uniq-1.0.1.pom
uniq-1.0.1.jar	5 KB
uniq-1.0.1-sources.jar	22 bytes
uniq-1.0.1-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/uniq/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>uniq</artifactId>
    <version>1.0.1</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/uniq/
implementation 'org.webjars.npm:uniq:1.0.1'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/uniq/
implementation ("org.webjars.npm:uniq:1.0.1")

Apache Buildr

'org.webjars.npm:uniq:jar:1.0.1'

Apache Ivy

<dependency org="org.webjars.npm" name="uniq" rev="1.0.1">
  <artifact name="uniq" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='uniq', version='1.0.1')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "uniq" % "1.0.1"

Leiningen

[org.webjars.npm/uniq "1.0.1"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

uniq

Removes all duplicates from an array in place.

Usage

First install using npm:

npm install uniq

Then use it as follows:

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(array.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

Versions

Version
1.0.1 Sep 16, 2017