A lock-free concurrent trie (Text Retrieval) data structure

A Trie implementation

Package with functions for creation and manipulation of tries (prefix trees) with frequencies.

Package with functions for creation and manipulation of tries (prefix trees) with frequencies.

a character keyed trie using the datrie library.

Directed Acyclic Word Graph implementation for efficient string storage and retrieval

A lock-free concurrent trie (Text Retrieval) data structure.