.
[glibc/history.git] / localedata / xfrm-test.c
blob199bb6b5a5347d173dc51c94ec98eb200b72c53a
1 /* Test collation function via transformation using real data.
2 Copyright (C) 1997, 1998, 2000, 2003 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Lesser General Public
8 License as published by the Free Software Foundation; either
9 version 2.1 of the License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public
17 License along with the GNU C Library; if not, write to the Free
18 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
19 02111-1307 USA. */
21 #include <ctype.h>
22 #include <error.h>
23 #include <locale.h>
24 #include <stdio.h>
25 #include <stdlib.h>
26 #include <string.h>
29 struct lines
31 char *xfrm;
32 char *line;
35 static int xstrcmp (const void *, const void *);
37 int
38 main (int argc, char *argv[])
40 int result = 0;
41 size_t nstrings, nstrings_max;
42 struct lines *strings;
43 char *line = NULL;
44 size_t len = 0;
45 size_t n;
47 if (argc < 2)
48 error (1, 0, "usage: %s <random seed>", argv[0]);
50 setlocale (LC_ALL, "");
52 nstrings_max = 100;
53 nstrings = 0;
54 strings = (struct lines *) malloc (nstrings_max * sizeof (struct lines));
55 if (strings == NULL)
57 perror (argv[0]);
58 exit (1);
61 while (1)
63 char saved, *newp;
64 int needed;
65 int l;
66 if (getline (&line, &len, stdin) < 0)
67 break;
69 if (nstrings == nstrings_max)
71 strings = (struct lines *) realloc (strings,
72 (nstrings_max *= 2)
73 * sizeof (*strings));
74 if (strings == NULL)
76 perror (argv[0]);
77 exit (1);
80 strings[nstrings].line = strdup (line);
81 l = strcspn (line, ":(;");
82 while (l > 0 && isspace (line[l - 1]))
83 --l;
85 saved = line[l];
86 line[l] = '\0';
87 needed = strxfrm (NULL, line, 0);
88 newp = malloc (needed + 1);
89 strxfrm (newp, line, needed + 1);
90 strings[nstrings].xfrm = newp;
91 line[l] = saved;
92 ++nstrings;
94 free (line);
96 /* First shuffle. */
97 srandom (atoi (argv[1]));
98 for (n = 0; n < 10 * nstrings; ++n)
100 int r1, r2, r;
101 size_t idx1 = random () % nstrings;
102 size_t idx2 = random () % nstrings;
103 struct lines tmp = strings[idx1];
104 strings[idx1] = strings[idx2];
105 strings[idx2] = tmp;
107 /* While we are at it a first little test. */
108 r1 = strcmp (strings[idx1].xfrm, strings[idx2].xfrm);
109 r2 = strcmp (strings[idx2].xfrm, strings[idx1].xfrm);
110 r = -(r1 ^ r2);
111 if (r)
112 r /= abs (r1 ^ r2);
114 if (r < 0 || (r == 0 && (r1 != 0 || r2 != 0))
115 || (r > 0 && (r1 ^ r2) >= 0))
116 printf ("collate wrong: %d vs. %d\n", r1, r2);
119 /* Now sort. */
120 qsort (strings, nstrings, sizeof (struct lines), xstrcmp);
122 /* Print the result. */
123 for (n = 0; n < nstrings; ++n)
125 fputs (strings[n].line, stdout);
126 free (strings[n].line);
127 free (strings[n].xfrm);
129 free (strings);
131 return result;
135 static int
136 xstrcmp (ptr1, ptr2)
137 const void *ptr1;
138 const void *ptr2;
140 const struct lines *l1 = (const struct lines *) ptr1;
141 const struct lines *l2 = (const struct lines *) ptr2;
143 return strcmp (l1->xfrm, l2->xfrm);