From 4f29e633689954185f6ad865693d6fca6b82caf0 Mon Sep 17 00:00:00 2001 From: Jeff Carr Date: Thu, 7 Oct 2021 12:04:48 -0500 Subject: NODE: continued work on implementing a node tree Signed-off-by: Jeff Carr --- debug.go | 52 ++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 52 insertions(+) (limited to 'debug.go') diff --git a/debug.go b/debug.go index 0b383c8..79a5fb3 100644 --- a/debug.go +++ b/debug.go @@ -2,6 +2,7 @@ package gui import ( "fmt" + "os" "log" "time" @@ -112,3 +113,54 @@ func addTableTab() { log.Println("Sleep for 1 second, then try to add new tabs") time.Sleep(1 * time.Second) } + +func DebugDataNodeMap() { + if Data.NodeMap == nil { + log.Println("Data.NodeMap == nil") + return + } + log.Println("Dumping Data.NodeMap:") + for name, node := range Data.NodeMap { + log.Println("\tData.NodeMap name =", node.Width, node.Height, name) + // node.SetName("yahoo") + // log.Println("\tData.NodeMap node =", node) + } +} + +func FindNode(name string) *Node { + if Data.NodeMap == nil { + log.Println("gui.FindNode() gui.Data.NodeMap == nil") + return nil + } + log.Println("gui.FindNode() searching Data.NodeMap:") + for id, node := range Data.NodeMap { + log.Println("\tData.NodeMap name =", node.Width, node.Height, id) + node.Dump() + if (name == node.Name) { + return node + } + newNode := findByName(node, name) + if (newNode != nil) { + return newNode + } + log.Println("gui.FindNode() could not find node name =", name) + os.Exit(-1) + } + log.Println("gui.FindNode() could not find node name =", name) + return nil +} + +func DebugNodeChildren() { + if Data.NodeMap == nil { + log.Println("Data.NodeMap == nil") + return + } + 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.SetName("yahoo") + // log.Println("\tData.NodeMap node =", node) + } +} -- cgit v1.2.3