1 /* Test of case-insensitive searching in a string.
2 Copyright (C) 2007 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 2, or (at your option)
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, write to the Free Software Foundation,
16 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
18 /* Written by Bruno Haible <bruno@clisp.org>, 2007. */
29 #define ASSERT(expr) \
34 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
43 /* This test is executed in the C locale. */
46 const char input[] = "foo";
47 const char *result = mbscasestr (input, "");
48 ASSERT (result == input);
52 const char input[] = "foo";
53 const char *result = mbscasestr (input, "O");
54 ASSERT (result == input + 1);
58 const char input[] = "ABC ABCDAB ABCDABCDABDE";
59 const char *result = mbscasestr (input, "ABCDaBD");
60 ASSERT (result == input + 15);
64 const char input[] = "ABC ABCDAB ABCDABCDABDE";
65 const char *result = mbscasestr (input, "ABCDaBE");
66 ASSERT (result == NULL);
69 /* Check that a very long haystack is handled quickly if the needle is
70 short and occurs near the beginning. */
72 size_t repeat = 10000;
75 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
76 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
77 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
78 char *haystack = (char *) malloc (m + 1);
81 memset (haystack, 'A', m);
85 for (; repeat > 0; repeat--)
87 ASSERT (mbscasestr (haystack, needle) == haystack + 1);
94 /* Check that a very long needle is discarded quickly if the haystack is
97 size_t repeat = 10000;
100 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
101 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
102 char *needle = (char *) malloc (m + 1);
105 memset (needle, 'A', m);
108 for (; repeat > 0; repeat--)
110 ASSERT (mbscasestr (haystack, needle) == NULL);
117 /* Check that the asymptotic worst-case complexity is not quadratic. */
120 char *haystack = (char *) malloc (2 * m + 2);
121 char *needle = (char *) malloc (m + 2);
122 if (haystack != NULL && needle != NULL)
126 memset (haystack, 'A', 2 * m);
127 haystack[2 * m] = 'B';
128 haystack[2 * m + 1] = '\0';
130 memset (needle, 'a', m);
132 needle[m + 1] = '\0';
134 result = mbscasestr (haystack, needle);
135 ASSERT (result == haystack + m);
139 if (haystack != NULL)