Fixed inspector presenter

Author: jordanmontt

src/BaselineOfContainersAVLTree/BaselineOfContainersAVLTree.class.st

@@ -23,9 +23,8 @@ BaselineOfContainersAVLTree >> baseline: spec [
 
 		"Groups"
 		spec
-			group: 'Core'
-			with: #( 'Containers-AVL-Tree' 'Containers-AVL-Tree-Inspector' );
+			group: 'Core' with: #( 'Containers-AVL-Tree' 'Containers-AVL-Tree-Inspector' );
 			group: 'Tests' with: #( 'Containers-AVL-Tree-Tests' ).
 
 		spec group: 'default' with: #( 'Core' 'Tests' ) ]
-]
+]

src/Containers-AVL-Tree-Inspector/CTAVLTree.extension.st

@@ -1,9 +1,13 @@
 Extension { #name : 'CTAVLTree' }
 
 { #category : '*Containers-AVL-Tree-Inspector' }
-CTAVLTree >> inspectorCanvas [
+CTAVLTree >> inspectorCanvas: aBuilder [
+
 	<inspectorPresentationOrder: 90 title: 'AVL'>
-	^ CTAVLTreeVisualizer new
-		tree: self;
-		asPresenter
+	^ (aBuilder instantiate: SpRoassalInspectorPresenter)
+		  canvas: (CTAVLTreeVisualizer new
+				   tree: self;
+				   build;
+				   canvas);
+		  yourself
 ]

src/Containers-AVL-Tree-Tests/CTAVLTreeTest.class.st

@@ -38,6 +38,16 @@ CTAVLTreeTest >> testAddSingleElement [
 	self assert: tree height equals: 1
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testAllChildren [
+
+	| elements |
+	elements := (1 to: 10000) collect: [ :i | Random new nextIntegerBetween: 1 and: 100000000 ].
+	tree addAll: elements.
+
+	self assertCollection: (tree allChildren collect: #contents) hasSameElements: elements
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testAnySatisfy [
 

src/Containers-AVL-Tree/CTAVLAbstractNode.class.st

@@ -28,6 +28,12 @@ CTAVLAbstractNode >> balanceFactor [
 	^ self subclassResponsibility 
 ]
 
+{ #category : 'accessing' }
+CTAVLAbstractNode >> children [
+
+	^ {  }
+]
+
 { #category : 'accessing' }
 CTAVLAbstractNode >> contents [
 
@@ -95,6 +101,12 @@ CTAVLAbstractNode >> inOrderDo: aBlock [
 	^ self subclassResponsibility
 ]
 
+{ #category : 'testing' }
+CTAVLAbstractNode >> isBalanced [
+
+	^ false
+]
+
 { #category : 'testing' }
 CTAVLAbstractNode >> isEmpty [
 
@@ -107,6 +119,12 @@ CTAVLAbstractNode >> isLeaf [
 	^ self subclassResponsibility 
 ]
 
+{ #category : 'testing' }
+CTAVLAbstractNode >> isNilNode [
+
+	^ false
+]
+
 { #category : 'accessing' }
 CTAVLAbstractNode >> parent [
 

src/Containers-AVL-Tree/CTAVLNilNode.class.st

@@ -102,6 +102,12 @@ CTAVLNilNode >> isLeaf [
 	^ false
 ]
 
+{ #category : 'testing' }
+CTAVLNilNode >> isNilNode [
+
+	^ true
+]
+
 { #category : 'enumerating' }
 CTAVLNilNode >> postOrderDo: aBlock [
 

src/Containers-AVL-Tree/CTAVLNode.class.st

@@ -42,6 +42,12 @@ CTAVLNode >> balanceFactor [
 	^ left height - right height
 ]
 
+{ #category : 'accessing' }
+CTAVLNode >> children [
+
+	^ { left . right }
+]
+
 { #category : 'accessing' }
 CTAVLNode >> contents [
 
@@ -137,6 +143,12 @@ CTAVLNode >> initialize [
 	height := 1
 ]
 
+{ #category : 'testing' }
+CTAVLNode >> isBalanced [
+
+	^ (left height - right height) abs <= 1
+]
+
 { #category : 'testing' }
 CTAVLNode >> isEmpty [
 
@@ -298,7 +310,7 @@ CTAVLNode >> successorOf: anObject [
 { #category : 'private' }
 CTAVLNode >> updateHeight [
 
-height := 1 + (left height max: right height)
+	height := 1 + (left height max: right height)
 ]
 
 { #category : 'private' }

src/Containers-AVL-Tree/CTAVLTree.class.st

@@ -36,6 +36,21 @@ CTAVLTree >> addAll: aCollection [
 	^ aCollection
 ]
 
+{ #category : 'accessing' }
+CTAVLTree >> allChildren [
+
+	| currentNode nodesToVisit children |
+	children := Set new.
+	nodesToVisit := LinkedList with: root.
+
+	[ nodesToVisit isNotEmpty ] whileTrue: [ 
+		currentNode := nodesToVisit removeFirst.
+		children add: currentNode.
+		nodesToVisit addAll: (currentNode children reject: #isNilNode) ].
+
+	^ children
+]
+
 { #category : 'enumerating' }
 CTAVLTree >> anySatisfy: aBlock [