https://github.com/asphaltt/lpmtrie
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
https://github.com/asphaltt/lpmtrie
golang longest-prefix-match lpm-trie
Last synced: about 1 month ago
JSON representation
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License
- Host: GitHub
- URL: https://github.com/asphaltt/lpmtrie
- Owner: Asphaltt
- License: mit
- Created: 2022-02-05T15:19:41.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-02-05T15:32:00.000Z (over 3 years ago)
- Last Synced: 2024-06-20T09:18:46.045Z (12 months ago)
- Topics: golang, longest-prefix-match, lpm-trie
- Language: Go
- Homepage:
- Size: 4.88 KB
- Stars: 4
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# lpmtrie
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
## License
[MIT License](./LICENSE)