Compiling and Running Chapel
Writing Chapel Programs
This module provides a simple singly linked list.
This module is expected to change in the future.
A singly linked list.
destroy must be called to reclaim any memory used by the list.
The type of the data stored in every node.
The number of nodes in the list.
Iterate over the list, yielding each element.
Append e to the list.
Synonym for append.
Append all of the supplied arguments to the list.
Prepend e to the list.
Synonym for prepend.
Append all the elements in l to the end of the list.
Remove the first encountered instance of x from the list.
Does nothing if x is not present in the list.
Remove the first element from the list and return it.
It is an error to call this function on an empty list.
Returns true if this list contains an element equal to the value of
e. Returns false otherwise.
e – The element search for
true if the e was found
Returns a reference to the first item in the list
Calling this method on an empty list will cause the currently running
program to halt. If the –fast flag is used, no safety checks will be
a reference to the first item in the list
Returns a reference to the last item in the list
a reference to the last item in the list
Delete every node in the list.
Initialize a new LinkedList containing all of the supplied arguments.
x : T – Every argument must be of type T.