generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.
-
Updated
Jan 6, 2024 - Go
#
fast-ip-lookup
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the fast-ip-lookup topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the fast-ip-lookup topic, visit your repo's landing page and select "manage topics."