Package | Description |
---|---|
java.util |
Utilities
|
tijos.framework.util.json |
JSON-java suppport
|
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 list).
|
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 duplicates.
|
interface |
SortedSet<E>
A set which guarantees its iteration order.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractCollection<E>
A basic implementation of most of the methods in the Collection interface to
make it easier to create a collection.
|
class |
AbstractList<E>
A basic implementation of most of the methods in the List interface to make
it easier to create a List based on a random-access data structure.
|
class |
AbstractQueue<E>
This class provides skeletal implementations of some
Queue
operations. |
class |
AbstractSequentialList<E>
Abstract superclass to make it easier to implement the List interface when
backed by a sequential-access store, such as a linked list.
|
class |
AbstractSet<E>
An abstract implementation of Set to make it easier to create your own
implementations.
|
class |
ArrayDeque<E>
Resizable-array implementation of the
Deque interface. |
class |
ArrayList<E>
An array-backed implementation of the List interface.
|
class |
HashSet<T>
This class provides a HashMap-backed implementation of the Set interface.
|
class |
LinkedHashSet<T>
This class provides a hashtable-backed implementation of the
Set interface, with predictable traversal order.
|
class |
LinkedList<T>
Linked list implementation of the List interface.
|
class |
PriorityQueue<E> |
class |
Stack<T> |
class |
TreeSet<T>
This class provides a TreeMap-backed implementation of the SortedSet
interface.
|
class |
Vector<T>
The
Vector classes implements growable arrays 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 given collection,
where any modification is first checked to ensure that the type
of the new data is appropriate.
|
static <T> Collection<T> |
Collections.synchronizedCollection(Collection<T> c)
Returns a synchronized (thread-safe) collection wrapper backed by the
given collection.
|
static <T> Collection<T> |
Collections.unmodifiableCollection(Collection<? extends T> c)
Returns an unmodifiable view of the given collection.
|
Collection<V> |
TreeMap.values()
Returns a "collection view" (or "bag view") of this TreeMap's values.
|
Collection<V> |
Map.values()
Returns a collection (or bag) view of the values in this Map.
|
Collection<V> |
IdentityHashMap.values()
Returns a "collection view" (or "bag view") of this Map's values.
|
Collection<V> |
Hashtable.values()
Returns a "collection view" (or "bag view") of this Hashtable's values.
|
Collection<V> |
HashMap.values()
Returns a "collection view" (or "bag view") of this HashMap's values.
|
Collection<V> |
AbstractMap.values()
Returns a collection or bag view of this map's values.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Set.addAll(Collection<? extends E> c)
Adds all of the elements of the given collection to this set (optional
operation).
|
boolean |
PriorityQueue.addAll(Collection<? extends E> c) |
boolean |
List.addAll(Collection<? extends E> c)
Add the contents of a collection to the end of the list (optional
operation).
|
boolean |
Collection.addAll(Collection<? extends E> c)
Add the contents of a given collection to this collection.
|
boolean |
ArrayList.addAll(Collection<? extends E> c)
Add each element in the supplied Collection to this List.
|
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)
Add all the elements of a given collection to this collection (optional
operation).
|
boolean |
Vector.addAll(Collection<? extends T> c)
Appends all elements of the given collection to the end of this Vector.
|
boolean |
TreeSet.addAll(Collection<? extends T> c)
Adds all of the elements in the supplied Collection to this TreeSet.
|
boolean |
LinkedList.addAll(Collection<? extends T> c)
Append the elements of the collection in iteration order to the end of
this list.
|
static <T> boolean |
Collections.addAll(Collection<? super T> c,
T... a)
Adds all the specified elements to the given collection, in a similar
way to the
addAll method of the Collection . |
boolean |
List.addAll(int index,
Collection<? extends E> c)
Insert the contents of a collection into the list at a given position
(optional operation).
|
boolean |
ArrayList.addAll(int index,
Collection<? extends E> c)
Add all elements in the supplied collection, inserting them beginning
at the specified index.
|
boolean |
AbstractSequentialList.addAll(int index,
Collection<? extends E> c)
Insert the contents of a collection into the list at a given position
(optional operation).
|
boolean |
AbstractList.addAll(int index,
Collection<? extends E> c)
Insert the contents of a collection into the list at a given position
(optional operation).
|
boolean |
Vector.addAll(int index,
Collection<? extends T> c)
Inserts all elements of the given collection at the given index of
this Vector.
|
boolean |
LinkedList.addAll(int index,
Collection<? extends T> c)
Insert the elements of the collection in iteration order at the given
index of this list.
|
static <E> Collection<E> |
Collections.checkedCollection(Collection<E> c,
Class<E> type)
Returns a dynamically typesafe view of the given collection,
where any modification is first checked to ensure that the type
of the new data is appropriate.
|
boolean |
Vector.containsAll(Collection<?> c)
Returns true if this Vector contains all the elements in c.
|
boolean |
Set.containsAll(Collection<?> c)
Returns true if this set contains all elements in the specified
collection.
|
boolean |
List.containsAll(Collection<?> c)
Test whether this list contains every element in a given collection.
|
boolean |
Collection.containsAll(Collection<?> c)
Test whether this collection contains every element in a given collection.
|
boolean |
AbstractCollection.containsAll(Collection<?> c)
Tests whether this collection contains all the elements in a given
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 a collection.
|
static int |
Collections.frequency(Collection<?> c,
Object o)
Returns the frequency of the specified object within the supplied
collection.
|
static <T extends Object & Comparable<? super T>> |
Collections.max(Collection<? extends T> c)
Find the maximum element in a Collection, according to the natural
ordering of the elements.
|
static <T> T |
Collections.max(Collection<? extends T> c,
Comparator<? super T> order)
Find the maximum element in a Collection, according to a specified
Comparator.
|
static <T extends Object & Comparable<? super T>> |
Collections.min(Collection<? extends T> c)
Find the minimum element in a Collection, according to the natural
ordering of the elements.
|
static <T> T |
Collections.min(Collection<? extends T> c,
Comparator<? super T> order)
Find the minimum element in a Collection, according to a specified
Comparator.
|
boolean |
Vector.removeAll(Collection<?> c)
Remove from this vector all elements contained in the given collection.
|
boolean |
Set.removeAll(Collection<?> c)
Removes from this set all elements contained in the specified collection
(optional operation).
|
boolean |
List.removeAll(Collection<?> c)
Remove all elements of a given collection from this list (optional
operation).
|
boolean |
Collection.removeAll(Collection<?> c)
Remove all elements of a given collection from this collection.
|
boolean |
AbstractSet.removeAll(Collection<?> c)
Removes from this set all elements in the given collection (optional
operation).
|
boolean |
AbstractCollection.removeAll(Collection<?> c)
Remove from this collection all its elements that are contained in a given
collection (optional operation).
|
boolean |
Vector.retainAll(Collection<?> c)
Retain in this vector only the elements contained in the given collection.
|
boolean |
Set.retainAll(Collection<?> c)
Retains only the elements in this set that are also in the specified
collection (optional operation).
|
boolean |
List.retainAll(Collection<?> c)
Remove all elements of this list that are not contained in a given
collection (optional operation).
|
boolean |
Collection.retainAll(Collection<?> c)
Remove all elements of this collection that are not contained in a given
collection.
|
boolean |
AbstractCollection.retainAll(Collection<?> c)
Remove from this collection all its elements that are not contained in a
given collection (optional operation).
|
static <T> Collection<T> |
Collections.synchronizedCollection(Collection<T> c)
Returns a synchronized (thread-safe) collection wrapper backed by the
given collection.
|
static <T> Collection<T> |
Collections.unmodifiableCollection(Collection<? extends T> c)
Returns an unmodifiable view of the given 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)
Construct a new ArrayList, and initialize it with the elements
in the supplied Collection.
|
HashSet(Collection<? extends T> c)
Construct a new HashSet with the same elements as are in the supplied
collection (eliminating any duplicates, of course).
|
LinkedHashSet(Collection<? extends T> c)
Construct a new HashSet with the same elements as are in the supplied
collection (eliminating any duplicates, of course).
|
LinkedList(Collection<? extends T> c)
Create a linked list containing the elements, in order, of a given
collection.
|
PriorityQueue(Collection<? extends E> c) |
TreeSet(Collection<? extends T> collection)
Construct a new TreeSet whose backing TreeMap uses the "natural"
orering of the keys and which contains all of the elements in the
supplied Collection.
|
Vector(Collection<? extends T> c)
Constructs a vector containing the contents of Collection, in the
order given by the collection.
|
Modifier and Type | Method and Description |
---|---|
JSONArray |
JSONArray.put(Collection<?> value)
Put a value in the JSONArray, where the value will be a JSONArray which
is produced from a Collection.
|
JSONArray |
JSONArray.put(int index,
Collection<?> value)
Put a value in the JSONArray, where the value will be a JSONArray which
is produced from a Collection.
|
JSONObject |
JSONObject.put(String key,
Collection<?> value)
Put a key/value pair in the JSONObject, where the value will be a
JSONArray which is produced from a Collection.
|
Constructor and Description |
---|
JSONArray(Collection<?> collection)
Construct a JSONArray from a Collection.
|