1 /* Test of case-insensitive searching in a string.
2 Copyright (C) 2007-2010 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"
32 const char input[] = "foo";
33 const char *result = c_strcasestr (input, "");
34 ASSERT (result == input);
38 const char input[] = "foo";
39 const char *result = c_strcasestr (input, "O");
40 ASSERT (result == input + 1);
44 const char input[] = "ABC ABCDAB ABCDABCDABDE";
45 const char *result = c_strcasestr (input, "ABCDaBD");
46 ASSERT (result == input + 15);
50 const char input[] = "ABC ABCDAB ABCDABCDABDE";
51 const char *result = c_strcasestr (input, "ABCDaBE");
52 ASSERT (result == NULL);
56 const char input[] = "ABC ABCDAB ABCDABCDABDE";
57 const char *result = c_strcasestr (input, "ABCDaBCD");
58 ASSERT (result == input + 11);
61 /* Check that a very long haystack is handled quickly if the needle is
62 short and occurs near the beginning. */
64 size_t repeat = 10000;
67 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
68 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
69 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
70 char *haystack = (char *) malloc (m + 1);
73 memset (haystack, 'A', m);
77 for (; repeat > 0; repeat--)
79 ASSERT (c_strcasestr (haystack, needle) == haystack + 1);
86 /* Check that a very long needle is discarded quickly if the haystack is
89 size_t repeat = 10000;
92 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
93 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
94 char *needle = (char *) malloc (m + 1);
97 memset (needle, 'A', m);
100 for (; repeat > 0; repeat--)
102 ASSERT (c_strcasestr (haystack, needle) == NULL);
109 /* Check that the asymptotic worst-case complexity is not quadratic. */
112 char *haystack = (char *) malloc (2 * m + 2);
113 char *needle = (char *) malloc (m + 2);
114 if (haystack != NULL && needle != NULL)
118 memset (haystack, 'A', 2 * m);
119 haystack[2 * m] = 'B';
120 haystack[2 * m + 1] = '\0';
122 memset (needle, 'a', m);
124 needle[m + 1] = '\0';
126 result = c_strcasestr (haystack, needle);
127 ASSERT (result == haystack + m);