Lines Matching refs:queue
14 check_integrity (GQueue *queue)
22 g_assert (queue->length < 4000000000u);
24 g_assert (g_queue_get_length (queue) == queue->length);
26 if (!queue->head)
27 g_assert (!queue->tail);
28 if (!queue->tail)
29 g_assert (!queue->head);
33 for (list = queue->head; list != NULL; list = list->next)
39 g_assert (n == queue->length);
40 g_assert (last == queue->tail);
44 for (list = queue->tail; list != NULL; list = list->prev)
50 g_assert (n == queue->length);
51 g_assert (last == queue->head);
54 for (list = queue->head; list != NULL; list = list->next)
58 for (list = queue->tail; list != NULL; list = list->prev)
66 for (list = queue->tail; list != NULL; list = list->prev)
70 for (list = queue->head; list != NULL; list = list->next)
105 find_min (GQueue *queue)
109 g_queue_foreach (queue, check_min, &min);
115 find_max (GQueue *queue)
119 g_queue_foreach (queue, check_max, &max);
132 delete_all (GQueue *queue)
134 g_queue_foreach (queue, delete_elm, queue);
152 get_random_position (GQueue *queue, gboolean allow_offlist)
174 n = queue->length;
176 n = queue->length - 1;
180 if (queue->length == 0)
183 n = g_random_int_range (0, queue->length);
219 GQueue *queue;
236 queues[i].queue = g_queue_new ();
246 GQueue *q = qinf->queue;
257 if (g_queue_is_empty (qinf->queue))
292 GQueue *new_queue = g_queue_copy (random_queue->queue);
294 g_queue_free (qinf->queue);
295 q = qinf->queue = new_queue;
732 queue);
736 g_queue_free (queues[i].queue);
742 GQueue *queue = q;
744 g_queue_remove (queue, data);
