[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc_2008Q1 2008-03-17T12:52:00Z 2008-03-17T12:52:00Z obache obache 2008-03-17T12:52:00Z urn:sha1:de369eb5f63f266f45dcaa4947a2111a7f9cb3ce 2008-03-16T15:38:08Z obache obache 2008-03-16T15:38:08Z urn:sha1:924ffd967a45a3a8ac3f6fc31b0fa8dd2a62fa06 2008-02-11T02:11:24Z obache obache 2008-02-11T02:11:24Z urn:sha1:529f2e22472ec87a8cfbe14ed5d2e50211e5ccd9 datrie 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 with O(1) time complexity for searching. 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.