|
Go |
7 |
A pure Go trie (prefix tree) implementation. |
Jan 28, 2023 |
|
Go |
19 |
A prefix tree (trie) implementation in go |
May 02, 2023 |
|
TypeScript |
2 |
simple trie data structure |
Sep 11, 2022 |
|
C |
5 |
Simple implementation of trie data structure in C |
Dec 02, 2022 |
|
JavaScript |
25 |
:abc: Trie data structure implementation |
Feb 16, 2023 |
|
Go |
2 |
Trie is a Compressed Prefix Tree Implementation in Golang Generic. |
Feb 09, 2023 |
|
Go |
13 |
adaptive radix tree (a.k.a prefix tree or compact trie) |
Aug 04, 2022 |
|
JavaScript |
4 |
Simple Prefix-Trie in JavaScript |
Apr 07, 2021 |
|
JavaScript |
13 |
Minimalistic trie implementation for prefix searches |
Mar 24, 2022 |
|
Emacs Lisp |
3 |
Trie data structure |
Dec 31, 2020 |
|
Rust |
2 |
A Rust implementation of generic prefix tree (trie) map with wildcard capture support |
Apr 22, 2022 |
|
Go |
69 |
A Trie (Prefix Index) implementation in golang. |
Nov 27, 2022 |
|
Rust |
38 |
Memory efficient trie (prefix tree) library based on LOUDS |
Sep 05, 2022 |
|
Ruby |
73 |
A Ruby implementation of the trie data structure. |
Mar 25, 2023 |
|
Rust |
21 |
Ergonomic trie data structure |
Sep 26, 2021 |
|
Ruby |
5 |
Ruby trie data structure. |
Jul 07, 2015 |
|
OCaml |
2 |
Trie data structure library |
Jul 29, 2023 |
|
Go |
4 |
LpmTrie is a trie data structure which implements Longest Prefix Match algorithm. MIT License |
Mar 30, 2023 |
|
Go |
4 |
Go implementation of double-array minimal-prefix trie |
Oct 18, 2019 |
|
Ruby |
2 |
Trie-like, prefix-tree data structures that maps from ordered keys to values. Ruby. |
Nov 05, 2021 |
|
PHP |
5 |
Trie data structure PHP library |
May 07, 2020 |
|
D |
3 |
Trie data structure in dlang |
Mar 29, 2020 |
|
Haskell |
2 |
More Succinct Trie Data structure |
Mar 10, 2020 |
|
PHP |
84 |
An implementation of tree data structure |
Apr 09, 2023 |
|
C++ |
3 |
Implementation of splay tree data structure |
Dec 31, 2022 |
|
JavaScript |
2 |
Implementation of radix-tree data structure |
Mar 08, 2023 |
|
D |
18 |
Implementation of the Trie data structure in D and Python. |
May 01, 2021 |
|
C# |
6 |
An implementation of a Prefix Tree/ Trie in C#, specifically for doing partial look-ups (autocomplete). |
Mar 19, 2018 |
|
JavaScript |
3 |
A trie data structure for arrays |
Jul 19, 2019 |
|
Clojure |
40 |
A memory efficient trie data structure. |
Aug 07, 2022 |
|
Go |
43 |
Golang implementation of KD tree data structure |
Jun 28, 2022 |
|
Go |
31 |
A prefix tree implementation in go |
Nov 03, 2022 |
|
TypeScript |
6 |
Fast Trie structure implementation with matching feature |
Apr 13, 2021 |
|
Go |
41 |
List data structure supporting prefix sums |
May 25, 2023 |
|
Python |
754 |
Python library implementing a trie data structure. |
Aug 04, 2022 |
|
Python |
25 |
Python library implementing a trie data structure. |
Sep 21, 2022 |
|
None |
10 |
A trie data structure implemented in OCaml |
May 23, 2022 |
|
JavaScript |
2 |
Tree data structure |
May 20, 2017 |
|
Haskell |
2 |
Haskell implementation of the radix tree data structure |
Jan 30, 2019 |
|
Dart |
2 |
Dart implementation of the Radix Tree data structure. |
Jan 31, 2023 |
|
C# |
12 |
C# implementation of a T-Tree data structure |
Aug 13, 2019 |
|
Elixir |
8 |
Elixir implementation of modified Merkle Patricia tree (trie) |
May 18, 2022 |
|
C |
2 |
Collection of Radix Tree and Hat Trie implementation |
Mar 04, 2020 |
|
Java |
4 |
Distributed prefix trie implementation to demonstrated autocomplete capabilities at a distributed level. |
Jul 19, 2021 |
|
Clojure |
3 |
A simple Clojure trie implementation |
Mar 30, 2022 |
|
HTML |
2 |
Auto Complete / Suggestion feature using Trie data structure |
Dec 16, 2022 |
|
Fennel |
2 |
Fennel and Lua library for Trie data structure |
Apr 16, 2023 |
|
Go |
40 |
Succinct Data Structure of Trie, written in Go |
Mar 28, 2023 |
|
Rust |
7 |
IP CIDR prefix Radix Tree implementation in Rust |
Mar 24, 2022 |
|
Kotlin |
57 |
Compressed Hash-Array Mapped Prefix-tree (CHAMP) Implementation |
Nov 30, 2022 |