You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
112 lines
2.1 KiB
112 lines
2.1 KiB
3 months ago
|
/*
|
||
|
|
* UCW Library -- Matching Prefixes and Suffixes
|
||
|
|
*
|
||
|
|
* (c) 2011 Martin Mares <mj@ucw.cz>
|
||
|
|
*
|
||
|
|
* This software may be freely distributed and used according to the terms
|
||
|
|
* of the GNU Lesser General Public License.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <ucw/lib.h>
|
||
|
|
#include <ucw/string.h>
|
||
|
|
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
int
|
||
|
|
str_has_prefix(const char *str, const char *prefix)
|
||
|
|
{
|
||
|
|
size_t pxlen = strlen(prefix);
|
||
|
|
return !strncmp(str, prefix, pxlen);
|
||
|
|
}
|
||
|
|
|
||
|
|
int
|
||
|
|
str_has_suffix(const char *str, const char *suffix)
|
||
|
|
{
|
||
|
|
size_t sxlen = strlen(suffix);
|
||
|
|
size_t len = strlen(str);
|
||
|
|
|
||
|
|
if (len < sxlen)
|
||
|
|
return 0;
|
||
|
|
else
|
||
|
|
return !strcmp(str + len - sxlen, suffix);
|
||
|
|
}
|
||
|
|
|
||
|
|
int
|
||
|
|
str_hier_prefix(const char *str, const char *prefix, uint sep)
|
||
|
|
{
|
||
|
|
while (*str && *prefix)
|
||
|
|
{
|
||
|
|
size_t sl=0, pl=0;
|
||
|
|
while (str[sl] && (uint) str[sl] != sep)
|
||
|
|
sl++;
|
||
|
|
while (prefix[pl] && (uint) prefix[pl] != sep)
|
||
|
|
pl++;
|
||
|
|
if (sl != pl || memcmp(str, prefix, sl))
|
||
|
|
return 0;
|
||
|
|
str += sl, prefix += pl;
|
||
|
|
if (!*str)
|
||
|
|
return !*prefix;
|
||
|
|
if (!*prefix)
|
||
|
|
return 1;
|
||
|
|
str++, prefix++;
|
||
|
|
}
|
||
|
|
return !*prefix;
|
||
|
|
}
|
||
|
|
|
||
|
|
int
|
||
|
|
str_hier_suffix(const char *str, const char *suffix, uint sep)
|
||
|
|
{
|
||
|
|
const char *st = str + strlen(str);
|
||
|
|
const char *sx = suffix + strlen(suffix);
|
||
|
|
while (st > str && sx > suffix)
|
||
|
|
{
|
||
|
|
size_t sl=0, pl=0;
|
||
|
|
while (st-sl > str && (uint) st[-sl-1] != sep)
|
||
|
|
sl++;
|
||
|
|
while (sx-pl > suffix && (uint) sx[-pl-1] != sep)
|
||
|
|
pl++;
|
||
|
|
if (sl != pl || memcmp(st-sl, sx-pl, sl))
|
||
|
|
return 0;
|
||
|
|
st -= sl, sx -= pl;
|
||
|
|
if (st == str)
|
||
|
|
return (sx == suffix);
|
||
|
|
if (sx == suffix)
|
||
|
|
return 1;
|
||
|
|
st--, sx--;
|
||
|
|
}
|
||
|
|
return (sx == suffix);
|
||
|
|
}
|
||
|
|
|
||
|
|
#ifdef TEST
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
|
||
|
|
int main(int argc, char **argv)
|
||
|
|
{
|
||
|
|
if (argc != 4)
|
||
|
|
return 1;
|
||
|
|
|
||
|
|
int ret;
|
||
|
|
switch (argv[1][0])
|
||
|
|
{
|
||
|
|
case 'p':
|
||
|
|
ret = str_has_prefix(argv[2], argv[3]);
|
||
|
|
break;
|
||
|
|
case 's':
|
||
|
|
ret = str_has_suffix(argv[2], argv[3]);
|
||
|
|
break;
|
||
|
|
case 'P':
|
||
|
|
ret = str_hier_prefix(argv[2], argv[3], '.');
|
||
|
|
break;
|
||
|
|
case 'S':
|
||
|
|
ret = str_hier_suffix(argv[2], argv[3], '.');
|
||
|
|
break;
|
||
|
|
default:
|
||
|
|
return 1;
|
||
|
|
}
|
||
|
|
printf("%s\n", (ret ? "YES" : "NO"));
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|