[evolution] Remove unused e_tree_memory_node_insert_before().

[Matthew Barnes <mbarnes src gnome org>]

commit 0b1e95fb3fcf65a8ab5594c68dbd47f0d665680f
Author: Matthew Barnes <mbarnes redhat com>
Date:   Sat Jun 15 09:58:44 2013 -0400

    Remove unused e_tree_memory_node_insert_before().

 .../evolution-util/evolution-util-sections.txt     |    1 -
 e-util/e-tree-memory.c                             |   35 --------------------
 e-util/e-tree-memory.h                             |    5 ---
 3 files changed, 0 insertions(+), 41 deletions(-)
---
diff --git a/doc/reference/evolution-util/evolution-util-sections.txt 
b/doc/reference/evolution-util/evolution-util-sections.txt
index 2390c95..eb7bab6 100644
--- a/doc/reference/evolution-util/evolution-util-sections.txt
+++ b/doc/reference/evolution-util/evolution-util-sections.txt
@@ -4287,7 +4287,6 @@ ETreeMemory
 e_tree_memory_construct
 e_tree_memory_new
 e_tree_memory_node_insert
-e_tree_memory_node_insert_before
 e_tree_memory_node_remove
 e_tree_memory_freeze
 e_tree_memory_thaw
diff --git a/e-util/e-tree-memory.c b/e-util/e-tree-memory.c
index 30fa646..0b92b17 100644
--- a/e-util/e-tree-memory.c
+++ b/e-util/e-tree-memory.c
@@ -541,41 +541,6 @@ e_tree_memory_node_insert (ETreeMemory *tree_memory,
        return new_path;
 }
 
-/**
- * e_tree_memory_node_insert_before:
- * @tree_memory:
- * @parent:
- * @sibling:
- * @node_data:
- *
- *
- *
- * Return value:
- **/
-ETreePath
-e_tree_memory_node_insert_before (ETreeMemory *tree_memory,
-                                  ETreePath parent,
-                                  ETreePath sibling,
-                                  gpointer node_data)
-{
-       ETreeMemoryPath *child;
-       ETreeMemoryPath *parent_path = parent;
-       ETreeMemoryPath *sibling_path = sibling;
-       gint position = 0;
-
-       g_return_val_if_fail (tree_memory != NULL, NULL);
-
-       if (sibling != NULL) {
-               for (child = parent_path->first_child; child; child = child->next_sibling) {
-                       if (child == sibling_path)
-                               break;
-                       position++;
-               }
-       } else
-               position = parent_path->num_children;
-       return e_tree_memory_node_insert (tree_memory, parent, position, node_data);
-}
-
 /* just blows away child data, doesn't take into account unlinking/etc */
 static void
 child_free (ETreeMemory *tree_memory,
diff --git a/e-util/e-tree-memory.h b/e-util/e-tree-memory.h
index aa47ce3..532a40e 100644
--- a/e-util/e-tree-memory.h
+++ b/e-util/e-tree-memory.h
@@ -85,11 +85,6 @@ ETreePath    e_tree_memory_node_insert       (ETreeMemory *tree_memory,
                                                 ETreePath parent_node,
                                                 gint position,
                                                 gpointer node_data);
-ETreePath      e_tree_memory_node_insert_before
-                                               (ETreeMemory *tree_memory,
-                                                ETreePath parent,
-                                                ETreePath sibling,
-                                                gpointer node_data);
 gpointer       e_tree_memory_node_remove       (ETreeMemory *tree_memory,
                                                 ETreePath path);