private int commonPrefix(byte[] sequence, int start, int len) {
    // Empty root state case.
    final int max = Math.min(len, activePathLen);
    int i;
    for (i = 0; i < max; i++) {
      final int lastArc = nextArcOffset[i] - ARC_SIZE;
      if (sequence[start++] != getArcLabel(lastArc)) {
        break;
      }
    }

    return i;
  }
private int commonPrefix ( byte [ ] sequence , int start , int len ) { final int max = Math . min ( len , activePathLen ) ; int i ; for ( i = 0 ; i < max ; i ++ ) { final int lastArc = nextArcOffset [ i ] - ARC_SIZE ; if ( sequence [ start ++ ] != getArcLabel ( lastArc ) ) { break ; } } return i ; }
@return The number of common prefix characters with the previous sequence.