public int countMatches(TreeString str, int startMatch, int endMatch) { int ei = start; int mi = startMatch; int eend = end(); for (; ei < eend && mi < endMatch; ei++, mi++) { if (!string.matches(ei, str, mi)) { return ei - start; } } return ei - start; }