| Package | Description |
|---|---|
| org.elasticsearch.common.recycler |
| 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. |
| 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–2017. All rights reserved.