next up previous contents index
Next: Hash tables Up: Linked lists Previous: Linked lists   Contents   Index

Internal list functions

There are some functions that are used internally, but may be used by you to do some clever optimizations. Note that, if not used correctly, you may break the code.

Element *list_element_from_data ( List *l, void *data ); 
Given a data, returns the Element it's stored in. Element is a structure:

struct element { 
struct element *next, *previous; 

void *data; 

}; 

typedef struct element Element;

This may be interesting if you need to access the next and previous nodes several times and you are not using a for_each_data, i.e., you need to use list_next and list_prev heavily.

int list_higher_level ( List *l ); 

void list_lower_level ( List *l ); 

These functions are used internally by for_each_data and should not be directly called by the user.



root 2002-02-17