Set interface, backed by a hash table (actually a HashMap instance).
More...
#include <java_util_HashSet.h>
Inheritance diagram for java::util::HashSet:


Public Types | |
| enum | { xmogDefaultFlags = xmog_base::GLOBAL, xmogMajorVersion = 3, xmogMinorVersion = 2, xmogPatchVersion = 9, xmogBuildNumber = 2047 } |
|
typedef ::xmog_java_array_template< ::java::util::HashSet > | array1D |
|
typedef ::xmog_java_array_template< ::xmog_java_array_template< ::java::util::HashSet > > | 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. | |
| virtual void | clear (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes all of the elements from this set. | |
| virtual ::java::lang::Object | clone (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns a shallow copy of this HashSet instance: the elements themselves are not cloned. | |
| 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 | equals (const ::java::lang::Object &obj,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
The method representing the Java method java.lang.Object.equals(). | |
| virtual jint | hashCode (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
The method representing the Java method java.lang.Object.hashCode(). | |
| HashSet (jint initialCapacity, jfloat loadFactor, bool dummy,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
| Constructs a new, empty linked hash set. | |
| HashSet (jint initialCapacity, jfloat loadFactor,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and the specified load factor. | |
| HashSet (::xmog_dummy _use_java_ctor,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
Constructs a new, empty set; the backing HashMap instance has default initial capacity (16) and load factor (0.75). | |
| HashSet (const ::java::util::Collection &c,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
| Constructs a new set containing the elements in the specified collection. | |
| HashSet (jint initialCapacity,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
Constructs a new, empty set; the backing HashMap instance has the specified initial capacity and default load factor, which is 0.75. | |
| 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. | |
| virtual jint | size (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the number of elements in this set (its cardinality). | |
| virtual ::java::lang::String | toString (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
The method representing the Java method java.lang.Object.toString(). | |
Set interface, backed by a hash table (actually a HashMap instance).
It makes no guarantees as to the iteration order of the set; in particular, it does not guarantee that the order will remain constant over time. This class permits the null element.
This class offers constant time performance for the basic operations (add, remove, contains and size), assuming the hash function disperses the elements properly among the buckets. Iterating over this set requires time proportional to the sum of the HashSet instance's size (the number of elements) plus the "capacity" of the backing HashMap instance (the number of buckets). Thus, it's very important not to set the initial capacity too high (or the load factor too low) if iteration performance is important.
Note that this implementation is not synchronized. If multiple threads access a set concurrently, and at least one of the threads modifies the set, it must be synchronized externally. This is typically accomplished by synchronizing on some object that naturally encapsulates the set. If no such object exists, the set should be "wrapped" using the Collections.synchronizedSet method. This is best done at creation time, to prevent accidental unsynchronized access to the HashSet instance:
Set s = Collections.synchronizedSet(new HashSet(...));
The iterators returned by this class's iterator method are fail-fast: if the set is modified at any time after the iterator is created, in any way except through the iterator's own remove method, the Iterator throws a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
This class is a member of the Java Collections Framework.
|
||||||||||||||||
|
Constructs a new, empty set; the backing
|
|
||||||||||||||||
|
Constructs a new set containing the elements in the specified collection.
The
|
|
||||||||||||||||
|
Constructs a new, empty set; the backing
|
|
||||||||||||||||||||
|
Constructs a new, empty set; the backing
|
|
||||||||||||||||||||||||
|
Constructs a new, empty linked hash set. (This package private constructor is only used by LinkedHashSet.) The backing HashMap instance is a LinkedHashMap with the specified initial capacity and the specified load factor.
|
|
||||||||||||||||
|
Adds the specified element to this set if it is not already present.
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
Removes all of the elements from this set.
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
Returns a shallow copy of this
|
|
||||||||||||||||
|
Returns
Reimplemented from java::util::AbstractSet. |
|
||||||||||||||||
|
The method representing the Java method
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
The method representing the Java method
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
Returns
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
Returns an iterator over the elements in this set. The elements are returned in no particular order.
Reimplemented from java::util::AbstractSet. |
|
||||||||||||||||
|
Removes the specified element from this set if it is present.
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
Returns the number of elements in this set (its cardinality).
Reimplemented from java::util::AbstractSet. |
|
||||||||||||
|
The method representing the Java method
Reimplemented from java::util::AbstractSet. |
1.4.1