Attributes
- Companion
- class
- Graph
-
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
AbstractBinaryTree.type
Members list
Value members
Concrete methods
Determine whether all of the nodes on the left are ordered before all the nodes on the right
Determine whether all of the nodes on the left are ordered before all the nodes on the right
Type parameters
- A
-
the underlying type of the nodes and comparisons
Value parameters
- anL
-
the left-node
- anR
-
the right-node
Attributes
- Returns
-
true if the proposition is proven
Determine whether the value on the left is ordered before all the nodes on the right
Determine whether the value on the left is ordered before all the nodes on the right
NOTE: this is recursive
Type parameters
- A
-
the underlying type of the nodes and comparisons
Value parameters
- ans
-
the left-node-sequence
- bns
-
the right-node-sequence
Attributes
- Returns
-
true if the proposition is proven
Determine whether the value on the left is ordered before all the nodes on the right
Determine whether the value on the left is ordered before all the nodes on the right
NOTE: this is recursive
Type parameters
- A
-
the underlying type of the nodes and comparisons
Value parameters
- an
-
the left-node
- bns
-
the right-node-sequence
Attributes
- Returns
-
true if the proposition is proven
Determine whether the value on the left is ordered before all the nodes on the right
Determine whether the value on the left is ordered before all the nodes on the right
NOTE: this is recursive
Type parameters
- A
-
the underlying type of the nodes and comparisons
Value parameters
- a
-
the left-value
- an
-
the right-node
Attributes
- Returns
-
true if the proposition is proven
Determine whether the value on the left is ordered before all the nodes on the right
Determine whether the value on the left is ordered before all the nodes on the right
Type parameters
- A
-
the underlying type of the nodes and comparisons
Value parameters
- a
-
the left-value
- as
-
the right-iterator
Attributes
- Returns
-
true if the proposition is proven
Determine whether the value on the left is ordered before the value on the right
Determine whether the value on the left is ordered before the value on the right
Type parameters
- A
-
the underlying type of the nodes and comparisons
Value parameters
- a
-
the left-value
- b
-
the right-value
Attributes
- Returns
-
-1 if proposition is true; 0 if they are equal; 1 if the proposition if false
Method to determine if node a compares as less than node b
Method to determine if node a compares as less than node b
Type parameters
- A
-
the underlying node type
Value parameters
- a
-
node a
- b
-
node b
Attributes
- Returns
-
true if node a compares as less than node b
Given a sequence of comparison values, determine if the result is true, false or maybe.
Given a sequence of comparison values, determine if the result is true, false or maybe.
Value parameters
- is
-
the comparison values as a sequence of Ints (either -1, 0, or 1)
Attributes
- Returns
-
Some(true) if all the values are -1, Some(false) if all the values are +1, otherwise None.
method to determine if there is an overlap between the values of tree n1 and tree n2
method to determine if there is an overlap between the values of tree n1 and tree n2
Type parameters
- A
-
the underlying tree type
Value parameters
- n1
-
the first tree (order is not important)
- n2
-
the second tree
Attributes
- Returns
-
true if there is an overlap of values, that's to say, the values cannot be completely separated.
method to determine if there is an overlap between a value a and the values of tree n
method to determine if there is an overlap between a value a and the values of tree n
Type parameters
- A
-
the underlying tree type
Value parameters
- a
-
the value to compare
- n
-
the tree
Attributes
- Returns
-
true if there is an overlap of values, that's to say, the values cannot be completely separated.