Trait/Object

com.github.jonnylaw.model

Tree

Related Docs: object Tree | package model

Permalink

sealed trait Tree[A] extends AnyRef

A binary tree implementation, to be used when combining models Hopefully this simplifies "zooming" into values and changing them

Self Type
Tree[A]
Linear Supertypes
AnyRef, Any
Known Subclasses
Branch, Leaf
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Tree
  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. def +|(that: Tree[A]): Tree[A]

    Permalink

    Add a Tree to the left of the tree

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

    Permalink
    Definition Classes
    AnyRef → Any

  5. def add(that: Tree[A])(implicit N: Numeric[A]): Tree[A]

    Permalink

    Add two (same shape) trees together, each leaf node is added

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. def flatten: List[A]

    Permalink

  12. def fold[B](z: B)(f: (A) ⇒ B)(g: (B, B) ⇒ B): B

    Permalink

    Reduce the tree to a value, by recursively applying fold to the branches, combining the results using g and transforming the leaves using f

  13. def foldMap(f: (A) ⇒ A)(implicit m: Monoid[A]): A

    Permalink

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

    Permalink
    Definition Classes
    AnyRef → Any

  15. def getNode(n: Int): A

    Permalink

    Get the contents of the leaf node element at position n from the left, indexed from 0

    Get the contents of the leaf node element at position n from the left, indexed from 0

    n

    the node position from the left

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. def prettyPrint: String

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  24. final def wait(): Unit

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

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

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

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

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

  27. def zipWith[B, C](that: Tree[B])(f: (A, B) ⇒ C): Tree[C]

    Permalink

    Combine two trees which are the same shape using the function f

  28. def |+(that: Tree[A]): Tree[A]

    Permalink

    Add a Tree to the right of the tree

Inherited from AnyRef

Inherited from Any

Ungrouped