1 /* Test of case-insensitive searching in a string.
2 Copyright (C) 2007-2011 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 long periodic needle does not cause false positives. */
63 const char input[] = ("F_BD_CE_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD"
64 "_C3_88_20_EF_BF_BD_EF_BF_BD_EF_BF_BD"
65 "_C3_A7_20_EF_BF_BD");
66 const char need[] = "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD";
67 const char *result = c_strcasestr (input, need);
68 ASSERT (result == NULL);
71 const char input[] = ("F_BD_CE_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD"
72 "_C3_88_20_EF_BF_BD_EF_BF_BD_EF_BF_BD"
73 "_C3_A7_20_EF_BF_BD_DA_B5_C2_A6_20"
74 "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD");
75 const char need[] = "_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD_EF_BF_BD";
76 const char *result = c_strcasestr (input, need);
77 ASSERT (result == input + 115);
80 /* Check that a very long haystack is handled quickly if the needle is
81 short and occurs near the beginning. */
83 size_t repeat = 10000;
86 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
87 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
88 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
89 char *haystack = (char *) malloc (m + 1);
92 memset (haystack, 'A', m);
96 for (; repeat > 0; repeat--)
98 ASSERT (c_strcasestr (haystack, needle) == haystack + 1);
105 /* Check that a very long needle is discarded quickly if the haystack is
108 size_t repeat = 10000;
110 const char *haystack =
111 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
112 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
113 char *needle = (char *) malloc (m + 1);
116 memset (needle, 'A', m);
119 for (; repeat > 0; repeat--)
121 ASSERT (c_strcasestr (haystack, needle) == NULL);
128 /* Check that the asymptotic worst-case complexity is not quadratic. */
131 char *haystack = (char *) malloc (2 * m + 2);
132 char *needle = (char *) malloc (m + 2);
133 if (haystack != NULL && needle != NULL)
137 memset (haystack, 'A', 2 * m);
138 haystack[2 * m] = 'B';
139 haystack[2 * m + 1] = '\0';
141 memset (needle, 'a', m);
143 needle[m + 1] = '\0';
145 result = c_strcasestr (haystack, needle);
146 ASSERT (result == haystack + m);