List notation
From HaskellWiki
(Difference between revisions)
(insert elements conditionally) |
(operator section) |
||
| Line 40: | Line 40: | ||
[] | [] | ||
</haskell> | </haskell> | ||
| - | * You can construct a singleton list with a [[operator | + | * You can construct a singleton list with a [[Section of an infix operator|section]] of the colon operator: <haskell>(:[]) :: a -> [a]</haskell>. |
* You can prepend an element to a list: <haskell>(x:) :: [a] -> [a]</haskell>. E.g. <haskell>iterate (' ':) []</haskell> creates a list of blank strings with increasing size very efficiently. | * You can prepend an element to a list: <haskell>(x:) :: [a] -> [a]</haskell>. E.g. <haskell>iterate (' ':) []</haskell> creates a list of blank strings with increasing size very efficiently. | ||
Revision as of 17:08, 4 November 2008
We are used to the list notation[0,1,2,3]
(0:1:2:3:[])
By using the syntactic sugar, we often miss the benefits of the direct notation.
- A trailing colon is like a terminator.
0 : 1 : 2 : 3 : []
- Thus it is more theoretically sound and easier to edit.
- You can easily mix elements and lists into a list by appending the corresponding operator in each line:
[1,2,3] ++ 4 : listA ++ 5 : listB ++ []
- You can insert elements or sub-lists conditionally.
infixr 5 ?:, ?++ (?:) :: (Bool, a) -> [a] -> [a] (?:) (b, x) = if b then (x:) else id (?++) :: (Bool, [a]) -> [a] -> [a] (?++) (b, x) = if b then (x++) else id list = [2,3] ++ (x==5, 5) ?: (x==7, listA) ?++ []
- You can construct a singleton list with a section of the colon operator: .
(:[]) :: a -> [a]
- You can prepend an element to a list: . E.g.
(x:) :: [a] -> [a]
creates a list of blank strings with increasing size very efficiently.iterate (' ':) []
See also:
