Packages

final case class TreeLoc[A](tree: Tree[A], lefts: TreeForest[A], rights: TreeForest[A], parents: Parents[A]) extends Product with Serializable

A rose-tree zipper. Represents a scalaz.Tree together with a position in that tree. Provides navigation, persistent update, insertion, and deletes.

tree

The currently selected node.

lefts

The left siblings of the current node.

rights

The right siblings of the current node.

parents

The parent contexts of the current node.

Source
TreeLoc.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TreeLoc
  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 TreeLoc(tree: Tree[A], lefts: TreeForest[A], rights: TreeForest[A], parents: Parents[A])

    tree

    The currently selected node.

    lefts

    The left siblings of the current node.

    rights

    The right siblings of the current node.

    parents

    The parent contexts of the current node.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. def cojoin: TreeLoc[TreeLoc[A]]
  7. def delete: Option[TreeLoc[A]]

    Delete the current node and all its children.

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  10. def find(p: (TreeLoc[A]) ⇒ Boolean): Option[TreeLoc[A]]

    Select the first descendant node of the current node that satisfies the given predicate.

  11. def findChild(p: (Tree[A]) ⇒ Boolean): Option[TreeLoc[A]]

    Select the first immediate child of the current node that satisfies the given predicate.

  12. def firstChild: Option[TreeLoc[A]]

    Select the leftmost child of the current node.

  13. def getChild(n: Int): Option[TreeLoc[A]]

    Select the nth child of the current node.

  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def getLabel: A

    Get the label of the current node.

  16. def hasChildren: Boolean

    True if the current node has children.

  17. def insertDownAt(n: Int, t: Tree[A]): Option[TreeLoc[A]]

    Insert the given node as the nth child of the current node and give it focus.

  18. def insertDownFirst(t: Tree[A]): TreeLoc[A]

    Insert the given node as the first child of the current node and give it focus.

  19. def insertDownLast(t: Tree[A]): TreeLoc[A]

    Insert the given node as the last child of the current node and give it focus.

  20. def insertLeft(t: Tree[A]): TreeLoc[A]

    Insert the given node to the left of the current node and give it focus.

  21. def insertRight(t: Tree[A]): TreeLoc[A]

    Insert the given node to the right of the current node and give it focus.

  22. def isChild: Boolean

    True if the current node is not the root node.

  23. def isFirst: Boolean

    True if the current node has no left siblings.

  24. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  25. def isLast: Boolean

    True if the current node has no right siblings.

  26. def isLeaf: Boolean

    True if the current node has no children.

  27. def isRoot: Boolean

    True if the current node is the root node.

  28. def lastChild: Option[TreeLoc[A]]

    Select the rightmost child of the current node.

  29. def left: Option[TreeLoc[A]]

    Select the left sibling of the current node.

  30. val lefts: TreeForest[A]
  31. def map[B](f: (A) ⇒ B): TreeLoc[B]

    Maps the given function over the elements.

  32. def modifyLabel(f: (A) ⇒ A): TreeLoc[A]

    Modify the label at the current node with the given function.

  33. def modifyTree(f: (Tree[A]) ⇒ Tree[A]): TreeLoc[A]

    Modify the current node with the given function.

  34. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  36. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  37. def parent: Option[TreeLoc[A]]

    Select the parent of the current node.

  38. val parents: Parents[A]
  39. def path: Stream[A]

    The path from the focus to the root.

  40. def right: Option[TreeLoc[A]]

    Select the right sibling of the current node.

  41. val rights: TreeForest[A]
  42. def root: TreeLoc[A]

    Select the root node of the tree.

    Select the root node of the tree.

    Annotations
    @tailrec()
  43. def setLabel(a: A): TreeLoc[A]

    Set the label of the current node.

  44. def setTree(t: Tree[A]): TreeLoc[A]

    Replace the current node with the given one.

  45. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  46. def toForest: TreeForest[A]

    Get the entire forest represented by this zipper.

  47. def toTree: Tree[A]

    Get the entire tree represented by this zipper.

  48. val tree: Tree[A]
  49. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped