ContainsSymbol

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object KeepArg extends PreVisitResult with Product with Serializable

Use the same argument for the direct sub-expressions as for this expression

def allVariablesAtLeast(t: IExpression, threshold: Int): Boolean

Check that given expression only contains variables with index at least threshold.

def apply(t: IExpression, searchExpr: IExpression): Boolean

def apply(t: IExpression, pred: (IExpression) ⇒ Boolean): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def containsFunctions(t: IExpression): Boolean

Check whether the given expression contains any functions (instances of IFunApp).

def containsPredicate(t: IExpression, p: Predicate): Boolean

Check whether the given expression contains some predicate.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def freeFrom(t: IExpression, syms: Set[IVariable]): Boolean

Check that given expression does not contain any of the variables.

def freeFromVariableIndex(t: IExpression, indexes: Set[Int]): Boolean

Check that given expression does not contain any of the variables.

final def getClass(): Class[_]

def hashCode(): Int

def isClosed(t: IExpression): Boolean

Check that given expression does not contain free/unbound variables.

final def isInstanceOf[T0]: Boolean

def isPresburger(t: IExpression): Boolean

Check whether the given expression is in Presburger arithmetic.

def isPresburgerBV(t: IExpression): Boolean

Check whether given formula is in Presburger or bit-vector arithmetic.

def isPresburgerBVNonLin(t: IExpression): Boolean

Check whether given formula is in Presburger, bit-vector, or non-linear arithmetic.

def isPresburgerBVNonLinWithPreds(t: IExpression): Boolean

Check whether given formula is in Presburger, bit-vector, or non-linear arithmetic, but possibly including predicate atoms in which all arguments are concrete numbers.

def isPresburgerBVWithPreds(t: IExpression): Boolean

Check whether given formula is in Presburger or bit-vector arithmetic, but possibly including predicate atoms in which all arguments are concrete numbers.

def isPresburgerWithPreds(t: IExpression): Boolean

Check whether given formula is in Presburger arithmetic, but possibly including predicate atoms in which all arguments are concrete numbers.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def postVisit(t: IExpression, context: Context[(IExpression) ⇒ Boolean], subres: Seq[Unit]): Unit

def preVisit(t: IExpression, context: Context[(IExpression) ⇒ Boolean]): PreVisitResult

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def visit(expr: IExpression, arg: Context[(IExpression) ⇒ Boolean]): Unit

def visitWithoutResult(expr: IExpression, arg: Context[(IExpression) ⇒ Boolean]): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit