summaryrefslogtreecommitdiff
path: root/string-list.h
diff options
context:
space:
mode:
authorMichael Haggerty <mhagger@alum.mit.edu>2012-10-28 17:16:27 +0100
committerJeff King <peff@peff.net>2012-10-29 02:34:58 -0400
commit059b37934c611b1b9b735e0310ba282a0c7f5eba (patch)
treec1438784babc6ee81faae36311bc31d52fb5e5e4 /string-list.h
parent1b77d83cab798668d8a54a05b3fa0262486f7dfc (diff)
downloadgit-059b37934c611b1b9b735e0310ba282a0c7f5eba.tar.gz
string_list_longest_prefix(): remove function
This function was added in f103f95b11d087f07c0c48bf784cd9197e18f203 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>
Diffstat (limited to 'string-list.h')
-rw-r--r--string-list.h8
1 files changed, 0 insertions, 8 deletions
diff --git a/string-list.h b/string-list.h
index 5efd07b44e..3a6a6dc392 100644
--- a/string-list.h
+++ b/string-list.h
@@ -38,14 +38,6 @@ int for_each_string_list(struct string_list *list,
void filter_string_list(struct string_list *list, int free_util,
string_list_each_func_t want, void *cb_data);
-/*
- * Return the longest string in prefixes that is a prefix (in the
- * sense of prefixcmp()) of string, or NULL if no such prefix exists.
- * This function does not require the string_list to be sorted (it
- * does a linear search).
- */
-char *string_list_longest_prefix(const struct string_list *prefixes, const char *string);
-
/* Use these functions only on sorted lists: */
int string_list_has_string(const struct string_list *list, const char *string);