A collection of powerful data structures

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

Go efficient text segmentation @vcaesar; support english, chinese, japanese and other. Go 语言高性能分词

Universal database layer for the client, server & mobile devices. It's like Lego for databases.

Python module (C extension and plain python) implementing Aho-Corasick algorithm

C++ implementation of a fast and memory efficient HAT-trie

🔑A high performance Key/Value store written in Go with a predictable read/write performance and high throughput. Uses a Bitcask on-disk layout (LSM+WAL) similar to Riak.

The Capsule Hash Trie Collections Library

Go datastructures.

leetcode.com , algoexpert.io solutions in python and swift

This is an implementation of the modified merkle patricia tree as specified in the Ethereum's yellow paper.

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

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

High-quality LeetCode solutions

A collection of common algorithms and data structures.

PATRICIA, Double Array, LOUDS Trie implementations for Java

Data Structures and Algorithms in Java

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)

Data-Structures using C++.

.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

Swift Collection Data Structures Library

Ciri is an Ethereum implementation written in Ruby.

Fast generic radix trie implemented in Rust

Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition

Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

Fastest Trie structure (Linux & Windows)

Java autocomplete library.