&iter,
&parent);
TREE_VIEW_INTERNAL_ASSERT_VOID (has_child);
- gtk_tree_path_append_index (path, 0);
+ gtk_tree_path_down (path);
}
else
{
pos == GTK_TREE_VIEW_DROP_INTO_OR_AFTER)
{
/* get first child, drop before it */
- gtk_tree_path_append_index (path, 0);
+ gtk_tree_path_down (path);
}
else
{
g_return_if_fail (tree_view->priv->tree != NULL);
path = gtk_tree_path_new ();
- gtk_tree_path_append_index (path, 0);
+ gtk_tree_path_down (path);
indices = gtk_tree_path_get_indices (path);
tree = tree_view->priv->tree;
GtkTreePath *child_path;
gint child_count = 0;
child_path = gtk_tree_path_copy (path);
- gtk_tree_path_append_index (child_path, 0);
+ gtk_tree_path_down (child_path);
if (node->children)
_gtk_rbtree_traverse (node->children, node->children->root, G_POST_ORDER, count_children_helper, &child_count);
(* tree_view->priv->destroy_count_func) (tree_view, child_path, child_count, tree_view->priv->destroy_count_data);
gpointer user_data)
{
GtkRBNode *node;
- gint *indices;
- gint depth;
gint i = 0;
if (tree == NULL || tree->root == NULL)
node = tree->root;
- indices = gtk_tree_path_get_indices (path);
- depth = gtk_tree_path_get_depth (path);
-
while (node && node->left != tree->nil)
node = node->left;
{
if (node->children)
{
- gtk_tree_path_append_index (path, 0);
+ gtk_tree_path_down (path);
gtk_tree_view_map_expanded_rows_helper (tree_view, node->children, path, func, user_data);
gtk_tree_path_up (path);
(* func) (tree_view, path, user_data);
}
i++;
- indices[depth -1] = i;
+ gtk_tree_path_next (path);
node = _gtk_rbtree_next (tree, node);
}
}
tmp = *iter;
has_child = gtk_tree_model_iter_children (model, iter, &tmp);
- gtk_tree_path_append_index (path, 0);
+ gtk_tree_path_down (path);
/* sanity check */
TREE_VIEW_INTERNAL_ASSERT (has_child, FALSE);