Class

ap.basetypes

Tree

Related Doc: package basetypes

Permalink

case class Tree[D](d: D, children: List[Tree[D]]) extends Product with Serializable

Polymorphic class for representing finite trees, with unbounded branching.

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Tree
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Tree(d: D, children: List[Tree[D]])

    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. val children: List[Tree[D]]

    Permalink
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. val d: D

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

    Permalink
    Definition Classes
    AnyRef
  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def foreach[U](f: (D) ⇒ U): Unit

    Permalink
  11. def foreachPostOrder[U](f: (D) ⇒ U): Unit

    Permalink
  12. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    Any
  14. def iterator: Iterator[D] { val todo: scala.collection.mutable.ArrayStack[ap.basetypes.Tree[D]] }

    Permalink
  15. def map[E](f: (D) ⇒ E): Tree[E]

    Permalink
  16. def mapUpDown(f: (D) ⇒ D): Tree[D]

    Permalink
  17. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  20. def prettyPrint(indent: String): Unit

    Permalink
  21. def prettyPrint: Unit

    Permalink
  22. def size: Int

    Permalink
  23. def subtrees: Tree[Tree[D]]

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

    Permalink
    Definition Classes
    AnyRef
  25. def toList: List[D]

    Permalink
  26. def toSeq: List[D]

    Permalink
  27. def toSet: Set[D]

    Permalink
  28. def unzip[D1, D2](implicit asPair: (D) ⇒ (D1, D2)): (Tree[D1], Tree[D2])

    Permalink
  29. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. def zip[E](t: Tree[E]): Tree[(D, E)]

    Permalink

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped