1*4882a593Smuzhiyunconfig BR2_PACKAGE_DAWGDIC 2*4882a593Smuzhiyun bool "dawgdic" 3*4882a593Smuzhiyun depends on BR2_INSTALL_LIBSTDCPP 4*4882a593Smuzhiyun # needs std::strtoll 5*4882a593Smuzhiyun depends on BR2_TOOLCHAIN_GCC_AT_LEAST_4_6 6*4882a593Smuzhiyun help 7*4882a593Smuzhiyun dawgdic provides a library for building and accessing 8*4882a593Smuzhiyun dictionaries implemented with directed acyclic word graphs 9*4882a593Smuzhiyun (DAWG). A dawg is constructed by minimizing a trie as a 10*4882a593Smuzhiyun deterministic finite automaton (DFA), and thus the dawg has 11*4882a593Smuzhiyun an advantage in memory usage. In addition, dawgdic uses a 12*4882a593Smuzhiyun double-array as a base data structure, so its retrieval 13*4882a593Smuzhiyun speed is as fast as that of Darts, a library for building 14*4882a593Smuzhiyun and accessing double-array tries. 15*4882a593Smuzhiyun 16*4882a593Smuzhiyun https://github.com/stil/dawgdic 17*4882a593Smuzhiyun 18*4882a593Smuzhiyuncomment "dawgdic needs a toolchain w/ C++, gcc >= 4.6" 19*4882a593Smuzhiyun depends on !BR2_INSTALL_LIBSTDCPP || !BR2_TOOLCHAIN_GCC_AT_LEAST_4_6 20