modular-prelude-0.3.0.0: A new Prelude featuring first class modules

Safe HaskellNone

ModularPrelude.Module.List

Contents

Description

This module provides a first-class version of the Data.List module.

Synopsis

Module interface

data ListModule Source

Constructors

List 

Fields

map :: forall a b. (a -> b) -> [a] -> [b]
 
concatMap :: forall a b. (a -> [b]) -> [a] -> [b]
 
filter :: forall a. (a -> Bool) -> [a] -> [a]
 
length :: forall a. [a] -> Int
 
singleton :: forall a. a -> [a]
 
null :: forall a. [a] -> Bool
 
pack :: forall a. [a] -> [a]
 
unpack :: forall a. [a] -> [a]
 
fromList :: forall a. [a] -> [a]
 
toList :: forall a. [a] -> [a]
 
lookup :: forall k a. Eq k => k -> [(k, a)] -> Maybe a
 
empty :: forall a. [a]
 
insert :: forall a. a -> [a] -> [a]
 
delete :: forall a. Eq a => a -> [a] -> [a]
 
member :: forall a. Eq a => a -> [a] -> Bool
 
stripPrefix :: forall a. Eq a => [a] -> [a] -> Maybe [a]
 
break :: forall a. (a -> Bool) -> [a] -> ([a], [a])
 
span :: forall a. (a -> Bool) -> [a] -> ([a], [a])
 
dropWhile :: forall a. (a -> Bool) -> [a] -> [a]
 
takeWhile :: forall a. (a -> Bool) -> [a] -> [a]
 
any :: forall a. (a -> Bool) -> [a] -> Bool
 
all :: forall a. (a -> Bool) -> [a] -> Bool
 
splitAt :: forall a. Int -> [a] -> ([a], [a])
 
fold :: forall a b. (a -> b -> a) -> a -> [b] -> a
 

Module contents

class ListImplements interface whereSource

Methods

_Data_List_ :: interfaceSource