mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

regexgen - Generate regular expressions that match a set of strings

•    Javascript

---

Generates regular expressions that match a set of strings. regexgen also has a simple CLI to generate regexes using inputs from the command line.

regex trie regular expression

HanLP - 自然语言处理 中文分词 词性标注 命名实体识别 依存句法分析 关键词提取 新词发现 短语提取 自动摘要 文本分类 拼音简繁

•    Java

---

汉语言处理包

nlp natural-language-processing hanlp crf hmm trie textrank doublearraytrie neural-network chinese-word-segmentation text-mining pos-tagging dependency-parser text-classification word2vec perceptron named-entity-recognition text-clustering

ForestDB - A Fast Key-Value Storage Engine Based on Hierarchical B+-Tree Trie

•    C++

---

ForestDB is a key-value storage engine developed by Couchbase Caching and Storage Team, and its main index structure is built from Hierarchical B+-Tree based Trie, called HB+-Trie. ForestDB paper has been published in IEEE Transactions on Computers.

key-value-store key-value cache b-tree trie database

dsjslib - A library implementing several standard data structures and utilities, in JavaScript

•    Javascript

---

This is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.

algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filter

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

•    Go

---

Go efficient text segmentation; support english, chinese, japanese and other. Dictionary with double array trie (Double-Array Trie) to achieve, Sender algorithm is the shortest path based on word frequency plus dynamic programming.

segment nlp gse chinese english japanese trie

Capsule - The Capsule Hash Trie Collections Library

•    Java

---

Capsule aims to become a full-fledged (immutable) collections library for Java 8+ that is solely built around persistent tries. The library is designed for standalone use and for being embedded in domain-specific languages. Capsule still has to undergo some incubation before it can ship as a well-rounded collection library. Nevertheless, the code is stable and performance is solid.

hashmap trie immutable immutable-collections persistent-data-structure hashset performance data-structure collections map list champ

Trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching

•    Go

---

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

data-structure trie fuzzy-search string-search

wayfarer - :eyeglasses: composable trie based router

•    Javascript

---

Composable trie based router. It's faster than traditional, linear, regular expression-matching routers, although insignficantly, and scales with the number of routes. If you're looking for a client-side router check out sheet-router. If you're looking for a server router check out server-router.

router trie client simple minimal functional idempotent on event emitter react browserify browser

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

•    C++

---

Trie implementation based on the "HAT-trie: A Cache-conscious Trie-based Data Structure for Strings." (Askitis Nikolas and Sinha Ranjan, 2007) paper. For now, only the pure HAT-trie has been implemented, the hybrid version may arrive later. Details regarding the HAT-trie data structure can be found here. The library provides an efficient and compact way to store a set or a map of strings by compressing the common prefixes. It also allows to search for keys that match a prefix. Note though that the default parameters of the structure are geared toward optimizing exact searches, if you do a lot of prefix searches you may want to reduce the burst threshold through the burst_threshold method.

cpp trie hat-trie data-structures header-only c-plus-plus

java-ds-algorithms - Data Structures and Algorithms in Java

•    Java

---

Trying out various DS and Algorithms for learning purposes and to refresh my Java skills.

algorithm stack tree sort palindrome strings graph dijkstra matrix permutation hash-map trie

Buckets-Swift - Swift Collection Data Structures Library

•    Swift

---

Buckets is a complete, tested and documented collections library for swift.Carthage is a decentralized dependency manager that automates the process of adding frameworks to your application.

swift-3 queue deque stack priority-queue matrix multiset multimap bimap graph trie bitarray circular-buffer bloom-filter swift-package-manager carthage cocoapods

datrie - A JavaScript Double Array Trie

•    Javascript

---

This library implements a double array trie in JavaScript. Nested JavaScript object tries are easy to build but take up large amounts of memory and need to be serialized and deserialized when sending them over the wire. A double array trie consists of three fixed size arrays which can be efficiently stored and transmitted. This library is licensed under the three clause BSD license.

trie double-array-trie datrie dtrie

node-digital-tree - Trie data structure

•    Javascript

---

Trie data structure

trie autocomplete

level-trie - The TRIE data structure and search algorithm, on top of leveldb.

•    Javascript

---

The TRIE data structure and search algorithm, on top of leveldb.Create a new Trie that stores its data in db.

trie tree leveldb levelup level search fuzzy suffix-tree suffix radix-tree radix digital

regex-trie-cli - Create regular expression patterns based on a list of strings to be matched.

•    Javascript

---

Create regular expression patterns based on a list of strings to be matched.

regex regexp trie

router - A lightning fast HTTP router

•    Go

---

Package router provides a lightning fast HTTP router.Remember that HTTP methods are case-sensitive and uppercase by convention (RFC 7231 4.1). So you can directly use the built-in shortcuts for standard HTTP methods: Router.Get, Router.Post, Router.Put, Router.Patch and Router.Delete.

router routing fast trie http server handler performance optimization regular-expression wildcard http-router go-library

data-structures - Go datastructures.

•    Go

---

Copyright 2013, Licensed under the GPL version 2. Please reach out to me directly if you require another licensing option. I am willing to work with you. To collect many important data structures for usage in go programs. Golang's standard library lacks many useful and important structures. This library attempts to fill the gap. I have implemented data-structure's as I have needed them. If there is a missing structure or even just a missing (or incorrect) method open an issue, send a pull request, or send an email patch.

data-structures avl-tree avl immutable btree hashtable hash-tables linear-hash-table trie ternary-search-trie arraylist linked-list priority-queue exceptions error-handling tree

redis-completer - Real-time search with autocomplete via redis

•    Javascript

---

An implementation of antirez's http://gist.github.com/574044 for node.js. That prefix prevents key conflics in redis. Make sure you use a prefix for each project.

redis completer trie autocomplete

papuga - Polish dictionary with prefix-tree suggestions.

•    Javascript

---

Polish-English dictionary with predefined wordlists

trie prefix-tree data-structures react papuga