|
Java Platform 1.2 Beta 4 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--java.util.Collections
Collection
,
Set
,
List
,
Map
Field Summary | |
static List | EMPTY_LIST
The empty List (immutable). |
static Set | EMPTY_SET
The empty Set (immutable). |
Method Summary | |
static int | binarySearch(List list,
Object key,
Comparator c)
Searches the specified List for the specified Object using the binary search algorithm. |
static int | binarySearch(List list,
Object key)
Searches the specified List for the specified Object using the binary search algorithm. |
static void | copy(List dest,
List src)
Copies all of the elements from one List into another. |
static Enumeration | enumeration(Collection c)
Returns an Enumeration over the specified Collection. |
static void | fill(List list,
Object o)
Replaces all of the elements of the specified List with the specified element. |
static Object | max(Collection coll,
Comparator comp)
Returns the maximum element of the given Collection, according to the order induced by the specified Comparator. |
static Object | max(Collection coll)
Returns the maximum element of the given Collection, according to the natural ordering of its elements. |
static Object | min(Collection coll,
Comparator comp)
Returns the minimum element of the given Collection, according to the order induced by the specified Comparator. |
static Object | min(Collection coll)
Returns the minimum element of the given Collection, according to the natural ordering of its elements. |
static List | nCopies(int n,
Object o)
Returns an immutable List consisting of n copies of the specified Object. |
static void | reverse(List l)
Reverses the order of the elements in the specified List. |
static Comparator | reverseOrder()
Returns a Comparator that imposes the reverse of the natural ordering on a collection of Comparable objects. |
static void | shuffle(List list,
Random rnd)
Randomly permute the specified list using the specified source of randomness. |
static void | shuffle(List list)
Randomly permutes the specified list using a default source of randomness. |
static Set | singleton(Object o)
Returns an immutable Set containing only the specified Object. |
static void | sort(List list,
Comparator c)
Sorts the specified List according to the order induced by the specified Comparator. |
static void | sort(List list)
Sorts the specified List into ascending order, according to the natural ordering of its elements. |
static Collection | synchronizedCollection(Collection c)
Returns a synchronized (thread-safe) Collection backed by the specified Collection. |
static List | synchronizedList(List list)
Returns a synchronized (thread-safe) List backed by the specified List. |
static Map | synchronizedMap(Map m)
Returns a synchronized (thread-safe) Map backed by the specified Map. |
static Set | synchronizedSet(Set s)
Returns a synchronized (thread-safe) Set backed by the specified Set. |
static SortedMap | synchronizedSortedMap(SortedMap m)
Returns a synchronized (thread-safe) SortedMap backed by the specified SortedMap. |
static SortedSet | synchronizedSortedSet(SortedSet s)
Returns a synchronized (thread-safe) SortedSet backed by the specified SortedSet. |
static Collection | unmodifiableCollection(Collection c)
Returns an unmodifiable view of the specified Collection. |
static List | unmodifiableList(List list)
Returns an unmodifiable view of the specified List. |
static Map | unmodifiableMap(Map m)
Returns an unmodifiable view of the specified Map. |
static Set | unmodifiableSet(Set s)
Returns an unmodifiable view of the specified Set. |
static SortedMap | unmodifiableSortedMap(SortedMap m)
Returns an unmodifiable view of the specified SortedMap. |
static SortedSet | unmodifiableSortedSet(SortedSet s)
Returns an unmodifiable view of the specified SortedSet. |
Methods inherited from class java.lang.Object | |
clone , equals , finalize , getClass , hashCode , notify , notifyAll , toString , wait , wait , wait |
Field Detail |
public static final Set EMPTY_SET
public static final List EMPTY_LIST
Method Detail |
public static void sort(List list)
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n log(n) performance, and can approach linear performance on nearly sorted lists.
The specified List must be modifiable, but need not be resizable. This implementation dumps the specified List into an List, sorts the array, and iterates over the List resetting each element from the corresponding position in the array. This avoids the n2 log(n) performance that would result from attempting to sort a LinkedList in place.
list
- the List to be sorted.Comparable
public static void sort(List list, Comparator c)
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n log(n) performance, and can approach linear performance on nearly sorted lists.
The specified List must be modifiable, but need not be resizable. This implementation dumps the specified List into an array, sorts the array, and iterates over the List resetting each element from the corresponding position in the array. This avoids the n2 log(n) performance that would result from attempting to sort a LinkedList in place.
list
- the List to be sorted.Comparator
public static int binarySearch(List list, Object key)
This method runs in log(n) time for a "random access" List (which provides near-constant-time positional access). It may run in n log(n) time if it is called on a "sequential access" List (which provides linear-time positional access). If the specified List is an instanceof AbstracSequentialList, this method will do a sequential search instead of a binary search; this offers linear performance instead of n log(n) performance if this method is called on a LinkedList.
list
- the List to be searched.
key
- the key to be searched for.Comparable
,
sort(List)
public static int binarySearch(List list, Object key, Comparator c)
This method runs in log(n) time for a "random access" List (which provides near-constant-time positional access). It may run in n log(n) time if it is called on a "sequential access" List (which provides linear-time positional access). If the specified List is an instanceof AbstracSequentialList, this method will do a sequential search instead of a binary search; this offers linear performance instead of n log(n) performance if this method is called on a LinkedList.
list
- the List to be searched.
key
- the key to be searched for.Comparable
,
sort(List, Comparator)
public static void reverse(List l)
This method runs in linear time.
list
- The List whose elements are to be reversed.public static void shuffle(List list)
The hedge "approximately" is used in the foregoing description because default source of randomenss is only approximately an unbiased source of independently chosen bits. If it were a perfect source of randomly chosen bits, then the algorithm would choose permutations with perfect uniformity.
This method runs in linear time for a "random access" List (which provides near-constant-time positional access). It may require quadratic time for a "sequential access" List.
list
- The List to be shuffled.public static void shuffle(List list, Random rnd)
This method runs in linear time for a "random access" List (which provides near-constant-time positional access). It may require quadratic time for a "sequential access" List.
list
- the List to be shuffled.
r
- the source of randomness to use to shuffle the List.public static void fill(List list, Object o)
This method runs in linear time.
list
- The List to be filled with the specified element.
o
- The element with which to fill the specified List.public static void copy(List dest, List src)
This method runs in linear time.
dest
- The destination List.
src
- The source List.public static Object min(Collection coll)
This method iterates over the entire Collection, hence it requires time proportional to the size of the Collection.
coll
- the collection whose minimum element is to be determined.Comparable
public static Object min(Collection coll, Comparator comp)
This method iterates over the entire Collection, hence it requires time proportional to the size of the Collection.
coll
- the collection whose minimum element is to be determined.Comparable
public static Object max(Collection coll)
This method iterates over the entire Collection, hence it requires time proportional to the size of the Collection.
coll
- the collection whose maximum element is to be determined.Comparable
public static Object max(Collection coll, Comparator comp)
This method iterates over the entire Collection, hence it requires time proportional to the size of the Collection.
coll
- the collection whose maximum element is to be determined.Comparable
public static Collection unmodifiableCollection(Collection c)
The returned Collection does not pass the hashCode and equals operations through to the backing Collection, but relies on Object's equals and hashCode methods. This is necessary to preserve the contracts of these operations in the case that the backing Collection is a Set or a List.
The returned Collection will be Serializable if the specified Collection is Serializable.
c
- the Collection for which an unmodifiable view is to be
returned.public static Set unmodifiableSet(Set s)
The returned Set will be Serializable if the specified Set is Serializable.
s
- the Set for which an unmodifiable view is to be returned.public static SortedSet unmodifiableSortedSet(SortedSet s)
The returned SortedSet will be Serializable if the specified SortedSet is Serializable.
s
- the SortedSet for which an unmodifiable view is to be returned.public static List unmodifiableList(List list)
The returned List will be Serializable if the specified List is Serializable.
list
- the List for which an unmodifiable view is to be returned.public static Map unmodifiableMap(Map m)
The returned Map will be Serializable if the specified Map is Serializable.
m
- the Map for which an unmodifiable view is to be returned.public static SortedMap unmodifiableSortedMap(SortedMap m)
The returned SortedMap will be Serializable if the specified SortedMap is Serializable.
m
- the SortedMap for which an unmodifiable view is to be returned.public static Collection synchronizedCollection(Collection c)
It is imperative that the user manually synchronize on the returned Collection when iterating over it:
Collection c = Collections.synchronizedCollection(myCollection); ... synchronized(c) { Iterator i = c.iterator(); // Must be in the synchronized block while (i.hasNext()) foo(i.next(); }Failure to follow this advice may result in non-deterministic behavior.
The returned Collection does not pass the hashCode and equals operations through to the backing Collection, but relies on Object's equals and hashCode methods. This is necessary to preserve the contracts of these operations in the case that the backing Collection is a Set or a List.
The returned Collection will be Serializable if the specified Collection is Serializable.
c
- the Collection to be "wrapped" in a synchronized Collection.public static Set synchronizedSet(Set s)
It is imperative that the user manually synchronize on the returned Set when iterating over it:
Set s = Collections.synchronizedSet(new HashSet()); ... synchronized(s) { Iterator i = s.iterator(); // Must be in the synchronized block while (i.hasNext()) foo(i.next(); }Failure to follow this advice may result in non-deterministic behavior.
The returned Set will be Serializable if the specified Set is Serializable.
s
- the Set to be "wrapped" in a synchronized Set.public static SortedSet synchronizedSortedSet(SortedSet s)
It is imperative that the user manually synchronize on the returned SortedSet when iterating over it or any of its subSet, headSet, or tailSet views.
SortedSet s = Collections.synchronizedSortedSet(new HashSortedSet()); ... synchronized(s) { Iterator i = s.iterator(); // Must be in the synchronized block while (i.hasNext()) foo(i.next(); }or:
SortedSet s = Collections.synchronizedSortedSet(new HashSortedSet()); SortedSet s2 = s.headSet(foo); ... synchronized(s) { // Note: s, not s2!!! Iterator i = s2.iterator(); // Must be in the synchronized block while (i.hasNext()) foo(i.next(); }Failure to follow this advice may result in non-deterministic behavior.
The returned SortedSet will be Serializable if the specified SortedSet is Serializable.
s
- the SortedSet to be "wrapped" in a synchronized SortedSet.public static List synchronizedList(List list)
It is imperative that the user manually synchronize on the returned List when iterating over it:
List list = Collections.synchronizedList(new ArrayList()); ... synchronized(list) { Iterator i = list.iterator(); // Must be in synchronized block while (i.hasNext()) foo(i.next(); }Failure to follow this advice may result in non-deterministic behavior.
The returned List will be Serializable if the specified List is Serializable.
list
- the List to be "wrapped" in a synchronized List.public static Map synchronizedMap(Map m)
It is imperative that the user manually synchronize on the returned Map when iterating over any of its Collection views:
Map m = Collections.synchronizedMap(new HashMap()); ... Set s = m.keySet(); // Needn't be in synchronized block ... synchronized(m) { // Synchronizing on m, not s! Iterator i = s.iterator(); // Must be in synchronized block while (i.hasNext()) foo(i.next(); }Failure to follow this advice may result in non-deterministic behavior.
The returned Map will be Serializable if the specified Map is Serializable.
m
- the Map to be "wrapped" in a synchronized Map.public static SortedMap synchronizedSortedMap(SortedMap m)
It is imperative that the user manually synchronize on the returned SortedMap when iterating over any of its Collection views, or the Collections views of any of its subMap, headMap or tailMap views.
SortedMap m = Collections.synchronizedSortedMap(new HashSortedMap()); ... Set s = m.keySet(); // Needn't be in synchronized block ... synchronized(m) { // Synchronizing on m, not s! Iterator i = s.iterator(); // Must be in synchronized block while (i.hasNext()) foo(i.next(); }or:
SortedMap m = Collections.synchronizedSortedMap(new HashSortedMap()); SortedMap m2 = m.subMap(foo, bar); ... Set s2 = m2.keySet(); // Needn't be in synchronized block ... synchronized(m) { // Synchronizing on m, not m2 or s2! Iterator i = s.iterator(); // Must be in synchronized block while (i.hasNext()) foo(i.next(); }Failure to follow this advice may result in non-deterministic behavior.
The returned SortedMap will be Serializable if the specified SortedMap is Serializable.
m
- the SortedMap to be "wrapped" in a synchronized SortedMap.public static Set singleton(Object o)
public static List nCopies(int n, Object o)
n
- the number of elements in the returned List.
o
- the element to appear repeatedly in the returned List.List.addAll(Collection)
,
List.addAll(int, Collection)
public static Comparator reverseOrder()
Arrays.sort(a, Collections.REVERSE_ORDER);sorts the array in reverse-lexicographic (alphabetical) order.
This Comparator is Serializable.
Comparable
public static Enumeration enumeration(Collection c)
c
- the Collection for which an Enumeration is to be returned.
|
Java Platform 1.2 Beta 4 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |