1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
27 #if !defined (__GLIB_H_INSIDE__) && !defined (GLIB_COMPILATION)
28 #error "Only <glib.h> can be included directly."
34 #include <glib/glist.h>
38 typedef struct _GQueue GQueue;
42 * @head: a pointer to the first element of the queue
43 * @tail: a pointer to the last element of the queue
44 * @length: the number of elements in the queue
46 * Contains the public fields of a
47 * <link linkend="glib-Double-ended-Queues">Queue</link>.
59 * A statically-allocated #GQueue must be initialized with this
60 * macro before it can be used. This macro can be used to initialize
61 * a variable, but it cannot be assigned to a variable. In that case
62 * you have to use g_queue_init().
65 * GQueue my_queue = G_QUEUE_INIT;
70 #define G_QUEUE_INIT { NULL, NULL, 0 }
74 GQueue* g_queue_new (void);
75 void g_queue_free (GQueue *queue);
76 void g_queue_free_full (GQueue *queue,
77 GDestroyNotify free_func);
78 void g_queue_init (GQueue *queue);
79 void g_queue_clear (GQueue *queue);
80 gboolean g_queue_is_empty (GQueue *queue);
81 guint g_queue_get_length (GQueue *queue);
82 void g_queue_reverse (GQueue *queue);
83 GQueue * g_queue_copy (GQueue *queue);
84 void g_queue_foreach (GQueue *queue,
87 GList * g_queue_find (GQueue *queue,
89 GList * g_queue_find_custom (GQueue *queue,
92 void g_queue_sort (GQueue *queue,
93 GCompareDataFunc compare_func,
96 void g_queue_push_head (GQueue *queue,
98 void g_queue_push_tail (GQueue *queue,
100 void g_queue_push_nth (GQueue *queue,
103 gpointer g_queue_pop_head (GQueue *queue);
104 gpointer g_queue_pop_tail (GQueue *queue);
105 gpointer g_queue_pop_nth (GQueue *queue,
107 gpointer g_queue_peek_head (GQueue *queue);
108 gpointer g_queue_peek_tail (GQueue *queue);
109 gpointer g_queue_peek_nth (GQueue *queue,
111 gint g_queue_index (GQueue *queue,
113 gboolean g_queue_remove (GQueue *queue,
115 guint g_queue_remove_all (GQueue *queue,
117 void g_queue_insert_before (GQueue *queue,
120 void g_queue_insert_after (GQueue *queue,
123 void g_queue_insert_sorted (GQueue *queue,
125 GCompareDataFunc func,
128 void g_queue_push_head_link (GQueue *queue,
130 void g_queue_push_tail_link (GQueue *queue,
132 void g_queue_push_nth_link (GQueue *queue,
135 GList* g_queue_pop_head_link (GQueue *queue);
136 GList* g_queue_pop_tail_link (GQueue *queue);
137 GList* g_queue_pop_nth_link (GQueue *queue,
139 GList* g_queue_peek_head_link (GQueue *queue);
140 GList* g_queue_peek_tail_link (GQueue *queue);
141 GList* g_queue_peek_nth_link (GQueue *queue,
143 gint g_queue_link_index (GQueue *queue,
145 void g_queue_unlink (GQueue *queue,
147 void g_queue_delete_link (GQueue *queue,
152 #endif /* __G_QUEUE_H__ */