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

Router implementation for fasthttp

adaptive radix tree (a.k.a prefix tree or compact trie)

An Adaptive Radix Tree (ART) implementation in Go

go-fasttld is a high performance effective top level domains (eTLD) extraction module.

Efficient generic compact radix tree (trie) implementation in go

Golang radix tree implementation

A simple, light and fast Web framework written in Go.

An in-memory index which finds a keyword in millions of pathnames within milliseconds.

Simorgh is a simple server/client and key/value database using radix tree

Immutable Adaptive Radix Tree implementation in go

A radix tree library implementation for Go

A fast Adaptive Radix Tree implementation

简易的 go web框架

A fast and simple key-value store using netip.Addr and netip.Prefix as keys

Adaptive Radix Tree in go

Sorted Data Structure Server - Treds is a Data Structure Server which returns data in sorted order and is the fastest prefix search server.

A simple and serializable radix tree implementation in Go/Golang.

A versioned radix tree library implementation for Go

GoLang implementation for Tries