A general branch of a tree, where there is a value at the node itself and the number of children is unbounded
Type parameters
- A
-
the underlying type of this Branch
Value parameters
- children
-
the children of this Node
- value
-
the value of the branch
Attributes
- Companion
- object
- Graph
-
- Supertypes
Members list
Value members
Concrete methods
Attributes
- Returns
-
Some(value)
Inherited methods
Method to add the given node to this node
Method to add the given node to this node
Type parameters
- B
-
the underlying type of the new node (and the resulting tree)
Value parameters
- b
-
the value to add, as a Leaf
Attributes
- Returns
-
the resulting tree
- Inherited from:
- Tree
Method to add the given node to this node.
Method to add the given node to this node.
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
- Inherited from:
- Tree
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
NOTE: that this is NOT tail-recursive
NOTE: that this is NOT tail-recursive
NOTE: I don't think we can use Parent.traverse for depth. Could be wrong.
Attributes
- Returns
-
the depth of the subtree
- Inherited from:
- Tree
Type parameters
- B
-
the type of b
Value parameters
- p
-
the predicate to be applied to the value of each node in turn (depth first)
Attributes
- Returns
-
Some(node) where node is the first node to be found that satisfies the predicate p
- Inherited from:
- Tree
Type parameters
- B
-
the type of b
Value parameters
- b
-
value to be found, looking at the value of each node in turn (depth first)
Attributes
- Returns
-
Some(node) where node is the first node to be found with value b
- Inherited from:
- Tree
Determine if this tree has a subtree matching b which includes c
Determine if this tree has a subtree matching b which includes c
Type parameters
- B
-
the type of subtree and element
Value parameters
- element
-
the value of the element to be found in the subtree
- subtree
-
the value of the subtree to be searched
Attributes
- Returns
-
true if value element is found in the sub-tree defined by subtree
- Inherited from:
- Tree
Method to determine if this Tree includes the given node
Method to determine if this Tree includes the given node
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:
- Tree
Determine if this subtree includes a value equal to b
Determine if this subtree includes a value equal to b
CONSIDER renaming this back to just includes (as it was previously)
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:
- Tree
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
Iterate on the values of this tree
Iterate on the values of this tree
Value parameters
- depthFirst
-
if true then we iterate depth-first, else breadth-first (defaults to true)
Attributes
- Returns
-
an iterator of values
- Inherited from:
- Tree
Method to determine if this subtree is "like" the given node (without recursion)
Method to determine if this subtree is "like" the given node (without recursion)
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:
- Tree
Iterate on the nodes of this branch
Iterate on the nodes of this branch
NOTE: this method is not currently implemented in a tail-recursive manner.
Value parameters
- depthFirst
-
if true then we iterate depth-first, else breadth-first
Attributes
- Returns
-
an iterator of nodes
- Inherited from:
- Branch
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
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
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
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:
- Tree