Difference between revisions of "List of partial functions"
Jump to navigation
Jump to search
Josephcsible (talk | contribs) ("filter (const False) [1..]" and "dropWhile (const True) [1..]" are both bottom) |
Josephcsible (talk | contribs) (Undo revision 62780 by Josephcsible (talk) - the functions can short-circuit) |
||
| Line 19: | Line 19: | ||
* foldl1' |
* foldl1' |
||
* foldr1 |
* foldr1 |
||
| − | * scanr (∞) |
||
| − | * scanr1 (∞) |
||
* cycle |
* cycle |
||
* !! |
* !! |
||
Revision as of 21:47, 23 February 2019
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
- cycle
- !!
- filter (∞)
- dropWhile (∞)
- length (∞)
- sum (∞)
- product (∞)
- reverse (∞)
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.