| |||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public class Collections extends Object
This class consists exclusively of static methods that operate on or return collections. It contains polymorphic algorithms that operate on collections, "wrappers", which return a new collection backed by a specified collection, and a few other odds and ends.
The methods of this class all throw a NullPointerException if the collections or class objects provided to them are null.
The documentation for the polymorphic algorithms contained in this class generally includes a brief description of the implementation. Such descriptions should be regarded as implementation notes, rather than parts of the specification. Implementors should feel free to substitute other algorithms, so long as the specification itself is adhered to. (For example, the algorithm used by sort does not have to be a mergesort, but it does have to be stable.)
The "destructive" algorithms contained in this class, that is, the algorithms that modify the collection on which they operate, are specified to throw UnsupportedOperationException if the collection does not support the appropriate mutation primitive(s), such as the set method. These algorithms may, but are not required to, throw this exception if an invocation would have no effect on the collection. For example, invoking the sort method on an unmodifiable list that is already sorted may or may not throw UnsupportedOperationException.
This class is a member of the Java Collections Framework.
Field Summary | |
---|---|
static List |
EMPTY_LIST
The empty list (immutable). |
static Map |
EMPTY_MAP
The empty map (immutable). |
static Set |
EMPTY_SET
The empty set (immutable). |
Method Summary | |
---|---|
static boolean |
addAll(Collection c, Object[] elements) Adds all of the specified elements to the specified collection. |
static Queue |
asLifoQueue(Deque deque) Returns a view of a java.util.Deque as a Last-in-first-out (Lifo) java.util.Queue. |
static int |
binarySearch(List list, Object key) Searches the specified list for the specified object using the binary search algorithm. |
static int |
binarySearch(List list, Object key, Comparator c) Searches the specified list for the specified object using the binary search algorithm. |
static Collection |
checkedCollection(Collection c, Class type) Returns a dynamically typesafe view of the specified collection. |
static List |
checkedList(List list, Class type) Returns a dynamically typesafe view of the specified list. |
static Map |
checkedMap(Map m, Class keyType, Class valueType) Returns a dynamically typesafe view of the specified map. |
static Set |
checkedSet(Set s, Class type) Returns a dynamically typesafe view of the specified set. |
static SortedMap |
checkedSortedMap(SortedMap m, Class keyType, Class valueType) Returns a dynamically typesafe view of the specified sorted map. |
static SortedSet |
checkedSortedSet(SortedSet s, Class type) Returns a dynamically typesafe view of the specified sorted set. |
static void |
Copies all of the elements from one list into another. |
static boolean |
disjoint(Collection c1, Collection c2) Returns true if the two specified collections have no elements in common. |
static List |
Returns the empty list (immutable). |
static Map |
emptyMap() Returns the empty map (immutable). |
static Set |
emptySet() Returns the empty set (immutable). |
static Enumeration |
Returns an enumeration over the specified collection. |
static void |
Replaces all of the elements of the specified list with the specified element. |
static int |
frequency(Collection c, Object o) Returns the number of elements in the specified collection equal to the specified object. |
static int |
indexOfSubList(List source, List target) Returns the starting position of the first occurrence of the specified target list within the specified source list, or -1 if there is no such occurrence. |
static int |
lastIndexOfSubList(List source, List target) Returns the starting position of the last occurrence of the specified target list within the specified source list, or -1 if there is no such occurrence. |
static ArrayList |
list(Enumeration e) Returns an array list containing the elements returned by the specified enumeration in the order they are returned by the enumeration. |
static Object |
max(Collection coll) Returns the maximum element of the given collection, according to the natural ordering of its elements. |
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 |
min(Collection coll) Returns the minimum 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 List |
Returns an immutable list consisting of n copies of the specified object. |
static Set |
newSetFromMap(Map map) Returns a set backed by the specified map. |
static boolean |
replaceAll(List list, Object oldVal, Object newVal) Replaces all occurrences of one specified value in a list with another. |
static void |
Reverses the order of the elements in the specified list. |
static Comparator |
Returns a comparator that imposes the reverse of the natural ordering on a collection of objects that implement the Comparable interface. |
static Comparator |
reverseOrder(Comparator cmp) Returns a comparator that imposes the reverse ordering of the specified comparator. |
static void |
Rotates the elements in the specified list by the specified distance. |
static void |
Randomly permutes the specified list using a default source of randomness. |
static void |
Randomly permute the specified list using the specified source of randomness. |
static Set |
Returns an immutable set containing only the specified object. |
static List |
Returns an immutable list containing only the specified object. |
static Map |
singletonMap(Object key, Object value) Returns an immutable map, mapping only the specified key to the specified value. |
static void |
Sorts the specified list into ascending order, according to the natural ordering of its elements. |
static void |
sort(List list, Comparator c) Sorts the specified list according to the order induced by the specified comparator. |
static void |
Swaps the elements at the specified positions in the specified list. |
static Collection |
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 |
Returns a synchronized (thread-safe) map backed by the specified map. |
static Set |
Returns a synchronized (thread-safe) set backed by the specified set. |
static SortedMap |
Returns a synchronized (thread-safe) sorted map backed by the specified sorted map. |
static SortedSet |
Returns a synchronized (thread-safe) sorted set backed by the specified sorted set. |
static Collection |
Returns an unmodifiable view of the specified collection. |
static List |
unmodifiableList(List list) Returns an unmodifiable view of the specified list. |
static Map |
Returns an unmodifiable view of the specified map. |
static Set |
Returns an unmodifiable view of the specified set. |
static SortedMap |
Returns an unmodifiable view of the specified sorted map. |
static SortedSet |
Returns an unmodifiable view of the specified sorted set. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
public static final List EMPTY_LIST
public static final Map EMPTY_MAP
public static final Set EMPTY_SET
Method Detail |
---|
public static boolean addAll(Collection c, Object[] elements)
When elements are specified individually, this method provides a convenient way to add a few elements to an existing collection:
Collections.addAll(flavors, "Peaches 'n Plutonium", "Rocky Racoon");
c
- the collection into which elements are to be insertedelements
- the elements to insert into cpublic static Queue asLifoQueue(Deque deque)
Each method invocation on the queue returned by this method results in exactly one method invocation on the backing deque, with one exception. The {@link Queue#addAll addAll} method is implemented as a sequence of {@link Deque#addFirst addFirst} invocations on the backing deque.
deque
- the dequepublic 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). If the specified list does not implement the {@link RandomAccess} interface and is large, this method will do an iterator-based binary search that performs O(n) link traversals and O(log n) element comparisons.
list
- the list to be searched.key
- the key to be searched for.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). If the specified list does not implement the {@link RandomAccess} interface and is large, this method will do an iterator-based binary search that performs O(n) link traversals and O(log n) element comparisons.
list
- the list to be searched.key
- the key to be searched for.c
- the comparator by which the list is ordered.
A null value indicates that the elements'
{@linkplain Comparable natural ordering} should be used.public static Collection checkedCollection(Collection c, Class type)
The generics mechanism in the language provides compile-time (static) type checking, but it is possible to defeat this mechanism with unchecked casts. Usually this is not a problem, as the compiler issues warnings on all such unchecked operations. There are, however, times when static type checking alone is not sufficient. For example, suppose a collection is passed to a third-party library and it is imperative that the library code not corrupt the collection by inserting an element of the wrong type.
Another use of dynamically typesafe views is debugging. Suppose a program fails with a ClassCastException, indicating that an incorrectly typed element was put into a parameterized collection. Unfortunately, the exception can occur at any time after the erroneous element is inserted, so it typically provides little or no information as to the real source of the problem. If the problem is reproducible, one can quickly determine its source by temporarily modifying the program to wrap the collection with a dynamically typesafe view. For example, this declaration:
Collection<String> c = new HashSet<String>();may be replaced temporarily by this one:
Collection<String> c = Collections.checkedCollection( new HashSet<String>(), String.class);Running the program again will cause it to fail at the point where an incorrectly typed element is inserted into the collection, clearly identifying the source of the problem. Once the problem is fixed, the modified declaration may be reverted back to the original.
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 a dynamically typesafe view is to be
returnedtype
- the type of element that c is permitted to holdpublic static List checkedList(List list, Class type)
A discussion of the use of dynamically typesafe views may be found in the documentation for the {@link #checkedCollection checkedCollection} method.
The returned list will be serializable if the specified list is serializable.
list
- the list for which a dynamically typesafe view is to be
returnedtype
- the type of element that list is permitted to holdpublic static Map checkedMap(Map m, Class keyType, Class valueType)
Assuming a map contains no incorrectly typed keys or values prior to the time a dynamically typesafe view is generated, and that all subsequent access to the map takes place through the view (or one of its collection views), it is guaranteed that the map cannot contain an incorrectly typed key or value.
A discussion of the use of dynamically typesafe views may be found in the documentation for the {@link #checkedCollection checkedCollection} method.
The returned map will be serializable if the specified map is serializable.
m
- the map for which a dynamically typesafe view is to be
returnedkeyType
- the type of key that m is permitted to holdvalueType
- the type of value that m is permitted to holdpublic static Set checkedSet(Set s, Class type)
A discussion of the use of dynamically typesafe views may be found in the documentation for the {@link #checkedCollection checkedCollection} method.
The returned set will be serializable if the specified set is serializable.
s
- the set for which a dynamically typesafe view is to be
returnedtype
- the type of element that s is permitted to holdpublic static SortedMap checkedSortedMap(SortedMap m, Class keyType, Class valueType)
Assuming a map contains no incorrectly typed keys or values prior to the time a dynamically typesafe view is generated, and that all subsequent access to the map takes place through the view (or one of its collection views), it is guaranteed that the map cannot contain an incorrectly typed key or value.
A discussion of the use of dynamically typesafe views may be found in the documentation for the {@link #checkedCollection checkedCollection} method.
The returned map will be serializable if the specified map is serializable.
m
- the map for which a dynamically typesafe view is to be
returnedkeyType
- the type of key that m is permitted to holdvalueType
- the type of value that m is permitted to holdpublic static SortedSet checkedSortedSet(SortedSet s, Class type)
A discussion of the use of dynamically typesafe views may be found in the documentation for the {@link #checkedCollection checkedCollection} method.
The returned sorted set will be serializable if the specified sorted set is serializable.
s
- the sorted set for which a dynamically typesafe view is to be
returnedtype
- the type of element that s is permitted to holdpublic static void copy(List dest, List src)
This method runs in linear time.
dest
- The destination list.src
- The source list.public static boolean disjoint(Collection c1, Collection c2)
Care must be exercised if this method is used on collections that do not comply with the general contract for Collection. Implementations may elect to iterate over either collection and test for containment in the other collection (or to perform any equivalent computation). If either collection uses a nonstandard equality test (as does a {@link SortedSet} whose ordering is not compatible with equals, or the key set of an {@link IdentityHashMap}), both collections must use the same nonstandard equality test, or the result of this method is undefined.
Note that it is permissible to pass the same collection in both parameters, in which case the method will return true if and only if the collection is empty.
c1
- a collectionc2
- a collectionpublic static final List emptyList()
This example illustrates the type-safe way to obtain an empty list:
List<String> s = Collections.emptyList();Implementation note: Implementations of this method need not create a separate List object for each call. Using this method is likely to have comparable cost to using the like-named field. (Unlike this method, the field does not provide type safety.)
public static final Map emptyMap()
This example illustrates the type-safe way to obtain an empty set:
Map<String, Date> s = Collections.emptyMap();Implementation note: Implementations of this method need not create a separate Map object for each call. Using this method is likely to have comparable cost to using the like-named field. (Unlike this method, the field does not provide type safety.)
public static final Set emptySet()
This example illustrates the type-safe way to obtain an empty set:
Set<String> s = Collections.emptySet();Implementation note: Implementations of this method need not create a separate Set object for each call. Using this method is likely to have comparable cost to using the like-named field. (Unlike this method, the field does not provide type safety.)
public static Enumeration enumeration(Collection c)
c
- the collection for which an enumeration is to be returned.public static void fill(List list, Object obj)
This method runs in linear time.
list
- the list to be filled with the specified element.obj
- The element with which to fill the specified list.public static int frequency(Collection c, Object o)
c
- the collection in which to determine the frequency
of oo
- the object whose frequency is to be determinedpublic static int indexOfSubList(List source, List target)
This implementation uses the "brute force" technique of scanning over the source list, looking for a match with the target at each location in turn.
source
- the list in which to search for the first occurrence
of target.target
- the list to search for as a subList of source.public static int lastIndexOfSubList(List source, List target)
This implementation uses the "brute force" technique of iterating over the source list, looking for a match with the target at each location in turn.
source
- the list in which to search for the last occurrence
of target.target
- the list to search for as a subList of source.public static ArrayList list(Enumeration e)
e
- enumeration providing elements for the returned
array listpublic 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.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.comp
- the comparator with which to determine the maximum element.
A null value indicates that the elements' natural
ordering should be used.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.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.comp
- the comparator with which to determine the minimum element.
A null value indicates that the elements' natural
ordering should be used.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.public static Set newSetFromMap(Map map)
Each method invocation on the set returned by this method results in exactly one method invocation on the backing map or its keySet view, with one exception. The addAll method is implemented as a sequence of put invocations on the backing map.
The specified map must be empty at the time this method is invoked, and should not be accessed directly after this method returns. These conditions are ensured if the map is created empty, passed directly to this method, and no reference to the map is retained, as illustrated in the following code fragment:
Set<Object> weakHashSet = Collections.newSetFromMap( new WeakHashMap<Object, Boolean>());
map
- the backing mappublic static boolean replaceAll(List list, Object oldVal, Object newVal)
list
- the list in which replacement is to occur.oldVal
- the old value to be replaced.newVal
- the new value with which oldVal is to be
replaced.public static void reverse(List list)
This method runs in linear time.
list
- the list whose elements are to be reversed.public static Comparator reverseOrder()
Arrays.sort(a, Collections.reverseOrder());sorts the array in reverse-lexicographic (alphabetical) order.
The returned comparator is serializable.
public static Comparator reverseOrder(Comparator cmp)
The returned comparator is serializable (assuming the specified comparator is also serializable or null).
cmp
public static void rotate(List list, int distance)
For example, suppose list comprises [t, a, n, k, s]. After invoking Collections.rotate(list, 1) (or Collections.rotate(list, -4)), list will comprise [s, t, a, n, k].
Note that this method can usefully be applied to sublists to move one or more elements within a list while preserving the order of the remaining elements. For example, the following idiom moves the element at index j forward to position k (which must be greater than or equal to j):
Collections.rotate(list.subList(j, k+1), -1);To make this concrete, suppose list comprises [a, b, c, d, e]. To move the element at index 1 (b) forward two positions, perform the following invocation:
Collections.rotate(l.subList(1, 4), -1);The resulting list is [a, c, d, b, e].
To move more than one element forward, increase the absolute value of the rotation distance. To move elements backward, use a positive shift distance.
If the specified list is small or implements the {@link RandomAccess} interface, this implementation exchanges the first element into the location it should go, and then repeatedly exchanges the displaced element into the location it should go until a displaced element is swapped into the first element. If necessary, the process is repeated on the second and successive elements, until the rotation is complete. If the specified list is large and doesn't implement the RandomAccess interface, this implementation breaks the list into two sublist views around index -distance mod size. Then the {@link #reverse(List)} method is invoked on each sublist view, and finally it is invoked on the entire list. For a more complete description of both algorithms, see Section 2.3 of Jon Bentley's Programming Pearls (Addison-Wesley, 1986).
list
- the list to be rotated.distance
- the distance to rotate the list. There are no
constraints on this value; it may be zero, negative, or
greater than list.size().public static void shuffle(List list)
The hedge "approximately" is used in the foregoing description because default source of randomness 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 implementation traverses the list backwards, from the last element up to the second, repeatedly swapping a randomly selected element into the "current position". Elements are randomly selected from the portion of the list that runs from the first element to the current position, inclusive.
This method runs in linear time. If the specified list does not implement the {@link RandomAccess} interface and is large, this implementation dumps the specified list into an array before shuffling it, and dumps the shuffled array back into the list. This avoids the quadratic behavior that would result from shuffling a "sequential access" list in place.
list
- the list to be shuffled.public static void shuffle(List list, Random rnd)
This implementation traverses the list backwards, from the last element up to the second, repeatedly swapping a randomly selected element into the "current position". Elements are randomly selected from the portion of the list that runs from the first element to the current position, inclusive.
This method runs in linear time. If the specified list does not implement the {@link RandomAccess} interface and is large, this implementation dumps the specified list into an array before shuffling it, and dumps the shuffled array back into the list. This avoids the quadratic behavior that would result from shuffling a "sequential access" list in place.
list
- the list to be shuffled.rnd
- the source of randomness to use to shuffle the list.public static Set singleton(Object o)
o
- the sole object to be stored in the returned set.public static List singletonList(Object o)
o
- the sole object to be stored in the returned list.public static Map singletonMap(Object key, Object value)
key
- the sole key to be stored in the returned map.value
- the value to which the returned map maps key.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 specified list must be modifiable, but need not be resizable.
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. 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 linked list in place.
list
- the list to be sorted.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. 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 linked list in place.
list
- the list to be sorted.c
- the comparator to determine the order of the list. A
null value indicates that the elements' natural
ordering should be used.public static void swap(List list, int i, int j)
list
- The list in which to swap elements.i
- the index of one element to be swapped.j
- the index of the other element to be swapped.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 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 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 SortedMap synchronizedSortedMap(SortedMap m)
It is imperative that the user manually synchronize on the returned sorted map 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 TreeMap()); ... 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 TreeMap()); 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 sorted map will be serializable if the specified sorted map is serializable.
m
- the sorted map to be "wrapped" in a synchronized sorted map.public static SortedSet synchronizedSortedSet(SortedSet s)
It is imperative that the user manually synchronize on the returned sorted set when iterating over it or any of its subSet, headSet, or tailSet views.
SortedSet s = Collections.synchronizedSortedSet(new TreeSet()); ... synchronized(s) { Iterator i = s.iterator(); // Must be in the synchronized block while (i.hasNext()) foo(i.next()); }or:
SortedSet s = Collections.synchronizedSortedSet(new TreeSet()); 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 sorted set will be serializable if the specified sorted set is serializable.
s
- the sorted set to be "wrapped" in a synchronized sorted set.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 List unmodifiableList(List list)
The returned list will be serializable if the specified list is serializable. Similarly, the returned list will implement {@link RandomAccess} if the specified list does.
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 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 SortedMap unmodifiableSortedMap(SortedMap m)
The returned sorted map will be serializable if the specified sorted map is serializable.
m
- the sorted map for which an unmodifiable view is to be
returned.public static SortedSet unmodifiableSortedSet(SortedSet s)
The returned sorted set will be serializable if the specified sorted set is serializable.
s
- the sorted set for which an unmodifiable view is to be
returned.
| |||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |