openRuyi Lookout
← Packages

libdatrie

autotools

Implementation of Double-Array structure for representing trie

Current
0.2.13
Candidate
0.2.14Stale
License
LGPL-2.1-or-later

Build

TargetResultLast successful versionSucceeded at
rva23
0.2.13
rva20
0.2.13
x86_64
0.2.13

Description

datrie is an implementation of double-array structure for representing trie. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. Details of the implementation: http://linux.thai.net/~thep/datrie/datrie.html

Changelog

PR · 1

Checks
MonitorObservationLast checked
Source
Stale
Repository refresh: git fetch exited 128 (authentication)
Version
Stale
Source last confirmed at 2026-11-10T17:23:44+00:00; repository refresh overdue.
Build
Checked
GitHub
Checked
EOL
Not configured
No reliable monitor identity/configuration.
—
LicenseDiff
Not configured
No reliable monitor identity/configuration.
—
Dependencies
Not configured
No reliable monitor identity/configuration.
—
Advisory
Not configured
No reliable monitor identity/configuration.
—
Yanked
Not configured
No reliable monitor identity/configuration.
—