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. */
29 #define ASSERT(expr) if (!(expr)) abort ();
35 const char input[] = "foo";
36 const char *result = c_strstr (input, "");
37 ASSERT (result == input);
41 const char input[] = "foo";
42 const char *result = c_strstr (input, "o");
43 ASSERT (result == input + 1);
47 const char input[] = "ABC ABCDAB ABCDABCDABDE";
48 const char *result = c_strstr (input, "ABCDABD");
49 ASSERT (result == input + 15);
53 const char input[] = "ABC ABCDAB ABCDABCDABDE";
54 const char *result = c_strstr (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 char *haystack = (char *) malloc (m + 1);
69 memset (haystack, 'A', m);
73 for (; repeat > 0; repeat--)
75 ASSERT (c_strstr (haystack, needle) == haystack + 1);
82 /* Check that a very long needle is discarded quickly if the haystack is
85 size_t repeat = 10000;
88 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
89 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
90 char *needle = (char *) malloc (m + 1);
93 memset (needle, 'A', m);
96 for (; repeat > 0; repeat--)
98 ASSERT (c_strstr (haystack, needle) == NULL);
105 /* Check that the asymptotic worst-case complexity is not quadratic. */
108 char *haystack = (char *) malloc (2 * m + 2);
109 char *needle = (char *) malloc (m + 2);
110 if (haystack != NULL && needle != NULL)
114 memset (haystack, 'A', 2 * m);
115 haystack[2 * m] = 'B';
116 haystack[2 * m + 1] = '\0';
118 memset (needle, 'A', m);
120 needle[m + 1] = '\0';
122 result = c_strstr (haystack, needle);
123 ASSERT (result == haystack + m);
127 if (haystack != NULL)