Packages

p

ap.terfor

linearcombination

package linearcombination

Ordering
  1. Alphabetic
Visibility
  1. Public
  2. Protected

Type Members

  1. final class ArrayLinearCombination extends LinearCombination

    General implementation of linear combinations, with an unbounded number of terms

  2. class LCBlender extends PeekIterator[(IdealInt, Term)]

    Class for mixing together a number of LinearCombinations that are sorted by the same TermOrder (namely by order)

  3. sealed abstract class LinearCombination extends Term with SortedWithOrder[LinearCombination] with IndexedSeq[(IdealInt, Term)]

    Class for representing linear combinations of terms.

    Class for representing linear combinations of terms. Objects can be considered as finite mappings from terms to integers (i.e., to the coefficients). The terms are stored in an array that is sorted in descending order according to a TermOrder.

  4. final class LinearCombination0 extends LinearCombination

    Constant linear combinations

  5. final class LinearCombination1 extends LinearCombination

    Linear combinations with exactly one non-constant term

  6. final class LinearCombination2 extends LinearCombination

    Linear combinations with exactly two non-constant term

  7. class ScalingIterator extends Iterator[(IdealInt, Term)]

Value Members

  1. object LinearCombination
  2. object ScalingIterator

Ungrouped