public abstract class LdiCollectionsUtil extends Object
| 修飾子 | コンストラクタと説明 |
|---|---|
protected |
LdiCollectionsUtil() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
static <E> ArrayBlockingQueue<E> |
newArrayBlockingQueue(int capacity) |
static <E> ArrayBlockingQueue<E> |
newArrayBlockingQueue(int capacity,
boolean fair) |
static <E> ArrayBlockingQueue<E> |
newArrayBlockingQueue(int capacity,
boolean fair,
Collection<? extends E> c) |
static <E> ArrayList<E> |
newArrayList() |
static <E> ArrayList<E> |
newArrayList(Collection<? extends E> c) |
static <E> ArrayList<E> |
newArrayList(int initialCapacity) |
static <K,V> ConcurrentHashMap<K,V> |
newConcurrentHashMap() |
static <K,V> ConcurrentHashMap<K,V> |
newConcurrentHashMap(int initialCapacity) |
static <K,V> ConcurrentHashMap<K,V> |
newConcurrentHashMap(int initialCapacity,
float loadFactor,
int concurrencyLevel) |
static <K,V> ConcurrentHashMap<K,V> |
newConcurrentHashMap(Map<? extends K,? extends V> m) |
static <E> ConcurrentLinkedQueue<E> |
newConcurrentLinkedQueue() |
static <E> ConcurrentLinkedQueue<E> |
newConcurrentLinkedQueue(Collection<? extends E> c) |
static <E> CopyOnWriteArrayList<E> |
newCopyOnWriteArrayList() |
static <E> CopyOnWriteArrayList<E> |
newCopyOnWriteArrayList(Collection<? extends E> c) |
static <E> CopyOnWriteArrayList<E> |
newCopyOnWriteArrayList(E[] toCopyIn) |
static <E> CopyOnWriteArraySet<E> |
newCopyOnWriteArraySet() |
static <E> CopyOnWriteArraySet<E> |
newCopyOnWriteArraySet(Collection<? extends E> c) |
static <E extends Delayed> |
newDelayQueue() |
static <E extends Delayed> |
newDelayQueue(Collection<? extends E> c) |
static <K,V> HashMap<K,V> |
newHashMap() |
static <K,V> HashMap<K,V> |
newHashMap(int initialCapacity) |
static <K,V> HashMap<K,V> |
newHashMap(int initialCapacity,
float loadFactor) |
static <K,V> HashMap<K,V> |
newHashMap(Map<? extends K,? extends V> m) |
static <E> HashSet<E> |
newHashSet() |
static <E> HashSet<E> |
newHashSet(Collection<? extends E> c) |
static <E> HashSet<E> |
newHashSet(int initialCapacity) |
static <E> HashSet<E> |
newHashSet(int initialCapacity,
float loadFactor) |
static <K,V> Hashtable<K,V> |
newHashtable() |
static <K,V> Hashtable<K,V> |
newHashtable(int initialCapacity) |
static <K,V> Hashtable<K,V> |
newHashtable(int initialCapacity,
float loadFactor) |
static <K,V> Hashtable<K,V> |
newHashtable(Map<? extends K,? extends V> m) |
static <K,V> IdentityHashMap<K,V> |
newIdentityHashMap() |
static <K,V> IdentityHashMap<K,V> |
newIdentityHashMap(int expectedMaxSize) |
static <K,V> IdentityHashMap<K,V> |
newIdentityHashMap(Map<? extends K,? extends V> m) |
static <E> LinkedBlockingQueue<E> |
newLinkedBlockingQueue() |
static <E> LinkedBlockingQueue<E> |
newLinkedBlockingQueue(Collection<? extends E> c) |
static <E> LinkedBlockingQueue<E> |
newLinkedBlockingQueue(int initialCapacity) |
static <K,V> LinkedHashMap<K,V> |
newLinkedHashMap() |
static <K,V> LinkedHashMap<K,V> |
newLinkedHashMap(int initialCapacity) |
static <K,V> LinkedHashMap<K,V> |
newLinkedHashMap(int initialCapacity,
float loadFactor) |
static <K,V> LinkedHashMap<K,V> |
newLinkedHashMap(Map<? extends K,? extends V> m) |
static <E> LinkedHashSet<E> |
newLinkedHashSet() |
static <E> LinkedHashSet<E> |
newLinkedHashSet(Collection<? extends E> c) |
static <E> LinkedHashSet<E> |
newLinkedHashSet(int initialCapacity) |
static <E> LinkedHashSet<E> |
newLinkedHashSet(int initialCapacity,
float loadFactor) |
static <E> LinkedList<E> |
newLinkedList() |
static <E> LinkedList<E> |
newLinkedList(Collection<? extends E> c) |
static <E> PriorityBlockingQueue<E> |
newPriorityBlockingQueue() |
static <E> PriorityBlockingQueue<E> |
newPriorityBlockingQueue(Collection<? extends E> c) |
static <E> PriorityBlockingQueue<E> |
newPriorityBlockingQueue(int initialCapacity) |
static <E> PriorityBlockingQueue<E> |
newPriorityBlockingQueue(int initialCapacity,
Comparator<? super E> comparator) |
static <E> PriorityQueue<E> |
newPriorityQueue() |
static <E> PriorityQueue<E> |
newPriorityQueue(Collection<? extends E> c) |
static <E> PriorityQueue<E> |
newPriorityQueue(int initialCapacity) |
static <E> PriorityQueue<E> |
newPriorityQueue(int initialCapacity,
Comparator<? super E> comparator) |
static <E> PriorityQueue<E> |
newPriorityQueue(PriorityQueue<? extends E> c) |
static <E> PriorityQueue<E> |
newPriorityQueue(SortedSet<? extends E> c) |
static <E> Stack<E> |
newStack() |
static <K,V> TreeMap<K,V> |
newTreeMap() |
static <K,V> TreeMap<K,V> |
newTreeMap(Comparator<? super K> c) |
static <K,V> TreeMap<K,V> |
newTreeMap(Map<? extends K,? extends V> m) |
static <K,V> TreeMap<K,V> |
newTreeMap(SortedMap<K,? extends V> m) |
static <E> TreeSet<E> |
newTreeSet() |
static <E> TreeSet<E> |
newTreeSet(Collection<? extends E> c) |
static <E> TreeSet<E> |
newTreeSet(Comparator<? super E> c) |
static <E> TreeSet<E> |
newTreeSet(SortedSet<? extends E> s) |
static <E> Vector<E> |
newVector() |
static <E> Vector<E> |
newVector(Collection<? extends E> c) |
static <E> Vector<E> |
newVector(int initialCapacity) |
static <E> Vector<E> |
newVector(int initialCapacity,
int capacityIncrement) |
static <K,V> WeakHashMap<K,V> |
newWeakHashMap() |
static <K,V> WeakHashMap<K,V> |
newWeakHashMap(int initialCapacity) |
static <K,V> WeakHashMap<K,V> |
newWeakHashMap(int initialCapacity,
float loadFactor) |
static <K,V> WeakHashMap<K,V> |
newWeakHashMap(Map<? extends K,? extends V> m) |
static <K,V> V |
putIfAbsent(ConcurrentMap<K,V> map,
K key,
V value) |
public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int capacity)
E - capacity - ArrayBlockingQueue.ArrayBlockingQueue(int)public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int capacity, boolean fair)
E - capacity - fair - ArrayBlockingQueue.ArrayBlockingQueue(int, boolean)public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int capacity, boolean fair, Collection<? extends E> c)
E - capacity - fair - c - ArrayBlockingQueue.ArrayBlockingQueue(int, boolean, Collection)public static <E> ArrayList<E> newArrayList()
E - ArrayList.ArrayList()public static <E> ArrayList<E> newArrayList(Collection<? extends E> c)
E - c - ArrayList.ArrayList(Collection)public static <E> ArrayList<E> newArrayList(int initialCapacity)
E - initialCapacity - ArrayList.ArrayList(int)public static <K,V> ConcurrentHashMap<K,V> newConcurrentHashMap()
K - V - ConcurrentHashMap.ConcurrentHashMap()public static <K,V> ConcurrentHashMap<K,V> newConcurrentHashMap(int initialCapacity)
K - V - initialCapacity - ConcurrentHashMap.ConcurrentHashMap(int)public static <K,V> ConcurrentHashMap<K,V> newConcurrentHashMap(int initialCapacity, float loadFactor, int concurrencyLevel)
K - V - initialCapacity - loadFactor - concurrencyLevel - ConcurrentHashMap.ConcurrentHashMap(int, float, int)public static <K,V> ConcurrentHashMap<K,V> newConcurrentHashMap(Map<? extends K,? extends V> m)
K - V - m - ConcurrentHashMap.ConcurrentHashMap(Map)public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue()
E - ConcurrentLinkedQueue.ConcurrentLinkedQueue()public static <E> ConcurrentLinkedQueue<E> newConcurrentLinkedQueue(Collection<? extends E> c)
E - c - ConcurrentLinkedQueue.ConcurrentLinkedQueue(Collection)public static <E> CopyOnWriteArrayList<E> newCopyOnWriteArrayList()
E - CopyOnWriteArrayList.CopyOnWriteArrayList()public static <E> CopyOnWriteArrayList<E> newCopyOnWriteArrayList(Collection<? extends E> c)
E - c - CopyOnWriteArrayList.CopyOnWriteArrayList(Collection)public static <E> CopyOnWriteArrayList<E> newCopyOnWriteArrayList(E[] toCopyIn)
E - toCopyIn - CopyOnWriteArrayList.CopyOnWriteArrayList(Object[])public static <E> CopyOnWriteArraySet<E> newCopyOnWriteArraySet()
E - CopyOnWriteArraySet.CopyOnWriteArraySet()public static <E> CopyOnWriteArraySet<E> newCopyOnWriteArraySet(Collection<? extends E> c)
E - c - CopyOnWriteArraySet.CopyOnWriteArraySet(Collection)public static <E extends Delayed> DelayQueue<E> newDelayQueue()
E - DelayQueue.DelayQueue()public static <E extends Delayed> DelayQueue<E> newDelayQueue(Collection<? extends E> c)
E - c - DelayQueue.DelayQueue(Collection)public static <K,V> HashMap<K,V> newHashMap()
K - V - HashMap.HashMap()public static <K,V> HashMap<K,V> newHashMap(int initialCapacity)
K - V - initialCapacity - HashMap.HashMap(int)public static <K,V> HashMap<K,V> newHashMap(int initialCapacity, float loadFactor)
K - V - initialCapacity - loadFactor - HashMap.HashMap(int, float)public static <K,V> HashMap<K,V> newHashMap(Map<? extends K,? extends V> m)
K - V - m - HashMap.HashMap(int, float)public static <E> HashSet<E> newHashSet()
E - HashSet.HashSet()public static <E> HashSet<E> newHashSet(Collection<? extends E> c)
E - c - HashSet.HashSet()public static <E> HashSet<E> newHashSet(int initialCapacity)
E - initialCapacity - HashSet.HashSet()public static <E> HashSet<E> newHashSet(int initialCapacity, float loadFactor)
E - initialCapacity - loadFactor - HashSet.HashSet()public static <K,V> Hashtable<K,V> newHashtable()
K - V - Hashtable.Hashtable()public static <K,V> Hashtable<K,V> newHashtable(int initialCapacity)
K - V - initialCapacity - Hashtable.Hashtable(int)public static <K,V> Hashtable<K,V> newHashtable(int initialCapacity, float loadFactor)
K - V - initialCapacity - loadFactor - Hashtable.Hashtable(int, float)public static <K,V> Hashtable<K,V> newHashtable(Map<? extends K,? extends V> m)
K - V - m - Hashtable.Hashtable(Map)public static <K,V> IdentityHashMap<K,V> newIdentityHashMap()
K - V - IdentityHashMap.IdentityHashMap()public static <K,V> IdentityHashMap<K,V> newIdentityHashMap(int expectedMaxSize)
K - V - expectedMaxSize - IdentityHashMap.IdentityHashMap(int)public static <K,V> IdentityHashMap<K,V> newIdentityHashMap(Map<? extends K,? extends V> m)
K - V - m - IdentityHashMap.IdentityHashMap(Map)public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue()
E - LinkedBlockingQueue.LinkedBlockingQueue()public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(Collection<? extends E> c)
E - c - LinkedBlockingQueue.LinkedBlockingQueue(Collection)public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(int initialCapacity)
E - initialCapacity - LinkedBlockingQueue.LinkedBlockingQueue(int)public static <K,V> LinkedHashMap<K,V> newLinkedHashMap()
K - V - LinkedHashMap.LinkedHashMap()public static <K,V> LinkedHashMap<K,V> newLinkedHashMap(int initialCapacity)
K - V - initialCapacity - LinkedHashMap.LinkedHashMap(int)public static <K,V> LinkedHashMap<K,V> newLinkedHashMap(int initialCapacity, float loadFactor)
K - V - initialCapacity - loadFactor - LinkedHashMap.LinkedHashMap(int, float)public static <K,V> LinkedHashMap<K,V> newLinkedHashMap(Map<? extends K,? extends V> m)
K - V - m - LinkedHashMap.LinkedHashMap(Map)public static <E> LinkedHashSet<E> newLinkedHashSet()
E - LinkedHashSet.LinkedHashSet()public static <E> LinkedHashSet<E> newLinkedHashSet(Collection<? extends E> c)
E - c - LinkedHashSet.LinkedHashSet(Collection)public static <E> LinkedHashSet<E> newLinkedHashSet(int initialCapacity)
E - initialCapacity - LinkedHashSet.LinkedHashSet(int)public static <E> LinkedHashSet<E> newLinkedHashSet(int initialCapacity, float loadFactor)
E - initialCapacity - loadFactor - LinkedHashSet.LinkedHashSet(int, float)public static <E> LinkedList<E> newLinkedList()
E - LinkedList.LinkedList()public static <E> LinkedList<E> newLinkedList(Collection<? extends E> c)
E - c - LinkedList.LinkedList(Collection)public static <E> PriorityBlockingQueue<E> newPriorityBlockingQueue()
E - PriorityBlockingQueue.PriorityBlockingQueue()public static <E> PriorityBlockingQueue<E> newPriorityBlockingQueue(Collection<? extends E> c)
E - c - PriorityBlockingQueue.PriorityBlockingQueue(Collection)public static <E> PriorityBlockingQueue<E> newPriorityBlockingQueue(int initialCapacity)
E - initialCapacity - PriorityBlockingQueue.PriorityBlockingQueue(int)public static <E> PriorityBlockingQueue<E> newPriorityBlockingQueue(int initialCapacity, Comparator<? super E> comparator)
E - initialCapacity - comparator - PriorityBlockingQueue.PriorityBlockingQueue(int, Comparator)public static <E> PriorityQueue<E> newPriorityQueue()
E - PriorityQueue.PriorityQueue()public static <E> PriorityQueue<E> newPriorityQueue(Collection<? extends E> c)
E - c - PriorityQueue.PriorityQueue(Collection)public static <E> PriorityQueue<E> newPriorityQueue(int initialCapacity)
E - initialCapacity - PriorityQueue.PriorityQueue(int)public static <E> PriorityQueue<E> newPriorityQueue(int initialCapacity, Comparator<? super E> comparator)
E - initialCapacity - comparator - PriorityQueue.PriorityQueue(int, Comparator)public static <E> PriorityQueue<E> newPriorityQueue(PriorityQueue<? extends E> c)
E - c - PriorityQueue.PriorityQueue(PriorityQueue)public static <E> PriorityQueue<E> newPriorityQueue(SortedSet<? extends E> c)
E - c - PriorityQueue.PriorityQueue(SortedSet)public static <E> Stack<E> newStack()
E - Stack.Stack()public static <K,V> TreeMap<K,V> newTreeMap()
K - V - TreeMap.TreeMap()public static <K,V> TreeMap<K,V> newTreeMap(Comparator<? super K> c)
K - V - c - TreeMap.TreeMap()public static <K,V> TreeMap<K,V> newTreeMap(Map<? extends K,? extends V> m)
K - V - m - TreeMap.TreeMap(Map)public static <K,V> TreeMap<K,V> newTreeMap(SortedMap<K,? extends V> m)
K - V - m - TreeMap.TreeMap(SortedMap)public static <E> TreeSet<E> newTreeSet()
E - TreeSet.TreeSet()public static <E> TreeSet<E> newTreeSet(Collection<? extends E> c)
E - c - TreeSet.TreeSet(Collection)public static <E> TreeSet<E> newTreeSet(Comparator<? super E> c)
E - c - TreeSet.TreeSet(Comparator)public static <E> TreeSet<E> newTreeSet(SortedSet<? extends E> s)
E - s - TreeSet.TreeSet(SortedSet)public static <E> Vector<E> newVector()
E - Vector.Vector()public static <E> Vector<E> newVector(Collection<? extends E> c)
E - c - Vector.Vector(Collection)public static <E> Vector<E> newVector(int initialCapacity)
E - initialCapacity - Vector.Vector(int)public static <E> Vector<E> newVector(int initialCapacity, int capacityIncrement)
E - initialCapacity - capacityIncrement - Vector.Vector(int, int)public static <K,V> WeakHashMap<K,V> newWeakHashMap()
K - V - WeakHashMap.WeakHashMap()public static <K,V> WeakHashMap<K,V> newWeakHashMap(int initialCapacity)
K - V - initialCapacity - WeakHashMap.WeakHashMap(int)public static <K,V> WeakHashMap<K,V> newWeakHashMap(int initialCapacity, float loadFactor)
K - V - initialCapacity - loadFactor - WeakHashMap.WeakHashMap(int, float)public static <K,V> WeakHashMap<K,V> newWeakHashMap(Map<? extends K,? extends V> m)
K - V - m - WeakHashMap.WeakHashMap(Map)public static <K,V> V putIfAbsent(ConcurrentMap<K,V> map, K key, V value)
K - V - map - key - value - ConcurrentHashMap.putIfAbsent(Object, Object)Copyright © 2015–2016 The DBFlute Project. All rights reserved.