Class/Object

scalaz

TreeLoc

Related Docs: object TreeLoc | package scalaz

Permalink

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
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])

    Permalink

    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

    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. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def cojoin: TreeLoc[TreeLoc[A]]

    Permalink
  7. def delete: Option[TreeLoc[A]]

    Permalink

    Delete the current node and all its children.

  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 find(p: (TreeLoc[A]) ⇒ Boolean): Option[TreeLoc[A]]

    Permalink

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

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

    Permalink

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

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

    Permalink

    Select the leftmost child of the current node.

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

    Permalink

    Select the nth child of the current node.

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

    Permalink
    Definition Classes
    AnyRef → Any
  15. def getLabel: A

    Permalink

    Get the label of the current node.

  16. def hasChildren: Boolean

    Permalink

    True if the current node has children.

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

    Permalink

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

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

    Permalink

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

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

    Permalink

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

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

    Permalink

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

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

    Permalink

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

  22. def isChild: Boolean

    Permalink

    True if the current node is not the root node.

  23. def isFirst: Boolean

    Permalink

    True if the current node has no left siblings.

  24. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  25. def isLast: Boolean

    Permalink

    True if the current node has no right siblings.

  26. def isLeaf: Boolean

    Permalink

    True if the current node has no children.

  27. def isRoot: Boolean

    Permalink

    True if the current node is the root node.

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

    Permalink

    Select the rightmost child of the current node.

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

    Permalink

    Select the left sibling of the current node.

  30. val lefts: TreeForest[A]

    Permalink

    The left siblings of the current node.

  31. def map[B](f: (A) ⇒ B): TreeLoc[B]

    Permalink

    Maps the given function over the elements.

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

    Permalink

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

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

    Permalink

    Modify the current node with the given function.

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

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

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

    Permalink
    Definition Classes
    AnyRef
  37. def parent: Option[TreeLoc[A]]

    Permalink

    Select the parent of the current node.

  38. val parents: Parents[A]

    Permalink

    The parent contexts of the current node.

  39. def path: Stream[A]

    Permalink

    The path from the focus to the root.

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

    Permalink

    Select the right sibling of the current node.

  41. val rights: TreeForest[A]

    Permalink

    The right siblings of the current node.

  42. def root: TreeLoc[A]

    Permalink

    Select the root node of the tree.

    Select the root node of the tree.

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

    Permalink

    Set the label of the current node.

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

    Permalink

    Replace the current node with the given one.

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

    Permalink
    Definition Classes
    AnyRef
  46. def toForest: TreeForest[A]

    Permalink

    Get the entire forest represented by this zipper.

  47. def toTree: Tree[A]

    Permalink

    Get the entire tree represented by this zipper.

  48. val tree: Tree[A]

    Permalink

    The currently selected node.

  49. final def wait(): Unit

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped