mirror of
https://gitlab.gnome.org/GNOME/glib.git
synced 2024-11-02 07:36:17 +01:00
3fa620d4df
* glib/gstrfuncs.c: (g_ascii_strdown), (g_ascii_strup): Add missing const. (g_strsplit): Add g_return_val_if_fail for case of empty delimiter, which can result in an infinite loop otherwise. * glib/gstrfuncs.h: Add missing const. * tests/.cvsignore: Ignore a generated file. * tests/array-test.c: * tests/dirname-test.c: * tests/hash-test.c: * tests/list-test.c: * tests/node-test.c: * tests/relation-test.c: * tests/shell-test.c: * tests/slist-test.c: * tests/spawn-test.c: * tests/strfunc-test.c: * tests/string-test.c: * tests/testglib.c: * tests/tree-test.c: * tests/type-test.c: Add an #undef G_DISABLE_ASSERT so all tests will assert even if asserts are disabled inside glib itself.
152 lines
3.6 KiB
C
152 lines
3.6 KiB
C
/* GLIB - Library of useful routines for C programming
|
|
* Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the
|
|
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
* Boston, MA 02111-1307, USA.
|
|
*/
|
|
|
|
/*
|
|
* Modified by the GLib Team and others 1997-2000. See the AUTHORS
|
|
* file for a list of people on the GLib Team. See the ChangeLog
|
|
* files for a list of changes. These files are distributed with
|
|
* GLib at ftp://ftp.gtk.org/pub/gtk/.
|
|
*/
|
|
|
|
#undef G_DISABLE_ASSERT
|
|
#undef G_LOG_DOMAIN
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include "glib.h"
|
|
|
|
int array[10000];
|
|
gboolean failed = FALSE;
|
|
|
|
#define TEST(m,cond) G_STMT_START { failed = !(cond); \
|
|
if (failed) \
|
|
{ if (!m) \
|
|
g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
|
|
else \
|
|
g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
|
|
} \
|
|
else \
|
|
g_print ("."); fflush (stdout); \
|
|
} G_STMT_END
|
|
|
|
#define C2P(c) ((gpointer) ((long) (c)))
|
|
#define P2C(p) ((gchar) ((long) (p)))
|
|
|
|
#define GLIB_TEST_STRING "el dorado "
|
|
#define GLIB_TEST_STRING_5 "el do"
|
|
|
|
typedef struct {
|
|
guint age;
|
|
gchar name[40];
|
|
} GlibTestInfo;
|
|
|
|
static gint
|
|
my_list_compare_one (gconstpointer a, gconstpointer b)
|
|
{
|
|
gint one = *((const gint*)a);
|
|
gint two = *((const gint*)b);
|
|
return one-two;
|
|
}
|
|
|
|
static gint
|
|
my_list_compare_two (gconstpointer a, gconstpointer b)
|
|
{
|
|
gint one = *((const gint*)a);
|
|
gint two = *((const gint*)b);
|
|
return two-one;
|
|
}
|
|
|
|
int
|
|
main (int argc,
|
|
char *argv[])
|
|
{
|
|
GSList *slist, *st;
|
|
gint nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
|
gint morenums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6};
|
|
gint i;
|
|
|
|
slist = NULL;
|
|
for (i = 0; i < 10; i++)
|
|
slist = g_slist_append (slist, &nums[i]);
|
|
slist = g_slist_reverse (slist);
|
|
|
|
for (i = 0; i < 10; i++)
|
|
{
|
|
st = g_slist_nth (slist, i);
|
|
g_assert (*((gint*) st->data) == (9 - i));
|
|
}
|
|
|
|
g_slist_free (slist);
|
|
slist = NULL;
|
|
|
|
for (i = 0; i < 10; i++)
|
|
slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_one);
|
|
|
|
/*
|
|
g_print("\n");
|
|
g_slist_foreach (slist, my_list_print, NULL);
|
|
*/
|
|
|
|
for (i = 0; i < 10; i++)
|
|
{
|
|
st = g_slist_nth (slist, i);
|
|
g_assert (*((gint*) st->data) == i);
|
|
}
|
|
|
|
g_slist_free(slist);
|
|
slist = NULL;
|
|
|
|
for (i = 0; i < 10; i++)
|
|
slist = g_slist_insert_sorted (slist, &morenums[i], my_list_compare_two);
|
|
|
|
/*
|
|
g_print("\n");
|
|
g_slist_foreach (slist, my_list_print, NULL);
|
|
*/
|
|
|
|
for (i = 0; i < 10; i++)
|
|
{
|
|
st = g_slist_nth (slist, i);
|
|
g_assert (*((gint*) st->data) == (9 - i));
|
|
}
|
|
|
|
g_slist_free(slist);
|
|
slist = NULL;
|
|
|
|
for (i = 0; i < 10; i++)
|
|
slist = g_slist_prepend (slist, &morenums[i]);
|
|
|
|
slist = g_slist_sort (slist, my_list_compare_two);
|
|
|
|
/*
|
|
g_print("\n");
|
|
g_slist_foreach (slist, my_list_print, NULL);
|
|
*/
|
|
|
|
for (i = 0; i < 10; i++)
|
|
{
|
|
st = g_slist_nth (slist, i);
|
|
g_assert (*((gint*) st->data) == (9 - i));
|
|
}
|
|
|
|
g_slist_free(slist);
|
|
|
|
return 0;
|
|
}
|