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 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. */
28 #define ASSERT(expr) if (!(expr)) abort ();
34 const char input[] = "foo";
35 const char *result = c_strstr (input, "");
36 ASSERT (result == input);
40 const char input[] = "foo";
41 const char *result = c_strstr (input, "o");
42 ASSERT (result == input + 1);
46 const char input[] = "ABC ABCDAB ABCDABCDABDE";
47 const char *result = c_strstr (input, "ABCDABD");
48 ASSERT (result == input + 15);
52 const char input[] = "ABC ABCDAB ABCDABCDABDE";
53 const char *result = c_strstr (input, "ABCDABE");
54 ASSERT (result == NULL);
57 /* Check that a very long haystack is handled quickly if the needle is
58 short and occurs near the beginning. */
60 size_t repeat = 10000;
63 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
64 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
65 char *haystack = (char *) malloc (m + 1);
68 memset (haystack, 'A', m);
72 for (; repeat > 0; repeat--)
74 ASSERT (c_strstr (haystack, needle) == haystack + 1);
81 /* Check that a very long needle is discarded quickly if the haystack is
84 size_t repeat = 10000;
87 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
88 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
89 char *needle = (char *) malloc (m + 1);
92 memset (needle, 'A', m);
95 for (; repeat > 0; repeat--)
97 ASSERT (c_strstr (haystack, needle) == NULL);
104 /* Check that the asymptotic worst-case complexity is not quadratic. */
107 char *haystack = (char *) malloc (2 * m + 2);
108 char *needle = (char *) malloc (m + 2);
109 if (haystack != NULL && needle != NULL)
113 memset (haystack, 'A', 2 * m);
114 haystack[2 * m] = 'B';
115 haystack[2 * m + 1] = '\0';
117 memset (needle, 'A', m);
119 needle[m + 1] = '\0';
121 result = c_strstr (haystack, needle);
122 ASSERT (result == haystack + m);
126 if (haystack != NULL)