search

hankcs / AhoCorasickDoubleArrayTrie

An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.
http://www.hankcs.com/program/algorithm/aho-corasick-double-array-trie.html
950 stars 290 forks source link

能否提供一个最长前缀匹配方法？ #35

Open yangxudong opened 4 years ago

yangxudong commented 4 years ago

能否加一个longestPrefixMatch方法？功能就是把findFirst()的返回结果改为最长匹配的子串