List_Create	list.c	/^void List_Create(List *list, size_t len)$/
List_Destroy	list.c	/^void List_Destroy(List *list)$/
List_Insert	list.c	/^void List_Insert(List *list, Pointer data, Positio/
List_Length	list.c	/^size_t List_Length(List *list)$/
List_Position	list.c	/^Pointer List_Position(List *list, Index pos)$/
List_Remove	list.c	/^void List_Remove(List *list, Index pos)$/
Queue_Create	queue.c	/^void Queue_Create(Queue *q,size_t len)$/
Queue_Dequeue	queue.c	/^void Queue_Dequeue(Queue *q)$/
Queue_Destroy	queue.c	/^void Queue_Destroy(Queue *q)$/
Queue_Enqueue	queue.c	/^void Queue_Enqueue(Queue *q,Pointer data)$/
Queue_Length	queue.c	/^size_t Queue_Length(Queue *q)$/
Queue_Next	queue.c	/^Pointer Queue_Next(Queue *q)$/
Stack_Create	stack.c	/^void Stack_Create(Stack *stack, size_t len)$/
Stack_Destroy	stack.c	/^void Stack_Destroy(Stack *stack)$/
Stack_Length	stack.c	/^size_t Stack_Length(Stack *stack)$/
Stack_Pop	stack.c	/^void Stack_Pop(Stack *stack)$/
Stack_Push	stack.c	/^void Stack_Push(Stack *stack,Pointer data)$/
Stack_Top	stack.c	/^Pointer Stack_Top(Stack *stack)$/
delete_element	helper.c	/^void delete_element(Element *tmp)$/
new_element	helper.c	/^Element *new_element(Pointer data, size_t len)$/