1 /* Test of case-insensitive 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. */
21 #include "c-strcasestr.h"
27 #define ASSERT(expr) \
32 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
42 const char input[] = "foo";
43 const char *result = c_strcasestr (input, "");
44 ASSERT (result == input);
48 const char input[] = "foo";
49 const char *result = c_strcasestr (input, "O");
50 ASSERT (result == input + 1);
54 const char input[] = "ABC ABCDAB ABCDABCDABDE";
55 const char *result = c_strcasestr (input, "ABCDaBD");
56 ASSERT (result == input + 15);
60 const char input[] = "ABC ABCDAB ABCDABCDABDE";
61 const char *result = c_strcasestr (input, "ABCDaBE");
62 ASSERT (result == NULL);
66 const char input[] = "ABC ABCDAB ABCDABCDABDE";
67 const char *result = c_strcasestr (input, "ABCDaBCD");
68 ASSERT (result == input + 11);
71 /* Check that a very long haystack is handled quickly if the needle is
72 short and occurs near the beginning. */
74 size_t repeat = 10000;
77 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
78 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
79 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
80 char *haystack = (char *) malloc (m + 1);
83 memset (haystack, 'A', m);
87 for (; repeat > 0; repeat--)
89 ASSERT (c_strcasestr (haystack, needle) == haystack + 1);
96 /* Check that a very long needle is discarded quickly if the haystack is
99 size_t repeat = 10000;
102 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
103 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
104 char *needle = (char *) malloc (m + 1);
107 memset (needle, 'A', m);
110 for (; repeat > 0; repeat--)
112 ASSERT (c_strcasestr (haystack, needle) == NULL);
119 /* Check that the asymptotic worst-case complexity is not quadratic. */
122 char *haystack = (char *) malloc (2 * m + 2);
123 char *needle = (char *) malloc (m + 2);
124 if (haystack != NULL && needle != NULL)
128 memset (haystack, 'A', 2 * m);
129 haystack[2 * m] = 'B';
130 haystack[2 * m + 1] = '\0';
132 memset (needle, 'a', m);
134 needle[m + 1] = '\0';
136 result = c_strcasestr (haystack, needle);
137 ASSERT (result == haystack + m);
141 if (haystack != NULL)