Go efficient multilingual NLP and text segmentation; support English, Chinese, Japanese and others.

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.

Go datastructures.

Adaptive Radix Trees implemented in Go

Muxie is a modern, fast and light HTTP multiplexer for Go. Fully compatible with the http.Handler interface. Written for everyone.

Garbage collector-sensitive patricia tree for IP/CIDR tagging

⚡️ A lightning fast HTTP router

Fast specialized time-series database for IoT, real-time internet connected devices and AI analytics.

A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.

A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library.

Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

A golang http router based on trie tree.

A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.

Simple and high-performance data structures and algorithms library

Succinct Data Structure of Trie, written in Go

A prefix tree implementation in go

Golang radix tree implementation

A prefix tree (trie) implementation in go

My solved challenges and hacks (Go, Python, Java)