1 /* Test of searching in a string.
2 Copyright (C) 2007-2008 Free Software Foundation, Inc.
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
15 along with this program. If not, see <http://www.gnu.org/licenses/>. */
17 /* Written by Bruno Haible <bruno@clisp.org>, 2007. */
27 #define ASSERT(expr) \
32 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
42 /* configure should already have checked that the locale is supported. */
43 if (setlocale (LC_ALL, "") == NULL)
47 const char input[] = "f\303\266\303\266";
48 const char *result = mbscasestr (input, "");
49 ASSERT (result == input);
53 const char input[] = "f\303\266\303\266";
54 const char *result = mbscasestr (input, "\303\266");
55 ASSERT (result == input + 1);
59 const char input[] = "f\303\266\303\266";
60 const char *result = mbscasestr (input, "\266\303");
61 ASSERT (result == NULL);
65 const char input[] = "\303\204BC \303\204BCD\303\204B \303\204BCD\303\204BCD\303\204BDE"; /* "ÄBC ÄBCDÄB ÄBCDÄBCDÄBDE" */
66 const char *result = mbscasestr (input, "\303\244BCD\303\204BD"); /* "äBCDÄBD" */
67 ASSERT (result == input + 19);
71 const char input[] = "\303\204BC \303\204BCD\303\204B \303\204BCD\303\204BCD\303\204BDE"; /* "ÄBC ÄBCDÄB ÄBCDÄBCDÄBDE" */
72 const char *result = mbscasestr (input, "\303\204BCD\303\204BE"); /* "ÄBCDÄBE" */
73 ASSERT (result == NULL);
76 /* Check that a very long haystack is handled quickly if the needle is
77 short and occurs near the beginning. */
79 size_t repeat = 10000;
82 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
83 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
84 char *haystack = (char *) malloc (m + 1);
87 memset (haystack, 'a', m);
88 haystack[0] = '\303'; haystack[1] = '\204';
91 for (; repeat > 0; repeat--)
93 ASSERT (mbscasestr (haystack, needle) == haystack + 2);
100 /* Check that a very long needle is discarded quickly if the haystack is
103 size_t repeat = 10000;
106 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
107 "A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
108 "A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
109 "A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
110 "A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
111 "A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207";
112 char *needle = (char *) malloc (m + 1);
115 memset (needle, 'A', m);
118 for (; repeat > 0; repeat--)
120 ASSERT (mbscasestr (haystack, needle) == NULL);
127 /* Check that the asymptotic worst-case complexity is not quadratic. */
130 char *haystack = (char *) malloc (2 * m + 3);
131 char *needle = (char *) malloc (m + 3);
132 if (haystack != NULL && needle != NULL)
136 memset (haystack, 'A', 2 * m);
137 haystack[2 * m] = '\303'; haystack[2 * m + 1] = '\247';
138 haystack[2 * m + 2] = '\0';
140 memset (needle, 'a', m);
141 needle[m] = '\303'; needle[m + 1] = '\207';
142 needle[m + 2] = '\0';
144 result = mbscasestr (haystack, needle);
145 ASSERT (result == haystack + m);