int
main ()
{
/* configure should already have checked that the locale is supported. */
if (setlocale (LC_ALL, "") == NULL)
return 1;
{
const char input[] = "GOLD NEEDLE BEATS TIN NEEDLE";
ASSERT (mbscasestr (input, "Needle") == input + 5);
}
/* The following tests show how mbscasestr() is different from
strcasestr(). */
{
const char input[] = "s\303\266zc\303\274k"; /* sözcük */
ASSERT (mbscasestr (input, "\303\266z") == input + 1);
ASSERT (mbscasestr (input, "\303\266c") == NULL);
}
/* This test shows how a string of larger size can be found in a string of
smaller size. */
{
const char input[] = "*Tbilisi imini*";
ASSERT (mbscasestr (input, "TB\304\260L\304\260S\304\260 \304\260m\304\260n\304\260") == input + 1); /* TBİLİSİ İmİnİ */
}
return 0;
}
int
main ()
{
/* configure should already have checked that the locale is supported. */
if (setlocale (LC_ALL, "") == NULL)
return 1;
{
const char input[] = "f\303\266\303\266";
const char *result = mbscasestr (input, "");
ASSERT (result == input);
}
{
const char input[] = "f\303\266\303\266";
const char *result = mbscasestr (input, "\303\266");
ASSERT (result == input + 1);
}
{
const char input[] = "f\303\266\303\266";
const char *result = mbscasestr (input, "\266\303");
ASSERT (result == NULL);
}
{
const char input[] = "\303\204BC \303\204BCD\303\204B \303\204BCD\303\204BCD\303\204BDE"; /* "ÄBC ÄBCDÄB ÄBCDÄBCDÄBDE" */
const char *result = mbscasestr (input, "\303\244BCD\303\204BD"); /* "äBCDÄBD" */
ASSERT (result == input + 19);
}
{
const char input[] = "\303\204BC \303\204BCD\303\204B \303\204BCD\303\204BCD\303\204BDE"; /* "ÄBC ÄBCDÄB ÄBCDÄBCDÄBDE" */
const char *result = mbscasestr (input, "\303\204BCD\303\204BE"); /* "ÄBCDÄBE" */
ASSERT (result == NULL);
}
/* Check that a very long haystack is handled quickly if the needle is
short and occurs near the beginning. */
{
size_t repeat = 10000;
size_t m = 1000000;
const char *needle =
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
char *haystack = (char *) malloc (m + 1);
if (haystack != NULL)
{
memset (haystack, 'a', m);
haystack[0] = '\303'; haystack[1] = '\204';
haystack[m] = '\0';
for (; repeat > 0; repeat--)
{
ASSERT (mbscasestr (haystack, needle) == haystack + 2);
}
free (haystack);
}
}
/* Check that a very long needle is discarded quickly if the haystack is
short. */
{
size_t repeat = 10000;
size_t m = 1000000;
const char *haystack =
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207"
"A\303\207A\303\207A\303\207A\303\207A\303\207A\303\207";
char *needle = (char *) malloc (m + 1);
if (needle != NULL)
{
memset (needle, 'A', m);
needle[m] = '\0';
for (; repeat > 0; repeat--)
{
ASSERT (mbscasestr (haystack, needle) == NULL);
}
free (needle);
}
}
/* Check that the asymptotic worst-case complexity is not quadratic. */
{
size_t m = 1000000;
char *haystack = (char *) malloc (2 * m + 3);
char *needle = (char *) malloc (m + 3);
if (haystack != NULL && needle != NULL)
{
const char *result;
memset (haystack, 'A', 2 * m);
haystack[2 * m] = '\303'; haystack[2 * m + 1] = '\247';
haystack[2 * m + 2] = '\0';
memset (needle, 'a', m);
needle[m] = '\303'; needle[m + 1] = '\207';
needle[m + 2] = '\0';
result = mbscasestr (haystack, needle);
ASSERT (result == haystack + m);
}
free (needle);
free (haystack);
}
return 0;
}
int
main ()
{
/* This test is executed in the C locale. */
{
const char input[] = "foo";
const char *result = mbscasestr (input, "");
ASSERT (result == input);
}
{
const char input[] = "foo";
const char *result = mbscasestr (input, "O");
ASSERT (result == input + 1);
}
{
const char input[] = "ABC ABCDAB ABCDABCDABDE";
const char *result = mbscasestr (input, "ABCDaBD");
ASSERT (result == input + 15);
}
{
const char input[] = "ABC ABCDAB ABCDABCDABDE";
const char *result = mbscasestr (input, "ABCDaBE");
ASSERT (result == NULL);
}
/* Check that a very long haystack is handled quickly if the needle is
short and occurs near the beginning. */
{
size_t repeat = 10000;
size_t m = 1000000;
const char *needle =
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAaaaaaaAAAAaaaaaaa"
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA";
char *haystack = (char *) malloc (m + 1);
if (haystack != NULL)
{
memset (haystack, 'A', m);
haystack[0] = 'B';
haystack[m] = '\0';
for (; repeat > 0; repeat--)
{
ASSERT (mbscasestr (haystack, needle) == haystack + 1);
}
free (haystack);
}
}
/* Check that a very long needle is discarded quickly if the haystack is
short. */
{
size_t repeat = 10000;
size_t m = 1000000;
const char *haystack =
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
"ABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABABAB";
char *needle = (char *) malloc (m + 1);
if (needle != NULL)
{
memset (needle, 'A', m);
needle[m] = '\0';
for (; repeat > 0; repeat--)
{
ASSERT (mbscasestr (haystack, needle) == NULL);
}
free (needle);
}
}
/* Check that the asymptotic worst-case complexity is not quadratic. */
{
size_t m = 1000000;
char *haystack = (char *) malloc (2 * m + 2);
char *needle = (char *) malloc (m + 2);
if (haystack != NULL && needle != NULL)
{
const char *result;
memset (haystack, 'A', 2 * m);
haystack[2 * m] = 'B';
haystack[2 * m + 1] = '\0';
memset (needle, 'a', m);
needle[m] = 'B';
needle[m + 1] = '\0';
result = mbscasestr (haystack, needle);
ASSERT (result == haystack + m);
}
free (needle);
free (haystack);
}
return 0;
}
