|
|
Rust |
20 |
FST (Fast Succinct Trie) implementation in Rust |
Aug 09, 2022 |
|
|
C |
8 |
fast string matching trie library |
Sep 08, 2021 |
|
|
Haskell |
2 |
More Succinct Trie Data structure |
Mar 10, 2020 |
|
|
Go |
2 |
Succinct Trie for Go. Support Marshalling |
Mar 10, 2022 |
|
|
Python |
6 |
Trie implementation for approximate string matching. |
Feb 17, 2023 |
|
|
Java |
37 |
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching … |
Oct 02, 2022 |
|
|
Go |
40 |
Succinct Data Structure of Trie, written in Go |
Mar 28, 2023 |
|
|
TypeScript |
6 |
Fast Trie structure implementation with matching feature |
Apr 13, 2021 |
|
|
C |
21 |
C implementation of a compressed trie lookup map |
Dec 25, 2021 |
|
|
Ruby |
2 |
Fast String#camelize implementation |
Apr 06, 2022 |
|
|
Ruby |
2 |
Fast String#parameterize implementation |
Apr 06, 2022 |
|
|
C |
25 |
Fast String#underscore implementation |
Jul 31, 2022 |
|
|
Go |
2 |
Fast trie implementations. |
Jun 14, 2016 |
|
|
C++ |
126 |
Fast string implementation for graphics. |
May 24, 2023 |
|
|
Go |
22 |
The fast and flexible Trie Tree implementation in Go. |
Apr 08, 2022 |
|
|
Haskell |
12 |
Haskell through succinct, narrative, worked examples |
Mar 21, 2018 |
|
|
JavaScript |
4 |
A map-like Trie class. |
Mar 29, 2021 |
|
|
C |
73 |
Concurrent trie-hash map library |
Nov 23, 2022 |
|
|
C++ |
109 |
Fast map implementation for R |
Jul 27, 2022 |
|
|
C++ |
660 |
C++ implementation of a fast and memory efficient HAT-trie |
Aug 28, 2022 |
|
|
Go |
4 |
Xor Trie implementation |
Dec 15, 2021 |
|
|
Pascal |
2 |
Trie search implementation |
Jun 10, 2022 |
|
|
Erlang |
129 |
Erlang Trie Implementation |
Apr 17, 2023 |
|
|
Python |
2 |
Trie autocomplete implementation |
Dec 01, 2023 |
|
|
Go |
10 |
A trie-tree string-matching in golang, fatster than trie 2 regex. |
Jan 28, 2023 |
|
|
TypeScript |
3 |
🌲 The extremely fast compressed trie implementation in 2 kB gzipped. |
Jan 18, 2023 |
|
|
C |
2 |
Fast, pure C Trie dictionary |
Apr 08, 2021 |
|
|
C++ |
45 |
Fast compressed trie dictionary library |
Jul 11, 2022 |
|
|
Go |
7 |
A quickly made string keyed trie implimentation |
May 02, 2015 |
|
|
C |
9 |
An attempt to speed up smaz compression through a rudimentary trie implementation |
Jun 16, 2021 |
|
|
Rust |
2 |
A Rust implementation of generic prefix tree (trie) map with wildcard capture support |
Apr 22, 2022 |
|
|
C |
4 |
Trie C language implementation |
Jan 07, 2021 |
|
|
Clojure |
2 |
Trie implementation in Clojure |
Jan 09, 2022 |
|
|
Elixir |
2 |
Trie implementation in Elixir |
Jan 17, 2022 |
|
|
Ruby |
2 |
A basic trie implementation. |
Sep 22, 2016 |
|
|
PHP |
35 |
Trie implementation for PHP |
Nov 23, 2021 |
|
|
Dart |
3 |
trie implementation in dart |
Jun 05, 2021 |
|
|
C |
8 |
An efficient trie implementation. |
Apr 22, 2022 |
|
|
Python |
2 |
python implementation of trie |
Dec 26, 2021 |
|
|
Java |
22 |
Java port of a concurrent trie hash map implementation from the Scala collections library |
May 09, 2022 |
|
|
Java |
819 |
An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie. |
Aug 19, 2022 |
|
|
C# |
37 |
Very fast C# implementation of Aho Corasick algorithm based on Double Array Trie. |
Mar 13, 2023 |
|
|
Java |
2 |
Fast, robust and memory-savvy IP radix tree (Patricia trie) implementation in Java |
Jan 26, 2016 |
|
|
JavaScript |
19 |
A fast and lightweight Map based LRU implementation. |
Mar 25, 2020 |
|
|
C++ |
7 |
LOUDS-trie implementation example (C++) |
Jun 24, 2022 |
|
|
Go |
9 |
Missing Trie implementation for Go |
Feb 26, 2023 |
|
|
Standard ML |
3 |
Trie implementation in Standard ML. |
May 14, 2022 |
|
|
Clojure |
3 |
A simple Clojure trie implementation |
Mar 30, 2022 |
|
|
JavaScript |
25 |
:abc: Trie data structure implementation |
Feb 16, 2023 |
|
|
Rust |
135 |
Fast generic radix trie implemented in Rust |
Aug 07, 2022 |