Ecosyste.ms: Repos
An open API service providing repository metadata for many open source software ecosystems.
GitHub topics: longest-prefix-match
gaissmai/bart
The Balanced Routing Table is an adaptation of D. Knuth's ART algorithm combined with popcount level compression and backtracking. It is somewhat slower than ART, but requires considerably less memory.
Language: Go - Size: 3.06 MB - Last synced: 1 day ago - Pushed: 2 days ago - Stars: 15 - Forks: 3
cookiengineer/lpm
:rocket: LPM Tries and Hash Set Maps for Go
Size: 21.5 KB - Last synced: 29 days ago - Pushed: 3 months ago - Stars: 0 - Forks: 0
gaissmai/cidrtree
fast IP to CIDR lookup, longest prefix match in golang
Language: Go - Size: 2.59 MB - Last synced: about 1 month ago - Pushed: 4 months ago - Stars: 7 - Forks: 0
piaodazhu/ComponentTrie
🥂 A simple component trie that enables component-granularity longest prefix matching for strings with delimiters.
Language: C - Size: 35.2 KB - Last synced: 12 months ago - Pushed: 12 months ago - Stars: 0 - Forks: 0
Asphaltt/lpmtrie
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
Language: Go - Size: 4.88 KB - Last synced: about 1 month ago - Pushed: over 2 years ago - Stars: 4 - Forks: 0
