NODE: continued work on implementing a node tree

Signed-off-by: Jeff Carr <[email protected]>

1 files changed, 21 insertions, 5 deletions

diff --git a/debug.go b/debug.go
index d9cb9b5..ae6801d 100644
--- a/debug.go
+++ b/debug.go
@@ -116,12 +116,12 @@ func addTableTab() {
 
 func DebugDataNodeMap() {
 	if Data.NodeMap == nil {
-		log.Println("Data.NodeMap == nil")
+		log.Println("DebugDataNodeMap() NodeMap == nil")
 		return
 	}
-	log.Println("Dumping Data.NodeMap:")
+	log.Println("DebugDataNodeMap():")
 	for name, node := range Data.NodeMap {
-		log.Println("\tData.NodeMap name =", node.Width, node.Height, name)
+		log.Println("\tNode name =", node.Width, node.Height, name)
 		if (node.children == nil) {
 			log.Println("\t\tNo children")
 		} else {
@@ -132,6 +132,22 @@ func DebugDataNodeMap() {
 	}
 }
 
+func DebugDataNodeChildren() {
+	if Data.NodeMap == nil {
+		log.Println("DebugDataNodeChildren() NodeMap == nil")
+		return
+	}
+	log.Println("DebugDataNodeChildren():")
+	for name, node := range Data.NodeMap {
+		log.Println("\tNode name =", node.Width, node.Height, name)
+		if (node.children == nil) {
+			log.Println("\t\tNo children")
+			break
+		}
+		log.Println("\t\tHas children:", node.children)
+	}
+}
+
 func FindNode(name string) *Node {
 	if Data.NodeMap == nil {
 		log.Println("gui.FindNode() gui.Data.NodeMap == nil")
@@ -163,8 +179,8 @@ func DebugNodeChildren() {
 	log.Println("Dumping Data.NodeMap:")
 	for name, node := range Data.NodeMap {
 		log.Println("\tData.NodeMap name =", node.Width, node.Height, name)
-		node.Dump()
-		node.List()
+		// node.Dump()
+		node.ListChildren()
 		// node.SetName("yahoo")
 		// log.Println("\tData.NodeMap node =", node)
 	}