2 * Copyright (C) 2012-2015 Thadeu Lima de Souza Cascardo <cascardo@minaslivre.org>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 3 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 static char *names[] = {
31 static char *sorting[] = {
39 static char *sorted[] = {
47 #define ALEN(x) (sizeof(x)/sizeof(x[0]))
49 int main(int argc, char **argv)
55 arraylen = sizeof(names)/sizeof(names[0]);
60 printf("Single static list test pass\n");
64 for (i = 0; i < arraylen; i++) {
65 list_add(&l, strdup(names[i]));
67 for (i = 0; i < arraylen; i++) {
68 if (strcmp(list_get(l, i), names[i]))
72 printf("Multiple add ordering list test pass\n");
76 for (i = 0; i < arraylen; i++) {
77 list_insert(&l, 0, strdup(names[i]));
79 for (i = 0; i < arraylen; i++) {
80 if (strcmp(list_get(l, i), names[arraylen - i - 1]))
84 printf("Multiple insertion at start ordering list test pass\n");
88 for (i = 0; i < arraylen; i++) {
89 list_insert(&l, i, strdup(names[i]));
91 for (i = 0; i < arraylen; i++) {
92 if (strcmp(list_get(l, i), names[i]))
96 printf("Multiple insertion at end ordering list test pass\n");
100 for (i = 0; i < ALEN(sorting); i++) {
101 list_insert_ordered(&l, strdup(sorting[i]),
102 (sort_function_t *) strcmp);
104 for (i = 0; i < ALEN(sorted); i++) {
105 if (strcmp(list_get(l, i), sorted[i]))
109 printf("Ordered insertion list test pass\n");