ReduceWithConjunction

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(conj: ArithConj): ArithConj
def apply(conj: EquationConj): EquationConj
def apply(conjs: NegatedConjunctions): NegatedConjunctions
def apply(conj: Conjunction, logger: ComputationLogger): Conjunction
def apply(conj: Conjunction): Conjunction
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def lowerBound(t: Term, withAssumptionInEqs: Boolean): Option[(IdealInt, Seq[InEqConj])]

Check whether the known inequalities imply a lower bound of the given term.
Check whether the known inequalities imply a lower bound of the given term. If withAssumptionInEqs is set, also return the assumed inequalities needed for the bound.
def lowerBound(t: Term): Option[IdealInt]

Check whether known inequalities imply a lower bound of the given term.
def lowerBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

Check whether the known inequalities imply a lower bound of the given term.
Check whether the known inequalities imply a lower bound of the given term. Also return assumed inequalities needed to derive the bound.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def passQuantifiers(num: Int): ReduceWithConjunction
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tentativeReduce(conj: Conjunction): Conjunction

Check whether conj can be simplified with the help of assumed knowledge/facts.
Check whether conj can be simplified with the help of assumed knowledge/facts. If yes, conj will be fully reduced, otherwise conj will be returned unchanged.
def toString(): String

Definition Classes
AnyRef → Any
def upperBound(t: Term, withAssumptionInEqs: Boolean): Option[(IdealInt, Seq[InEqConj])]

Check whether the known inequalities imply a upper bound of the given term.
Check whether the known inequalities imply a upper bound of the given term. If withAssumptionInEqs is set, also return the assumed inequalities needed for the bound.
def upperBound(t: Term): Option[IdealInt]

Check whether known inequalities imply an upper bound of the given term.
def upperBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

Check whether the known inequalities imply an upper bound of the given term.
Check whether the known inequalities imply an upper bound of the given term. Also return assumed inequalities needed to derive the bound.
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
lazy val withoutFacts: ReduceWithConjunction

A reducer corresponding to this one, but without assuming any facts known a priori.

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object ReduceWithConjunction | package conjunctions

class ReduceWithConjunction extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(conj: ArithConj): ArithConj

def apply(conj: EquationConj): EquationConj

def apply(conjs: NegatedConjunctions): NegatedConjunctions

def apply(conj: Conjunction, logger: ComputationLogger): Conjunction

def apply(conj: Conjunction): Conjunction

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lowerBound(t: Term, withAssumptionInEqs: Boolean): Option[(IdealInt, Seq[InEqConj])]

def lowerBound(t: Term): Option[IdealInt]

def lowerBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def passQuantifiers(num: Int): ReduceWithConjunction

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

def tentativeReduce(conj: Conjunction): Conjunction

def toString(): String

def upperBound(t: Term, withAssumptionInEqs: Boolean): Option[(IdealInt, Seq[InEqConj])]

def upperBound(t: Term): Option[IdealInt]

def upperBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

lazy val withoutFacts: ReduceWithConjunction

Deprecated Value Members

def finalize(): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped