Double-Array Trie Library

Edit Package libdatrie

This is an implementation of double-array structure for representing
trie, as proposed by Junichi Aoe.

Refresh
Refresh
Source Files
Filename Size Changed
baselibs.conf 0000000011 11 Bytes
libdatrie-0.2.12.tar.xz 0000310236 303 KB
libdatrie.changes 0000005255 5.13 KB
libdatrie.spec 0000002615 2.55 KB
Revision 21 (latest revision is 22)
Dominique Leuenberger's avatar Dominique Leuenberger (dimstar_suse) accepted request 829642 from Dirk Mueller's avatar Dirk Mueller (dirkmueller) (revision 21)
- update to 0.2.12:
  - More C90 (ANSI C) compliance.
  - Prevent some compiling conflicts with other sources.
  - Fix miscellaneous compiler warnings.
  - Prevent trimming on extremely long dictionary path names.
  - Detect iconv() error more correctly in trietool.
  - Clarify package description that search time is O(m), where m is
    key length, not O(1), while still claiming that it's independent
    of database size.
  - Fix trie_state_get_data() on a prefix key.
  - Fix reported segfault on full-range alpha map.
Comments 0
openSUSE Build Service is sponsored by