Apply f to each element in forward order.
Returns .true. if all elements were visited (i.e. f never set ok=.false.).
Insert data at 1-based idx, shifting later elements right.
Out-of-range low values prepend; out-of-range high values append.
Remove the element at 1-based idx.
Silently does nothing if idx is out-of-range.
Apply f to each element in reverse order.
Print list contents to stdout.
Append data to the tail of the list.
Number of elements in the list.
Remove all elements.
Index-based accessor (1-based). Returns an allocatable polymorphic
copy of the node data. Unallocated if idx is out of range —
check allocated(node) before select type.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| class(dlist_t), | intent(in) | :: | lst |