Documentation

Methods

fold :: Monoid m => Wide m -> m #

foldMap :: Monoid m => (a -> m) -> Wide a -> m #

foldMap' :: Monoid m => (a -> m) -> Wide a -> m #

foldr :: (a -> b -> b) -> b -> Wide a -> b #

foldr' :: (a -> b -> b) -> b -> Wide a -> b #

foldl :: (b -> a -> b) -> b -> Wide a -> b #

foldl' :: (b -> a -> b) -> b -> Wide a -> b #

foldr1 :: (a -> a -> a) -> Wide a -> a #

foldl1 :: (a -> a -> a) -> Wide a -> a #

toList :: Wide a -> [a] #

null :: Wide a -> Bool #

length :: Wide a -> Int #

elem :: Eq a => a -> Wide a -> Bool #

maximum :: Ord a => Wide a -> a #

minimum :: Ord a => Wide a -> a #

sum :: Num a => Wide a -> a #

product :: Num a => Wide a -> a #

Methods

traverse :: Applicative f => (a -> f b) -> Wide a -> f (Wide b) #

sequenceA :: Applicative f => Wide (f a) -> f (Wide a) #

mapM :: Monad m => (a -> m b) -> Wide a -> m (Wide b) #

sequence :: Monad m => Wide (m a) -> m (Wide a) #

Methods

pure :: a -> Wide a #

(<*>) :: Wide (a -> b) -> Wide a -> Wide b #

liftA2 :: (a -> b -> c) -> Wide a -> Wide b -> Wide c #

(*>) :: Wide a -> Wide b -> Wide b #

(<*) :: Wide a -> Wide b -> Wide a #

Methods

fmap :: (a -> b) -> Wide a -> Wide b #

(<$) :: a -> Wide b -> Wide a #

Methods

(>>=) :: Wide a -> (a -> Wide b) -> Wide b #

(>>) :: Wide a -> Wide b -> Wide b #

return :: a -> Wide a #

Methods

from1 :: forall (a :: k). Wide a -> Rep1 Wide a #

to1 :: forall (a :: k). Rep1 Wide a -> Wide a #

Methods

arbitrary :: Gen (Wide a) #

shrink :: Wide a -> [Wide a] #

Methods

coarbitrary :: Wide a -> Gen b -> Gen b #

Methods

function :: (Wide a -> b) -> Wide a :-> b #

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Wide a -> c (Wide a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Wide a) #

toConstr :: Wide a -> Constr #

dataTypeOf :: Wide a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Wide a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Wide a)) #

gmapT :: (forall b. Data b => b -> b) -> Wide a -> Wide a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Wide a -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Wide a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Wide a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Wide a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Wide a -> m (Wide a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Wide a -> m (Wide a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Wide a -> m (Wide a) #

Methods

from :: Wide a -> Rep (Wide a) x #

to :: Rep (Wide a) x -> Wide a #

Methods

readsPrec :: Int -> ReadS (Wide a) #

readList :: ReadS [Wide a] #

readPrec :: ReadPrec (Wide a) #

readListPrec :: ReadPrec [Wide a] #

Methods

showsPrec :: Int -> Wide a -> ShowS #

show :: Wide a -> String #

showList :: [Wide a] -> ShowS #

Methods

rnf :: Wide a -> () #

Methods

(==) :: Wide a -> Wide a -> Bool #

(/=) :: Wide a -> Wide a -> Bool #

Methods

compare :: Wide a -> Wide a -> Ordering #

(<) :: Wide a -> Wide a -> Bool #

(<=) :: Wide a -> Wide a -> Bool #

(>) :: Wide a -> Wide a -> Bool #

(>=) :: Wide a -> Wide a -> Bool #

max :: Wide a -> Wide a -> Wide a #

min :: Wide a -> Wide a -> Wide a #

Methods

hashWithSalt :: Int -> Wide a -> Int #

hash :: Wide a -> Int #

Methods

bottom :: Wide a Source #

Methods

top :: Wide a Source #

Methods

(\/) :: Wide a -> Wide a -> Wide a Source #

(/\) :: Wide a -> Wide a -> Wide a Source #

Methods

leq :: Wide a -> Wide a -> Bool Source #

comparable :: Wide a -> Wide a -> Bool Source #

Methods

universeF :: [Wide a] #

cardinality :: Tagged (Wide a) Natural #

Methods

universe :: [Wide a] #