Documentation

ListForeachReverse

ListForeachReverse Description Iterate over each element var of the given list l in reverse order. The variable var is declared and defined by this macro. Iteration happens in reverse, starting from the tail of the list and continuing through the prev pointers until the head is reached. The variable var will contain a copy of the value pointed to by each list node.

Read More

ListForeachReverseIdx

ListForeachReverseIdx Description Iterate over each element var of the given list l in reverse order, with index idx. The variable var is declared and defined by this macro. Iteration starts from the tail and moves backward using the prev pointers. The variable idx will contain the zero-based index from the head: index length-1 corresponds to the tail, length-2 to the previous node, and so on down to 0 (head).

Read More

ListForeachReverseInRange

ListForeachReverseInRange Description Iterate over each element var of the given list l in reverse, limited to index range [start, end) relative to the tail of the list. Index 0 corresponds to the tail, 1 to the previous node, and so on. The variable var is declared and defined by this macro. Since linked lists do not support indexing, this macro counts nodes from the tail and includes only those where the relative reverse index lies in [start, end).

Read More

ListInit

ListInit Description Initialize a list with default arguments.

Read More

ListInitT

ListInitT Description Initialize a list with default arguments.

Read More

ListInitWithDeepCopy

ListInitWithDeepCopy Description Initialize a list with copy init and deinit methods for maintaining a deep-copy.

Read More

ListInsert

ListInsert Description Insert an l-value into given list

Read More

ListInsertL

ListInsertL Description Insert an l-value into list of it’s type. Insertion index must not exceed list length.

Read More

ListInsertR

ListInsertR Description Insert an r-value into list of it’s type. Insertion index must not exceed list length.

Read More

ListLast

ListLast Description Value at last node in list This is a more expensive call. Fetches pointer to data twice and then dereferences. Better use ListPtrAt instead.

Read More