/** {@inheritDoc} */ @Override public boolean removex(int hash, byte[] keyBytes, IgniteBiPredicate<Long, Integer> p) { return segmentFor(hash).removex(hash, keyBytes, p); }
/** {@inheritDoc} */ @Override public boolean put(int hash, byte[] keyBytes, byte[] valBytes) { return segmentFor(hash).put(hash, keyBytes, valBytes); }
/** {@inheritDoc} */ @Override public void enableEviction(int hash, byte[] keyBytes) { assert lru != null; segmentFor(hash).enableEviction(hash, keyBytes); }
/** {@inheritDoc} */ @Override public byte[] get(int hash, byte[] keyBytes) { return segmentFor(hash).get(hash, keyBytes); }
/** {@inheritDoc} */ @Override public boolean contains(int hash, byte[] keyBytes) { return segmentFor(hash).contains(hash, keyBytes); }
/** {@inheritDoc} */ @Override public boolean removex(int hash, byte[] keyBytes) { return segmentFor(hash).removex(hash, keyBytes); }
/** {@inheritDoc} */ @Nullable @Override public IgniteBiTuple<Long, Integer> valuePointer(int hash, byte[] keyBytes) { return segmentFor(hash).valuePointer(hash, keyBytes); }
/** {@inheritDoc} */ @Override public byte[] remove(int hash, byte[] keyBytes) { return segmentFor(hash).remove(hash, keyBytes); }
/** {@inheritDoc} */ @Override public void insert(int hash, byte[] keyBytes, byte[] valBytes) { segmentFor(hash).insert(hash, keyBytes, valBytes); }
/** * Frees space by polling entries from LRU queue. * * @param order Queue stripe order. * @param qAddr Queue node address. * @return Released size. */ int freeSpace(short order, long qAddr) { if (lru == null) return 0; int hash = lru.hash(order, qAddr); return segmentFor(hash).freeSpace(hash, order, qAddr); }
/** {@inheritDoc} */ @Override public void enableEviction(int hash, byte[] keyBytes) { assert lru != null; segmentFor(hash).enableEviction(hash, keyBytes); }
/** {@inheritDoc} */ @Nullable @Override public IgniteBiTuple<Long, Integer> valuePointer(int hash, byte[] keyBytes) { return segmentFor(hash).valuePointer(hash, keyBytes); }
/** {@inheritDoc} */ @Override public boolean removex(int hash, byte[] keyBytes, IgniteBiPredicate<Long, Integer> p) { return segmentFor(hash).removex(hash, keyBytes, p); }
/** {@inheritDoc} */ @Override public boolean put(int hash, byte[] keyBytes, byte[] valBytes) { return segmentFor(hash).put(hash, keyBytes, valBytes); }
/** * Frees space by polling entries from LRU queue. * * @param order Queue stripe order. * @param qAddr Queue node address. * @return Released size. */ int freeSpace(short order, long qAddr) { if (lru == null) return 0; int hash = lru.hash(order, qAddr); return segmentFor(hash).freeSpace(hash, order, qAddr); }
/** {@inheritDoc} */ @Override public boolean contains(int hash, byte[] keyBytes) { return segmentFor(hash).contains(hash, keyBytes); }
/** {@inheritDoc} */ @Override public void insert(int hash, byte[] keyBytes, byte[] valBytes) { segmentFor(hash).insert(hash, keyBytes, valBytes); }
/** {@inheritDoc} */ @Override public byte[] get(int hash, byte[] keyBytes) { return segmentFor(hash).get(hash, keyBytes); }
/** {@inheritDoc} */ @Override public byte[] remove(int hash, byte[] keyBytes) { return segmentFor(hash).remove(hash, keyBytes); }
/** {@inheritDoc} */ @Override public boolean removex(int hash, byte[] keyBytes) { return segmentFor(hash).removex(hash, keyBytes); }