<<Type>> CircularSequence {Analysis} derived from: Sequence

Documentation
A circular sequence is a sequence that wraps back on itself, i. e. when the last element is reached, the tail is the original sequence.

The representation of a sequence is unique, but a circular sequence is equal to any circular sequence of the same length that is a circular permutation of itself. the fact that this is an equivalence relation is an easy exercise, and is left to the reader.


Parent PackageCollectionsAbstractNo
Export ControlPublicAccessLink Class forNone
Class KindParameterizedClassCardinalityn
Space ConcurrencySequential
PersistenceYes  


Operations
NameSignatureClass
lastNULL last ()CircularSequence
asSequenceSequence<T> asSequence (T firstObject)CircularSequence
firstRecord<T, Integer = 1> first ()Sequence
lastRecord<T, Integer = length> last ()Sequence
tailSequence<T> tail ()Sequence
atT at (Integer position)Sequence
prependSequence<T> prepend (T element)Sequence
deleteFirstSequence<T> deleteFirst ()Sequence
deleteAtSequence<T> deleteAt (Integer position)Sequence
deleteLastSequence<T> deleteLast ()Sequence
asSetSet<T> asSet ()Sequence
subSequenceSequence<T> subSequence (Integer begin, Integer end)Sequence
concatenateSequence<T> concatenate (Sequence<T> tail)Sequence
collectSequence<expr.type> collect (OCL expr)Sequence
reverseSequence<T> reverse ()Sequence
appendSequence<T> append (T element)Sequence


Attributes
NameClassTypeInitial Value
lengthSequenceInteger 


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


Generalization Relationships
NameClassSupplier
--Not Named--CircularSequenceSequence
--Not Named--SequenceCollection


Realize Relationships
NameClassSupplier
--Not Named--CollectionTransfiniteSet