ListForeach
ListForeach Description Iterate over each element var of the given list l. The variable var is declared and defined by this macro. Iteration happens in forward order, starting from the head of the list and continuing through the next pointers until the end is reached. The variable var will contain a copy of the value pointed to by each list node.
Read MoreListForeachIdx
ListForeachIdx Description Iterate over each element var of the given list l, with index idx. The variable var is declared and defined by this macro. Iteration happens in forward order, starting from the head of the list. This macro also tracks the index (idx) of each element during iteration. var will contain a copy of the value pointed to by each list node, and idx will be the zero-based index of the current element.
Read MoreListForeachInRange
ListForeachInRange Description Iterate over each element var of the given list l in the index range [start, end). The variable var is declared and defined by this macro. This macro performs forward traversal, starting at index start (inclusive) and continuing until index end (exclusive), assuming zero-based indexing. Since linked lists are not indexable, the traversal walks node-by-node and skips nodes before start, then continues while tracking the current index.
Read MoreListForeachPtr
ListForeachPtr Description Iterate over each element var (as a pointer) of the given list l. The variable var is declared and defined by this macro as a pointer to the list’s data type. Iteration happens in forward order, starting from the head of the list and continuing through the next pointers until the end is reached. The variable var will point to the data associated with each list node.
Read MoreListForeachPtrIdx
ListForeachPtrIdx Description Iterate over each element var (as a pointer) of the given list l, with index idx. The variable var is declared and defined by this macro as a pointer to the data. Iteration happens in forward order, starting from the head of the list. This macro also tracks the index (idx) of each element during iteration. var will point to the data associated with the current list node, and idx will be the zero-based index of the current element.
Read MoreListForeachPtrInRange
ListForeachPtrInRange Description This macro performs forward traversal, starting at index start (inclusive) and continuing until index end (exclusive), assuming zero-based indexing. Since linked lists are not indexable, the traversal walks node-by-node and skips nodes before start, then continues while tracking the current index.
Read MoreListForeachPtrReverse
ListForeachPtrReverse Description Iterate over each element var (as a pointer) of the given list l in reverse order. The variable var is declared and defined by this macro as a pointer to the list’s data type. 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 point to the data associated with each list node.
Read MoreListForeachPtrReverseIdx
ListForeachPtrReverseIdx 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 MoreListForeachPtrReverseInRange
ListForeachPtrReverseInRange Description Iterate over each element var (as a pointer) 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 as a pointer to the list’s data type. 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 MoreListForeachReverse
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 MoreListForeachReverseIdx
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 MoreListForeachReverseInRange
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