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. */
24 #include "c-strcasestr.h"
29 #define ASSERT(expr) if (!(expr)) abort ();
35 const char input[] = "foo";
36 const char *result = c_strcasestr (input, "");
37 ASSERT (result == input);
41 const char input[] = "foo";
42 const char *result = c_strcasestr (input, "O");
43 ASSERT (result == input + 1);
47 const char input[] = "ABC ABCDAB ABCDABCDABDE";
48 const char *result = c_strcasestr (input, "ABCDaBD");
49 ASSERT (result == input + 15);
53 const char input[] = "ABC ABCDAB ABCDABCDABDE";
54 const char *result = c_strcasestr (input, "ABCDaBE");
55 ASSERT (result == NULL);
58 /* Check that a very long haystack is handled quickly if the needle is
59 short and occurs near the beginning. */
61 size_t repeat = 10000;
64 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
65 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
66 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
67 char *haystack = (char *) malloc (m + 1);
70 memset (haystack, 'A', m);
74 for (; repeat > 0; repeat--)
76 ASSERT (c_strcasestr (haystack, needle) == haystack + 1);
83 /* Check that a very long needle is discarded quickly if the haystack is
86 size_t repeat = 10000;
89 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
90 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
91 char *needle = (char *) malloc (m + 1);
94 memset (needle, 'A', m);
97 for (; repeat > 0; repeat--)
99 ASSERT (c_strcasestr (haystack, needle) == NULL);
106 /* Check that the asymptotic worst-case complexity is not quadratic. */
109 char *haystack = (char *) malloc (2 * m + 2);
110 char *needle = (char *) malloc (m + 2);
111 if (haystack != NULL && needle != NULL)
115 memset (haystack, 'A', 2 * m);
116 haystack[2 * m] = 'B';
117 haystack[2 * m + 1] = '\0';
119 memset (needle, 'a', m);
121 needle[m + 1] = '\0';
123 result = c_strcasestr (haystack, needle);
124 ASSERT (result == haystack + m);
128 if (haystack != NULL)