mirror of
https://github.com/git/git
synced 2024-10-28 19:25:47 +00:00
059b37934c
This function was added in f103f95b11 in
the erroneous expectation that it would be used in the
reimplementation of longest_ancestor_length(). But it turned out to
be easier to use a function specialized for comparing path prefixes
(i.e., one that knows about slashes and root paths) than to prepare
the paths in such a way that a generic string prefix comparison
function can be used. So delete string_list_longest_prefix() and its
documentation and test cases.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Jeff King <peff@peff.net>
103 lines
2.5 KiB
C
103 lines
2.5 KiB
C
#include "cache.h"
|
|
#include "string-list.h"
|
|
|
|
/*
|
|
* Parse an argument into a string list. arg should either be a
|
|
* ':'-separated list of strings, or "-" to indicate an empty string
|
|
* list (as opposed to "", which indicates a string list containing a
|
|
* single empty string). list->strdup_strings must be set.
|
|
*/
|
|
static void parse_string_list(struct string_list *list, const char *arg)
|
|
{
|
|
if (!strcmp(arg, "-"))
|
|
return;
|
|
|
|
(void)string_list_split(list, arg, ':', -1);
|
|
}
|
|
|
|
static void write_list(const struct string_list *list)
|
|
{
|
|
int i;
|
|
for (i = 0; i < list->nr; i++)
|
|
printf("[%d]: \"%s\"\n", i, list->items[i].string);
|
|
}
|
|
|
|
static void write_list_compact(const struct string_list *list)
|
|
{
|
|
int i;
|
|
if (!list->nr)
|
|
printf("-\n");
|
|
else {
|
|
printf("%s", list->items[0].string);
|
|
for (i = 1; i < list->nr; i++)
|
|
printf(":%s", list->items[i].string);
|
|
printf("\n");
|
|
}
|
|
}
|
|
|
|
static int prefix_cb(struct string_list_item *item, void *cb_data)
|
|
{
|
|
const char *prefix = (const char *)cb_data;
|
|
return !prefixcmp(item->string, prefix);
|
|
}
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
if (argc == 5 && !strcmp(argv[1], "split")) {
|
|
struct string_list list = STRING_LIST_INIT_DUP;
|
|
int i;
|
|
const char *s = argv[2];
|
|
int delim = *argv[3];
|
|
int maxsplit = atoi(argv[4]);
|
|
|
|
i = string_list_split(&list, s, delim, maxsplit);
|
|
printf("%d\n", i);
|
|
write_list(&list);
|
|
string_list_clear(&list, 0);
|
|
return 0;
|
|
}
|
|
|
|
if (argc == 5 && !strcmp(argv[1], "split_in_place")) {
|
|
struct string_list list = STRING_LIST_INIT_NODUP;
|
|
int i;
|
|
char *s = xstrdup(argv[2]);
|
|
int delim = *argv[3];
|
|
int maxsplit = atoi(argv[4]);
|
|
|
|
i = string_list_split_in_place(&list, s, delim, maxsplit);
|
|
printf("%d\n", i);
|
|
write_list(&list);
|
|
string_list_clear(&list, 0);
|
|
free(s);
|
|
return 0;
|
|
}
|
|
|
|
if (argc == 4 && !strcmp(argv[1], "filter")) {
|
|
/*
|
|
* Retain only the items that have the specified prefix.
|
|
* Arguments: list|- prefix
|
|
*/
|
|
struct string_list list = STRING_LIST_INIT_DUP;
|
|
const char *prefix = argv[3];
|
|
|
|
parse_string_list(&list, argv[2]);
|
|
filter_string_list(&list, 0, prefix_cb, (void *)prefix);
|
|
write_list_compact(&list);
|
|
string_list_clear(&list, 0);
|
|
return 0;
|
|
}
|
|
|
|
if (argc == 3 && !strcmp(argv[1], "remove_duplicates")) {
|
|
struct string_list list = STRING_LIST_INIT_DUP;
|
|
|
|
parse_string_list(&list, argv[2]);
|
|
string_list_remove_duplicates(&list, 0);
|
|
write_list_compact(&list);
|
|
string_list_clear(&list, 0);
|
|
return 0;
|
|
}
|
|
|
|
fprintf(stderr, "%s: unknown function name: %s\n", argv[0],
|
|
argv[1] ? argv[1] : "(there was none)");
|
|
return 1;
|
|
}
|