sorted sets with binary search
npm install binary-sorted-setkeep a set of objects in order.
`` js
var BinarySortedSet = require('binary-sorted-set')
//pass in a compare function (same as Array#sort)
var set = BinarySortedSet(compare)
set.add(object)
set.rm(object)
//take a range as an array.
console.log(set.range({gt: obj1, lt: obj2}))
``
construct a new instance of a BinarySortedSet.
The compare function must take two set items and return
-1 if a < b, 1 if a > b and 0 if they are equal
(i.e. the same as Array#sort)
add an item to the set.
remove an item from the set.
check if an item is in the set.
take a range from within the set, using levelup style ranges.
MIT