Method reverse

src/fl/stl/list.h:468–480

    }

    void reverse() {
        if (mSize <= 1) {
            return;
        }

        Node* current = mHead;
        do {
            Node* temp = current->next;
            current->next = current->prev;
            current->prev = temp;
            current = current->prev; // Move to next node (which is now prev)
        } while (current != mHead);
    }

    void unique() {
        if (mSize <= 1) {