1 /* Test of 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 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. */
27 #define ASSERT(expr) \
32 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
42 const char input[] = "foo";
43 const char *result = c_strstr (input, "");
44 ASSERT (result == input);
48 const char input[] = "foo";
49 const char *result = c_strstr (input, "o");
50 ASSERT (result == input + 1);
54 const char input[] = "ABC ABCDAB ABCDABCDABDE";
55 const char *result = c_strstr (input, "ABCDABD");
56 ASSERT (result == input + 15);
60 const char input[] = "ABC ABCDAB ABCDABCDABDE";
61 const char *result = c_strstr (input, "ABCDABE");
62 ASSERT (result == NULL);
65 /* Check that a very long haystack is handled quickly if the needle is
66 short and occurs near the beginning. */
68 size_t repeat = 10000;
71 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
72 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
73 char *haystack = (char *) malloc (m + 1);
76 memset (haystack, 'A', m);
80 for (; repeat > 0; repeat--)
82 ASSERT (c_strstr (haystack, needle) == haystack + 1);
89 /* Check that a very long needle is discarded quickly if the haystack is
92 size_t repeat = 10000;
95 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
96 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
97 char *needle = (char *) malloc (m + 1);
100 memset (needle, 'A', m);
103 for (; repeat > 0; repeat--)
105 ASSERT (c_strstr (haystack, needle) == NULL);
112 /* Check that the asymptotic worst-case complexity is not quadratic. */
115 char *haystack = (char *) malloc (2 * m + 2);
116 char *needle = (char *) malloc (m + 2);
117 if (haystack != NULL && needle != NULL)
121 memset (haystack, 'A', 2 * m);
122 haystack[2 * m] = 'B';
123 haystack[2 * m + 1] = '\0';
125 memset (needle, 'A', m);
127 needle[m + 1] = '\0';
129 result = c_strstr (haystack, needle);
130 ASSERT (result == haystack + m);
134 if (haystack != NULL)