cl-interval
cl-interval copied to clipboard
Intervals and interval trees for Common Lisp
Building with SBCL 2.0.9.5-442f54894 / ASDF 3.3.1 for quicklisp dist creation. Commit id 2ffd7990e23533f200dc6b1b3521c5ca808e9c23 *cl-interval-test* fails to build with the following error: ``` Unhandled ASDF/FIND-COMPONENT:MISSING-DEPENDENCY in thread #: Component #:S-DOT...
``` ? (interval:find-all *tree* '(0 . 10)) NIL ? (interval:insert *tree* '(1 . 1)) # T ? (interval:insert *tree* '(1 . 2)) # T ? (interval:find-all *tree* '(0 . 10))...
This is definitely useful enough to be on Quicklisp!
It seems possible to append each result in constant time, rather than `n`, which should improve the time complexity of `FIND-ALL`.
The find tests are based on eyed values, which have been wrong. Write a complete tree walker to compare against.