Collection interface, to minimize the effort required to implement this interface.
More...
#include <java_util_AbstractCollection.h>
Inheritance diagram for java::util::AbstractCollection:


Public Types | |
| enum | { xmogDefaultFlags = xmog_base::GLOBAL, xmogMajorVersion = 3, xmogMinorVersion = 2, xmogPatchVersion = 9, xmogBuildNumber = 2047 } |
|
typedef ::xmog_java_array_template< ::java::util::AbstractCollection > | array1D |
|
typedef ::xmog_java_array_template< ::xmog_java_array_template< ::java::util::AbstractCollection > > | array2D |
Public Member Functions | |
| AbstractCollection (::xmog_dummy _use_java_ctor,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
| Sole constructor. | |
| virtual bool | add (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Ensures that this collection contains the specified element (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 collection (optional operation). | |
| virtual void | clear (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes all of the elements from this collection (optional operation). | |
| virtual bool | contains (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this collection 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 collection contains all of the elements in the specified collection. | |
| virtual bool | isEmpty (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this collection contains no elements. | |
| virtual ::java::util::Iterator | iterator (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns an iterator over the elements contained in this collection. | |
| virtual bool | remove (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes a single instance of the specified element from this collection, 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 collection 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 collection 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 collection. | |
| 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 collection; 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 collection. | |
| virtual ::java::lang::String | toString (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns a string representation of this collection. | |
Collection interface, to minimize the effort required to implement this interface.
To implement an unmodifiable collection, the programmer needs only to extend this class and provide implementations for the iterator and size methods. (The iterator returned by the iterator method must implement hasNext and next.)
To implement a modifiable collection, the programmer must additionally override this class's add method (which otherwise throws an UnsupportedOperationException), and the iterator returned by the iterator method must additionally implement its remove method.
The programmer should generally provide a void (no argument) and Collection constructor, as per the recommendation in the Collection interface specification.
The documentation for each non-abstract methods in this class describes its implementation in detail. Each of these methods may be overridden if the collection being implemented admits a more efficient implementation.
This class is a member of the Java Collections Framework.
|
||||||||||||||||
|
Sole constructor. (For invocation by subclass constructors, typically implicit.)
|
|
||||||||||||||||
|
Ensures that this collection contains the specified element (optional operation).
Returns
This implementation always throws an
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, java::util::HashSet, and java::util::Vector. |
|
||||||||||||||||
|
Adds all of the elements in the specified collection to this collection (optional operation). The behavior of this operation is undefined if the specified collection is modified while the operation is in progress. (This implies that the behavior of this call is undefined if the specified collection is this collection, and this collection is nonempty.) This implementation iterates over the specified collection, and adds each object returned by the iterator to this collection, in turn.
Note that this implementation will throw an
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, and java::util::Vector. |
|
||||||||||||
|
Removes all of the elements from this collection (optional operation). The collection will be empty after this call returns (unless it throws an exception).
This implementation iterates over this collection, removing each element using the
Note that this implementation will throw an
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, java::util::HashSet, and java::util::Vector. |
|
||||||||||||||||
|
Returns
More formally, returns This implementation iterates over the elements in the collection, checking each element in turn for equality with the specified element.
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, java::util::HashSet, and java::util::Vector. |
|
||||||||||||||||
|
Returns
This implementation iterates over the specified collection, checking each element returned by the iterator in turn to see if it's contained in this collection. If all elements are so contained
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, and java::util::Vector. |
|
||||||||||||
|
Returns
This implementation returns
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, java::util::HashSet, and java::util::Vector. |
|
||||||||||||
|
Returns an iterator over the elements contained in this collection.
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, and java::util::HashSet. |
|
||||||||||||||||
|
Removes a single instance of the specified element from this collection, if it is present (optional operation).
More formally, removes an element This implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.
Note that this implementation throws an
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::HashSet, and java::util::Vector. |
|
||||||||||||||||
|
Removes from this collection all of its elements that are contained in the specified collection (optional operation).
This implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's so contained, it's removed from this collection with the iterator's
Note that this implementation will throw an
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, and java::util::Vector. |
|
||||||||||||||||
|
Retains only the elements in this collection that are contained in the specified collection (optional operation). In other words, removes from this collection all of its elements that are not contained in the specified collection.
This implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's not so contained, it's removed from this collection with the iterator's
Note that this implementation will throw an
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, and java::util::Vector. |
|
||||||||||||
|
Returns the number of elements in this collection.
If the collection contains more than
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, java::util::HashSet, and java::util::Vector. |
|
||||||||||||||||
|
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array. If the collection fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this collection.
If the collection fits in the specified array with room to spare (i.e., the array has more elements than the collection), the element in the array immediately following the end of the collection is set to 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.
This implementation checks if the array is large enough to contain the collection; if not, it allocates a new array of the correct size and type (using reflection). Then, it iterates over the collection, storing each object reference in the next consecutive element of the array, starting with element 0. If the array is larger than the collection, a
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, and java::util::Vector. |
|
||||||||||||
|
Returns an array containing all of the elements in this collection. If the 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. The returned array will be "safe" in that no references to it are maintained by the collection. (In other words, this method must allocate a new array even if the collection is backed by an Array). The caller is thus free to modify the returned array. This implementation allocates the array to be returned, and iterates over the elements in the collection, storing each object reference in the next consecutive element of the array, starting with element 0.
Reimplemented from java::util::Collection. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, and java::util::Vector. |
|
||||||||||||
|
Returns a string representation of this collection.
The string representation consists of a list of the collection's elements in the order they are returned by its iterator, enclosed in square brackets (
This implementation creates an empty string buffer, appends a left square bracket, and iterates over the collection appending the string representation of each element in turn. After appending each element except the last, the string
Reimplemented from java::lang::Object. Reimplemented in java::util::AbstractList, java::util::AbstractSet, java::util::ArrayList, java::util::HashSet, and java::util::Vector. |
1.4.1