| Package | Description |
|---|---|
| org.omnifaces.util.concurrentlinkedhashmap |
This package contains an implementation of a bounded
ConcurrentMap data structure. |
| Modifier and Type | Method and Description |
|---|---|
static Weigher<byte[]> |
Weighers.byteArray()
A weigher where the value is a byte array and its weight is the number of
bytes.
|
static <E> Weigher<? super Collection<E>> |
Weighers.collection()
A weigher where the value is a
Collection and its weight is the
number of elements. |
static <E> Weigher<? super Iterable<E>> |
Weighers.iterable()
A weigher where the value is a
Iterable and its weight is the
number of elements. |
static <E> Weigher<? super List<E>> |
Weighers.list()
A weigher where the value is a
List and its weight is the number
of elements. |
static <A,B> Weigher<? super Map<A,B>> |
Weighers.map()
A weigher where the value is a
Map and its weight is the number of
entries. |
static <E> Weigher<? super Set<E>> |
Weighers.set()
A weigher where the value is a
Set and its weight is the number
of elements. |
static <V> Weigher<V> |
Weighers.singleton()
A weigher where a value has a weight of 1.
|
| Modifier and Type | Method and Description |
|---|---|
static <K,V> EntryWeigher<K,V> |
Weighers.asEntryWeigher(Weigher<? super V> weigher)
A entry weigher backed by the specified weigher.
|
ConcurrentLinkedHashMap.Builder<K,V> |
ConcurrentLinkedHashMap.Builder.weigher(Weigher<? super V> weigher)
Specifies an algorithm to determine how many the units of capacity an
entry consumes.
|