dev-libs/libdatrie (gentoo-zh)

Search

Package Information

Description:
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. Trie is a kind of digital search tree, an efficient indexing method in which search time is independent of database size. It only takes O(m) search time, where m is the length of the search string. 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.
Homepage:
https://github.com/tlwg/libdatrie

Versions

Version EAPI Keywords Slot
0.2.14 7 ~amd64 ~arm ~arm64 ~riscv ~x86 0

Metadata

Description

Maintainers

Upstream

Raw Metadata XML
<pkgmetadata>
	<maintainer type="person">
		<email>vowstar@gmail.com</email>
		<name>Huang Rui</name>
	</maintainer>
	<longdescription lang="en">
	This is an implementation of double-array structure for representing trie, 
	as proposed by Junichi Aoe.
	Trie is a kind of digital search tree, an efficient indexing method in which
	search time is independent of database size. It only takes O(m) search time,
	where m is the length of the search string. 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.
	</longdescription>
	<upstream>
		<remote-id type="github">tlwg/libdatrie</remote-id>
	</upstream>
</pkgmetadata>

Lint Warnings

Manifest

Type File Size Versions
DIST libdatrie-0.2.14.tar.gz 118164 bytes 0.2.14
Unmatched Entries
Type File Size