| products/Sources/formale Sprachen/Fortran/f90gl-1.2.15/ |
|
Quellcode-Bibliothek© Kompilation durch diese Firma[Weder Korrektheit noch Funktionsfähigkeit der Software werden zugesichert.]Datei: arrows.xbm Sprache: VDMOriginal von: VDM© |
|
||||||
|
class Set
functions -- Same as VDMUtil`set2seq which is implemented by C++ static public asSequence[@T]: set of @T -> seq of @T asSequence(aSet) == cases aSet : {} -> [], {x} union xs -> [x] ^ asSequence[@T](xs) end post hasSameElems[@T](RESULT, aSet) measure cardinality; static cardinality[@T]: set of @T +> nat cardinality(aSet) == card aSet; static public hasSameElems[@T] : (seq of @T) * (set of @T) -> bool hasSameElems(aSeq,aSet) == (elems aSeq = aSet) and (len aSeq = card aSet); static public Combinations[@T] : nat1 -> set of @T -> set of set of @T Combinations(n)(aSet) == { aElem | aElem in set power aSet & card aElem = n}; static public fmap[@T1,@T2]: (@T1 -> @T2) -> set of @T1 -> set of @T2 fmap(f)(aSet) == {f(s) | s in set aSet}; static public Sum[@T]: set of @T -> @T Sum(aSet) == SumAux[@T](aSet)(0) pre is_(aSet, set of int) or is_(aSet, set of nat) or is_(aSet, set of nat1) or is_(aSet, set of real) or is_(aSet, set of rat); static SumAux[@T] : set of @T -> @T -> @T SumAux(aSet)(aSum) == cases aSet : ({}) -> aSum, {e} union s-> SumAux[@T](s)(if is_real(aSum) and is_real(e) then aSum + e else undefined) end pre pre_Sum[@T](aSet); end Set ¤ Dauer der Verarbeitung: 0.22 Sekunden (vorverarbeitet) ¤ |
schauen Sie vor die Tür
Fenster
Die Firma ist wie angegeben erreichbar.Die farbliche Syntaxdarstellung ist noch experimentell.Bot Zugriff |
