Hasher hasher = new Hasher(null, 0); for (PathFilter pf : pathFilters) { hasher.init(pf.pathRaw, pf.pathRaw.length);
Hasher hasher = new Hasher(null, 0); for (PathFilter pf : pathFilters) { hasher.init(pf.pathRaw, pf.pathRaw.length);
@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; }
private int chainlength(byte[] b) { Hasher h = new Hasher(b, b.length); int hash = h.hash(); final int msk = mask; int i = hash & msk; final byte[][] tbl = table; byte[] obj; int n = 0; while ((obj = tbl[i]) != null) { if (equals(obj, b, b.length)) return n; i = (i + 1) & msk; ++n; } return -1; }
private int chainlength(byte[] b) { Hasher h = new Hasher(b, b.length); int hash = h.hash(); final int msk = mask; int i = hash & msk; final byte[][] tbl = table; byte[] obj; int n = 0; while ((obj = tbl[i]) != null) { if (equals(obj, b, b.length)) return n; i = (i + 1) & msk; ++n; } return -1; }
Hasher hasher = new Hasher(null, 0); for (PathFilter pf : pathFilters) { hasher.init(pf.pathRaw, pf.pathRaw.length);
private int chainlength(byte[] b) { Hasher h = new Hasher(b, b.length); int hash = h.hash(); final int msk = mask; int i = hash & msk; final byte[][] tbl = table; byte[] obj; int n = 0; while ((obj = tbl[i]) != null) { if (equals(obj, b, b.length)) return n; i = (i + 1) & msk; ++n; } return -1; }
@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; }