Object/Class

ap.theories.nia

Polynomial

Related Docs: class Polynomial | package nia

Permalink

object Polynomial extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Polynomial
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type CoeffMonomialList = List[CoeffMonomial]

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. def fromLinearCombination(lc: LinearCombination)(implicit ordering: MonomialOrdering): Polynomial

    Permalink

    Converts an LinearCombination (Princess) to a Polynomial (Groebner).

    Converts an LinearCombination (Princess) to a Polynomial (Groebner). This method assumes that the TermOrder and the used MonomialOrdering are compatible, so that the elements of the linear combination are sorted correctly.

  10. def fromLinearCombinationGen(lc: LinearCombination)(implicit ordering: MonomialOrdering): Polynomial

    Permalink

    Converts an LinearCombination (Princess) to a Polynomial (Groebner).

  11. def fromMulAtom(a: Atom)(implicit ordering: MonomialOrdering): Polynomial

    Permalink

    Converts an atom (Princess) to a Polynomial (Groebner).

    Converts an atom (Princess) to a Polynomial (Groebner). This method assumes that the TermOrder and the used MonomialOrdering are compatible, so that the elements of the arguments are sorted correctly.

  12. def fromMulAtomGen(a: Atom)(implicit ordering: MonomialOrdering): Polynomial

    Permalink

    Converts an atom (Princess) to a Polynomial (Groebner).

  13. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped