1.1 --- a/epoc32/include/stdapis/glib-2.0/glib/gtree.h Tue Nov 24 13:55:44 2009 +0000
1.2 +++ b/epoc32/include/stdapis/glib-2.0/glib/gtree.h Tue Mar 16 16:12:26 2010 +0000
1.3 @@ -1,1 +1,90 @@
1.4 -gtree.h
1.5 +/* GLIB - Library of useful routines for C programming
1.6 + * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
1.7 + * Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
1.8 + *
1.9 + * This library is free software; you can redistribute it and/or
1.10 + * modify it under the terms of the GNU Lesser General Public
1.11 + * License as published by the Free Software Foundation; either
1.12 + * version 2 of the License, or (at your option) any later version.
1.13 + *
1.14 + * This library is distributed in the hope that it will be useful,
1.15 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
1.16 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
1.17 + * Lesser General Public License for more details.
1.18 + *
1.19 + * You should have received a copy of the GNU Lesser General Public
1.20 + * License along with this library; if not, write to the
1.21 + * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
1.22 + * Boston, MA 02111-1307, USA.
1.23 + */
1.24 +
1.25 +/*
1.26 + * Modified by the GLib Team and others 1997-2000. See the AUTHORS
1.27 + * file for a list of people on the GLib Team. See the ChangeLog
1.28 + * files for a list of changes. These files are distributed with
1.29 + * GLib at ftp://ftp.gtk.org/pub/gtk/.
1.30 + */
1.31 +
1.32 +#ifndef __G_TREE_H__
1.33 +#define __G_TREE_H__
1.34 +
1.35 +#include <_ansi.h>
1.36 +#include <glib/gnode.h>
1.37 +
1.38 +G_BEGIN_DECLS
1.39 +
1.40 +typedef struct _GTree GTree;
1.41 +
1.42 +typedef gboolean (*GTraverseFunc) (gpointer key,
1.43 + gpointer value,
1.44 + gpointer data);
1.45 +
1.46 +/* Balanced binary trees
1.47 + */
1.48 +IMPORT_C GTree* g_tree_new (GCompareFunc key_compare_func);
1.49 +IMPORT_C GTree* g_tree_new_with_data (GCompareDataFunc key_compare_func,
1.50 + gpointer key_compare_data);
1.51 +IMPORT_C GTree* g_tree_new_full (GCompareDataFunc key_compare_func,
1.52 + gpointer key_compare_data,
1.53 + GDestroyNotify key_destroy_func,
1.54 + GDestroyNotify value_destroy_func);
1.55 +IMPORT_C void g_tree_destroy (GTree *tree);
1.56 +IMPORT_C void g_tree_insert (GTree *tree,
1.57 + gpointer key,
1.58 + gpointer value);
1.59 +IMPORT_C void g_tree_replace (GTree *tree,
1.60 + gpointer key,
1.61 + gpointer value);
1.62 +IMPORT_C gboolean g_tree_remove (GTree *tree,
1.63 + gconstpointer key);
1.64 +IMPORT_C gboolean g_tree_steal (GTree *tree,
1.65 + gconstpointer key);
1.66 +IMPORT_C gpointer g_tree_lookup (GTree *tree,
1.67 + gconstpointer key);
1.68 +IMPORT_C gboolean g_tree_lookup_extended (GTree *tree,
1.69 + gconstpointer lookup_key,
1.70 + gpointer *orig_key,
1.71 + gpointer *value);
1.72 +IMPORT_C void g_tree_foreach (GTree *tree,
1.73 + GTraverseFunc func,
1.74 + gpointer user_data);
1.75 +
1.76 +#ifndef G_DISABLE_DEPRECATED
1.77 +IMPORT_C void g_tree_traverse (GTree *tree,
1.78 + GTraverseFunc traverse_func,
1.79 + GTraverseType traverse_type,
1.80 + gpointer user_data);
1.81 +#endif /* G_DISABLE_DEPRECATED */
1.82 +
1.83 +IMPORT_C gpointer g_tree_search (GTree *tree,
1.84 + GCompareFunc search_func,
1.85 + gconstpointer user_data);
1.86 +IMPORT_C gint g_tree_height (GTree *tree);
1.87 +IMPORT_C gint g_tree_nnodes (GTree *tree);
1.88 +
1.89 +
1.90 +
1.91 +G_END_DECLS
1.92 +
1.93 +#endif /* __G_TREE_H__ */
1.94 +