NODE: continued work on implementing a node tree

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

1 files changed, 5 insertions, 0 deletions

diff --git a/debug.go b/debug.go
index 79a5fb3..d9cb9b5 100644
--- a/debug.go
+++ b/debug.go
@@ -122,6 +122,11 @@ func DebugDataNodeMap() {
 	log.Println("Dumping Data.NodeMap:")
 	for name, node := range Data.NodeMap {
 		log.Println("\tData.NodeMap name =", node.Width, node.Height, name)
+		if (node.children == nil) {
+			log.Println("\t\tNo children")
+		} else {
+			log.Println("\t\tHas children:", node.children)
+		}
 		// node.SetName("yahoo")
 		// log.Println("\tData.NodeMap node =", node)
 	}