1 Repo
Awesome GitHub RepositoriesInteger Tries
Trie structures that treat integers as sequences of bits or words for range-like queries.
Distinguishing note: Candidates focus on number-to-word translation or matrix structures, not algorithmic trie indexing for integers
Explore 1 awesome GitHub repository matching data & databases · Integer Tries. Refine with filters or upvote what's useful.
Awesome Integer Tries GitHub Repositories
Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
- workiva/go-datastructures
Workiva/go-datastructures
7,901Auf GitHub ansehengo-datastructures is a collection of thread-safe and lock-free data structures designed for high-performance concurrent applications in Go. It provides a modular library of specialized algorithmic toolsets, including a lock-free collection library and an immutable data structure library. The project distinguishes itself through a suite of persistent AVL trees and hash array mapped tries that use branch-copying to preserve previous versions. It also implements non-blocking hash maps, queues, and tries that enable linearizable snapshots and concurrent updates without the use of mutual exclusion
Provides tries that treat integers as words to execute rapid predecessor and successor queries.
Go
