@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); } }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); } }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); } }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); } }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); }
@Override boolean phIsPrefixValid(long[] prefix, int bitsToIgnore) { return filter == null || filter.isValid(bitsToIgnore, prefix); }
@SuppressWarnings("unchecked") private boolean readValue(long pos, long[] kdKey, Object value, PhEntry<T> result) { if (value instanceof Node) { Node sub = (Node) value; if (checker != null && !checker.isValid(sub.postLenStored()+1, kdKey)) { return false; } System.arraycopy(kdKey, 0, valTemplate, 0, kdKey.length); result.setNodeInternal(sub); } else { if (checker != null && !checker.isValid(kdKey)) { return false; } System.arraycopy(kdKey, 0, result.getKey(), 0, kdKey.length); //ensure that 'node' is set to null result.setValueInternal((T) value); } return true; }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { list.add(e); free = new PhEntry<>(new long[e.getKey().length], null); } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { list.add(e); free = new PhEntry<>(new long[e.getKey().length], null); } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
private boolean readValue(long pos, Object value, PhEntry<T> result) { if (!node.checkAndGetEntryNt(pos, value, result, valTemplate, rangeMin, rangeMax)) { return false; } //subnode ? if (value instanceof Node) { Node sub = (Node) value; //skip this for postLen>=63 if (checker != null && sub.getPostLen() < (PhTree11.DEPTH_64-1) && !checker.isValid(sub.getPostLen()+1, valTemplate)) { return false; } return true; } return checker == null || checker.isValid(result.getKey()); }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { list.add(e); free = new PhEntry<>(new long[e.getKey().length], null); } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { R e2 = mapper.map(e); list.add(e2); //resuse e unless e is added to the list. free = e == e2 ? factory.create() : e; } else { free = e; } }
@Override void phOffer(PhEntry<T> e) { if (filter == null || filter.isValid(e.getKey())) { list.add(e); free = new PhEntry<>(new long[e.getKey().length], null); } else { free = e; } }
private boolean readValue(long pos, Object value, PhEntry<T> result) { if (!node.checkAndGetEntryNt(pos, value, result, valTemplate, rangeMin, rangeMax)) { return false; } //subnode ? if (value instanceof Node) { Node sub = (Node) value; //skip this for postLen>=63 if (checker != null && sub.getPostLen() < (PhTree13.DEPTH_64-1) && !checker.isValid(sub.getPostLen()+1, valTemplate)) { return false; } return true; } return checker == null || checker.isValid(result.getKey()); }
/** * * @return False if the value does not match the range, otherwise true. */ private boolean readSub(long pos, Node<T> sub) { PhTreeHelper.applyHcPos(pos, postLen, valTemplate); sub.getInfix(valTemplate); return (checker == null || checker.isValid(sub.getPostLen()+1, valTemplate)); }