diff options
| -rw-r--r-- | src/tree.c | 14 |
1 files changed, 8 insertions, 6 deletions
@@ -29,6 +29,8 @@ #include <glib.h> +#include "i18n.h" + #if MQ_TREE_DEBUG #include <math.h> @@ -136,7 +138,7 @@ update_position(MqTree *node, gpointer user_data) static void update_positions(MqTree *node, gint step) { - debug_print_head("Updating positions", node); + debug_print_head(_("Updating positions"), node); mq_tree_foreach_from(node, update_position, &step); } @@ -168,7 +170,7 @@ mq_tree_append_child_allocated(MqTree *node, MqTree *parent, gpointer data) node->data = data; - debug_print_tree("Appended child", node); + debug_print_tree(_("Appended child"), node); return node; } @@ -197,7 +199,7 @@ mq_tree_append_sibling_allocated(MqTree *node, MqTree *sibling, gpointer data) node->data = data; - debug_print_tree("Appended sibling", node); + debug_print_tree(_("Appended sibling"), node); return node; } @@ -244,7 +246,7 @@ mq_tree_remove_allocated(MqTree *node) update_sizes(node, -1); - debug_print_tree("Removed node", node); + debug_print_tree(_("Removed node"), node); } static MqTree * G_GNUC_PURE @@ -306,7 +308,7 @@ void mq_tree_foreach(MqTree *node, gboolean (*cb)(MqTree *node, gpointer user_data), gpointer user_data) { - debug_print_head("Traversing full tree", node); + debug_print_head(_("Traversing full tree"), node); foreach_down(node->root->first_child, cb, user_data); } @@ -335,7 +337,7 @@ void mq_tree_foreach_from(MqTree *node, gboolean (*cb)(MqTree *node, gpointer user_data), gpointer user_data) { - debug_print_head("Traversing tree from position", node); + debug_print_head(_("Traversing tree from position"), node); if (foreach_down(node, cb, user_data) == MQ_TREE_CONTINUE) { foreach_up(node, cb, user_data); |