struct util_list *util_list_ini(unsigned size, void (*del)(void *)); // constructs the list objectvoid util_list_del(struct util_list *); // deletes the list objectvoid *util_list_add(struct util_list *); // adds an elementvoid util_list_rem(struct util_list *, void *); // removes an elementvoid *util_list_enum(struct util_list *); // enumerates the elements
I finished my list primitive and integrated it with the engine. Its not quite a true linked-list in that it doesn't have any concept of order. It doesn't provide previous/next iteration; only unordered enumeration. Here's the interface:
Advertisement
Latest Entries
Exponential shadow maps
2547 views
Median filtering
1297 views
Phun with Loo-ah
1503 views
Combating macro pollution
1425 views
Dynamic AABB
1526 views
Greetings
1106 views
Theora video recording
1035 views
Bug-fix update
1145 views
First demo release!
1551 views
Its not supposed to look like that!
1214 views
Advertisement