TermsOps

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

10. def exists(matcher: (Sort) ⇒ Boolean)(sort: Sort): Boolean

11. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12. def fold[T](f: (Sort, Seq[T]) ⇒ T)(sort: Sort): T

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

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

17. final def notify(): Unit

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    Definition Classes

    AnyRef

19. def postMap(f: (Sort) ⇒ Option[Sort])(sort: Sort): Sort

    Applies a function to each sort in post-order

    Applies a function to each sort in post-order

    The mapping is done starting from the leaf of the sort tree. For each node, first apply recursively the postMap on the children from left to right, then apply the function to the current sort with the new children.

    f

    the function to apply. If it returns None then do not update the corresponding node.

    sort

    the sort to traverse

    returns

    the new sort after applying the mapping

20. def postTraversal(f: (Sort) ⇒ Unit)(sort: Sort): Unit

21. def preMap(f: (Sort) ⇒ Option[Sort])(sort: Sort): Sort

    Applies a function to each sort in pre-order

    Applies a function to each sort in pre-order

    The mapping is done starting from the root of the sort tree. For each node, first apply the function to the current node, then do it recursively on the children from left to right.

    f

    the function to apply. If it returns None then do not update the corresponding node

    sort

    the sort to traverse

    returns

    the new sort after applying the mapping

    Note

    this operation can diverge if f is not well formed

22. def preTraversal(f: (Sort) ⇒ Unit)(sort: Sort): Unit

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

    Definition Classes

    AnyRef

24. def toString(): String

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )