Dillo v3.1.1-111-gd4f56d0d
|
Fast list methods. More...
Go to the source code of this file.
Macros | |
#define | a_List_resize(list, num_items, alloc_step) |
Make sure there's space for 'num_items' items within the list. | |
#define | a_List_add(list, num_items, alloc_step) a_List_resize(list,num_items,alloc_step) |
Make sure there's space for one more item within the list. | |
#define | a_List_remove(list, item, num_items) |
Quickly remove an item from the list ==> We preserve relative position, but not the element index <==. | |
#define a_List_add | ( | list, | |
num_items, | |||
alloc_step | |||
) | a_List_resize(list,num_items,alloc_step) |
#define a_List_remove | ( | list, | |
item, | |||
num_items | |||
) |
#define a_List_resize | ( | list, | |
num_items, | |||
alloc_step | |||
) |
Make sure there's space for 'num_items' items within the list.
(First, allocate an 'alloc_step' sized chunk, after that, double the list size –to make it faster)