object LinearCombination
- Alphabetic
- By Inheritance
- LinearCombination
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
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
- val MINUS_ONE: LinearCombination
- val ONE: LinearCombination
- val ZERO: LinearCombination
- def apply(c: IdealInt): LinearCombination
- def apply(coeff: IdealInt, t: Term, constant: IdealInt, order: TermOrder): LinearCombination
- def apply(coeff: IdealInt, t: Term, order: TermOrder): LinearCombination
- def apply(t: Term, order: TermOrder): LinearCombination
- def apply(terms: Iterable[(IdealInt, Term)], order: TermOrder): LinearCombination
- def apply(terms: Iterator[(IdealInt, Term)], order: TermOrder): LinearCombination
Create a linear combination from an arbitrary set of terms with coefficients
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- def createFromSortedSeq(terms: Iterator[(IdealInt, Term)], order: TermOrder): LinearCombination
Create a linear combination from an array of coefficient-term pairs that is already sorted, flattened, and contracted.
- def createFromSortedSeq(terms: Seq[(IdealInt, Term)], order: TermOrder): LinearCombination
Create a linear combination from an array of coefficient-term pairs that is already sorted, flattened, and contracted.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def sum(coeff1: IdealInt, lc1: LinearCombination, coeff2: IdealInt, lc2: LinearCombination, coeff3: IdealInt, lc3: LinearCombination, order: TermOrder): LinearCombination
Compute the sum of exactly three linear combinations with arbitrary coefficients
- def sum(coeff1: IdealInt, lc1: LinearCombination, coeff2: IdealInt, lc2: LinearCombination, order: TermOrder): LinearCombination
Compute the sum of exactly two linear combinations with arbitrary coefficients.
Compute the sum of exactly two linear combinations with arbitrary coefficients. This method is optimised and tries to avoid the the general case as far as possible
- def sum(lcs: Iterator[(IdealInt, LinearCombination)], order: TermOrder): LinearCombination
- def sum(lcs: Seq[(IdealInt, LinearCombination)], order: TermOrder): LinearCombination
Compute the sum of a collection of linear combinations (together with coefficients).
Compute the sum of a collection of linear combinations (together with coefficients). This method is more optimised than direct usage of
LCBlender
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- object Constant
Extractor applying to
LinearCombination
that are constant. - object Difference
Extractor applying to
LinearCombination
that are the difference between two non-constant terms; with the term with positive coefficient coming first. - object SingleTerm
Extractor applying to
LinearCombination
that are just a single term with coefficient1
. - object ValueOrdering extends PartialOrdering[LinearCombination]
Ordering that relates linear combinations
a, b
if the value ofa
is always going to be in relationship withb
.Ordering that relates linear combinations
a, b
if the value ofa
is always going to be in relationship withb
. E.g.,x + 3 < x + 5
.
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)