2.6 Tries and Prefix Structures

Trie variants including compressed, Patricia, ternary, XOR, suffix trees, Aho-Corasick, DAWG, HAMT, and concurrent prefix structures.

2.6 Tries and prefix structures, 45

index slug name
1 trie Trie
2 trie-insert Trie Insert
3 trie-search Trie Search
4 trie-prefix-search Prefix Search
5 trie-delete Trie Delete
6 compressed-trie Compressed Trie
7 radix-tree Radix Tree
8 patricia-trie Patricia Trie
9 crit-bit-tree Crit Bit Tree
10 ternary-search-tree Ternary Search Tree
11 binary-trie Binary Trie
12 xor-trie XOR Trie
13 suffix-trie Suffix Trie
14 suffix-tree Suffix Tree
15 suffix-array Suffix Array
16 lcp-array LCP Array
17 prefix-function Prefix Function
18 z-array Z Array
19 aho-corasick-trie Aho Corasick Trie
20 dawg Directed Acyclic Word Graph
21 minimal-dfa Minimal DFA
22 double-array-trie Double Array Trie
23 succinct-trie Succinct Trie
24 burst-trie Burst Trie
25 hat-trie HAT Trie
26 hash-array-mapped-trie Hash Array Mapped Trie
27 persistent-trie Persistent Trie
28 immutable-trie Immutable Trie
29 concurrent-trie Concurrent Trie
30 lock-free-trie Lock Free Trie
31 trie-autocomplete Autocomplete Trie
32 trie-wildcard-search Wildcard Search
33 trie-fuzzy-search Fuzzy Search
34 trie-lexicographic-iterator Lexicographic Iterator
35 trie-count-prefix Prefix Count
36 trie-frequency Frequency Trie
37 trie-top-k Top K Trie
38 trie-memory-pool Memory Pool
39 trie-array-children Array Children
40 trie-map-children Map Children
41 trie-bitset-children Bitset Children
42 trie-serialization Serialization
43 trie-compression Trie Compression
44 trie-invariant-check Trie Invariant Check
45 trie-benchmarking Trie Benchmarking