363d59df1a
Up to now, path-lists were sorted at all times. But sometimes it is much more convenient to build the list and sort it at the end, or sort it not at all. Add path_list_append() and sort_path_list() to allow that. Also, add the unsorted_path_list_has_path() function, to do a linear search. Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de> Signed-off-by: Junio C Hamano <gitster@pobox.com>
29 lines
898 B
C
29 lines
898 B
C
#ifndef PATH_LIST_H
|
|
#define PATH_LIST_H
|
|
|
|
struct path_list_item {
|
|
char *path;
|
|
void *util;
|
|
};
|
|
struct path_list
|
|
{
|
|
struct path_list_item *items;
|
|
unsigned int nr, alloc;
|
|
unsigned int strdup_paths:1;
|
|
};
|
|
|
|
void print_path_list(const char *text, const struct path_list *p);
|
|
void path_list_clear(struct path_list *list, int free_util);
|
|
|
|
/* Use these functions only on sorted lists: */
|
|
int path_list_has_path(const struct path_list *list, const char *path);
|
|
struct path_list_item *path_list_insert(const char *path, struct path_list *list);
|
|
struct path_list_item *path_list_lookup(const char *path, struct path_list *list);
|
|
|
|
/* Use these functions only on unsorted lists: */
|
|
struct path_list_item *path_list_append(const char *path, struct path_list *list);
|
|
void sort_path_list(struct path_list *list);
|
|
int unsorted_path_list_has_path(struct path_list *list, const char *path);
|
|
|
|
#endif /* PATH_LIST_H */
|