Jump to content
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

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!