quiet table pb outputv0.22.24

1 files changed, 6 insertions, 6 deletions

diff --git a/addNode.go b/addNode.go
index 23a39ff..63c54a5 100644
--- a/addNode.go
+++ b/addNode.go
@@ -60,23 +60,23 @@ func addNode(a *widget.Action) *Node {
 }
 
 func (me *TreeInfo) DeleteNode(n *Node) {
-	log.Log(TREEWARN, "DeleteNode() before lock n =", n.WidgetId, n.GetProgName())
+	log.Log(TREE, "DeleteNode() before lock n =", n.WidgetId, n.GetProgName())
 	if me.TryLock() {
 		defer me.Unlock()
 	} else {
 		log.Info("TREE: mutex lock was already held before DeleteNode()")
 	}
 	p := n.Parent
-	log.Log(TREEWARN, "DeleteNode() parent =", p.WidgetId, p.GetProgName())
+	log.Log(TREE, "DeleteNode() parent =", p.WidgetId, p.GetProgName())
 	for i, child := range p.children {
-		log.Log(TREEWARN, "parent has child:", i, child.WidgetId, child.GetProgName())
+		log.Log(TREE, "parent has child:", i, child.WidgetId, child.GetProgName())
 		if n == child {
-			log.Log(TREEWARN, "Found child ==", i, child.WidgetId, child.GetProgName())
-			log.Log(TREEWARN, "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.Log(TREEWARN, "parent now has child:", i, child.WidgetId, child.GetProgName())
+		log.Log(TREE, "parent now has child:", i, child.WidgetId, child.GetProgName())
 	}
 }