public static class BTraceUtils.Collections
extends java.lang.Object
Constructor and Description |
---|
Collections() |
Modifier and Type | Method and Description |
---|---|
static <V> void |
addLast(java.util.Deque<V> queue,
V value) |
static <K,V> void |
clear(java.util.Map<K,V> map) |
static <E> boolean |
contains(java.util.Collection<E> coll,
java.lang.Object obj) |
static boolean |
contains(java.lang.Object[] array,
java.lang.Object value) |
static <K,V> boolean |
containsKey(java.util.Map<K,V> map,
java.lang.Object key) |
static <K,V> boolean |
containsValue(java.util.Map<K,V> map,
java.lang.Object value) |
static <V> void |
copy(java.util.Collection<V> src,
java.util.Collection<V> dst) |
static <K,V> void |
copy(java.util.Map<K,V> src,
java.util.Map<K,V> dst) |
static <K,V> V |
get(java.util.Map<K,V> map,
java.lang.Object key) |
static <E> boolean |
isEmpty(java.util.Collection<E> coll) |
static <K,V> boolean |
isEmpty(java.util.Map<K,V> map) |
static <V> java.util.Deque<V> |
newDeque() |
static <K,V> java.util.Map<K,V> |
newHashMap() |
static <K,V> java.util.Map<K,V> |
newWeakMap() |
static <V> V |
peek(java.util.Deque<V> queue) |
static <V> V |
peekFirst(java.util.Deque<V> queue) |
static <V> V |
peekLast(java.util.Deque<V> queue) |
static <V> V |
poll(java.util.Deque<V> queue) |
static <V> void |
push(java.util.Deque<V> queue,
V value) |
static <K,V> V |
put(java.util.Map<K,V> map,
K key,
V value) |
static <K,V> void |
putAll(java.util.Map<K,V> src,
java.util.Map<K,V> dst) |
static <K,V> V |
remove(java.util.Map<K,V> map,
java.lang.Object key) |
static <V> V |
removeFirst(java.util.Deque<V> queue) |
static <V> V |
removeLast(java.util.Deque<V> queue) |
static <E> int |
size(java.util.Collection<E> coll) |
static <K,V> int |
size(java.util.Map<K,V> map) |
static <E> java.lang.Object[] |
toArray(java.util.Collection<E> collection) |
public static <K,V> java.util.Map<K,V> newHashMap()
public static <K,V> java.util.Map<K,V> newWeakMap()
public static <V> java.util.Deque<V> newDeque()
public static <K,V> void putAll(java.util.Map<K,V> src, java.util.Map<K,V> dst)
public static <K,V> void copy(java.util.Map<K,V> src, java.util.Map<K,V> dst)
public static <V> void copy(java.util.Collection<V> src, java.util.Collection<V> dst)
public static <K,V> V get(java.util.Map<K,V> map, java.lang.Object key)
public static <K,V> boolean containsKey(java.util.Map<K,V> map, java.lang.Object key)
public static <K,V> boolean containsValue(java.util.Map<K,V> map, java.lang.Object value)
public static <K,V> V put(java.util.Map<K,V> map, K key, V value)
public static <K,V> V remove(java.util.Map<K,V> map, java.lang.Object key)
public static <K,V> void clear(java.util.Map<K,V> map)
public static <K,V> int size(java.util.Map<K,V> map)
public static <K,V> boolean isEmpty(java.util.Map<K,V> map)
public static <E> int size(java.util.Collection<E> coll)
public static <E> boolean isEmpty(java.util.Collection<E> coll)
public static <E> boolean contains(java.util.Collection<E> coll, java.lang.Object obj)
public static boolean contains(java.lang.Object[] array, java.lang.Object value)
public static <E> java.lang.Object[] toArray(java.util.Collection<E> collection)
public static <V> void push(java.util.Deque<V> queue, V value)
public static <V> V poll(java.util.Deque<V> queue)
public static <V> V peek(java.util.Deque<V> queue)
public static <V> void addLast(java.util.Deque<V> queue, V value)
public static <V> V peekFirst(java.util.Deque<V> queue)
public static <V> V peekLast(java.util.Deque<V> queue)
public static <V> V removeLast(java.util.Deque<V> queue)
public static <V> V removeFirst(java.util.Deque<V> queue)