LinearCombination

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object CoeffTermWithOffset

Extractor applying to LinearCombination that are just a single term with some coefficient and a constant offset.

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.

val MINUS_ONE: LinearCombination

val ONE: LinearCombination

object SingleTerm

Extractor applying to LinearCombination that are just a single term with coefficient 1.

object TwoTermsWithOffset

Extractor applying to LinearCombination that are sums of two terms with some coefficients and a constant offset.

object ValueOrdering extends PartialOrdering[LinearCombination]

Ordering that relates linear combinations a, b if the value of a is always going to be in relationship with b.

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

def clone(): AnyRef

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

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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.

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).

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit