diff options
Diffstat (limited to 'addNode.go')
| -rw-r--r-- | addNode.go | 14 |
1 files changed, 7 insertions, 7 deletions
@@ -18,7 +18,7 @@ func (me *TreeInfo) AddNode(a *widget.Action) *Node { n.Strings = make(map[string]int) if a.WidgetType == widget.Root { - log.Info("AddNode() Root") + log.Log(TREE, "AddNode() Root") n.Parent = n me.treeRoot = n return n @@ -40,8 +40,8 @@ func (me *TreeInfo) AddNode(a *widget.Action) *Node { log.Warn("AddNode() ERROR n.Parent == nil", a.WidgetId, a.ParentId, a.WidgetType) return n } - log.Warn("AddNode() Adding to parent =", p.ParentId, p.WidgetType, p.GetProgName()) - log.Warn("AddNode() Adding child =", n.ParentId, n.WidgetType, n.GetProgName()) + log.Log(TREE, "AddNode() Adding to parent =", p.ParentId, p.WidgetType, p.GetProgName()) + log.Log(TREE, "AddNode() Adding child =", n.ParentId, n.WidgetType, n.GetProgName()) p.children = append(p.children, n) return n } @@ -49,14 +49,14 @@ func (me *TreeInfo) AddNode(a *widget.Action) *Node { func (n *Node) DeleteNode() { p := n.Parent for i, child := range p.children { - log.Warn("parent has child:", i, child.WidgetId, child.GetProgName()) + log.Log(TREE, "parent has child:", i, child.WidgetId, child.GetProgName()) if n == child { - log.Warn("Found child ==", i, child.WidgetId, child.GetProgName()) - log.Warn("Found n ==", i, n.WidgetId, n.GetProgName()) + log.Log(TREE, "Found child ==", i, child.WidgetId, child.GetProgName()) + log.Log(TREE, "Found n ==", i, n.WidgetId, n.GetProgName()) p.children = append(p.children[:i], p.children[i+1:]...) } } for i, child := range p.children { - log.Warn("parent now has child:", i, child.WidgetId, child.GetProgName()) + log.Log(TREE, "parent now has child:", i, child.WidgetId, child.GetProgName()) } } |