mirror of
https://gitlab.gnome.org/GNOME/glib.git
synced 2024-09-20 17:26:14 +02:00
87c7aeb93b
Sat Jul 24 20:11:35 1999 Tim Janik <timj@gtk.org>
* merged GLib 1.3.0 with glib-1.2.3 from Fri Jul 16 22:18:36.
* incorporated proposed cleanups from gtk-devel-list.
* bumped version number to GLib-1.3.1
* glib.h:
* gqueue.c:
* gstring.c:
* glist.c:
removed string tokenisation (we got g_strsplit() and g_strjoin()
already) and readline functions.
s/g_list_delete/g_list_delete_link.
implemented g_slist_delete_link.
removed notion of g_ATEXIT() macro in glib.h, this is an *internal*
macro, g_atexit() is provided for public consumption.
added GTrashStack inline utility functions.
reimplement double eneded queues.
removed GStack implementation, people can use a queue or a (singly)
linked list for this task.
deprecated g_strescape(), we need the SunOS variants here.
* gdate.c: added DEBUG_MSG() macro to wrap old messages.
* *.*: CVS merges.
* upgrade to libtool 1.3.3.
116 lines
4.5 KiB
C
116 lines
4.5 KiB
C
#ifdef HAVE_CONFIG_H
|
|
# include <config.h>
|
|
#endif
|
|
#include <glib.h>
|
|
|
|
int main()
|
|
{
|
|
GQueue *q;
|
|
GList *node;
|
|
gpointer data;
|
|
|
|
q = g_queue_create ();
|
|
|
|
g_assert (g_queue_is_empty (q) == TRUE);
|
|
|
|
g_queue_push_head (q, GINT_TO_POINTER (2));
|
|
g_assert (g_queue_peek_head (q) == GINT_TO_POINTER (2));
|
|
g_assert (g_queue_is_empty (q) == FALSE);
|
|
g_assert (g_list_length (q->head) == 1);
|
|
g_assert (q->head == q->tail);
|
|
g_queue_push_head (q, GINT_TO_POINTER (1));
|
|
g_assert (q->head->next == q->tail);
|
|
g_assert (q->tail->prev == q->head);
|
|
g_assert (g_list_length (q->head) == 2);
|
|
g_assert (q->tail->data == GINT_TO_POINTER (2));
|
|
g_assert (q->head->data == GINT_TO_POINTER (1));
|
|
g_queue_push_tail (q, GINT_TO_POINTER (3));
|
|
g_assert (g_list_length (q->head) == 3);
|
|
g_assert (q->head->data == GINT_TO_POINTER (1));
|
|
g_assert (q->head->next->data == GINT_TO_POINTER (2));
|
|
g_assert (q->head->next->next == q->tail);
|
|
g_assert (q->head->next == q->tail->prev);
|
|
g_assert (q->tail->data == GINT_TO_POINTER (3));
|
|
g_queue_push_tail (q, GINT_TO_POINTER (4));
|
|
g_assert (g_list_length (q->head) == 4);
|
|
g_assert (q->head->data == GINT_TO_POINTER (1));
|
|
g_assert (g_queue_peek_tail (q) == GINT_TO_POINTER (4));
|
|
g_queue_push_tail (q, GINT_TO_POINTER (5));
|
|
g_assert (g_list_length (q->head) == 5);
|
|
|
|
g_assert (g_queue_is_empty (q) == FALSE);
|
|
|
|
g_assert (q->length == 5);
|
|
g_assert (q->head->prev == NULL);
|
|
g_assert (q->head->data == GINT_TO_POINTER (1));
|
|
g_assert (q->head->next->data == GINT_TO_POINTER (2));
|
|
g_assert (q->head->next->next->data == GINT_TO_POINTER (3));
|
|
g_assert (q->head->next->next->next->data == GINT_TO_POINTER (4));
|
|
g_assert (q->head->next->next->next->next->data == GINT_TO_POINTER (5));
|
|
g_assert (q->head->next->next->next->next->next == NULL);
|
|
g_assert (q->head->next->next->next->next == q->tail);
|
|
g_assert (q->tail->data == GINT_TO_POINTER (5));
|
|
g_assert (q->tail->prev->data == GINT_TO_POINTER (4));
|
|
g_assert (q->tail->prev->prev->data == GINT_TO_POINTER (3));
|
|
g_assert (q->tail->prev->prev->prev->data == GINT_TO_POINTER (2));
|
|
g_assert (q->tail->prev->prev->prev->prev->data == GINT_TO_POINTER (1));
|
|
g_assert (q->tail->prev->prev->prev->prev->prev == NULL);
|
|
g_assert (q->tail->prev->prev->prev->prev == q->head);
|
|
g_assert (g_queue_peek_tail (q) == GINT_TO_POINTER (5));
|
|
g_assert (g_queue_peek_head (q) == GINT_TO_POINTER (1));
|
|
|
|
g_assert (g_queue_pop_head (q) == GINT_TO_POINTER (1));
|
|
g_assert (g_list_length (q->head) == 4 && q->length == 4);
|
|
g_assert (g_queue_pop_tail (q) == GINT_TO_POINTER (5));
|
|
g_assert (g_list_length (q->head) == 3);
|
|
g_assert (g_queue_pop_head_link (q)->data == GINT_TO_POINTER (2));
|
|
g_assert (g_list_length (q->head) == 2);
|
|
g_assert (g_queue_pop_tail (q) == GINT_TO_POINTER (4));
|
|
g_assert (g_list_length (q->head) == 1);
|
|
g_assert (g_queue_pop_head_link (q)->data == GINT_TO_POINTER (3));
|
|
g_assert (g_list_length (q->head) == 0);
|
|
g_assert (g_queue_pop_tail (q) == NULL);
|
|
g_assert (g_list_length (q->head) == 0);
|
|
g_assert (g_queue_pop_head (q) == NULL);
|
|
g_assert (g_list_length (q->head) == 0);
|
|
|
|
g_assert (g_queue_is_empty (q) == TRUE);
|
|
|
|
/************************/
|
|
|
|
g_queue_push_head (q, GINT_TO_POINTER (1));
|
|
g_assert (g_list_length (q->head) == 1 && 1 == q->length);
|
|
g_queue_push_head (q, GINT_TO_POINTER (2));
|
|
g_assert (g_list_length (q->head) == 2 && 2 == q->length);
|
|
g_queue_push_head (q, GINT_TO_POINTER (3));
|
|
g_assert (g_list_length (q->head) == 3 && 3 == q->length);
|
|
g_queue_push_head (q, GINT_TO_POINTER (4));
|
|
g_assert (g_list_length (q->head) == 4 && 4 == q->length);
|
|
g_queue_push_head (q, GINT_TO_POINTER (5));
|
|
g_assert (g_list_length (q->head) == 5 && 5 == q->length);
|
|
|
|
g_assert (g_queue_pop_head (q) == GINT_TO_POINTER (5));
|
|
g_assert (g_list_length (q->head) == 4);
|
|
node = q->tail;
|
|
g_assert (node == g_queue_pop_tail_link (q));
|
|
g_assert (g_list_length (q->head) == 3);
|
|
data = q->head->data;
|
|
g_assert (data == g_queue_pop_head (q));
|
|
g_assert (g_list_length (q->head) == 2);
|
|
g_assert (g_queue_pop_tail (q) == GINT_TO_POINTER (2));
|
|
g_assert (g_list_length (q->head) == 1);
|
|
g_assert (q->head == q->tail);
|
|
g_assert (g_queue_pop_tail (q) == GINT_TO_POINTER (3));
|
|
g_assert (g_list_length (q->head) == 0);
|
|
g_assert (g_queue_pop_head (q) == NULL);
|
|
g_assert (g_queue_pop_head_link (q) == NULL);
|
|
g_assert (g_list_length (q->head) == 0);
|
|
g_assert (g_queue_pop_tail_link (q) == NULL);
|
|
g_assert (g_list_length (q->head) == 0);
|
|
|
|
g_queue_free (q);
|
|
|
|
return 0;
|
|
}
|
|
|