Esta função será útil para obter número de dependentes, por exemplo.
ifree(list->items[i].val);
free(list);
}
ifree(list->items[i].val);
free(list);
}
+
+int list_size(struct list *list)
+{
+ return list->len;
+}
int list_insert_ordered(struct list **list, void *val, sort_function_t *fn);
void * list_get(struct list *list, int pos);
void list_free(struct list *list, free_function_t *ifree);
int list_insert_ordered(struct list **list, void *val, sort_function_t *fn);
void * list_get(struct list *list, int pos);
void list_free(struct list *list, free_function_t *ifree);
+int list_size(struct list *list);