<<Type>> Set {Analysis} derived from: Collection

Documentation
A finite set. See TransfiniteSet. The straight listing implementations of the set concept must be finite, since memory, although large, cannot be infinite. Sets are "by lists" implementations of the concept (hence must be finite). Transfinite sets are "Boolean test" implementations, and hence can be infinite, but cannot be modified one element at a time to any great degree of success.

Parent PackageCollectionsAbstractYes
Export ControlPublicAccessLink Class forNone
Class KindParameterizedClassCardinalityn
Space ConcurrencySequential
PersistenceYes  


Operations
NameSignatureClass
selectSet<expr.type> select (OCL expr)Set
rejectSet<expr.type> reject (OCL expr)Set
iterateexpr.evaluationType iterate (OCL expr)Set
forAllBoolean forAll (CharacterString expression)Set
sumT sum ()Set
sizeInteger size ()Set
existsBoolean exists (CharacterString expression)Set
unionSet<T> union (Bag<T> other)Set
includingSet<T> including (T object)Set
excludingSet<T> excluding (T object)Set
asSequenceSequence<T> asSequence ()Set
asBagBag<T> asBag ()Set


Attributes
NameClassTypeInitial Value
sizeSetInteger 


Associations
NameMy RoleMy ClassOther RoleOther Element
--Not Named----Not Named--SetelementsT


Generalization Relationships
NameClassSupplier
--Not Named--SetCollection


Realize Relationships
NameClassSupplier
--Not Named--CollectionTransfiniteSet