Traverse from the beginning of a singly-linked list to the end.



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


map (>5) [1..10] -- [False,False,False,False,False,True,True,True,True,True]
 
map (++ "s") ["Apple", "Orange", "Mango", "Pear"] -- ["Apples","Oranges","Mangos","Pears"]
 
foldr (+) 0 [1..10] -- prints 55
 
traverse :: [a] -> [a]
traverse list = map func list
	where func a = -- ...do something with a