int nextEntry(byte[] p, int pLen, int nextIdx) { while (nextIdx < entryCnt) { final DirCacheEntry next = sortedEntries[nextIdx]; if (!DirCacheTree.peq(p, next.path, pLen)) break; nextIdx++; } return nextIdx; }
private static boolean inDir(DirCacheEntry e, byte[] path, int pLen) { return e.path.length > pLen && e.path[pLen] == '/' && peq(path, e.path, pLen); }
int nextEntry(byte[] p, int pLen, int nextIdx) { while (nextIdx < entryCnt) { final DirCacheEntry next = sortedEntries[nextIdx]; if (!DirCacheTree.peq(p, next.path, pLen)) break; nextIdx++; } return nextIdx; }
int nextEntry(final byte[] p, final int pLen, int nextIdx) { while (nextIdx < entryCnt) { final DirCacheEntry next = sortedEntries[nextIdx]; if (!DirCacheTree.peq(p, next.path, pLen)) break; nextIdx++; } return nextIdx; }
private static boolean inDir(DirCacheEntry e, byte[] path, int pLen) { return e.path.length > pLen && e.path[pLen] == '/' && peq(path, e.path, pLen); }
private static boolean inDir(DirCacheEntry e, byte[] path, int pLen) { return e.path.length > pLen && e.path[pLen] == '/' && peq(path, e.path, pLen); }
while (cIdx < cCnt) { final byte[] currPath = cache[cIdx].path; if (pathOff > 0 && !peq(firstPath, currPath, pathOff)) {
while (cIdx < cCnt) { final byte[] currPath = cache[cIdx].path; if (pathOff > 0 && !peq(firstPath, currPath, pathOff)) {
while (cIdx < cCnt) { final byte[] currPath = cache[cIdx].path; if (pathOff > 0 && !peq(firstPath, currPath, pathOff)) {