1 /* Test of searching in a string.
2 Copyright (C) 2007-2008 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. */
26 #define ASSERT(expr) \
31 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
41 /* This test is executed in the C locale. */
44 const char input[] = "foo";
45 const char *result = mbsstr (input, "");
46 ASSERT (result == input);
50 const char input[] = "foo";
51 const char *result = mbsstr (input, "o");
52 ASSERT (result == input + 1);
56 const char input[] = "ABC ABCDAB ABCDABCDABDE";
57 const char *result = mbsstr (input, "ABCDABD");
58 ASSERT (result == input + 15);
62 const char input[] = "ABC ABCDAB ABCDABCDABDE";
63 const char *result = mbsstr (input, "ABCDABE");
64 ASSERT (result == NULL);
67 /* Check that a very long haystack is handled quickly if the needle is
68 short and occurs near the beginning. */
70 size_t repeat = 10000;
73 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
74 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
75 char *haystack = (char *) malloc (m + 1);
78 memset (haystack, 'A', m);
82 for (; repeat > 0; repeat--)
84 ASSERT (mbsstr (haystack, needle) == haystack + 1);
91 /* Check that a very long needle is discarded quickly if the haystack is
94 size_t repeat = 10000;
97 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
98 "ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
99 char *needle = (char *) malloc (m + 1);
102 memset (needle, 'A', m);
105 for (; repeat > 0; repeat--)
107 ASSERT (mbsstr (haystack, needle) == NULL);
114 /* Check that the asymptotic worst-case complexity is not quadratic. */
117 char *haystack = (char *) malloc (2 * m + 2);
118 char *needle = (char *) malloc (m + 2);
119 if (haystack != NULL && needle != NULL)
123 memset (haystack, 'A', 2 * m);
124 haystack[2 * m] = 'B';
125 haystack[2 * m + 1] = '\0';
127 memset (needle, 'A', m);
129 needle[m + 1] = '\0';
131 result = mbsstr (haystack, needle);
132 ASSERT (result == haystack + m);