reverse_list.d

import std;

struct Node
{
    int value;
    Node* next;
}

Node* reverseList(Node* head)
{
    Node* current = head;
    Node* prev;
    while (current)
    {
        Node* next = current.next;
        current.next = prev;
        prev = current;
        current = next;
    }
    return prev;
}

void printList(Node* node)
{
    write("[");
    while (node)
    {
        write(node.value, " ");
        node = node.next;
    }
    writeln("]");
}

Node* makeList(int[] values)
{
    Node* next;
    foreach_reverse (int val; values)
        next = new Node(val, next);
    return next;
}

void main()
{
    void test(int[] values)
    {
        values
            .makeList
            .reverseList
            .printList;
    }

    test([]);
    test([1]);
    test([1, 2]);
    test([1, 2, 3]);
}