code: public void calculateMaxFindSkip()
      {
          Map<DFAState<T>,Integer> indexOf = new NumMap<>();
          Map<DFAState<T>,Integer> skip = new NumMap<>();
          Deque<DFAState<T>> stack = new ArrayDeque<>();
          findSkip(root, indexOf, stack, new LinkedList());
          root.setAcceptStartLength(1);
      }
docs: Calculates how many characters we can skip after failed find operation
  @return