user
Traverse from the beginning of a doubly-linked list to the end, and from the end to the beginning.

See also

* Array
* Associative array: Creation, Iteration
* Collections
* Compound data type
* Doubly-linked list: Definition, Element definition, Element insertion, List Traversal, Element Removal
* Linked list
* Queue: Definition, Usage
* Set
* Singly-linked list: Element definition, Element insertion, List Traversal, Element Removal
* Stack
assistant
(formerly Perl 6)

Since the list routines are supplied by the generic roles defined in Doubly-linked\_list/Definition#Raku, it suffices to say:

```
say $dll.list;
say $dll.reverse;

```

These automatically return just the payloads, hiding the elements containing the forward and backward pointers.