|
| T * | head () |
| | Return the element at the head of the list.
|
| |
| void | enqueue (T *entry) |
| | Add an element to the tail of the list.
|
| |
| T * | dequeue () |
| | Remove the element at the head of the list.
|
| |
| void | enqueue (LinkEntry *entry) |
| | Add an element to the tail of the list.
|
| |
| void | remove (LinkEntry *entry) |
| | Remove the specified element if it is in the list.
|
| |
template<class T>
class LinkedList< T >
Definition at line 30 of file LinkedList.h.
◆ head()
Return the element at the head of the list.
- Returns
- The element at the head of the list or NULL if the list is empty
Definition at line 40 of file LinkedList.h.
◆ enqueue() [1/2]
template<class T >
| void enqueue |
( |
T * |
entry | ) |
|
Add an element to the tail of the list.
- Parameters
-
Definition at line 50 of file LinkedList.h.
◆ dequeue()
Remove the element at the head of the list.
- Returns
- The element at the head of the list or NULL if the list is empty
Definition at line 60 of file LinkedList.h.
◆ enqueue() [2/2]
Add an element to the tail of the list.
- Parameters
-
◆ remove()
Remove the specified element if it is in the list.
- Parameters
-
| entry | Element to remove from the list |