Attempt to represent the S^2->S^3 header reorganisation as a series of "hg rename" operations
1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
3 * Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the
17 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 * Boston, MA 02111-1307, USA.
22 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
23 * file for a list of people on the GLib Team. See the ChangeLog
24 * files for a list of changes. These files are distributed with
25 * GLib at ftp://ftp.gtk.org/pub/gtk/.
32 #include <glib/glist.h>
36 typedef struct _GQueue GQueue;
47 IMPORT_C GQueue* g_queue_new (void);
48 IMPORT_C void g_queue_free (GQueue *queue);
49 IMPORT_C gboolean g_queue_is_empty (GQueue *queue);
50 IMPORT_C guint g_queue_get_length (GQueue *queue);
51 IMPORT_C void g_queue_reverse (GQueue *queue);
52 IMPORT_C GQueue * g_queue_copy (GQueue *queue);
53 IMPORT_C void g_queue_foreach (GQueue *queue,
56 IMPORT_C GList * g_queue_find (GQueue *queue,
58 IMPORT_C GList * g_queue_find_custom (GQueue *queue,
61 IMPORT_C void g_queue_sort (GQueue *queue,
62 GCompareDataFunc compare_func,
65 IMPORT_C void g_queue_push_head (GQueue *queue,
67 IMPORT_C void g_queue_push_tail (GQueue *queue,
69 IMPORT_C void g_queue_push_nth (GQueue *queue,
72 IMPORT_C gpointer g_queue_pop_head (GQueue *queue);
73 IMPORT_C gpointer g_queue_pop_tail (GQueue *queue);
74 IMPORT_C gpointer g_queue_pop_nth (GQueue *queue,
76 IMPORT_C gpointer g_queue_peek_head (GQueue *queue);
77 IMPORT_C gpointer g_queue_peek_tail (GQueue *queue);
78 IMPORT_C gpointer g_queue_peek_nth (GQueue *queue,
80 IMPORT_C gint g_queue_index (GQueue *queue,
82 IMPORT_C void g_queue_remove (GQueue *queue,
84 IMPORT_C void g_queue_remove_all (GQueue *queue,
86 IMPORT_C void g_queue_insert_before (GQueue *queue,
89 IMPORT_C void g_queue_insert_after (GQueue *queue,
92 IMPORT_C void g_queue_insert_sorted (GQueue *queue,
94 GCompareDataFunc func,
97 IMPORT_C void g_queue_push_head_link (GQueue *queue,
99 IMPORT_C void g_queue_push_tail_link (GQueue *queue,
101 IMPORT_C void g_queue_push_nth_link (GQueue *queue,
104 IMPORT_C GList* g_queue_pop_head_link (GQueue *queue);
105 IMPORT_C GList* g_queue_pop_tail_link (GQueue *queue);
106 IMPORT_C GList* g_queue_pop_nth_link (GQueue *queue,
108 IMPORT_C GList* g_queue_peek_head_link (GQueue *queue);
109 IMPORT_C GList* g_queue_peek_tail_link (GQueue *queue);
110 IMPORT_C GList* g_queue_peek_nth_link (GQueue *queue,
112 IMPORT_C gint g_queue_link_index (GQueue *queue,
114 IMPORT_C void g_queue_unlink (GQueue *queue,
116 IMPORT_C void g_queue_delete_link (GQueue *queue,
121 #endif /* __G_QUEUE_H__ */