@GwtCompatible
public class CollectionLiterals
extends java.lang.Object
collections
.Constructor and Description |
---|
CollectionLiterals() |
Modifier and Type | Method and Description |
---|---|
static <T> java.util.List<T> |
emptyList()
Returns the empty, immutable list.
|
static <K,V> java.util.Map<K,V> |
emptyMap()
Returns the empty, immutable map.
|
static <T> java.util.Set<T> |
emptySet()
Returns the empty, immutable set.
|
static <T> java.util.ArrayList<T> |
newArrayList(T... initial)
Creates a mutable
ArrayList instance containing the given initial elements. |
static <K,V> java.util.HashMap<K,V> |
newHashMap(Pair<? extends K,? extends V>... initial)
Creates a mutable
HashMap instance containing the given initial entries. |
static <T> java.util.HashSet<T> |
newHashSet(T... initial)
Creates a mutable
HashSet instance containing the given initial elements. |
static <T> java.util.List<T> |
newImmutableList(T... elements)
Returns an immutable list containing the given elements, in order.
|
static <K,V> java.util.Map<K,V> |
newImmutableMap(Pair<? extends K,? extends V>... entries)
Returns an immutable map containing the given entries.
|
static <T> java.util.Set<T> |
newImmutableSet(T... elements)
Returns an immutable set containing the given elements.
|
static <K,V> java.util.LinkedHashMap<K,V> |
newLinkedHashMap(Pair<? extends K,? extends V>... initial)
Creates a mutable
LinkedHashMap instance containing the given initial entries. |
static <T> java.util.LinkedHashSet<T> |
newLinkedHashSet(T... initial)
Creates a mutable
LinkedHashSet instance containing the given initial elements. |
static <T> java.util.LinkedList<T> |
newLinkedList(T... initial)
Creates a mutable
LinkedList instance containing the given initial elements. |
static <K,V> java.util.TreeMap<K,V> |
newTreeMap(java.util.Comparator<? super K> comparator,
Pair<? extends K,? extends V>... initial)
Creates a mutable
TreeMap instance containing the given initial entries. |
static <T> java.util.TreeSet<T> |
newTreeSet(java.util.Comparator<? super T> comparator,
T... initial)
Creates a mutable
TreeSet instance containing the given initial elements. |
@Pure public static <T> java.util.List<T> emptyList()
Collections.emptyList()
@Pure public static <T> java.util.Set<T> emptySet()
Collections.emptySet()
@Pure public static <K,V> java.util.Map<K,V> emptyMap()
Collections.emptyMap()
@Pure public static <T> java.util.List<T> newImmutableList(T... elements)
elements
- the elements that should be contained in the list. May not be null
or contain any
null
values.java.lang.NullPointerException
- if elements
or any of items in elements
is null
@Pure public static <T> java.util.Set<T> newImmutableSet(T... elements)
Object.equals(java.lang.Object)
) after the first are ignoredelements
- the elements that should be contained in the set. May not be null
or contain any
null
values.java.lang.NullPointerException
- if elements
or any of items in elements
is null
@Pure public static <K,V> java.util.Map<K,V> newImmutableMap(Pair<? extends K,? extends V>... entries)
IllegalArgumentException
.entries
- the entries that should be contained in the map. May not be null
and may
not contain any null
keys or values.java.lang.NullPointerException
- if entries
or any key or value in entries
is null
java.lang.IllegalArgumentException
- if duplicate keys are contained in entries
.@Pure public static <T> java.util.ArrayList<T> newArrayList(T... initial)
ArrayList
instance containing the given initial elements.initial
- the initial elements that the list should contain, in order. May not be null
but may
contain null
values.ArrayList
containing those elements@Pure public static <T> java.util.LinkedList<T> newLinkedList(T... initial)
LinkedList
instance containing the given initial elements.initial
- the initial elements that the list should contain, in order. May not be null
but may
contain null
values.LinkedList
containing those elements@Pure public static <T> java.util.HashSet<T> newHashSet(T... initial)
HashSet
instance containing the given initial elements.initial
- the initial elements that the set should contain, in order. May not be null
but may
contain null
values.HashSet
containing those elements@Pure public static <T> java.util.LinkedHashSet<T> newLinkedHashSet(T... initial)
LinkedHashSet
instance containing the given initial elements.initial
- the initial elements that the set should contain, in order. May not be null
but may
contain null
values.LinkedHashSet
containing those elements@Pure public static <T> java.util.TreeSet<T> newTreeSet(java.util.Comparator<? super T> comparator, T... initial)
TreeSet
instance containing the given initial elements.initial
- the initial elements that the set should contain, in order. May not be null
but may
contain null
values.comparator
- the comparator that should be used. May be null
which indicates that the natural ordering
of the items should be used.TreeSet
containing those elements@Pure public static <K,V> java.util.HashMap<K,V> newHashMap(Pair<? extends K,? extends V>... initial)
HashMap
instance containing the given initial entries. Repeated occurrences of a keys
will cause an IllegalArgumentException
.initial
- the entries that should be contained in the map. May not be null
but may contain
null
keys or values.HashMap
containing those elementsjava.lang.IllegalArgumentException
- if duplicate keys are contained the initial
entries.@Pure public static <K,V> java.util.LinkedHashMap<K,V> newLinkedHashMap(Pair<? extends K,? extends V>... initial)
LinkedHashMap
instance containing the given initial entries. Repeated occurrences of a
keys will cause an IllegalArgumentException
.initial
- the entries that should be contained in the map. May not be null
but may contain
null
keys or values.LinkedHashMap
containing those elementsjava.lang.IllegalArgumentException
- if duplicate keys are contained the initial
entries.@Pure public static <K,V> java.util.TreeMap<K,V> newTreeMap(java.util.Comparator<? super K> comparator, Pair<? extends K,? extends V>... initial)
TreeMap
instance containing the given initial entries. Repeated occurrences of a keys
will cause an IllegalArgumentException
.initial
- the entries that should be contained in the map. May not be null
but may contain
null
keys or values.comparator
- the comparator that should be used. May be null
which indicates that the natural ordering
of the keys should be used.TreeMap
containing those elementsjava.lang.IllegalArgumentException
- if duplicate keys are contained the initial
entries.