https://github.com/willf/jsset
A set package for Javascript
https://github.com/willf/jsset
Last synced: about 1 year ago
JSON representation
A set package for Javascript
- Host: GitHub
- URL: https://github.com/willf/jsset
- Owner: willf
- Created: 2012-04-04T22:43:02.000Z (about 14 years ago)
- Default Branch: master
- Last Pushed: 2012-04-30T17:21:29.000Z (about 14 years ago)
- Last Synced: 2025-03-24T12:52:25.454Z (about 1 year ago)
- Language: JavaScript
- Homepage:
- Size: 145 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
JsSet: A small set package for Sets in Javascript
This treats Javascript arrays as sets. For the array functions, it assumes that the arrays are already sets; that is, the values are unique. The function uniq is provided to convert an array. into such an array. It also assumes that the items in the arrays have distinct string representations. In other words, consider such calls as:
uniq([new Object, new Object]) -> [Object]
or
uniq([1,"1"]) -> [1]
uniq(["1",1]) -> ["1"]
* `uniq(a)` - returns a new array, removing duplicates from a
* `intersection(a, b)` - returns a new array, the intersection of a and b
* `union(a, b)` - returns a new array, the union of a and b
* `difference(a, b)` returns a new array, the differene of a and b
* `intersection_arity(a, b)` - returns the size of the intersection of a and b, without creating a new array
* `union_arity(a, b)` - returns the size of the union of a and b, without creating a new array
* `difference_arity(a, b)` - returns the size of the difference of a and b, without creating a new array
* `jaccardIndex(a, b)` - returns the Jaccard Index of a and b
* `jaccardDistance(a, b)` - returns the Jaccard Distance of a and b
* `hammingDistance(a, b)` - returns the Hamming Distance of a and b
* `normalizedHammingDistance(a, b, size)` - returns the Hamming Distance of a and b, normalized to some size
compiled (non-minimized) file is in lib/js/jsset.js