Difference between revisions of "List of partial functions"
Jump to navigation
Jump to search
m (Added an infinity mark for functions that do not terminate given an infinite list.) |
m (Moved footnote to bottom) |
||
| Line 1: | Line 1: | ||
==Partial functions in Prelude== |
==Partial functions in Prelude== |
||
| − | |||
| ⚫ | |||
===Functions that aren't even partial=== |
===Functions that aren't even partial=== |
||
| Line 65: | Line 63: | ||
... (todo) |
... (todo) |
||
| + | |||
| ⚫ | |||
Revision as of 01:14, 4 November 2015
Partial functions in Prelude
Functions that aren't even partial
- error
- undefined
List functions
- maximum
- minimum
- head
- tail
- init
- last
- foldl (∞)
- foldl' (∞)
- foldl1
- foldl1'
- foldr1
- scanl1
- scanr1
- cycle
- !!
- length (∞)
- sum (∞)
- product (∞)
- reverse (∞)
- ... (todo)
Other
- read
- quot
- rem
- quotRem
- div
- mod
- divMod
- succ
- pred
- toEnum
- (^)
- fail
- ... (todo)
Partial functions in other base libraries
Data.List
- genericIndex
- genericLength (∞)
Data.Map
- (!)
Data.Maybe
- fromJust
Partial functions in other Haskell Platform packages
... (todo)
NB. Functions marked with (∞) are partial because the function will not terminate if given an infinite list.