generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.
Primary LanguageGoMIT LicenseMIT