int hash = hasher.nextHash(); if (hasher.hasNext()) prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash);
int hash = hasher.nextHash(); if (hasher.hasNext()) prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash);
@Override public boolean include(TreeWalk walker) { byte[] rp = walker.getRawPath(); Hasher hasher = new Hasher(rp, walker.getPathLength()); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (fullpaths.contains(rp, hasher.length(), hash)) return true; if (!hasher.hasNext() && walker.isSubtree() && prefixes.contains(rp, hasher.length(), hash)) return true; } final int cmp = walker.isPathPrefix(max, max.length); if (cmp > 0) throw StopWalkException.INSTANCE; return false; }
@Override public boolean include(final TreeWalk walker) { byte[] rp = walker.getRawPath(); Hasher hasher = new Hasher(rp, walker.getPathLength()); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (fullpaths.contains(rp, hasher.length(), hash)) return true; if (!hasher.hasNext() && walker.isSubtree() && prefixes.contains(rp, hasher.length(), hash)) return true; } final int cmp = walker.isPathPrefix(max, max.length); if (cmp > 0) throw StopWalkException.INSTANCE; return false; }
int hash = hasher.nextHash(); if (hasher.hasNext()) prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash);
@Override public boolean include(TreeWalk walker) { byte[] rp = walker.getRawPath(); Hasher hasher = new Hasher(rp, walker.getPathLength()); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (fullpaths.contains(rp, hasher.length(), hash)) return true; if (!hasher.hasNext() && walker.isSubtree() && prefixes.contains(rp, hasher.length(), hash)) return true; } final int cmp = walker.isPathPrefix(max, max.length); if (cmp > 0) throw StopWalkException.INSTANCE; return false; }