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
#
treaps
Here are 3 public repositories matching this topic...
Go package ordered sets implemented with balanced binary search trees
-
Updated
Jun 14, 2024 - Go
A REST API application to simulate a p2p network with a tree topology.
-
Updated
Jul 21, 2022 - Go
Improve this page
Add a description, image, and links to the treaps topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the treaps topic, visit your repo's landing page and select "manage topics."