Finger tree based interval treeset implementation.
Based largely on the original paper
Provides an efficient, persistent representation of a set of items sorted by the interval which they occupy.
Finger tree based interval treeset implementation. Based largely on the original [paper](http://www.cs.ox.ac.uk/ralf.hinze/publications/FingerTrees.pdf) Provides an efficient, persistent representation of a set of items sorted by the interval which they occupy.
Interval treeset subset selection.
Interval treeset subset selection.
cljdoc builds & hosts documentation for Clojure/Script libraries
Ctrl+k | Jump to recent docs |
← | Move to previous article |
→ | Move to next article |
Ctrl+/ | Jump to the search field |