| Package | Description |
|---|---|
| java.util |
Back 2 Browser Bytecode Translator
Copyright (C) 2012 Jaroslav Tulach
|
| java.util.concurrent |
| Modifier and Type | Interface and Description |
|---|---|
interface |
Deque<E>
A linear collection that supports element insertion and removal at
both ends.
|
interface |
List<E>
An ordered collection (also known as a sequence).
|
interface |
NavigableSet<E>
A
SortedSet extended with navigation methods reporting
closest matches for given search targets. |
interface |
Queue<E>
A collection designed for holding elements prior to processing.
|
interface |
Set<E>
A collection that contains no duplicate elements.
|
interface |
SortedSet<E>
A
Set that further provides a total ordering on its elements. |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractCollection<E>
This class provides a skeletal implementation of the Collection
interface, to minimize the effort required to implement this interface.
|
class |
AbstractList<E>
This class provides a skeletal implementation of the
List
interface to minimize the effort required to implement this interface
backed by a "random access" data store (such as an array). |
class |
AbstractQueue<E>
This class provides skeletal implementations of some
Queue
operations. |
class |
AbstractSequentialList<E>
This class provides a skeletal implementation of the List
interface to minimize the effort required to implement this interface
backed by a "sequential access" data store (such as a linked list).
|
class |
AbstractSet<E>
This class provides a skeletal implementation of the Set
interface to minimize the effort required to implement this
interface.
|
class |
ArrayDeque<E>
Resizable-array implementation of the
Deque interface. |
class |
ArrayList<E>
Resizable-array implementation of the List interface.
|
class |
EnumSet<E extends Enum<E>>
A specialized
Set implementation for use with enum types. |
class |
HashSet<E>
This class implements the Set interface, backed by a hash table
(actually a HashMap instance).
|
class |
LinkedHashSet<E>
Hash table and linked list implementation of the Set interface,
with predictable iteration order.
|
class |
LinkedList<E>
Doubly-linked list implementation of the
List and Deque
interfaces. |
class |
PriorityQueue<E>
An unbounded priority queue based on a priority heap.
|
class |
Stack<E>
The
Stack class represents a last-in-first-out
(LIFO) stack of objects. |
class |
TreeSet<E>
A
NavigableSet implementation based on a TreeMap. |
class |
Vector<E>
The
Vector class implements a growable array of
objects. |
| Modifier and Type | Method and Description |
|---|---|
static <E> Collection<E> |
Collections.checkedCollection(Collection<E> c,
Class<E> type)
Returns a dynamically typesafe view of the specified collection.
|
static <T> Collection<T> |
Collections.synchronizedCollection(Collection<T> c)
Returns a synchronized (thread-safe) collection backed by the specified
collection.
|
static <T> Collection<T> |
Collections.unmodifiableCollection(Collection<? extends T> c)
Returns an unmodifiable view of the specified collection.
|
Collection<V> |
WeakHashMap.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
TreeMap.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
SortedMap.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
Map.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
IdentityHashMap.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
Hashtable.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
HashMap.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
EnumMap.values()
Returns a
Collection view of the values contained in this map. |
Collection<V> |
AbstractMap.values()
Returns a
Collection view of the values contained in this map. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
Vector.addAll(Collection<? extends E> c)
Appends all of the elements in the specified Collection to the end of
this Vector, in the order that they are returned by the specified
Collection's Iterator.
|
boolean |
TreeSet.addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this set.
|
boolean |
Set.addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this set if
they're not already present (optional operation).
|
boolean |
List.addAll(Collection<? extends E> c)
Appends all of the elements in the specified collection to the end of
this list, in the order that they are returned by the specified
collection's iterator (optional operation).
|
boolean |
LinkedList.addAll(Collection<? extends E> c)
Appends all of the elements in the specified collection to the end of
this list, in the order that they are returned by the specified
collection's iterator.
|
boolean |
Collection.addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this collection
(optional operation).
|
boolean |
ArrayList.addAll(Collection<? extends E> c)
Appends all of the elements in the specified collection to the end of
this list, in the order that they are returned by the
specified collection's Iterator.
|
boolean |
AbstractQueue.addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this
queue.
|
boolean |
AbstractCollection.addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this collection
(optional operation).
|
static <T> boolean |
Collections.addAll(Collection<? super T> c,
T... elements)
Adds all of the specified elements to the specified collection.
|
boolean |
Vector.addAll(int index,
Collection<? extends E> c)
Inserts all of the elements in the specified Collection into this
Vector at the specified position.
|
boolean |
List.addAll(int index,
Collection<? extends E> c)
Inserts all of the elements in the specified collection into this
list at the specified position (optional operation).
|
boolean |
LinkedList.addAll(int index,
Collection<? extends E> c)
Inserts all of the elements in the specified collection into this
list, starting at the specified position.
|
boolean |
ArrayList.addAll(int index,
Collection<? extends E> c)
Inserts all of the elements in the specified collection into this
list, starting at the specified position.
|
boolean |
AbstractSequentialList.addAll(int index,
Collection<? extends E> c)
Inserts all of the elements in the specified collection into this
list at the specified position (optional operation).
|
boolean |
AbstractList.addAll(int index,
Collection<? extends E> c)
Inserts all of the elements in the specified collection into this
list at the specified position (optional operation).
|
boolean |
Vector.containsAll(Collection<?> c)
Returns true if this Vector contains all of the elements in the
specified Collection.
|
boolean |
Set.containsAll(Collection<?> c)
Returns true if this set contains all of the elements of the
specified collection.
|
boolean |
List.containsAll(Collection<?> c)
Returns true if this list contains all of the elements of the
specified collection.
|
boolean |
Collection.containsAll(Collection<?> c)
Returns true if this collection contains all of the elements
in the specified collection.
|
boolean |
AbstractCollection.containsAll(Collection<?> c)
Returns true if this collection contains all of the elements
in the specified collection.
|
static <E extends Enum<E>> |
EnumSet.copyOf(Collection<E> c)
Creates an enum set initialized from the specified collection.
|
static boolean |
Collections.disjoint(Collection<?> c1,
Collection<?> c2)
Returns
true if the two specified collections have no
elements in common. |
static boolean |
Collections.disjoint(Collection<?> c1,
Collection<?> c2)
Returns
true if the two specified collections have no
elements in common. |
static <T> Enumeration<T> |
Collections.enumeration(Collection<T> c)
Returns an enumeration over the specified collection.
|
static int |
Collections.frequency(Collection<?> c,
Object o)
Returns the number of elements in the specified collection equal to the
specified object.
|
static <E> Collection<E> |
Collections.checkedCollection(Collection<E> c,
Class<E> type)
Returns a dynamically typesafe view of the specified collection.
|
static <T extends Object & Comparable<? super T>> |
Collections.max(Collection<? extends T> coll)
Returns the maximum element of the given collection, according to the
natural ordering of its elements.
|
static <T> T |
Collections.max(Collection<? extends T> coll,
Comparator<? super T> comp)
Returns the maximum element of the given collection, according to the
order induced by the specified comparator.
|
static <T extends Object & Comparable<? super T>> |
Collections.min(Collection<? extends T> coll)
Returns the minimum element of the given collection, according to the
natural ordering of its elements.
|
static <T> T |
Collections.min(Collection<? extends T> coll,
Comparator<? super T> comp)
Returns the minimum element of the given collection, according to the
order induced by the specified comparator.
|
boolean |
Vector.removeAll(Collection<?> c)
Removes from this Vector all of its elements that are contained in the
specified Collection.
|
boolean |
Set.removeAll(Collection<?> c)
Removes from this set all of its elements that are contained in the
specified collection (optional operation).
|
boolean |
List.removeAll(Collection<?> c)
Removes from this list all of its elements that are contained in the
specified collection (optional operation).
|
boolean |
Collection.removeAll(Collection<?> c)
Removes all of this collection's elements that are also contained in the
specified collection (optional operation).
|
boolean |
ArrayList.removeAll(Collection<?> c)
Removes from this list all of its elements that are contained in the
specified collection.
|
boolean |
AbstractSet.removeAll(Collection<?> c)
Removes from this set all of its elements that are contained in the
specified collection (optional operation).
|
boolean |
AbstractCollection.removeAll(Collection<?> c)
Removes all of this collection's elements that are also contained in the
specified collection (optional operation).
|
boolean |
Vector.retainAll(Collection<?> c)
Retains only the elements in this Vector that are contained in the
specified Collection.
|
boolean |
Set.retainAll(Collection<?> c)
Retains only the elements in this set that are contained in the
specified collection (optional operation).
|
boolean |
List.retainAll(Collection<?> c)
Retains only the elements in this list that are contained in the
specified collection (optional operation).
|
boolean |
Collection.retainAll(Collection<?> c)
Retains only the elements in this collection that are contained in the
specified collection (optional operation).
|
boolean |
ArrayList.retainAll(Collection<?> c)
Retains only the elements in this list that are contained in the
specified collection.
|
boolean |
AbstractCollection.retainAll(Collection<?> c)
Retains only the elements in this collection that are contained in the
specified collection (optional operation).
|
static <T> Collection<T> |
Collections.synchronizedCollection(Collection<T> c)
Returns a synchronized (thread-safe) collection backed by the specified
collection.
|
static <T> Collection<T> |
Collections.unmodifiableCollection(Collection<? extends T> c)
Returns an unmodifiable view of the specified collection.
|
| Constructor and Description |
|---|
ArrayDeque(Collection<? extends E> c)
Constructs a deque containing the elements of the specified
collection, in the order they are returned by the collection's
iterator.
|
ArrayList(Collection<? extends E> c)
Constructs a list containing the elements of the specified
collection, in the order they are returned by the collection's
iterator.
|
HashSet(Collection<? extends E> c)
Constructs a new set containing the elements in the specified
collection.
|
LinkedHashSet(Collection<? extends E> c)
Constructs a new linked hash set with the same elements as the
specified collection.
|
LinkedList(Collection<? extends E> c)
Constructs a list containing the elements of the specified
collection, in the order they are returned by the collection's
iterator.
|
PriorityQueue(Collection<? extends E> c)
Creates a
PriorityQueue containing the elements in the
specified collection. |
TreeSet(Collection<? extends E> c)
Constructs a new tree set containing the elements in the specified
collection, sorted according to the natural ordering of its
elements.
|
Vector(Collection<? extends E> c)
Constructs a vector containing the elements of the specified
collection, in the order they are returned by the collection's
iterator.
|
| Modifier and Type | Method and Description |
|---|---|
Collection<V> |
ConcurrentHashMap.values() |
Copyright © 2015 API Design. All Rights Reserved.