package
dsl
Type Members
-
case class
Add
[+A >: BottomSort <: IntSort]
(args: Tree[A]*) extends Tree[IntSort] with Product with Serializable
-
case class
And
[+A >: BottomSort <: BoolSort]
(args: Tree[A]*) extends NAryPred[A] with Product with Serializable
-
trait
ArraySort
extends TopSort
-
trait
BVSort
extends TopSort
-
trait
BinaryOp
[+A >: BottomSort <: TopSort, B >: BottomSort <: TopSort]
extends Tree[B]
-
trait
BinaryPred
[+A >: BottomSort <: TopSort]
extends BinaryOp[A, BoolSort]
-
case class
BoolConstant
(value: Boolean) extends Tree[BoolSort] with Product with Serializable
-
trait
BoolSort
extends TopSort
-
case class
BoolVar
() extends Tree[BoolSort] with Product with Serializable
-
trait
BottomSort
extends BoolSort with IntSort with RealSort with BVSort with SetSort with ArraySort
-
case class
Distinct
[+A >: BottomSort <: TopSort]
(args: Tree[A]*) extends NAryPred[A] with Product with Serializable
-
case class
Div
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryOp[A, IntSort] with Product with Serializable
-
case class
EmptyIntSet
() extends Tree[SetSort] with Product with Serializable
-
case class
Eq
[+A >: BottomSort <: TopSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[A] with Product with Serializable
-
case class
GE
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[IntSort] with Product with Serializable
-
case class
GT
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[IntSort] with Product with Serializable
-
case class
Iff
[+A >: BottomSort <: BoolSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[BoolSort] with Product with Serializable
-
case class
Implies
[+A >: BottomSort <: BoolSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[BoolSort] with Product with Serializable
-
case class
IntConstant
(value: Int) extends Tree[IntSort] with Product with Serializable
-
case class
IntSetVar
() extends Tree[SetSort] with Product with Serializable
-
trait
IntSort
extends TopSort
-
case class
IntVar
() extends Tree[IntSort] with Product with Serializable
-
case class
LE
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[IntSort] with Product with Serializable
-
case class
LT
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[IntSort] with Product with Serializable
-
case class
MapSelect
(map: z3.scala.dsl.Tree[_ >: z3.scala.dsl.BottomSort <: z3.scala.dsl.TopSort], index: z3.scala.dsl.Tree[_ >: z3.scala.dsl.BottomSort <: z3.scala.dsl.TopSort]) extends Tree[BottomSort] with Product with Serializable
-
case class
Mod
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryOp[A, IntSort] with Product with Serializable
-
case class
Mul
[+A >: BottomSort <: IntSort]
(args: Tree[A]*) extends Tree[IntSort] with Product with Serializable
-
trait
NAryPred
[+A >: BottomSort <: TopSort]
extends Tree[BoolSort]
-
case class
Not
[+A >: BottomSort <: BoolSort]
(tree: Tree[A]) extends Tree[BoolSort] with Product with Serializable
-
case class
Or
[+A >: BottomSort <: BoolSort]
(args: Tree[A]*) extends NAryPred[A] with Product with Serializable
-
-
trait
RealSort
extends TopSort
-
case class
Rem
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryOp[A, IntSort] with Product with Serializable
-
case class
SetAdd
[+A >: BottomSort <: TopSort]
(set: Tree[SetSort], elem: Tree[A]) extends Tree[SetSort] with Product with Serializable
-
case class
SetDifference
[+A >: BottomSort <: SetSort]
(left: Tree[A], right: Tree[A]) extends Tree[SetSort] with Product with Serializable
-
case class
SetIntersect
[+A >: BottomSort <: SetSort]
(args: Tree[A]*) extends Tree[SetSort] with Product with Serializable
-
trait
SetSort
extends TopSort
-
case class
SetSubset
[+A >: BottomSort <: SetSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[SetSort] with Product with Serializable
-
case class
SetUnion
[+A >: BottomSort <: SetSort]
(args: Tree[A]*) extends Tree[SetSort] with Product with Serializable
-
-
case class
Sub
[+A >: BottomSort <: IntSort]
(left: Tree[A], right: Tree[A]) extends BinaryOp[A, IntSort] with Product with Serializable
-
trait
TopSort
extends AnyRef
-
trait
Tree
[+T >: BottomSort <: TopSort]
extends AnyRef
-
-
class
Val
[A]
extends Tree[BottomSort]
-
class
ValHandler
[A]
extends AnyRef
-
case class
Xor
[+A >: BottomSort <: BoolSort]
(left: Tree[A], right: Tree[A]) extends BinaryPred[BoolSort] with Product with Serializable
-
case class
Z3ASTWrapper
[+A >: BottomSort <: TopSort]
(ast: Z3AST) extends Tree[A] with Product with Serializable
Value Members
-
object
BooleanValHandler
extends ValHandler[Boolean]
-
object
IntValHandler
extends ValHandler[Int]
-
object
Operands
extends AnyRef
-
implicit def
boolOperandToBoolTree
(operand: BoolOperand): Tree[BoolSort]
-
-
implicit def
booleanValueToBoolOperand
(value: Boolean): BoolOperand
-
implicit def
booleanValueToBoolTree
(value: Boolean): Tree[BoolSort]
-
def
choose
[T1, T2, T3]
(predicate: (Val[T1], Val[T2], Val[T3]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T1], arg1: ValHandler[T2], arg2: ValHandler[T3]): (T1, T2, T3)
-
def
choose
[T1, T2]
(predicate: (Val[T1], Val[T2]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T1], arg1: ValHandler[T2]): (T1, T2)
-
def
choose
[T]
(predicate: (Val[T]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T]): T
-
def
find
[T1, T2, T3]
(predicate: (Val[T1], Val[T2], Val[T3]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T1], arg1: ValHandler[T2], arg2: ValHandler[T3]): Option[(T1, T2, T3)]
-
def
find
[T1, T2]
(predicate: (Val[T1], Val[T2]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T1], arg1: ValHandler[T2]): Option[(T1, T2)]
-
def
find
[T]
(predicate: (Val[T]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T]): Option[T]
-
def
findAll
[T1, T2, T3]
(predicate: (Val[T1], Val[T2], Val[T3]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T1], arg1: ValHandler[T2], arg2: ValHandler[T3]): Iterator[(T1, T2, T3)]
-
def
findAll
[T1, T2]
(predicate: (Val[T1], Val[T2]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T1], arg1: ValHandler[T2]): Iterator[(T1, T2)]
-
def
findAll
[T]
(predicate: (Val[T]) ⇒ Tree[BoolSort])(implicit arg0: ValHandler[T]): Iterator[T]
-
implicit def
intOperandToIntTree
(operand: IntOperand): Tree[IntSort]
-
implicit def
intSetValueToSetOperand
(value: Set[Int]): SetOperand
-
implicit def
intSetValueToSetTree
(value: Set[Int]): Tree[SetSort]
-
-
implicit def
intValueToIntOperand
(value: Int): IntOperand
-
implicit def
intValueToIntTree
(value: Int): Tree[IntSort]
-
implicit def
liftToFuncHandler
[A, B]
(implicit arg0: Default[A], arg1: ValHandler[A], arg2: Default[B], arg3: ValHandler[B]): ValHandler[(A) ⇒ B]
-
implicit def
liftToSetValHander
[A]
(implicit arg0: Default[A], arg1: ValHandler[A]): ValHandler[Set[A]]
-
implicit def
setOperandToSetTree
(operand: SetOperand): Tree[SetSort]
-
-
implicit def
z3ASTToBoolOperand
(ast: Z3AST): BoolOperand
-
implicit def
z3ASTToIntOperand
(ast: Z3AST): IntOperand
-
implicit def
z3ASTToSetOperand
(ast: Z3AST): SetOperand