mirrors/guru
1
0
Fork 0
mirror of https://github.com/gentoo-mirror/guru.git synced 2026-07-19 03:53:22 -04:00
Code Issues Packages Projects Releases Wiki Activity

dev-libs/libdatrie: add 0.2.14, drop 0.2.13-r2

Browse Source 
Closes: https://bugs.gentoo.org/932264
Signed-off-by: Huang Rui <vowstar@gmail.com>
This commit is contained in:
Huang Rui
2025-12-13 14:30:02 +08:00
parent bdb8dbca21
commit 84526dd48f
4 changed files with 11 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
dev-libs/libdatrie/metadata.xml
View File

@@ -9,7 +9,7 @@
<remote-id type="github">tlwg/libdatrie</remote-id>
</upstream>
<longdescription lang="en">
This is an implementation of double-array structure for representing trie,
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,
@@ -18,4 +18,11 @@
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
</longdescription>
<longdescription lang="zh">
这是由 Junichi Aoe 提出的用于表示 Trie（字典树）的双数组结构实现。
Trie 是一种数字搜索树，是一种高效的索引方法，其搜索时间与数据库大小无关。
它只需要 O(m) 的搜索时间，其中 m 是搜索字符串的长度。与哈希一样高效的同时，
Trie 还提供了增量匹配和键拼写操作的灵活性。这使其非常适合用于词法分析器和
拼写词典。
</longdescription>
</pkgmetadata>