Basis

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def add(polys: Iterable[(Polynomial, BitSet)]): Unit

def add(poly: Polynomial, label: BitSet): Unit

def addBasis(b: Basis): Unit

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def containsUnit: Option[Polynomial]

def copy: Basis

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def get: (Polynomial, BitSet)

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def labelFor(p: Polynomial): BitSet

val labels: HashMap[Polynomial, BitSet]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toArray: Array[Polynomial]

def toList: List[Polynomial]

def toSet: Set[Polynomial]

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit