Gentoo Packages

Search

Install

Install this package:

emerge -a dev-libs/libdatrie

If the package is masked, you can unmask it using the autounmask tool or standard emerge options:

autounmask dev-libs/libdatrie

Or alternatively:

emerge --autounmask-write -a dev-libs/libdatrie

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

License:

LGPL-2.1

Versions

Metadata

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.

Maintainers

• Vladimir Pavljuchenkov (spiderx@spiderx.dp.ua) - Type: person
• Proxy Maintainers (proxy-maint@gentoo.org) - Type: project

Upstream

• Remote IDs:
  • github: tlwg/libdatrie

<pkgmetadata>
	<maintainer type="person">
		<email>spiderx@spiderx.dp.ua</email>
		<name>Vladimir Pavljuchenkov</name>
	</maintainer>
	<maintainer type="project">
		<email>proxy-maint@gentoo.org</email>
		<name>Proxy Maintainers</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

• [Error] Missing md5-cache for ebuild libdatrie-9999
• [Error] Missing md5-cache for ebuild libdatrie-0.2.13

Manifest