• Advertisement
Sign in to follow this  
  • entries
  • comments
  • views

List primitive complete

Sign in to follow this  


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:
struct util_list *util_list_ini(unsigned size, void (*del)(void *)); // constructs the list object
void util_list_del(struct util_list *); // deletes the list object
void *util_list_add(struct util_list *); // adds an element
void util_list_rem(struct util_list *, void *); // removes an element
void *util_list_enum(struct util_list *); // enumerates the elements
Sign in to follow this  


Recommended Comments

There are no comments to display.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • Advertisement