| Structure's name |
What it represents |
| LList
OLList DLList ODLList CLList Stack Queue CQueue (new) Deque (new) Set OSet Heap PQueue CHTable Graph |
singly-linked lists ordered singly-linked lists doubly-linked lists ordered doubly-linked lists circular-linked lists stacks queues circular queues double ended queues ( aka deques) sets ordered sets heaps priority queues hash tables (chained hash table model) graphs (adjacency-list representation) |
| Strucure's name |
What it represents |
| LListElement OLListElement DLListElement ODLListElement CLListElement StackElement QueueElement CQueueElement DequeElement SetElement OSetElement Vertex Edge |
singly-linked list element
ordered singly-linked list element doubly-linked list element ordered doubly-linked list element circular-linked list element stack element queue element circular queue element deque element set element ordered set element graph vertex graph edge |
|
function type's name
|
What it represents |
| comparefunc
destroyfunc hashfunc |
function to compare data elements function to free dynamically allocated data. hash function |