Class/Object

at.logic.gapt.utils.ds.trees

ArbitraryTree

Related Docs: object ArbitraryTree | package trees

Permalink

class ArbitraryTree[V] extends ArbitraryAGraph[V] with Tree[V] with NonTerminalNodeA[V, Unit]

Source
trees.scala
Linear Supertypes
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArbitraryTree
  2. NonTerminalNodeA
  3. Tree
  4. TreeA
  5. ArbitraryAGraph
  6. AGraph
  7. EdgeGraph
  8. Graph
  9. AnyRef
  10. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  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. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to any2stringadd[ArbitraryTree[V]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (ArbitraryTree[V], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to ArrowAssoc[ArbitraryTree[V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    Any
  7. val children: List[(LeafTree[V], Unit)]

    Permalink
    Definition Classes
    ArbitraryTreeNonTerminalNodeA
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def contains[T >: AGraph[V]](sub: T): Boolean

    Permalink
    Definition Classes
    ArbitraryAGraphAGraph
  10. def ensuring(cond: (ArbitraryTree[V]) ⇒ Boolean, msg: ⇒ Any): ArbitraryTree[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to Ensuring[ArbitraryTree[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: (ArbitraryTree[V]) ⇒ Boolean): ArbitraryTree[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to Ensuring[ArbitraryTree[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean, msg: ⇒ Any): ArbitraryTree[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to Ensuring[ArbitraryTree[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean): ArbitraryTree[V]

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to Ensuring[ArbitraryTree[V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. final def eq(arg0: AnyRef): Boolean

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def fold[T](leafF: (V) ⇒ T)(unaryF: (T, V) ⇒ T)(binaryF: (T, T, V) ⇒ T): T

    Permalink
    Definition Classes
    ArbitraryTreeTree
  18. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to StringFormat[ArbitraryTree[V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  19. val g: Graph[V]

    Permalink
    Definition Classes
    EdgeGraph
  20. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  21. val hashCode: Int

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

    Permalink
    Definition Classes
    Any
  23. def isTree: Boolean

    Permalink
    Definition Classes
    ArbitraryTreeTree
  24. val lastParent: Tree[V]

    Permalink
    Definition Classes
    ArbitraryTreeArbitraryAGraph
  25. def leaves: Set[LeafTree[V]]

    Permalink
    Definition Classes
    ArbitraryTreeTree
  26. def name: String

    Permalink
    Definition Classes
    ArbitraryAGraphAGraph
  27. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  28. val node: V

    Permalink
    Definition Classes
    ArbitraryTreeNonTerminalNodeA
  29. def nodes[_ >: V](visited: HashSet[AGraph[_]]): HashSet[AGraph[_]]

    Permalink
    Definition Classes
    AGraph
  30. def nodes[_ >: V](): HashSet[AGraph[_]]

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

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

    Permalink
    Definition Classes
    AnyRef
  33. val restParents: List[Tree[V]]

    Permalink
    Definition Classes
    ArbitraryTreeArbitraryAGraph
  34. def size[_ >: V](visited: Map[AGraph[_], Int]): Map[AGraph[_], Int]

    Permalink
    Definition Classes
    AGraph
  35. def size[_ >: V](): Int

    Permalink
    Definition Classes
    AGraph
  36. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    ArbitraryAGraph → AnyRef → Any
  38. def unique_size: Int

    Permalink
    Definition Classes
    AGraph
  39. val v1: V

    Permalink
    Definition Classes
    EdgeGraph
  40. val v2: V

    Permalink
    Definition Classes
    EdgeGraph
  41. val vertex: V

    Permalink
    Definition Classes
    ArbitraryTreeTreeArbitraryAGraphAGraph
  42. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. def [B](y: B): (ArbitraryTree[V], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from ArbitraryTree[V] to ArrowAssoc[ArbitraryTree[V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from NonTerminalNodeA[V, Unit]

Inherited from Tree[V]

Inherited from TreeA[V, Unit]

Inherited from ArbitraryAGraph[V]

Inherited from AGraph[V]

Inherited from EdgeGraph[V]

Inherited from Graph[V]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from ArbitraryTree[V] to any2stringadd[ArbitraryTree[V]]

Inherited by implicit conversion StringFormat from ArbitraryTree[V] to StringFormat[ArbitraryTree[V]]

Inherited by implicit conversion Ensuring from ArbitraryTree[V] to Ensuring[ArbitraryTree[V]]

Inherited by implicit conversion ArrowAssoc from ArbitraryTree[V] to ArrowAssoc[ArbitraryTree[V]]

Ungrouped