A C data structure library for rapid prototyping
list
provides basic functionalities of double-linked lists
darray
provides basic functionalities of an dynamic array
hashmap
depending on darray
Creates a new double-linked List
Destroys a List and any elements it might have
Convenience function for freeing the values in each node, but not the nodes
Clears and destroys a list. Loops over the list twice
Returns the number of elements in the list, which is maintained as elements are added and removed
Returns the first element of the list, but does not remove it
Returns the last element of the list, but does not remove it
Adds a new element to the end of the list (fast)
Takes the last element off and returns it
Like List_push, adds element to the front
Like List_pop, this removes the first element and returns it
Removes the nodes in List_pop and List_shift
Iterates over the elements in the list
Create new dynamic array from type t
Create a new element pointer for array
Returns the last element
Returns the first element
Returns the index of the last element
Returns the number of elements in array
Returns the max elements
Set an element on index i with the element pointer el
Returns element on index i
Removes el on index i
Clear all elements
Clear array and free it afterwards
Push an element pointer into the end of the array. If max size is reached, the array expands
Returns and remove the last element. If old max size is reached, the array shrinks