|
|
Poseidon for UMLTM UMLdoc
|
|
PREV CLASSIFIER NEXT CLASSIFIER
|
|
FRAMES NO FRAMES
|
|
|
|
SUMMARY:
INNER |
ATTR |
ASSOC |
CONSTR |
METHOD
|
|
DETAIL:
INNER |
ATTR |
ASSOC |
CONSTR |
METHOD
|
|
DIAGRAMS:
COLLAB |
SEQ |
STATE |
ACTIV
|
|
Types
Class AggregationType
All known Superclassifier:
AnonymousType
- All known Subclassifier:
-
ARRAYType
, BAGType
, LISTType
, SETType
public abstract class AggregationType
an AnonymousType representing an EXPRESS "aggregation type", whose instances are collections of instances of a "member type": ARRAY, BAG, LIST, SET.
See 8.2 of ISO 10303-11:2004.
 | Attribute Summary |
|
public
Boolean
|
isUnique
True if the members of a given value of the type are required to be distinct; else False.
|
 | Attribute Detail |
|
isUnique
public
Boolean isUnique
True if the members of a given value of the type are required to be distinct; else False. isUnique is always True for a SET type, always False for a BAG type, and True for LIST and ARRAY types if and only if the UNIQUE keyword is present in the type designation
See 8.2 of ISO 10303-11:2004.
 | Association Detail |
|
aggregateValue
public
AggregateValue aggregateValue
genericAggregate
public
GenericAggregate genericAggregate
lower_bound
public
SizeConstraint lower_bound
represents the appearance of a lower-bound constraint in syntactic designation for the aggregation type. For this purpose the appearance of an explicit zero ('0') value may be considered to represent no lower-bound constraint; and the lower-bound relationship need not appear. (The appearance of a lower-bound expression that may evaluate to zero shall always be represented by a lower-bound relationship.)
See 8.2.x of ISO 10303-11:2004.
member_type
public
InstantiableType member_type
upper_bound
public
SizeConstraint upper_bound
represents the appearance of an upper-bound constraint in syntactic designation for the aggregation type. For this purpose the appearance of an explicit indeterminate value ('?') is considered to represent no upper-bound constraint, and shall not be represented by an upper-bound relationship. (The appearance of an upper-bound expression that may evaluate to '?' shall be represented by an upper-bound relationship.)
See 8.2.x of ISO 10303-11:2004.
Created 2005 - 6 - 15
|
|
Poseidon for UMLTM UMLdoc
|
|
PREV CLASSIFIER NEXT CLASSIFIER
|
|
FRAMES NO FRAMES
|
|
|
|
SUMMARY:
INNER |
ATTR |
ASSOC |
CONSTR |
METHOD
|
|
DETAIL:
INNER |
ATTR |
ASSOC |
CONSTR |
METHOD
|
|
DIAGRAMS:
COLLAB |
SEQ |
STATE |
ACTIV
|
|
Generated with Poseidon for UML
TM.
Poseidon is a registered trademark of
Gentleware AG in Germany, USA and other countries.
Copyright 2003-2004 Gentleware AG, Schanzenstr. 70, 20357 Hamburg, Germany. All Rights Reserved.
UML is a trademark or registered trademark of Object Management Group, Inc. in the U.S. and other countries.