libdatrie: Library for double-array trie1

libdatrie is an implementation of double-array structure for representing trie. Trie is a kind of digital search tree, an efficient indexing method in which search time is independent of database size.

... part of T2, get it here

URL: https://github.com/tlwg/libdatrie

Author: Theppitak Karoonboonyanan <theppitak [at] gmail [dot] com>
Maintainer: The T2 Project <t2 [at] t2-project [dot] org>

License: LGPL
Status: Stable
Version: 0.2.14

Download: https://github.com/tlwg/libdatrie/ libdatrie-0.2.14.tar.xz

T2 source: libdatrie.cache
T2 source: libdatrie.desc

Build time (on reference hardware): 3% (relative to binutils)2

Installed size (on reference hardware): 0.64 MB, 80 files

Dependencies (build time detected): bash binutils coreutils diffutils findutils gawk grep linux-header make sed tar xz

Installed files (on reference hardware): [show]

1) This page was automatically generated from the T2 package source. Corrections, such as dead links, URL changes or typos need to be performed directly on that source.

2) Compatible with Linux From Scratch's "Standard Build Unit" (SBU).

Generated: in 0.08s — Copyright ©2004-2025 ExactCODE GmbH and others. All Rights Reserved. The T2 SDE Project is maintained
and driven by the community and sponsored by ExactCODE. This is a community maintained site. ExactCODE is not responsible for the content.