PruningRadixTrie - 1000x faster Radix trie for prefix search & auto-complete

• UpdatedJun 27, 2024
• C#

A generic patricia trie (also called radix tree) implemented in Go (Golang)

• UpdatedJan 22, 2025
• Go

Garbage collector-sensitive patricia tree for IP/CIDR tagging

• UpdatedSep 3, 2024
• Go

A memory-efficient patricia tree implementation written in Rust

• UpdatedJan 13, 2025
• Rust

A library of binary tree data structures (bstree, dstree, trie, crit-bit, PATRICIA) implemented in C

• UpdatedApr 12, 2021
• C

Golang radix tree implementation

• UpdatedMar 11, 2019
• Go

Instant auto suggestion and completion

• UpdatedOct 31, 2023
• Java

An example showing how to read Merkle Patricia Trie for Ethereum block or contract

• UpdatedApr 11, 2018
• JavaScript

Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys

• UpdatedJan 28, 2025
• OCaml

A model-based QuickCheck test of ptrees (Patricia trees)

• UpdatedJul 15, 2019
• OCaml

Various merkle trees

• UpdatedJan 21, 2020
• Rust

Store CIDR IP addresses (both v4 and v6) in a trie for easy lookup.

• UpdatedDec 8, 2022
• Python

Go PATRICIA tree implementation

• UpdatedMar 11, 2019
• Go

Multi Key Radix PATRICIA Fast Search - OO C++ - a C++ header file only class

• UpdatedJan 18, 2019
• C++

trees and other structures

• UpdatedDec 20, 2024
• Scheme

A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.

• UpdatedOct 8, 2019
• JavaScript

A java implementation of patricia-merkle-trie data structure

• UpdatedOct 4, 2022
• Java

Implementation of a Patricia/radix tree data structure, storing a dictionary.

• UpdatedNov 27, 2015
• C

Dash Improvements

• UpdatedJan 11, 2018
• C++

Spotify playlists organizer.

• UpdatedOct 17, 2016
• Python