#include <java_util_Set.h>
Inheritance diagram for java::util::Set:


Public Types | |
| enum | { xmogDefaultFlags = xmog_base::GLOBAL, xmogMajorVersion = 3, xmogMinorVersion = 2, xmogPatchVersion = 9, xmogBuildNumber = 2047 } |
|
typedef ::xmog_java_array_template< ::java::util::Set > | array1D |
|
typedef ::xmog_java_array_template< ::xmog_java_array_template< ::java::util::Set > > | array2D |
Public Member Functions | |
| virtual bool | add (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Adds the specified element to this set if it is not already present (optional operation). | |
| virtual bool | addAll (const ::java::util::Collection &c,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Adds all of the elements in the specified collection to this set if they're not already present (optional operation). | |
| virtual void | clear (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes all of the elements from this set (optional operation). | |
| virtual bool | contains (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this set contains the specified element. | |
| virtual bool | containsAll (const ::java::util::Collection &c,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this set contains all of the elements of the specified collection. | |
| virtual bool | equals (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Compares the specified object with this set for equality. | |
| virtual jint | hashCode (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the hash code value for this set. | |
| virtual bool | isEmpty (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this set contains no elements. | |
| virtual ::java::util::Iterator | iterator (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns an iterator over the elements in this set. | |
| virtual bool | remove (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes the specified element from this set if it is present (optional operation). | |
| virtual bool | removeAll (const ::java::util::Collection &c,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes from this set all of its elements that are contained in the specified collection (optional operation). | |
| virtual bool | retainAll (const ::java::util::Collection &c,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Retains only the elements in this set that are contained in the specified collection (optional operation). | |
| virtual jint | size (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the number of elements in this set (its cardinality). | |
| virtual ::xmog_java_array_template< ::java::lang::Object > | toArray (const ::xmog_java_array_template< ::java::lang::Object > &a,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array. | |
| virtual ::xmog_java_array_template< ::java::lang::Object > | toArray (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns an array containing all of the elements in this set. | |
More formally, sets contain no pair of elements e1 and e2 such that e1.equals(e2), and at most one null element. As implied by its name, this interface models the mathematical set abstraction.
The Set interface places additional stipulations, beyond those inherited from the Collection interface, on the contracts of all constructors and on the contracts of the add, equals and hashCode methods. Declarations for other inherited methods are also included here for convenience. (The specifications accompanying these declarations have been tailored to the Set interface, but they do not contain any additional stipulations.)
The additional stipulation on constructors is, not surprisingly, that all constructors must create a set that contains no duplicate elements (as defined above).
Note: Great care must be exercised if mutable objects are used as set elements. The behavior of a set is not specified if the value of an object is changed in a manner that affects equals comparisons while the object is an element in the set. A special case of this prohibition is that it is not permissible for a set to contain itself as an element.
Some set implementations have restrictions on the elements that they may contain. For example, some implementations prohibit null elements, and some have restrictions on the types of their elements. Attempting to add an ineligible element throws an unchecked exception, typically NullPointerException or ClassCastException. Attempting to query the presence of an ineligible element may throw an exception, or it may simply return false; some implementations will exhibit the former behavior and some will exhibit the latter. More generally, attempting an operation on an ineligible element whose completion would not result in the insertion of an ineligible element into the set may throw an exception or it may succeed, at the option of the implementation. Such exceptions are marked as "optional" in the specification for this interface.
This interface is a member of the Java Collections Framework.
|
||||||||||||||||
|
Adds the specified element to this set if it is not already present (optional operation).
More formally, adds the specified element,
The stipulation above does not imply that sets must accept all elements; sets may refuse to add any particular element, including
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Adds all of the elements in the specified collection to this set if they're not already present (optional operation).
If the specified collection is also a set, the
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet. |
|
||||||||||||
|
Removes all of the elements from this set (optional operation). This set will be empty after this call returns (unless it throws an exception).
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Returns
More formally, returns
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Returns
If the specified collection is also a set, this method returns
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet. |
|
||||||||||||||||
|
Compares the specified object with this set for equality.
Returns
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||
|
Returns the hash code value for this set.
The hash code of a set is defined to be the sum of the hash codes of the elements in the set, where the hashcode of a
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||
|
Returns
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||
|
Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Removes the specified element from this set if it is present (optional operation).
More formally, removes an element
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also a set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet. |
|
||||||||||||||||
|
Retains only the elements in this set that are contained in the specified collection (optional operation). In other words, removes from this set all of its elements that are not contained in the specified collection. If the specified collection is also a set, this operation effectively modifies this set so that its value is the intersection of the two sets.
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet. |
|
||||||||||||
|
Returns the number of elements in this set (its cardinality).
If this set contains more than
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Returns an array containing all of the elements in this set; the runtime type of the returned array is that of the specified array.
Obeys the general contract of the
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet. |
|
||||||||||||
|
Returns an array containing all of the elements in this set.
Obeys the general contract of the
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractSet. |
1.4.1