LpmTrie is a trie data structure which implements Longest Prefix Match algorithm.
It's thread-safe and high performance with atomic operations.
It's inspired by: https://github.com/torvalds/linux/blob/master/kernel/bpf/lpm_trie.c
-
Notifications
You must be signed in to change notification settings - Fork 0
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
License
Asphaltt/lpmtrie
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published