append

Insert a new node at the end of the list.

Arguments: new_node: Pointer to the new node to insert.

Function parameters

Parameters

list:*DoublyLinkedList
new_node:*Node

This struct contains only the prev and next pointers and not any data

Types

Node: This struct contains only the prev and next pointers and not any data

Functions in this namespace

Functions

insertAfter
insertBefore
concatByMoving: Concatenate list2 onto the end of list1, removing all entries from the former.
append: Insert a new node at the end of the list.
prepend: Insert a new node at the beginning of the list.
remove: Remove a node from the list.
pop: Remove and return the last node in the list.
popFirst: Remove and return the first node in the list.
len: Iterate over all nodes, returning the count.

Source

Implementation

pub fn append(list: *DoublyLinkedList, new_node: *Node) void {
    if (list.last) |last| {
        // Insert after last.
        list.insertAfter(last, new_node);
    } else {
        // Empty list.
        list.prepend(new_node);
    }
}