code: public void parseLongestText(String text, AhoCorasickDoubleArrayTrie.IHit<V> processor)
      {
          int length = text.length();
          for (int i = 0; i < length; ++i)
          {
              BaseNode<V> state = transition(text.charAt(i));
              if (state != null)
              {
                  int to = i + 1;
                  int end = to;
                  V value = state.getValue();
                  for (; to < length; ++to)
                  {
                      state = state.transition(text.charAt(to));
                      if (state == null) break;
                      if (state.getValue() != null)
                      {
                          value = state.getValue();
                          end = to + 1;
                      }
                  }
                  if (value != null)
                  {
                      processor.hit(i, end, value);
                      i = end - 1;
                  }
              }
          }
      }
docs: 最长匹配
  
  @param text      文本
  @param processor 处理器