public int nextEntry(byte[] p, int pLen, int nextIdx) { while (nextIdx < _entryCnt) { DirCacheEntry next = _sortedEntries[nextIdx]; if (!DirCacheTree.peq(p, next.Path, pLen)) break; nextIdx++; } return nextIdx; }