: Public abstract <<type>> Class
Created: 4/10/2008 12:15:51 PM
Modified: 7/23/2009 11:59:38 AM
Project:
Advanced:
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.
Operation
Public
asBag():Bag<T>
Details:
sequential
Public
asSequence():Sequence<T>
Details:
sequential
Public
excluding( object: T,
):Set<T>
Details:
sequential
Public
exists( expression: CharacterString,
):Boolean
Details:
sequential
Public
forAll( expression: CharacterString,
):Boolean
Details:
sequential
Public
including( object: T,
):Set<T>
Details:
sequential
Public
iterate( expr: OCL,
):expr.evaluationType
Details:
sequential
Public
reject( expr: OCL,
):Set<expr.type>
Details:
sequential
Public
select( expr: OCL,
):Set<expr.type>
Details:
sequential
Public
size():Integer
Details:
sequential
Public
sum():T
Details:
sequential
Public
union( other: Bag<T>,
):Set<T>
Details:
sequential
Element Source Role Target Role
«parameter» T
Class   		Name:  
  		Name: elements
 
Details:
 
Tag Value
persistence persistent
Details:
 
Object Type Connection Notes
«Type» Collection Class Generalization