|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object java.util.Collections.SynchronizedCollection java.util.Collections.SynchronizedSet java.util.Collections.SynchronizedSortedSet
Field Summary | |
(package private) Collection |
c
|
(package private) Object |
mutex
|
private SortedSet |
ss
|
Constructor Summary | |
(package private) |
Collections.SynchronizedSortedSet(SortedSet s)
|
(package private) |
Collections.SynchronizedSortedSet(SortedSet s,
Object mutex)
|
Method Summary | |
boolean |
add(Object o)
Adds the specified element to this set if it is not already present (optional operation). |
boolean |
addAll(Collection coll)
Adds all of the elements in the specified collection to this set if they're not already present (optional operation). |
void |
clear()
Removes all of the elements from this set (optional operation). |
Comparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering. |
boolean |
contains(Object o)
Returns true if this set contains the specified element. |
boolean |
containsAll(Collection coll)
Returns true if this set contains all of the elements of the specified collection. |
boolean |
equals(Object o)
Compares the specified object with this set for equality. |
Object |
first()
Returns the first (lowest) element currently in this sorted set. |
int |
hashCode()
Returns the hash code value for this set. |
SortedSet |
headSet(Object toElement)
Returns a view of the portion of this sorted set whose elements are strictly less than toElement. |
boolean |
isEmpty()
Returns true if this set contains no elements. |
Iterator |
iterator()
Returns an iterator over the elements in this set. |
Object |
last()
Returns the last (highest) element currently in this sorted set. |
boolean |
remove(Object o)
Removes the specified element from this set if it is present (optional operation). |
boolean |
removeAll(Collection coll)
Removes from this set all of its elements that are contained in the specified collection (optional operation). |
boolean |
retainAll(Collection coll)
Retains only the elements in this set that are contained in the specified collection (optional operation). |
int |
size()
Returns the number of elements in this set (its cardinality). |
SortedSet |
subSet(Object fromElement,
Object toElement)
Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive. |
SortedSet |
tailSet(Object fromElement)
Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement. |
Object[] |
toArray()
Returns an array containing all of the elements in this set. |
Object[] |
toArray(Object[] a)
Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array. |
String |
toString()
Returns a string representation of the object. |
Methods inherited from class java.lang.Object |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Set |
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArray |
Field Detail |
private SortedSet ss
Collection c
Object mutex
Constructor Detail |
Collections.SynchronizedSortedSet(SortedSet s)
Collections.SynchronizedSortedSet(SortedSet s, Object mutex)
Method Detail |
public Comparator comparator()
SortedSet
comparator
in interface SortedSet
public SortedSet subSet(Object fromElement, Object toElement)
SortedSet
The sorted set returned by this method will throw an IllegalArgumentException if the user attempts to insert a element outside the specified range.
Note: this method always returns a half-open range (which includes its low endpoint but not its high endpoint). If you need a closed range (which includes both endpoints), and the element type allows for calculation of the successor a given value, merely request the subrange from lowEndpoint to successor(highEndpoint). For example, suppose that s is a sorted set of strings. The following idiom obtains a view containing all of the strings in s from low to high, inclusive:
SortedSet sub = s.subSet(low, high+"\0");A similar technique can be used to generate an open range (which contains neither endpoint). The following idiom obtains a view containing all of the Strings in s from low to high, exclusive:
SortedSet sub = s.subSet(low+"\0", high);
subSet
in interface SortedSet
fromElement
- low endpoint (inclusive) of the subSet.toElement
- high endpoint (exclusive) of the subSet.
public SortedSet headSet(Object toElement)
SortedSet
The sorted set returned by this method will throw an IllegalArgumentException if the user attempts to insert a element outside the specified range.
Note: this method always returns a view that does not contain its (high) endpoint. If you need a view that does contain this endpoint, and the element type allows for calculation of the successor a given value, merely request a headSet bounded by successor(highEndpoint). For example, suppose that s is a sorted set of strings. The following idiom obtains a view containing all of the strings in s that are less than or equal to high:
SortedSet head = s.headSet(high+"\0");
headSet
in interface SortedSet
toElement
- high endpoint (exclusive) of the headSet.
public SortedSet tailSet(Object fromElement)
SortedSet
The sorted set returned by this method will throw an IllegalArgumentException if the user attempts to insert a element outside the specified range.
Note: this method always returns a view that contains its (low) endpoint. If you need a view that does not contain this endpoint, and the element type allows for calculation of the successor a given value, merely request a tailSet bounded by successor(lowEndpoint). For example, suppose that s is a sorted set of strings. The following idiom obtains a view containing all of the strings in s that are strictly greater than low:
SortedSet tail = s.tailSet(low+"\0");
tailSet
in interface SortedSet
fromElement
- low endpoint (inclusive) of the tailSet.
public Object first()
SortedSet
first
in interface SortedSet
public Object last()
SortedSet
last
in interface SortedSet
public boolean equals(Object o)
Set
equals
in interface Set
equals
in class Object
o
- the reference object with which to compare.
true
if this object is the same as the obj
argument; false
otherwise.Object.hashCode()
,
Hashtable
public int hashCode()
Set
s1.equals(s2)
implies that
s1.hashCode()==s2.hashCode()
for any two sets
s1
and s2
, as required by the general
contract of the Object.hashCode method.
hashCode
in interface Set
hashCode
in class Object
Object.equals(java.lang.Object)
,
Hashtable
public int size()
Collection
size
in interface Collection
public boolean isEmpty()
Collection
isEmpty
in interface Collection
public boolean contains(Object o)
Collection
contains
in interface Collection
o
- element whose presence in this collection is to be tested.
public Object[] toArray()
Collection
The returned array will be "safe" in that no references to it are maintained by this collection. (In other words, this method must allocate a new array even if this collection is backed by an array). The caller is thus free to modify the returned array.
This method acts as bridge between array-based and collection-based APIs.
toArray
in interface Collection
public Object[] toArray(Object[] a)
Collection
If this collection fits in the specified array with room to spare (i.e., the array has more elements than this collection), the element in the array immediately following the end of the collection is set to null. This is useful in determining the length of this collection only if the caller knows that this collection does not contain any null elements.)
If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.
Like the toArray method, this method acts as bridge between array-based and collection-based APIs. Further, this method allows precise control over the runtime type of the output array, and may, under certain circumstances, be used to save allocation costs
Suppose l is a List known to contain only strings. The following code can be used to dump the list into a newly allocated array of String:
String[] x = (String[]) v.toArray(new String[0]);
Note that toArray(new Object[0]) is identical in function to toArray().
toArray
in interface Collection
a
- the array into which the elements of this collection are to be
stored, if it is big enough; otherwise, a new array of the same
runtime type is allocated for this purpose.
public Iterator iterator()
Collection
iterator
in interface Collection
public boolean add(Object o)
Collection
Collections that support this operation may place limitations on what elements may be added to this collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.
If a collection refuses to add a particular element for any reason other than that it already contains the element, it must throw an exception (rather than returning false). This preserves the invariant that a collection always contains the specified element after this call returns.
add
in interface Collection
o
- element whose presence in this collection is to be ensured.
public boolean remove(Object o)
Collection
remove
in interface Collection
o
- element to be removed from this collection, if present.
public boolean containsAll(Collection coll)
Collection
containsAll
in interface Collection
coll
- collection to be checked for containment in this collection.
Collection.contains(Object)
public boolean addAll(Collection coll)
Collection
addAll
in interface Collection
coll
- elements to be inserted into this collection.
Collection.add(Object)
public boolean removeAll(Collection coll)
Collection
removeAll
in interface Collection
coll
- elements to be removed from this collection.
Collection.remove(Object)
,
Collection.contains(Object)
public boolean retainAll(Collection coll)
Collection
retainAll
in interface Collection
coll
- elements to be retained in this collection.
Collection.remove(Object)
,
Collection.contains(Object)
public void clear()
Collection
clear
in interface Collection
public String toString()
Object
toString
method returns a string that
"textually represents" this object. The result should
be a concise but informative representation that is easy for a
person to read.
It is recommended that all subclasses override this method.
The toString
method for class Object
returns a string consisting of the name of the class of which the
object is an instance, the at-sign character `@
', and
the unsigned hexadecimal representation of the hash code of the
object. In other words, this method returns a string equal to the
value of:
getClass().getName() + '@' + Integer.toHexString(hashCode())
toString
in class Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |