1/* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
3 *
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.1 of the License, or (at your option) any later version.
8 *
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.
13 *
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
16 */
17
18/*
19 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
20 * file for a list of people on the GLib Team. See the ChangeLog
21 * files for a list of changes. These files are distributed with
22 * GLib at ftp://ftp.gtk.org/pub/gtk/.
23 */
24
25#ifndef __G_QUEUE_H__
26#define __G_QUEUE_H__
27
28#if !defined (__GLIB_H_INSIDE__) && !defined (GLIB_COMPILATION)
29#error "Only <glib.h> can be included directly."
30#endif
31
32#include <glib/glist.h>
33
34G_BEGIN_DECLS
35
36typedef struct _GQueue GQueue;
37
38/**
39 * GQueue:
40 * @head: a pointer to the first element of the queue
41 * @tail: a pointer to the last element of the queue
42 * @length: the number of elements in the queue
43 *
44 * Contains the public fields of a
45 * [Queue][glib-Double-ended-Queues].
46 */
47struct _GQueue
48{
49 GList *head;
50 GList *tail;
51 guint length;
52};
53
54/**
55 * G_QUEUE_INIT:
56 *
57 * A statically-allocated #GQueue must be initialized with this
58 * macro before it can be used. This macro can be used to initialize
59 * a variable, but it cannot be assigned to a variable. In that case
60 * you have to use g_queue_init().
61 *
62 * |[
63 * GQueue my_queue = G_QUEUE_INIT;
64 * ]|
65 *
66 * Since: 2.14
67 */
68#define G_QUEUE_INIT { NULL, NULL, 0 }
69
70/* Queues
71 */
72GLIB_AVAILABLE_IN_ALL
73GQueue* g_queue_new (void);
74GLIB_AVAILABLE_IN_ALL
75void g_queue_free (GQueue *queue);
76GLIB_AVAILABLE_IN_ALL
77void g_queue_free_full (GQueue *queue,
78 GDestroyNotify free_func);
79GLIB_AVAILABLE_IN_ALL
80void g_queue_init (GQueue *queue);
81GLIB_AVAILABLE_IN_ALL
82void g_queue_clear (GQueue *queue);
83GLIB_AVAILABLE_IN_ALL
84gboolean g_queue_is_empty (GQueue *queue);
85GLIB_AVAILABLE_IN_2_60
86void g_queue_clear_full (GQueue *queue,
87 GDestroyNotify free_func);
88GLIB_AVAILABLE_IN_ALL
89guint g_queue_get_length (GQueue *queue);
90GLIB_AVAILABLE_IN_ALL
91void g_queue_reverse (GQueue *queue);
92GLIB_AVAILABLE_IN_ALL
93GQueue * g_queue_copy (GQueue *queue);
94GLIB_AVAILABLE_IN_ALL
95void g_queue_foreach (GQueue *queue,
96 GFunc func,
97 gpointer user_data);
98GLIB_AVAILABLE_IN_ALL
99GList * g_queue_find (GQueue *queue,
100 gconstpointer data);
101GLIB_AVAILABLE_IN_ALL
102GList * g_queue_find_custom (GQueue *queue,
103 gconstpointer data,
104 GCompareFunc func);
105GLIB_AVAILABLE_IN_ALL
106void g_queue_sort (GQueue *queue,
107 GCompareDataFunc compare_func,
108 gpointer user_data);
109
110GLIB_AVAILABLE_IN_ALL
111void g_queue_push_head (GQueue *queue,
112 gpointer data);
113GLIB_AVAILABLE_IN_ALL
114void g_queue_push_tail (GQueue *queue,
115 gpointer data);
116GLIB_AVAILABLE_IN_ALL
117void g_queue_push_nth (GQueue *queue,
118 gpointer data,
119 gint n);
120GLIB_AVAILABLE_IN_ALL
121gpointer g_queue_pop_head (GQueue *queue);
122GLIB_AVAILABLE_IN_ALL
123gpointer g_queue_pop_tail (GQueue *queue);
124GLIB_AVAILABLE_IN_ALL
125gpointer g_queue_pop_nth (GQueue *queue,
126 guint n);
127GLIB_AVAILABLE_IN_ALL
128gpointer g_queue_peek_head (GQueue *queue);
129GLIB_AVAILABLE_IN_ALL
130gpointer g_queue_peek_tail (GQueue *queue);
131GLIB_AVAILABLE_IN_ALL
132gpointer g_queue_peek_nth (GQueue *queue,
133 guint n);
134GLIB_AVAILABLE_IN_ALL
135gint g_queue_index (GQueue *queue,
136 gconstpointer data);
137GLIB_AVAILABLE_IN_ALL
138gboolean g_queue_remove (GQueue *queue,
139 gconstpointer data);
140GLIB_AVAILABLE_IN_ALL
141guint g_queue_remove_all (GQueue *queue,
142 gconstpointer data);
143GLIB_AVAILABLE_IN_ALL
144void g_queue_insert_before (GQueue *queue,
145 GList *sibling,
146 gpointer data);
147GLIB_AVAILABLE_IN_2_62
148void g_queue_insert_before_link
149 (GQueue *queue,
150 GList *sibling,
151 GList *link_);
152GLIB_AVAILABLE_IN_ALL
153void g_queue_insert_after (GQueue *queue,
154 GList *sibling,
155 gpointer data);
156GLIB_AVAILABLE_IN_2_62
157void g_queue_insert_after_link
158 (GQueue *queue,
159 GList *sibling,
160 GList *link_);
161GLIB_AVAILABLE_IN_ALL
162void g_queue_insert_sorted (GQueue *queue,
163 gpointer data,
164 GCompareDataFunc func,
165 gpointer user_data);
166
167GLIB_AVAILABLE_IN_ALL
168void g_queue_push_head_link (GQueue *queue,
169 GList *link_);
170GLIB_AVAILABLE_IN_ALL
171void g_queue_push_tail_link (GQueue *queue,
172 GList *link_);
173GLIB_AVAILABLE_IN_ALL
174void g_queue_push_nth_link (GQueue *queue,
175 gint n,
176 GList *link_);
177GLIB_AVAILABLE_IN_ALL
178GList* g_queue_pop_head_link (GQueue *queue);
179GLIB_AVAILABLE_IN_ALL
180GList* g_queue_pop_tail_link (GQueue *queue);
181GLIB_AVAILABLE_IN_ALL
182GList* g_queue_pop_nth_link (GQueue *queue,
183 guint n);
184GLIB_AVAILABLE_IN_ALL
185GList* g_queue_peek_head_link (GQueue *queue);
186GLIB_AVAILABLE_IN_ALL
187GList* g_queue_peek_tail_link (GQueue *queue);
188GLIB_AVAILABLE_IN_ALL
189GList* g_queue_peek_nth_link (GQueue *queue,
190 guint n);
191GLIB_AVAILABLE_IN_ALL
192gint g_queue_link_index (GQueue *queue,
193 GList *link_);
194GLIB_AVAILABLE_IN_ALL
195void g_queue_unlink (GQueue *queue,
196 GList *link_);
197GLIB_AVAILABLE_IN_ALL
198void g_queue_delete_link (GQueue *queue,
199 GList *link_);
200
201G_END_DECLS
202
203#endif /* __G_QUEUE_H__ */
204

source code of include/glib-2.0/glib/gqueue.h