Linked list removal

list.zig

const List = struct {
    const Node = struct {
        value: u32,
        next: ?*Node = null,
    };

    head: ?*Node = null,

    fn addNode(this: *@This(), node: *Node) void {
        node.next = this.head;
        this.head = node;
    }

    fn removeNode(this: *@This(), node: *Node) void {
        var current = &this.head;

        while(current.*) |cur|: ({current = &cur.next;}) {
            if(cur.value == node.value) {

                current.* = cur.next;
                break;
            }
        }
    }

    fn printList(this: *@This()) void {
       @import("std").debug.print("PRINT LIST\n", .{});
        var current = &this.head;

        while(current.*) |cur|: ({current = &cur.next;}) {
            @import("std").debug.print("Node value = {}\n", .{cur.value});
        }
    }
};

pub fn main() void {
    var l = List {};
    var n1 = List.Node { .value = 1, };
    var n2 = List.Node { .value = 2, };
    var n3 = List.Node { .value = 3, };

    l.addNode(&n1);
    l.printList();
    l.addNode(&n2);
    l.printList();
    l.addNode(&n3);
    l.printList();

    l.removeNode(&n1);

    l.printList();
}