IndexedLeaf

com.phasmidsoftware.lascala.tree.IndexedLeaf
case class IndexedLeaf[A](lIndex: Option[Long], rIndex: Option[Long], value: A) extends AbstractLeaf[A], TreeIndex, IndexedNode[A]

Case class for an indexed leaf

Type parameters

A

the underlying type of this Leaf

Value parameters

lIndex

the (optional) index to the left of the leaf

rIndex

the (optional) index to the right of the leaf

value

the leaf value

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait IndexedNode[A]
trait TreeIndex
class AbstractLeaf[A]
trait Node[A]
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

def +[K, B >: A : TreeBuilder](node: Node[B]): Tree[B]

Method to add the given node to this node specifically

Method to add the given node to this node specifically

Type parameters

B

the underlying type of the new node (and the resulting tree)

Value parameters

node

the node to add

Attributes

Returns

the resulting tree

override def depth: Int

Method to determine the depth of the tree headed by this Node. Ideally, we would put this method into Tree, but because of the specific (non-tail-recursive) implementation, it is actually more logical to declare it here.

Method to determine the depth of the tree headed by this Node. Ideally, we would put this method into Tree, but because of the specific (non-tail-recursive) implementation, it is actually more logical to declare it here.

Attributes

Returns

the maximum depth of the tree headed by this Node

Definition Classes
override def toString: String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Any

Inherited methods

def compareValues[B >: A](n: Node[B]): Maybe

Method to determine if this Node's value is equal to node n's value WITHOUT any recursion.

Method to determine if this Node's value is equal to node n's value WITHOUT any recursion.

Type parameters

B

the underlying type of n

Value parameters

n

the node to be compared

Attributes

Returns

true if this is "like" n

Inherited from:
Node
def get: Some[A]

Attributes

Returns

the value of this node, if any

Inherited from:
AbstractLeaf
def includes[B >: A](node: Node[B]): Boolean

Method to determine if this Node includes the given node in its subtree (if any)

Method to determine if this Node includes the given node in its subtree (if any)

Type parameters

B

the underlying type of n

Value parameters

node

the node to be searched for

Attributes

Returns

true if node n is found in the sub-tree defined by this

Inherited from:
AbstractLeaf
def includesValue[B >: A](b: B): Boolean

Determine if this subtree includes a value equal to b

Determine if this subtree includes a value equal to b

CONSIDER renaming this as includes

Type parameters

B

the type of b

Value parameters

b

the value to be searched

Attributes

Returns

true if value b is found in the sub-tree defined by this

Inherited from:
AbstractLeaf
def isLeaf: Boolean

Method to determine if this Node is a leaf or a branch node

Method to determine if this Node is a leaf or a branch node

Attributes

Returns

true if this Node is a leaf

Inherited from:
Node
def nodeIterator(depthFirst: Boolean): Iterator[Node[A]]

Iterate on the nodes which are the descendants of this node (including this node at start or end of result)

Iterate on the nodes which are the descendants of this node (including this node at start or end of result)

Value parameters

depthFirst

if true then we iterate depth-first, else breadth-first (defaults to true)

Attributes

Returns

an iterator of nodes

Inherited from:
AbstractLeaf
def productElementNames: Iterator[String]

An iterator over the names of all the elements of this product.

An iterator over the names of all the elements of this product.

Attributes

Inherited from:
Product
def productIterator: Iterator[Any]

An iterator over all the elements of this product.

An iterator over all the elements of this product.

Attributes

Returns

in the default implementation, an Iterator[Any]

Inherited from:
Product
def replaceNode[B >: A : TreeBuilder](x: Node[B], y: Node[B])(f: (Node[B], Node[B]) => Boolean): Tree[B]

Method to replace a particular node in this tree with another node, but otherwise return a copy of this tree.

Method to replace a particular node in this tree with another node, but otherwise return a copy of this tree.

CONSIDER moving this into Tree since it isn't really a Node method

Type parameters

B

the underlying type of the new node (and the resulting tree)

Value parameters

f

function to determine if two nodes are the same

x

the node to be replaced with y

y

the node to replace x

Attributes

Returns

the resulting tree

Inherited from:
Node
def size: Int

Calculate the size of this node's subtree

Calculate the size of this node's subtree

Attributes

Returns

the size of the subtree

Inherited from:
AbstractLeaf