@Test public void checkStatesCount() { final SuffixTree st = checkAllSuffixes("cocoa$"); assertEquals(9, st.getStatesCount()); }
public final int getStatesCount() { return this.states.size() - 1; }
SuffixTree { public final int getStatesCount() { return this.states.size() - 1; } }
SuffixTree { public final int getStatesCount() { return this.states.size() - 1; } SuffixTree(
      Sequence sequence,
      IStateCallback newStateCallback,
      final IProgressCallback progressCallback); }
SuffixTree { public final int getStatesCount() { return this.states.size() - 1; } SuffixTree(
      Sequence sequence,
      IStateCallback newStateCallback,
      final IProgressCallback progressCallback); final int getTransitionsCount(); final int getStatesCount(); boolean containsSuffix(Sequence seq); final void visit(final IVisitor visitor); final void visitState(final int state, final IVisitor visitor); int getRootState(); final boolean isLeaf(int state); final int firstEdge(int state); final int nextEdge(int edge); final int findEdge(int state, int symbol); int getToState(int edge); int getStartIndex(int edge); int getEndIndex(int edge); }
SuffixTree { public final int getStatesCount() { return this.states.size() - 1; } SuffixTree(
      Sequence sequence,
      IStateCallback newStateCallback,
      final IProgressCallback progressCallback); final int getTransitionsCount(); final int getStatesCount(); boolean containsSuffix(Sequence seq); final void visit(final IVisitor visitor); final void visitState(final int state, final IVisitor visitor); int getRootState(); final boolean isLeaf(int state); final int firstEdge(int state); final int nextEdge(int edge); final int findEdge(int state, int symbol); int getToState(int edge); int getStartIndex(int edge); int getEndIndex(int edge); static final int NO_EDGE; }