How to use

getSegment

method

in

org.h2.mvstore.cache.CacheLongKeyLIRS

/**
 * Get the value for the given key if the entry is cached. This method
 * adjusts the internal state of the cache sometimes, to ensure commonly
 * used entries stay in the cache.
 *
 * @param key the key (may not be null)
 * @return the value, or null if there is no resident entry
 */
public V get(long key) {
  int hash = getHash(key);
  return getSegment(hash).get(key, hash);
}

/**
 * Check whether there is a resident entry for the given key. This
 * method does not adjust the internal state of the cache.
 *
 * @param key the key (may not be null)
 * @return true if there is a resident entry
 */
public boolean containsKey(long key) {
  int hash = getHash(key);
  return getSegment(hash).containsKey(key, hash);
}

/**
 * Get the memory used for the given key.
 *
 * @param key the key (may not be null)
 * @return the memory, or 0 if there is no resident entry
 */
public int getMemory(long key) {
  int hash = getHash(key);
  return getSegment(hash).getMemory(key, hash);
}

private Entry<V> find(long key) {
  int hash = getHash(key);
  return getSegment(hash).find(key, hash);
}

/**
 * Get the memory used for the given key.
 *
 * @param key the key (may not be null)
 * @return the memory, or 0 if there is no resident entry
 */
public int getMemory(long key) {
  int hash = getHash(key);
  return getSegment(hash).getMemory(key, hash);
}

/**
 * Check whether there is a resident entry for the given key. This
 * method does not adjust the internal state of the cache.
 *
 * @param key the key (may not be null)
 * @return true if there is a resident entry
 */
public boolean containsKey(long key) {
  int hash = getHash(key);
  return getSegment(hash).containsKey(key, hash);
}

/**
 * Get the value for the given key if the entry is cached. This method
 * adjusts the internal state of the cache sometimes, to ensure commonly
 * used entries stay in the cache.
 *
 * @param key the key (may not be null)
 * @return the value, or null if there is no resident entry
 */
public V get(long key) {
  int hash = getHash(key);
  return getSegment(hash).get(key, hash);
}

/**
 * Get the value for the given key if the entry is cached. This method
 * adjusts the internal state of the cache sometimes, to ensure commonly
 * used entries stay in the cache.
 *
 * @param key the key (may not be null)
 * @return the value, or null if there is no resident entry
 */
public V get(long key) {
  int hash = getHash(key);
  return getSegment(hash).get(key, hash);
}

/**
 * Check whether there is a resident entry for the given key. This
 * method does not adjust the internal state of the cache.
 *
 * @param key the key (may not be null)
 * @return true if there is a resident entry
 */
public boolean containsKey(long key) {
  int hash = getHash(key);
  return getSegment(hash).containsKey(key, hash);
}

/**
 * Get the value for the given key if the entry is cached. This method
 * adjusts the internal state of the cache sometimes, to ensure commonly
 * used entries stay in the cache.
 *
 * @param key the key (may not be null)
 * @return the value, or null if there is no resident entry
 */
public V get(long key) {
  int hash = getHash(key);
  return getSegment(hash).get(key, hash);
}

/**
 * Get the memory used for the given key.
 *
 * @param key the key (may not be null)
 * @return the memory, or 0 if there is no resident entry
 */
public int getMemory(long key) {
  int hash = getHash(key);
  return getSegment(hash).getMemory(key, hash);
}

/**
 * Check whether there is a resident entry for the given key. This
 * method does not adjust the internal state of the cache.
 *
 * @param key the key (may not be null)
 * @return true if there is a resident entry
 */
public boolean containsKey(long key) {
  int hash = getHash(key);
  return getSegment(hash).containsKey(key, hash);
}

/**
 * Get the memory used for the given key.
 *
 * @param key the key (may not be null)
 * @return the memory, or 0 if there is no resident entry
 */
public int getMemory(long key) {
  int hash = getHash(key);
  return getSegment(hash).getMemory(key, hash);
}

private Entry<V> find(long key) {
  int hash = getHash(key);
  return getSegment(hash).find(key, hash);
}

private Entry<V> find(long key) {
  int hash = getHash(key);
  return getSegment(hash).find(key, hash);
}

private Entry<V> find(long key) {
  int hash = getHash(key);
  return getSegment(hash).find(key, hash);
}