luc14n0/glib
1
0
Fork 0
mirror of https://gitlab.gnome.org/GNOME/glib.git synced 2024-11-06 01:16:17 +01:00
Code Issues Packages Projects Releases Wiki Activity

sort: Improve test coverage

Browse Source 
Test the code paths that sort 'large' items.
This commit is contained in:
Matthias Clasen 2012-04-07 11:28:04 -04:00
parent 06015064b8
commit 550b69b963
1 changed files with 32 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
glib/tests/sort.c
View File

@ -53,6 +53,12 @@ typedef struct {
int i; int i;
} SortItem; } SortItem;
typedef struct {
int val;
int i;
int data[16];
} BigItem;
static int static int
item_compare_data (gconstpointer p1, gconstpointer p2, gpointer data) item_compare_data (gconstpointer p1, gconstpointer p2, gpointer data)
{ {
@ -81,7 +87,31 @@ test_sort_stable (void)
{ {
g_assert_cmpint (data[i -1].val, <=, data[i].val); g_assert_cmpint (data[i -1].val, <=, data[i].val);
if (data[i -1].val == data[i].val) if (data[i -1].val == data[i].val)
g_assert_cmpint (data[i -1].i, <, data[i].i); g_assert_cmpint (data[i -1].i, <, data[i].i);
}
g_free (data);
}
static void
test_sort_big (void)
{
BigItem *data;
gint i;
data = g_malloc (10000 * sizeof (BigItem));
for (i = 0; i < 10000; i++)
{
data[i].val = g_random_int_range (0, 10000);
data[i].i = i;
}
g_qsort_with_data (data, 10000, sizeof (BigItem), item_compare_data, NULL);
for (i = 1; i < 10000; i++)
{
g_assert_cmpint (data[i -1].val, <=, data[i].val);
if (data[i -1].val == data[i].val)
g_assert_cmpint (data[i -1].i, <, data[i].i);
} }
g_free (data); g_free (data);
} }
@ -93,6 +123,7 @@ main (int argc, char *argv[])
g_test_add_func ("/sort/basic", test_sort_basic); g_test_add_func ("/sort/basic", test_sort_basic);
g_test_add_func ("/sort/stable", test_sort_stable); g_test_add_func ("/sort/stable", test_sort_stable);
g_test_add_func ("/sort/big", test_sort_big);
return g_test_run (); return g_test_run ();
} }