: Public abstract Interface
Created: 10-04-2008 12:15:51
Modified: 27-06-2008 12:26:26
Project:
Advanced:
Transfinite set is the implementation of a mathematical set. Normally, sets in software implementation are finite, but in mathematics they are often infinite. Since most of the behavior of wither type of set can be defined by the same operations protocols, we list them here. <br /></p><p>In Implementations, infinite sets (instances of TransfiniteSet, but not of set) are most often defined by the Boolean operation "includes" which test for the inclusion of a particular "T."<br /></p>
Operation
Public
contains( element: T,
):Boolean
Details:
Sequential
Public
contains( set: TransfiniteSet<T>,
):Boolean
Details:
Sequential
Public
difference( set: TransfiniteSet,
):TransfiniteSet<T>
Details:
Sequential
Public
equals( set: TransfiniteSet,
):Boolean
Details:
Sequential
Public
includes( element: T,
):Boolean
Details:
Sequential
Public
includesAll( set: TransfiniteSet,
):Boolean
Details:
Sequential
Public
intersection( set: TransfiniteSet,
):TransfiniteSet<T>
Details:
Sequential
Public
intersects( set: TransfiniteSet,
):Boolean
Details:
Sequential
Public
isEmpty():Boolean
Details:
Sequential
Public
notEmpty():Boolean
Details:
Sequential
Public
subSet( set: TransfiniteSet,
):Boolean
Details:
Sequential
Public
symmetricDifference( set: TransfiniteSet<T>,
):TransfiniteSet<T>
Details:
Sequential
Public
union( set: TransfiniteSet,
):TransfiniteSet<T>
Details:
Sequential
Tag Value
persistence persistent
Details:
 
Constraint Type Status
parameterized: T:Type Invariant Approved
Details:
 
Object Type Connection Direction Notes
«type» Collection Class Realization From