Singly-linked list/Element definition: Difference between revisions

Define the data structure for a [[singly-linked list]] element. Said element should contain a data member capable of holding a numeric value, and the link to the next element should be mutable.

type Link;

end record;

struct link {

Note that the generic version works for any type, not only integral types.

import StdMaybe

:: Link t = { next :: Maybe (Link t), data :: t }

A simple one way list. I use a generic pointer for the data that way it can point to any structure, individual variable or whatever. Note that in Standard Pascal, there are no generic pointers, therefore one has to settle for a specific data type there.

end;

interface LinkedList guards LinkedListStamp {}

}

Forth has no "struct" facility, but you can easily implement a single linked list with a data cell using a double-cell value.

but that would be really awkward to use.

Just use an array. You can traverse and splice it any way. Linked lists are way too low level.

$node{next} = \%bar_node; # mutable

List are built in into Pop11, so normally on would just use them:

l1 =>

The Node class implements also iteration for more Pythonic iteration over linked lists.

</pre>

class ListNode