andrius
/
mes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

lib: test: Add 80-qsort-stress. 

* lib/tests/stdlib/80-qsort-stress.c: New test.
* build-aux/check-mescc.sh (tcc_tests): Add it.
This commit is contained in:
Jan (janneke) Nieuwenhuizen 2022-10-25 14:51:32 +02:00
parent 4a88f05e0a
commit 89e77b724c
No known key found for this signature in database
GPG Key ID: F3C1A0D9C1D65273
2 changed files with 61 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
build-aux/check-mescc.sh
View File

@ -201,6 +201,7 @@ lib/tests/setjmp/80-setjmp.c
lib/tests/stdio/80-sscanf.c
lib/tests/stdlib/80-qsort.c
lib/tests/stdlib/80-qsort-dupes.c
lib/tests/stdlib/80-qsort-stress.c
lib/tests/string/80-strncpy.c
lib/tests/string/80-strrchr.c
lib/tests/scaffold/82-define.c

60
lib/tests/stdlib/80-qsort-stress.c Normal file
View File

@ -0,0 +1,60 @@
/* -*-comment-start: "//";comment-end:""-*-
* GNU Mes --- Maxwell Equations of Software
* Copyright © 2017,2022 Jan (janneke) Nieuwenhuizen <janneke@gnu.org>
*
* This file is part of GNU Mes.
*
* GNU Mes is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or (at
* your option) any later version.
*
* GNU Mes 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Mes. If not, see <http://www.gnu.org/licenses/>.
*/
#include <mes/lib.h>
#include <stdlib.h>
#include <string.h>
int
compare_int (void const *a, void const *b)
{
eputs ("compare: ");
eputs (itoa (*(int *) a));
eputs (" <? ");
eputs (itoa (*(int *) b));
eputs (" => ");
eputs (itoa (*(int *) a - *(int *) b));
eputs ("\n");
return *(int *) a - *(int *) b;
}
int
main ()
{
int lst[9] = { 0, 0, 5, 0, 0, 4, 3, 2, -1 };
qsort (lst, 9, sizeof (int), compare_int);
for (int i = 0; i < 9; i++)
{
eputs (itoa (i));
eputs (":");
eputs (itoa (lst[i]));
eputs ("\n");
}
if (lst[0] != -1)
return 1;
if (lst[9] != 5)
return 2;
int x = -2;
for (int i = 0; i < 9; i++)
if (x > lst[i])
return 3 + i;
return 0;
}