RichLinearCombinationSeq

final def !=(arg0: Any): Boolean

final def ##(): Int

def ***(that: Term): Seq[LinearCombination]

def ***(that: Seq[Term]): Seq[LinearCombination]

def *:*(that: Seq[Term]): LinearCombination

The dot-product of two vectors

def +++(that: Term): Seq[LinearCombination]

def +++(that: Seq[Term]): Seq[LinearCombination]

def ---(that: Term): Seq[LinearCombination]

def ---(that: Seq[Term]): Seq[LinearCombination]

def <(that: Term): InEqConj

def <(that: Seq[Term]): InEqConj

def <=(that: Term): InEqConj

def <=(that: Seq[Term]): InEqConj

def =/=(that: Term): Conjunction

Disequation of vectors (vector differs in at least one component)

def =/=(that: Seq[Term]): Conjunction

Disequation of vectors (vectors differ in at least one component)

def =/=/=(that: Term): NegEquationConj

Component-wise disequation of vectors (all components of the vectors are different)

def =/=/=(that: Seq[Term]): NegEquationConj

Component-wise disequation of vectors (all components of the vectors are different)

final def ==(arg0: Any): Boolean

def ===(that: Term): EquationConj

Component-wise equation

def ===(that: Seq[Term]): EquationConj

Equation of two vectors

def >(that: Term): InEqConj

def >(that: Seq[Term]): InEqConj

def >=(that: Term): InEqConj

def >=(that: Seq[Term]): 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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit val o: TermOrder

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

def toString(): String

def unary_-: Seq[LinearCombination]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit