williamr@2: /* GLIB - Library of useful routines for C programming williamr@2: * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald williamr@2: * Portions copyright (c) 2006 Nokia Corporation. All rights reserved. williamr@2: * williamr@2: * This library is free software; you can redistribute it and/or williamr@2: * modify it under the terms of the GNU Lesser General Public williamr@2: * License as published by the Free Software Foundation; either williamr@2: * version 2 of the License, or (at your option) any later version. williamr@2: * williamr@2: * This library is distributed in the hope that it will be useful, williamr@2: * but WITHOUT ANY WARRANTY; without even the implied warranty of williamr@2: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU williamr@2: * Lesser General Public License for more details. williamr@2: * williamr@2: * You should have received a copy of the GNU Lesser General Public williamr@2: * License along with this library; if not, write to the williamr@2: * Free Software Foundation, Inc., 59 Temple Place - Suite 330, williamr@2: * Boston, MA 02111-1307, USA. williamr@2: */ williamr@2: williamr@2: /* williamr@2: * Modified by the GLib Team and others 1997-2000. See the AUTHORS williamr@2: * file for a list of people on the GLib Team. See the ChangeLog williamr@2: * files for a list of changes. These files are distributed with williamr@2: * GLib at ftp://ftp.gtk.org/pub/gtk/. williamr@2: */ williamr@2: williamr@2: #ifndef __G_TREE_H__ williamr@2: #define __G_TREE_H__ williamr@2: williamr@2: #include <_ansi.h> williamr@2: #include williamr@2: williamr@2: G_BEGIN_DECLS williamr@2: williamr@2: typedef struct _GTree GTree; williamr@2: williamr@2: typedef gboolean (*GTraverseFunc) (gpointer key, williamr@2: gpointer value, williamr@2: gpointer data); williamr@2: williamr@2: /* Balanced binary trees williamr@2: */ williamr@2: IMPORT_C GTree* g_tree_new (GCompareFunc key_compare_func); williamr@2: IMPORT_C GTree* g_tree_new_with_data (GCompareDataFunc key_compare_func, williamr@2: gpointer key_compare_data); williamr@2: IMPORT_C GTree* g_tree_new_full (GCompareDataFunc key_compare_func, williamr@2: gpointer key_compare_data, williamr@2: GDestroyNotify key_destroy_func, williamr@2: GDestroyNotify value_destroy_func); williamr@2: IMPORT_C void g_tree_destroy (GTree *tree); williamr@2: IMPORT_C void g_tree_insert (GTree *tree, williamr@2: gpointer key, williamr@2: gpointer value); williamr@2: IMPORT_C void g_tree_replace (GTree *tree, williamr@2: gpointer key, williamr@2: gpointer value); williamr@2: IMPORT_C gboolean g_tree_remove (GTree *tree, williamr@2: gconstpointer key); williamr@2: IMPORT_C gboolean g_tree_steal (GTree *tree, williamr@2: gconstpointer key); williamr@2: IMPORT_C gpointer g_tree_lookup (GTree *tree, williamr@2: gconstpointer key); williamr@2: IMPORT_C gboolean g_tree_lookup_extended (GTree *tree, williamr@2: gconstpointer lookup_key, williamr@2: gpointer *orig_key, williamr@2: gpointer *value); williamr@2: IMPORT_C void g_tree_foreach (GTree *tree, williamr@2: GTraverseFunc func, williamr@2: gpointer user_data); williamr@2: williamr@2: #ifndef G_DISABLE_DEPRECATED williamr@2: IMPORT_C void g_tree_traverse (GTree *tree, williamr@2: GTraverseFunc traverse_func, williamr@2: GTraverseType traverse_type, williamr@2: gpointer user_data); williamr@2: #endif /* G_DISABLE_DEPRECATED */ williamr@2: williamr@2: IMPORT_C gpointer g_tree_search (GTree *tree, williamr@2: GCompareFunc search_func, williamr@2: gconstpointer user_data); williamr@2: IMPORT_C gint g_tree_height (GTree *tree); williamr@2: IMPORT_C gint g_tree_nnodes (GTree *tree); williamr@2: williamr@2: williamr@2: williamr@2: G_END_DECLS williamr@2: williamr@2: #endif /* __G_TREE_H__ */ williamr@2: