69 Open source projects that are alternatives of or similar to triebeard

Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

⚡️ Lightning fast URL routing in Python (trie router)

Garbage collector-sensitive patricia tree for IP/CIDR tagging

Data-Structures using C++.

코딩테스트 대비 문제집(Baekjoon Online Judge)

Performance shootout of various trie implementations

An idiomatic and fast QP-trie implementation in pure Rust.

A minimal and powerful trie based url path router (or mux) for Go.

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

⚡️ A lightning fast HTTP router

.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.

DAWG String Dictionary in C#

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

Java autocomplete library.

Fast IP lookup table for IPv4/IPv6 prefixes

neato compression for key-value data

Fast compressed trie dictionary library

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

A prefix tree (trie) implementation in go

🔑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.

High-quality LeetCode solutions

The Capsule Hash Trie Collections Library

A trie (prefix tree) data structure implementation in C#.

Project is in active development and has been moved to the EthereumJS VM monorepo.

A collection of common algorithms and data structures implemented in java, c++, and python.

Data Structures and Algorithms in Java

Create and modify trie prefix structures and extract word lists including prefixes, anagrams and sub-anagrams

Ergonomic trie data structure

Go efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词

My solutions for random coding challenges 💪

Swift Collection Data Structures Library

My take on an efficient implementation of a Trie in Javascript

A C++ library providing fast language model queries in compressed space.

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

A fast and space efficient Radix tree in Java

A golang http router based on trie tree.

Concurrent trie-hash map library

Erasure coding (Reed–Solomon coding) in Go

libgenerics is a minimalistic and generic library for C basic data structures.

A collection of powerful data structures

Minimalistic trie implementation for autosuggest and autocomplete components

Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks

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

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

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

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

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

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

Go datastructures.

Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.

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

Template Library of Data Structures in C++17

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

A collection of common algorithms and data structures implemented in Java.

PATRICIA, Double Array, LOUDS Trie implementations for Java

Go bindings for radix tree library for fast subnet (IPv4 and IPv6) lookups

A collection of powerful data structures

Fastest Trie structure (Linux & Windows)

Python package for lexicon; Trie and DAWG implementation.

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