|
Class: BTreeInteriorNode (private in BTreeNode
This class is only visible from within
BTreeNode (which is itself a private class of BTree).
Object
|
+--BTree::BTreeNode
|
+--BTree::BTreeNode::BTreeInteriorNode
- Package:
- stx:libbasic2
- Category:
- Collections-Ordered-Trees
- Owner:
- BTree::BTreeNode
- Author:
- Avi Bryant
[license:]
Dual licensed under both SqueakL and MIT.
This enables both base Squeak inclusion and 100% reuse.
accessing
-
> childForKey:">childForKey: aMagnitude
-
Modified (format): / 22-01-2024 / 15:30:25 / cg
-
> existingChildForKey:">existingChildForKey: aMagnitude
-
Unlike #childForKey:, this method looks for a child, but doesn't mess with the tree if it doesn't exist.
-
> existingLeafForKey:">existingLeafForKey: aMagnitude
-
Unlike #leafForKey:, this method looks for a leaf but doesn't mess with the tree if it doesn't exist.
-
> insertKey:value:at:">insertKey: aMagnitude value: anObject at: index
-
-
> updateKey:to:">updateKey: oldMagnitude to: newMagnitude
-
enumerating
-
> childrenDo:">childrenDo: aBlock
-
-
> leavesFrom:to:do:">leavesFrom: start to: end do: aBlock
-
Modified (format): / 22-01-2024 / 15:30:33 / cg
misc
-
> commonKeysWith:keysAndValuesDo:flip:">commonKeysWith: aNode keysAndValuesDo: aBlock flip: aBoolean
-
queries
-
> depth">depth
-
-
> firstChild">firstChild
-
-
> isLeaf">isLeaf
-
-
> leafForKey:">leafForKey: aMagnitude
-
-
> nextSiblingForChild:">nextSiblingForChild: aNode
-
Modified (format): / 22-01-2024 / 15:30:37 / cg
|