Package | Description |
---|---|
org.elasticsearch.cache.recycler | |
org.elasticsearch.common.recycler |
Modifier and Type | Field and Description |
---|---|
Recycler<com.carrotsearch.hppc.DoubleIntOpenHashMap> |
CacheRecycler.doubleIntMap |
Recycler<com.carrotsearch.hppc.DoubleObjectOpenHashMap> |
CacheRecycler.doubleObjectMap |
Recycler<com.carrotsearch.hppc.FloatIntOpenHashMap> |
CacheRecycler.floatIntMap |
Recycler<com.carrotsearch.hppc.ObjectObjectOpenHashMap> |
CacheRecycler.hashMap |
Recycler<com.carrotsearch.hppc.ObjectOpenHashSet> |
CacheRecycler.hashSet |
Recycler<com.carrotsearch.hppc.IntIntOpenHashMap> |
CacheRecycler.intIntMap |
Recycler<com.carrotsearch.hppc.IntObjectOpenHashMap> |
CacheRecycler.intObjectMap |
Recycler<com.carrotsearch.hppc.LongIntOpenHashMap> |
CacheRecycler.longIntMap |
Recycler<com.carrotsearch.hppc.LongLongOpenHashMap> |
CacheRecycler.longLongMap |
Recycler<com.carrotsearch.hppc.LongObjectOpenHashMap> |
CacheRecycler.longObjectMap |
Recycler<com.carrotsearch.hppc.ObjectFloatOpenHashMap> |
CacheRecycler.objectFloatMap |
Recycler<com.carrotsearch.hppc.ObjectIntOpenHashMap> |
CacheRecycler.objectIntMap |
Modifier and Type | Class and Description |
---|---|
class |
ConcurrentDequeRecycler<T>
|
class |
DequeRecycler<T>
|
class |
NoneRecycler<T> |
Modifier and Type | Method and Description |
---|---|
Recycler<T> |
Recycler.Factory.build() |
static <T> Recycler<T> |
Recyclers.concurrent(Recycler.Factory<T> factory) |
static <T> Recycler<T> |
Recyclers.concurrent(Recycler.Factory<T> factory,
int concurrencyLevel)
Create a concurrent implementation that can support concurrent access from
concurrencyLevel threads with little contention. |
static <T> Recycler<T> |
Recyclers.concurrentDeque(Recycler.C<T> c,
int limit)
Return a concurrent recycler based on a deque.
|
static <T> Recycler<T> |
Recyclers.deque(Recycler.C<T> c,
int limit)
Return a recycler based on a deque.
|
static <T> Recycler<T> |
Recyclers.locked(Recycler<T> recycler)
Wrap the provided recycler so that calls to
obtain() and Releasable.close() are protected by
a lock. |
static <T> Recycler<T> |
Recyclers.none(Recycler.C<T> c)
Return a
Recycler that never recycles entries. |
static <T> Recycler<T> |
Recyclers.sizing(Recycler<T> defaultRecycler,
Recycler<T> smallObjectRecycler,
int minSize)
Wrap two recyclers and forward to calls to
smallObjectRecycler when size < minSize and to
defaultRecycler otherwise. |
static <T> Recycler<T> |
Recyclers.soft(Recycler.Factory<T> factory)
Create a recycler that is wrapped inside a soft reference, so that it cannot cause
OutOfMemoryError s. |
Modifier and Type | Method and Description |
---|---|
static <T> Recycler<T> |
Recyclers.locked(Recycler<T> recycler)
Wrap the provided recycler so that calls to
obtain() and Releasable.close() are protected by
a lock. |
static <T> Recycler<T> |
Recyclers.sizing(Recycler<T> defaultRecycler,
Recycler<T> smallObjectRecycler,
int minSize)
Wrap two recyclers and forward to calls to
smallObjectRecycler when size < minSize and to
defaultRecycler otherwise. |
static <T> Recycler<T> |
Recyclers.sizing(Recycler<T> defaultRecycler,
Recycler<T> smallObjectRecycler,
int minSize)
Wrap two recyclers and forward to calls to
smallObjectRecycler when size < minSize and to
defaultRecycler otherwise. |
Copyright © 2009–2015. All rights reserved.