- Add the Codota plugin to your IDE and get smart completions
private void myMethod () {}
/** * Put the page in the cache. * * @param pos the page position * @param page the page * @param memory the memory used */ void cachePage(long pos, Page page, int memory) { if (cache != null) { cache.put(pos, page, memory); } }
/** * Add all elements of the map to this cache. * * @param m the map */ public void putAll(Map<Long, ? extends V> m) { for (Map.Entry<Long, ? extends V> e : m.entrySet()) { // copy only non-null entries put(e.getKey(), e.getValue()); } }
/** * Add an entry to the cache using the average memory size. * * @param key the key (may not be null) * @param value the value (may not be null) * @return the old value, or null if there was no resident entry */ public V put(long key, V value) { return put(key, value, sizeOf(value)); }
cache.put(cachePos, buff, CACHE_BLOCK_SIZE); } else { if (read <= 0) {
refs.chunkList = true; if (cacheChunkRef != null) { cacheChunkRef.put(refs.pos, refs, refs.getMemory());
cacheChunkRef.put(pos, r, r.getMemory());
/** * Put the page in the cache. * * @param pos the page position * @param page the page * @param memory the memory used */ void cachePage(long pos, Page page, int memory) { if (cache != null) { cache.put(pos, page, memory); } }
/** * Put the page in the cache. * * @param pos the page position * @param page the page * @param memory the memory used */ void cachePage(long pos, Page page, int memory) { if (cache != null) { cache.put(pos, page, memory); } }
/** * Put the page in the cache. * * @param pos the page position * @param page the page * @param memory the memory used */ void cachePage(long pos, Page page, int memory) { if (cache != null) { cache.put(pos, page, memory); } }
/** * Add all elements of the map to this cache. * * @param m the map */ public void putAll(Map<Long, ? extends V> m) { for (Map.Entry<Long, ? extends V> e : m.entrySet()) { // copy only non-null entries put(e.getKey(), e.getValue()); } }
/** * Add all elements of the map to this cache. * * @param m the map */ public void putAll(Map<Long, ? extends V> m) { for (Map.Entry<Long, ? extends V> e : m.entrySet()) { // copy only non-null entries put(e.getKey(), e.getValue()); } }
/** * Add all elements of the map to this cache. * * @param m the map */ public void putAll(Map<Long, ? extends V> m) { for (Map.Entry<Long, ? extends V> e : m.entrySet()) { // copy only non-null entries put(e.getKey(), e.getValue()); } }
/** * Add an entry to the cache using the average memory size. * * @param key the key (may not be null) * @param value the value (may not be null) * @return the old value, or null if there was no resident entry */ public V put(long key, V value) { return put(key, value, sizeOf(value)); }
/** {@inheritDoc} */ @Override public void cache(GridH2KeyValueRowOffheap row) { long ptr = row.pointer(); assert ptr > 0 : ptr; rowCache.put(ptr, row); }
/** * Add an entry to the cache using the average memory size. * * @param key the key (may not be null) * @param value the value (may not be null) * @return the old value, or null if there was no resident entry */ public V put(long key, V value) { return put(key, value, sizeOf(value)); }
/** * Add an entry to the cache using the average memory size. * * @param key the key (may not be null) * @param value the value (may not be null) * @return the old value, or null if there was no resident entry */ public V put(long key, V value) { return put(key, value, sizeOf(value)); }
cache.put(cachePos, buff, CACHE_BLOCK_SIZE); } else { if (read <= 0) {
refs.chunkList = true; if (cacheChunkRef != null) { cacheChunkRef.put(refs.pos, refs, refs.getMemory());
refs.chunkList = true; if (cacheChunkRef != null) { cacheChunkRef.put(refs.pos, refs, refs.getMemory());
refs.chunkList = true; if (cacheChunkRef != null) { cacheChunkRef.put(refs.pos, refs, refs.getMemory());