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.
Success
Data in tail node in list.
Failure
Empty object.
Usage example (Cross-references)
Usage examples (Cross-references)
- In
ListInt.c:116:
case LIST_INT_LAST : {
if (ListLen(list) > 0) {
volatile i32 last = ListLast(list);
(void)last;
}- In
List.Access.c:77:
result = result && (ListAt(&list, 2) == 30);
result = result && (ListFirst(&list) == 10);
result = result && (ListLast(&list) == 40);
ListSwapItems(&list, 1, 3);
static bool test_list_last_on_empty_fails(void) {
WriteFmt("Testing ListLast on empty list\n");
List(int) list = ListInit(get_test_alloc());
List(int) list = ListInit(get_test_alloc());
ListLast(&list);
return false;
Last updated on