class Basis extends AnyRef
Represents a collection of polynomials
By keeping a map and a priorityqueue in parallel, the data structure supports: -- Finding the smallest element (keeping it ordered) -- Finding all polynomials with a LT containing some variables
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Basis
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new Basis()(implicit ordering: MonomialOrdering)
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 add(polys: Iterable[(Polynomial, BitSet)]): Unit
- def add(poly: Polynomial, label: BitSet): Unit
- def addBasis(b: Basis): Unit
- 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 containsUnit: Option[Polynomial]
- def copy: Basis
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def get: (Polynomial, BitSet)
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def isEmpty: Boolean
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def labelFor(p: Polynomial): BitSet
- val labels: HashMap[Polynomial, BitSet]
- 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()
- implicit val o: Ordering[Polynomial]
- implicit val ordering: MonomialOrdering
- def polyIterator: Iterator[Polynomial]
- val polyMap: LinkedHashMap[Monomial, List[Polynomial]]
- val polyQueue: PriorityQueue[Polynomial]
- def reduceBy(poly: Polynomial, label: BitSet): Seq[(Polynomial, BitSet)]
Reduce each polynomial in this basis using
poly
, give back all modified polynomials. - def reducePolynomial(andAlso: Basis, poly: Polynomial, label: BitSet): (Polynomial, BitSet)
- def reducePolynomial(poly: Polynomial, label: BitSet): (Polynomial, BitSet)
- def remove(i: Int): Unit
- def simplify: Basis
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toArray: Array[Polynomial]
- def toList: List[Polynomial]
- def toSet: Set[Polynomial]
- def toString(): String
- Definition Classes
- Basis → 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)