DoxigAlpha
std › SinglyLinkedList › Node › findLast

findLast

Iterate over the singly-linked list from this node, until the final node is found.

This operation is O(N). Instead of calling this function, consider using a different data structure.

Function parameters

Parameters

#
node:*Node

This struct contains only a next pointer and not any data payload.

Types

#
Node
This struct contains only a next pointer and not any data payload.

Functions in this namespace

Functions

#
popFirst
Remove and return the first node in the list.
len
Iterate over all nodes, returning the count.

Source

Implementation

#
pub fn findLast(node: *Node) *Node {
    var it = node;
    while (true) {
        it = it.next orelse return it;
    }
}