#include
Inheritance diagram for OMF::Set:
The underlying set is actually implemented as a map. The idea is that we want to map objects to their identities or hash codes. If we don't map to identity, then we end up always adding new objects.
Public Member Functions |
|
Set () | |
Set (const Set &value) | |
virtual | ~Set () |
const Set & | operator= (const Set &value) |
virtual Iterator | begin () |
virtual Iterator | end () |
virtual Iterator | find (OMF::Object *obj) |
virtual Iterator | find (bool value) |
virtual Iterator | find (int value) |
virtual Iterator | find (const char *value) |
virtual ConstIterator | begin () const |
virtual ConstIterator | end () const |
virtual ConstIterator | find (Object *obj) const |
virtual ConstIterator | find (bool value) const |
virtual ConstIterator | find (int value) const |
virtual ConstIterator | find (const char *value) const |
Iterator | insert (Object *obj) |
Iterator | insert (bool value) |
Iterator | insert (int value) |
Iterator | insert (const char *value) |
void | erase (Iterator i) |
void | erase (Object *obj) |
void | erase (bool value) |
void | erase (int value) |
void | erase (const char *value) |
virtual bool | empty () const |
virtual size_t | size () const |
virtual void | add (Object *obj) |
virtual void | add (bool value) |
virtual void | add (int value) |
virtual void | add (const char *value) |
virtual void | remove (OMF::Object *obj) |
virtual void | remove (bool value) |
virtual void | remove (int value) |
virtual void | remove (const char *value) |
virtual void | clear () |
virtual const std::string & | typeCode () const |
bool | contains (Object *obj) const |
bool | contains (bool value) const |
bool | contains (int value) const |
bool | contains (const char *value) const |
void | collect (OMF::Object *obj) |
virtual unsigned | hashCode () const |
ModelObject * | metaObject () |
|
|
|
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Basic methods to append data. Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Clears the collection. Implements OMF::Container. |
|
The collect method is a generic append for other list/set objects of the same type. The object must be a container for the collect to function. Note that if the object is not a container, no action is taken and no exception is raised. |
|
|
|
|
The contains method tests for the existence of an object within the container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
|
|
|
|
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
The hash implementation for containers is to simply return the pointer value as an integer. We don't anticipate the need for value-based identity with containers. Implements OMF::Object. |
|
|
|
|
|
Return the meta-object of this instance. The meta-object is an instance of the metaclass of this object. For example, the metaclass of UML::Attribute is Model::Class. The metaobject for an instance of UML::Attribute is an instance of Model::Class. This method may force a load of an entire metamodel in order to return the correct object. |
|
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Implements OMF::Container. |
|
Basic methods to remove data. Implements OMF::Container. |
|
Implements OMF::Container. |
|
The typeCode method returns a textual description of an object's type. This can vary between classifications of objects. For primitives and collections, the names are essentially static. For model objects, enumerations and collections the name of the object is the scoped name of the instantiating class. Note that the names of primitives are not typed. Implements OMF::Object. |