2015-08-05 03:30:40 +02:00
|
|
|
#ifndef _SWAY_LIST_H
|
|
|
|
#define _SWAY_LIST_H
|
|
|
|
|
|
|
|
typedef struct {
|
2015-08-10 21:09:51 +02:00
|
|
|
int capacity;
|
|
|
|
int length;
|
|
|
|
void **items;
|
2015-08-05 03:30:40 +02:00
|
|
|
} list_t;
|
|
|
|
|
2015-08-11 02:32:50 +02:00
|
|
|
list_t *create_list(void);
|
2015-08-05 03:30:40 +02:00
|
|
|
void list_free(list_t *list);
|
|
|
|
void list_add(list_t *list, void *item);
|
2015-08-10 01:27:25 +02:00
|
|
|
void list_insert(list_t *list, int index, void *item);
|
2015-08-05 03:30:40 +02:00
|
|
|
void list_del(list_t *list, int index);
|
|
|
|
void list_cat(list_t *list, list_t *source);
|
2015-09-08 17:54:57 +02:00
|
|
|
// See qsort
|
|
|
|
void list_sort(list_t *list, int compare(const void *left, const void *right));
|
2015-11-18 21:12:20 +01:00
|
|
|
// Return index for first item in list that returns 0 for given compare
|
|
|
|
// function or -1 if none matches.
|
|
|
|
int list_seq_find(list_t *list, int compare(const void *item, const void *cmp_to), const void *cmp_to);
|
2015-08-05 03:30:40 +02:00
|
|
|
|
|
|
|
#endif
|