ReduceWithInEqsImpl

Instance Constructors

new ReduceWithInEqsImpl(ineqLowerBound: (LinearCombination) ⇒ Option[IdealInt], containsVariables: Boolean, order: TermOrder)

Attributes
protected[ap.terfor.inequalities]

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 addInEqs(furtherInEqs: InEqConj): ReduceWithInEqs

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
def apply(conj: InEqConj): InEqConj

Reduce a conjunction of inequalities.
Reduce a conjunction of inequalities. This means that subsumed inequalities are removed, contradictions are detected, and possibly further equations are inferred.

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
def apply(conj: NegEquationConj, logger: ComputationLogger): (NegEquationConj, InEqConj)

Reduce a conjunction of disequalities; sometimes, this will turn disequalities into inequalities.
Reduce a conjunction of disequalities; sometimes, this will turn disequalities into inequalities.

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
def apply(conj: EquationConj): EquationConj

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
def apply(conj: NegEquationConj): (NegEquationConj, InEqConj)

Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway.
Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway. This will also turn disequalities into inequalities if possible.

Definition Classes
ReduceWithInEqs
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): Option[IdealInt]

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.

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
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.

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
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): ReduceWithInEqs

Create a ReduceWithEqs that can be used underneath num binders.
Create a ReduceWithEqs that can be used underneath num binders. The conversion of de Brujin-variables is done on the fly, which should give a good performance when the resulting ReduceWithEqs is not applied too often (TODO: caching)

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
def reduceNoEqualityInfs(conj: InEqConj): InEqConj

Reduce a conjunction of inequalities without implied equations.
Reduce a conjunction of inequalities without implied equations. (i.e., conj.equalityInfs.isEmpty)

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def upperBound(t: Term): Option[IdealInt]

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.

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
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.

Definition Classes
ReduceWithInEqsImpl → ReduceWithInEqs
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( ... )

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 Doc: package inequalities

class ReduceWithInEqsImpl extends ReduceWithInEqs

Instance Constructors

new ReduceWithInEqsImpl(ineqLowerBound: (LinearCombination) ⇒ Option[IdealInt], containsVariables: Boolean, order: TermOrder)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addInEqs(furtherInEqs: InEqConj): ReduceWithInEqs

def apply(conj: InEqConj): InEqConj

def apply(conj: NegEquationConj, logger: ComputationLogger): (NegEquationConj, InEqConj)

def apply(conj: EquationConj): EquationConj

def apply(conj: NegEquationConj): (NegEquationConj, InEqConj)

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): 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): ReduceWithInEqs

def reduceNoEqualityInfs(conj: InEqConj): InEqConj

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

def toString(): String

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

Deprecated Value Members

def finalize(): Unit

Inherited from ReduceWithInEqs

Inherited from AnyRef

Inherited from Any

Ungrouped