class TreeLayout extends AnyRef
The TreeLayout class is used to display multi-way trees with the root at the
top and leaves at the bottom. It is translated from the pseudo-code given in
- See also
onlinelibrary.wiley.com/doi/10.1002/spe.713/pdf
Appendix A of Christoph Buchheim, Michael Junger and Sebastian Leipert paper.
- Alphabetic
- By Inheritance
- TreeLayout
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
ancestor(vim: Int, v: Int): Int
Return ancestor of 'vim' or default ancestor.
Return ancestor of 'vim' or default ancestor.
- vim
the inside left node id
- v
the current node id
-
def
apportion(v: Int): Unit
Apportion/combine new subtree with the previous subtrees.
Apportion/combine new subtree with the previous subtrees. Note: i/o means inside/outside; p/m means +/- (right/left)
- v
the current node id
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
executeShifts(v: Int): Unit
Executed the shifts computed in 'moveSubtree'.
Executed the shifts computed in 'moveSubtree'.
- v
the current node id
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
firstWalk(v: Int): Unit
Compute a preliminary x-coordinate for node 'v'.
Compute a preliminary x-coordinate for node 'v'.
- v
the current node id
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
layout(): (Array[Int], Array[Int])
Layout the nodes in tree 't' creating 'x' and 'y' coordinates for each.
-
def
leftmostSibling(v: Int): Int
Return the leftmost sibling of 'v'.
Return the leftmost sibling of 'v'.
- v
the current node id
-
def
moveSubtree(wm: Int, wp: Int, shift: Int): Unit
Move the subtree rooted at 'wp'.
Move the subtree rooted at 'wp'.
- wm
the left node id
- wp
the right node id
- shift
the amount of shift in x-coordinate
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nextLeft(v: Int): Int
Return the leftmost child of 'v', otherwise the thread of 'v'.
Return the leftmost child of 'v', otherwise the thread of 'v'.
- v
the current node id
-
def
nextRight(v: Int): Int
Return the rightmost child of 'v', otherwise the thread of 'v'.
Return the rightmost child of 'v', otherwise the thread of 'v'.
- v
the current node id
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
secondWalk(v: Int, m: Int): Unit
Assign 'x' and 'y' coordinates for each node.
Assign 'x' and 'y' coordinates for each node.
- v
the current node id
- m
the x position modifier
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )