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
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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