public MonaSuccessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Succ) { }
Esempio n. 2
0
 public MonaIsSuccessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Succ)
 {
 }
Esempio n. 3
0
 public MonaBelongs(MonaPos p, MonaSet S)
 {
     this.pos = p;
     this.set = S;
 }
Esempio n. 4
0
 public MonaPosGeq(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Geq)
 {
 }
Esempio n. 5
0
 public MonaIsPredecessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Pred)
 {
 }
 public MonaPosLe(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Le) { }
Esempio n. 7
0
 public MonaPosLe(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Le)
 {
 }
Esempio n. 8
0
 public MonaPredecessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Pred)
 {
 }
Esempio n. 9
0
 public MonaPosUnary(MonaPos p, MonaPosUnaryConstructor op)
 {
     this.pos = p;
     this.op  = op;
 }
 public MonaBelongs(MonaPos p, MonaSet S)
 {
     this.pos = p;
     this.set = S;
 }        
Esempio n. 11
0
 public MonaSuccessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Succ)
 {
 }
 public MonaIsSuccessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Succ) { }
 public MonaIsPredecessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Pred) { }
 public MonaPosGeq(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Geq) { }
 public MonaPredecessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Pred) { }
Esempio n. 16
0
 public MonaBinaryPosFormula(MonaPos p1, MonaPos p2, MonaPosComparisonOperator op)
 {
     this.pos1 = p1;
     this.pos2 = p2;
     this.op   = op;
 }
 public MonaPosUnary(MonaPos p, MonaPosUnaryConstructor op)
 {
     this.pos = p;
     this.op = op;
 }
 public MonaBinaryPosFormula(MonaPos p1, MonaPos p2, MonaPosComparisonOperator op)
 {
     this.pos1 = p1;
     this.pos2 = p2;
     this.op = op;
 }