a simple sorted set implementation that allows a custom compare function
npm install sortedsetA fast, simple sorted set implementation for javascript (browser and node) that allows a custom compare function.
Similar API to javascript's Set.
``
npm install sortedset
The compare function is the same thing that works with Array#sort().
- If compare(a, b) < 0, a comes before b.compare(a, b) === 0
- If , a and b are considered identical in the set.compare(a, b) > 0
- If , b comes before a.
If no compare function is provided, a default ascending comparator is used.
`javascript
const SortedSet = require('sortedset')
const set = new SortedSet([2, 1, 3])
console.log(Array.from(set)) // [1, 2, 3]
`
Or pass in a custom comparator.
`javascript
const SortedSet = require('sortedset')
function reverse(a, b) {
if (a === b) return 0
return a < b ? 1 : -1
}
const set = new SortedSet([2, 1, 3], reverse)
console.log(Array.from(set)) // [3, 2, 1]
`
Constructor:
- new SortedSet()
-
-
-
Properties:
- SortedSet#size
Methods:
- SortedSet#add(item)
- Note: Returns the deleted item if it existed, else undefinedSortedSet#clear()
-
-
SortedSet is iterable:
`javascript
const set = new SortedSet([2, 1, 3])
assert([...set], [1, 2, 3])
for (const item of set) {
console.log(item)
}
``