Class/Object

ap.terfor

TermOrder

Related Docs: object TermOrder | package terfor

Permalink

class TermOrder extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TermOrder
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

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. lazy val atomOrdering: Ordering[Atom]

    Permalink

    Ordering on atoms that lists large atoms last

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def compare(a1: Atom, a2: Atom): Int

    Permalink
  8. def compare(c1: ArithConj, c2: ArithConj): Int

    Permalink
  9. def compare(c1: Seq[LinearCombination], c2: Seq[LinearCombination]): Int

    Permalink
  10. def compare(t1: Term, t2: Term): Int

    Permalink
  11. lazy val constOrdering: Ordering[ConstantTerm]

    Permalink

    Ordering on terms that lists large terms last

  12. def constantsAreMaximal(consts: Set[ConstantTerm]): Boolean

    Permalink

    Determine whether this term order does not consider any constants as bigger than the given constants

  13. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    TermOrder → AnyRef → Any
  15. def extend(newConsts: Seq[ConstantTerm]): TermOrder

    Permalink
  16. def extend(newConst: ConstantTerm): TermOrder

    Permalink
  17. def extend(newConst: ConstantTerm, biggerConstants: Set[ConstantTerm]): TermOrder

    Permalink

    Extend this ordering by inserting a further constant newConst.

    Extend this ordering by inserting a further constant newConst. This constant is inserted so that it gets as big as possible, but such that it is smaller than all constants of the set biggerConstants

  18. def extendPred(newPreds: Seq[Predicate]): TermOrder

    Permalink

    Extend this ordering by inserting further predicate newPreds.

    Extend this ordering by inserting further predicate newPreds. The predicates are inserted so that they get as big as possible

  19. def extendPred(newPred: Predicate): TermOrder

    Permalink

    Extend this ordering by inserting a further predicate newPred.

    Extend this ordering by inserting a further predicate newPred. This predicate is inserted so that it gets as big as possible

  20. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. def findFirstIndex(lt: Term, seq: IndexedSeq[LinearCombination]): Int

    Permalink

    Assuming that seq is a sequence of linear combinations sorted in descending order according to this TermOrder, find the index of the first element whose leading term could be lt

    Assuming that seq is a sequence of linear combinations sorted in descending order according to this TermOrder, find the index of the first element whose leading term could be lt

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

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

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

    Permalink
    Definition Classes
    Any
  25. def isSortingOf[A](x: A): Boolean

    Permalink

    Test whether x is sorting by this TermOrder, or return true if x is not a sorted entity

    Test whether x is sorting by this TermOrder, or return true if x is not a sorted entity

  26. def isSubOrderOf(that: TermOrder, consideredConstants: Set[ConstantTerm], consideredPredicates: Set[Predicate]): Boolean

    Permalink

    Return true iff the term order that is an extension of the order this considering only the constants consideredConstants.

    Return true iff the term order that is an extension of the order this considering only the constants consideredConstants. I.e., this restricted to the constants in consideredConstants is a suborder of that.

  27. def isSubOrderOf(that: TermOrder): Boolean

    Permalink

    Return true iff the term order that is an extension of the order this, i.e., when restricted to the constants that are ordered by this it describes the same order.

    Return true iff the term order that is an extension of the order this, i.e., when restricted to the constants that are ordered by this it describes the same order.

  28. lazy val lcOrdering: Ordering[LinearCombination]

    Permalink

    Ordering on linear combinations that lists large linear combinations last

  29. def makeMaximal(movedConst: ConstantTerm, biggerConstants: Set[ConstantTerm]): TermOrder

    Permalink

    Change this ordering by making the constant const as big as possible, but still smaller than all constants of the set biggerConstants

    Change this ordering by making the constant const as big as possible, but still smaller than all constants of the set biggerConstants

  30. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  33. lazy val orderedConstants: Set[ConstantTerm]

    Permalink

    Return the set of all constants that are sorted by this TermOrder

    Return the set of all constants that are sorted by this TermOrder

  34. lazy val orderedPredicates: Set[Predicate]

    Permalink

    Return the set of all predicates that are sorted by this TermOrder

    Return the set of all predicates that are sorted by this TermOrder

  35. lazy val predOrdering: Ordering[Predicate]

    Permalink

    Ordering on predicates that lists large predicates last

  36. def resetPredicates: TermOrder

    Permalink

    Generate a new TermOrder that coincides with this one, except that all predicates have been removed

    Generate a new TermOrder that coincides with this one, except that all predicates have been removed

  37. def restrict(consts: Set[ConstantTerm]): TermOrder

    Permalink

    Restrict this ordering to the given symbols

  38. lazy val reverseAtomOrdering: Ordering[Atom]

    Permalink

    Ordering on atoms that lists large atoms first

  39. lazy val reverseLCOrdering: Ordering[LinearCombination]

    Permalink

    Ordering on linear combinations that lists large linear combinations first

  40. lazy val reversePredOrdering: Ordering[Predicate]

    Permalink

    Ordering on predicates that lists large predicates first

  41. lazy val reverseTermOrdering: Ordering[Term]

    Permalink

    Ordering on terms that lists large terms first

  42. def sort(constants: Iterator[ConstantTerm]): Seq[ConstantTerm]

    Permalink

    Sort the given constants in ascending order

  43. def sort(constants: Iterable[ConstantTerm]): Seq[ConstantTerm]

    Permalink

    Sort the given constants in ascending order

  44. def sort[A](x: A): A

    Permalink

    If x is a sorted entity, sort it by this TermOrder, or otherwise return the unchanged x

    If x is a sorted entity, sort it by this TermOrder, or otherwise return the unchanged x

  45. def sortPreds(preds: Iterable[Predicate]): Seq[Predicate]

    Permalink

    Sort the given predicates in ascending order

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

    Permalink
    Definition Classes
    AnyRef
  47. lazy val termOrdering: Ordering[Term]

    Permalink

    Ordering on terms that lists large terms last

  48. def toString(): String

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped