Hasher hasher = new Hasher(null, 0); for (PathFilter pf : pathFilters) { hasher.init(pf.pathRaw, pf.pathRaw.length); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (hasher.hasNext()) prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash); hasher.getHash()); if (compare(max, pf.pathRaw) < 0) max = pf.pathRaw;
Hasher hasher = new Hasher(null, 0); for (PathFilter pf : pathFilters) { hasher.init(pf.pathRaw, pf.pathRaw.length); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (hasher.hasNext()) prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash); hasher.getHash()); if (compare(max, pf.pathRaw) < 0) max = pf.pathRaw;
@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; }
Hasher(byte[] data, int length) { init(data, length); }
Hasher(byte[] data, int length) { init(data, length); }
Hasher hasher = new Hasher(null, 0); for (PathFilter pf : pathFilters) { hasher.init(pf.pathRaw, pf.pathRaw.length); while (hasher.hasNext()) { int hash = hasher.nextHash(); if (hasher.hasNext()) prefixes.addIfAbsent(pf.pathRaw, hasher.length(), hash); hasher.getHash()); if (compare(max, pf.pathRaw) < 0) max = pf.pathRaw;
@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; }
Hasher(byte[] data, int length) { init(data, length); }