libdatrie ☆

« Back to VersTracker

Description:
Double-Array Trie Library

Type: Formula | Latest Version: 0.2.14@0 | Tracked Since: Nov 25, 2025

Links: Homepage | formulae.brew.sh

Category: Developer tools

Tags: trie data-structure c-library text-processing algorithm

Install: brew install libdatrie

About:
libdatrie is a C library implementing a double-array trie data structure for efficient string mapping and dictionary storage. It provides fast lookups, insertions, and deletions while maintaining low memory overhead. The library is designed for high-performance text processing applications requiring prefix-based string searches.

Key Features:

Double-array trie implementation for optimal space-time tradeoff
Fast O(k) lookup time where k is the key length
Memory-efficient structure suitable for large datasets
C library with minimal dependencies
Supports dynamic insertion and deletion

Use Cases:

Implementing autocomplete and suggestion systems
Building efficient dictionary lookups for spell checkers
Creating routing tables for network applications
Text tokenization and prefix matching in NLP pipelines

Alternatives:

marisa-trie – Marisa-trie uses a more compact representation but is more complex to integrate
radix-tree – Radix trees offer simpler implementation but higher memory usage for sparse datasets

Version History

Detected	Version	Rev	Change	Commit
Nov 25, 2025 11:14am		0	VERSION_BUMP	214a083e