hat-2.9.4: The Haskell tracer, generating and viewing Haskell execution traces

Safe HaskellNone
LanguageHaskell98

Hat.Data.List

Documentation

(!++) :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) (List a))) Source #

(*++) :: R (List a) -> R (List a) -> RefExp -> R (List a) Source #

ghead :: RefSrcPos -> RefExp -> R (Fun (List a) a) Source #

hhead :: R (List a) -> RefExp -> R a Source #

glast :: RefSrcPos -> RefExp -> R (Fun (List a) a) Source #

hlast :: R (List a) -> RefExp -> R a Source #

gtail :: RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source #

htail :: R (List a) -> RefExp -> R (List a) Source #

ginit :: RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source #

hinit :: R (List a) -> RefExp -> R (List a) Source #

hnull :: R (List a) -> RefExp -> R Bool Source #

hlength :: R (List a) -> RefExp -> R Int Source #

gmap :: RefSrcPos -> RefExp -> R (Fun (Fun a b) (Fun (List a) (List b))) Source #

hmap :: R (Fun a b) -> R (List a) -> RefExp -> R (List b) Source #

hintersperse :: R a -> R (List a) -> RefExp -> R (List a) Source #

gintercalate :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List (List a)) (List a))) Source #

hintercalate :: R (List a) -> R (List (List a)) -> RefExp -> R (List a) Source #

htranspose :: R (List (List a)) -> RefExp -> R (List (List a)) Source #

hsubsequences :: R (List a) -> RefExp -> R (List (List a)) Source #

hpermutations :: R (List a) -> RefExp -> R (List (List a)) Source #

gfoldl :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b a)) (Fun a (Fun (List b) a))) Source #

hfoldl :: R (Fun a (Fun b a)) -> R a -> R (List b) -> RefExp -> R a Source #

gfoldl' :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b a)) (Fun a (Fun (List b) a))) Source #

hfoldl' :: R (Fun a (Fun b a)) -> R a -> R (List b) -> RefExp -> R a Source #

gfoldl1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) a)) Source #

hfoldl1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R a Source #

gfoldl1' :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) a)) Source #

hfoldl1' :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R a Source #

gfoldr :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b b)) (Fun b (Fun (List a) b))) Source #

hfoldr :: R (Fun a (Fun b b)) -> R b -> R (List a) -> RefExp -> R b Source #

gfoldr1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) a)) Source #

hfoldr1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R a Source #

gconcat :: RefSrcPos -> RefExp -> R (Fun (List (List a)) (List a)) Source #

hconcat :: R (List (List a)) -> RefExp -> R (List a) Source #

gconcatMap :: RefSrcPos -> RefExp -> R (Fun (Fun a (List b)) (Fun (List a) (List b))) Source #

hconcatMap :: R (Fun a (List b)) -> RefExp -> R (Fun (List a) (List b)) Source #

gany :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) Bool)) Source #

hany :: R (Fun a Bool) -> RefExp -> R (Fun (List a) Bool) Source #

gall :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) Bool)) Source #

hall :: R (Fun a Bool) -> RefExp -> R (Fun (List a) Bool) Source #

gsum :: Num a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source #

gproduct :: Num a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source #

gmaximum :: Ord a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source #

hmaximum :: Ord a => R (List a) -> RefExp -> R a Source #

gminimum :: Ord a => RefSrcPos -> RefExp -> R (Fun (List a) a) Source #

hminimum :: Ord a => R (List a) -> RefExp -> R a Source #

gscanl :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b a)) (Fun a (Fun (List b) (List a)))) Source #

hscanl :: R (Fun a (Fun b a)) -> R a -> R (List b) -> RefExp -> R (List a) Source #

gscanl1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) (List a))) Source #

hscanl1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R (List a) Source #

gscanr :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b b)) (Fun b (Fun (List a) (List b)))) Source #

hscanr :: R (Fun a (Fun b b)) -> R b -> R (List a) -> RefExp -> R (List b) Source #

gscanr1 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a a)) (Fun (List a) (List a))) Source #

hscanr1 :: R (Fun a (Fun a a)) -> R (List a) -> RefExp -> R (List a) Source #

gmapAccumL :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Tuple2 a c))) (Fun a (Fun (List b) (Tuple2 a (List c))))) Source #

hmapAccumL :: R (Fun a (Fun b (Tuple2 a c))) -> R a -> R (List b) -> RefExp -> R (Tuple2 a (List c)) Source #

gmapAccumR :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Tuple2 a c))) (Fun a (Fun (List b) (Tuple2 a (List c))))) Source #

hmapAccumR :: R (Fun a (Fun b (Tuple2 a c))) -> R a -> R (List b) -> RefExp -> R (Tuple2 a (List c)) Source #

giterate :: RefSrcPos -> RefExp -> R (Fun (Fun a a) (Fun a (List a))) Source #

hiterate :: R (Fun a a) -> R a -> RefExp -> R (List a) Source #

hrepeat :: R a -> RefExp -> R (List a) Source #

hreplicate :: R Int -> R a -> RefExp -> R (List a) Source #

gcycle :: RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source #

hcycle :: R (List a) -> RefExp -> R (List a) Source #

gunfoldr :: RefSrcPos -> RefExp -> R (Fun (Fun b (Maybe (Tuple2 a b))) (Fun b (List a))) Source #

hunfoldr :: R (Fun b (Maybe (Tuple2 a b))) -> R b -> RefExp -> R (List a) Source #

gtake :: RefSrcPos -> RefExp -> R (Fun Int (Fun (List a) (List a))) Source #

htake :: R Int -> R (List a) -> RefExp -> R (List a) Source #

gdrop :: RefSrcPos -> RefExp -> R (Fun Int (Fun (List a) (List a))) Source #

hdrop :: R Int -> R (List a) -> RefExp -> R (List a) Source #

gsplitAt :: RefSrcPos -> RefExp -> R (Fun Int (Fun (List a) (Tuple2 (List a) (List a)))) Source #

hsplitAt :: R Int -> R (List a) -> RefExp -> R (Tuple2 (List a) (List a)) Source #

gtakeWhile :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (List a))) Source #

htakeWhile :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List a) Source #

gdropWhile :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (List a))) Source #

hdropWhile :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List a) Source #

gspan :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (Tuple2 (List a) (List a)))) Source #

hspan :: R (Fun a Bool) -> R (List a) -> RefExp -> R (Tuple2 (List a) (List a)) Source #

gbreak :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (Tuple2 (List a) (List a)))) Source #

hbreak :: R (Fun a Bool) -> RefExp -> R (Fun (List a) (Tuple2 (List a) (List a))) Source #

gstripPrefix :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) (Maybe (List a)))) Source #

hstripPrefix :: Eq a => R (List a) -> R (List a) -> RefExp -> R (Maybe (List a)) Source #

ggroup :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (List (List a))) Source #

ginits :: RefSrcPos -> RefExp -> R (Fun (List a) (List (List a))) Source #

hinits :: R (List a) -> RefExp -> R (List (List a)) Source #

gtails :: RefSrcPos -> RefExp -> R (Fun (List a) (List (List a))) Source #

htails :: R (List a) -> RefExp -> R (List (List a)) Source #

gisPrefixOf :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) Bool)) Source #

hisPrefixOf :: Eq a => R (List a) -> R (List a) -> RefExp -> R Bool Source #

gisSuffixOf :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) Bool)) Source #

hisSuffixOf :: Eq a => R (List a) -> R (List a) -> RefExp -> R Bool Source #

gisInfixOf :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) Bool)) Source #

hisInfixOf :: Eq a => R (List a) -> R (List a) -> RefExp -> R Bool Source #

gelem :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) Bool)) Source #

helem :: Eq a => R a -> RefExp -> R (Fun (List a) Bool) Source #

gnotElem :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) Bool)) Source #

hnotElem :: Eq a => R a -> RefExp -> R (Fun (List a) Bool) Source #

glookup :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List (Tuple2 a b)) (Maybe b))) Source #

hlookup :: Eq a => R a -> R (List (Tuple2 a b)) -> RefExp -> R (Maybe b) Source #

gfind :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (Maybe a))) Source #

hfind :: R (Fun a Bool) -> RefExp -> R (Fun (List a) (Maybe a)) Source #

gfilter :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (List a))) Source #

hfilter :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List a) Source #

gpartition :: RefSrcPos -> RefExp -> R (Fun (Fun a Bool) (Fun (List a) (Tuple2 (List a) (List a)))) Source #

hpartition :: R (Fun a Bool) -> R (List a) -> RefExp -> R (Tuple2 (List a) (List a)) Source #

(!!!) :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun Int a)) Source #

(*!!) :: R (List a) -> R Int -> RefExp -> R a Source #

gelemIndex :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) (Maybe Int))) Source #

helemIndex :: Eq a => R a -> RefExp -> R (Fun (List a) (Maybe Int)) Source #

gelemIndices :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) (List Int))) Source #

helemIndices :: Eq a => R a -> RefExp -> R (Fun (List a) (List Int)) Source #

hfindIndex :: R (Fun a Bool) -> RefExp -> R (Fun (List a) (Maybe Int)) Source #

hfindIndices :: R (Fun a Bool) -> R (List a) -> RefExp -> R (List Int) Source #

gzip :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (List (Tuple2 a b)))) Source #

gzip3 :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (Fun (List c) (List (Tuple3 a b c))))) Source #

gzip4 :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (List (Tuple4 a b c d)))))) Source #

gzip5 :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (Fun (List e) (List (Tuple5 a b c d e))))))) Source #

gzip6 :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (Fun (List e) (Fun (List f) (List (Tuple6 a b c d e f)))))))) Source #

gzip7 :: RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (Fun (List e) (Fun (List f) (Fun (List g) (List (Tuple7 a b c d e f g))))))))) Source #

gzipWith :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b c)) (Fun (List a) (Fun (List b) (List c)))) Source #

hzipWith :: R (Fun a (Fun b c)) -> R (List a) -> R (List b) -> RefExp -> R (List c) Source #

gzipWith3 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Fun c d))) (Fun (List a) (Fun (List b) (Fun (List c) (List d))))) Source #

hzipWith3 :: R (Fun a (Fun b (Fun c d))) -> R (List a) -> R (List b) -> R (List c) -> RefExp -> R (List d) Source #

gzipWith4 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Fun c (Fun d e)))) (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (List e)))))) Source #

hzipWith4 :: R (Fun a (Fun b (Fun c (Fun d e)))) -> R (List a) -> R (List b) -> R (List c) -> R (List d) -> RefExp -> R (List e) Source #

gzipWith5 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Fun c (Fun d (Fun e f))))) (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (Fun (List e) (List f))))))) Source #

hzipWith5 :: R (Fun a (Fun b (Fun c (Fun d (Fun e f))))) -> R (List a) -> R (List b) -> R (List c) -> R (List d) -> R (List e) -> RefExp -> R (List f) Source #

gzipWith6 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Fun c (Fun d (Fun e (Fun f g)))))) (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (Fun (List e) (Fun (List f) (List g)))))))) Source #

hzipWith6 :: R (Fun a (Fun b (Fun c (Fun d (Fun e (Fun f g)))))) -> R (List a) -> R (List b) -> R (List c) -> R (List d) -> R (List e) -> R (List f) -> RefExp -> R (List g) Source #

gzipWith7 :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun b (Fun c (Fun d (Fun e (Fun f (Fun g h))))))) (Fun (List a) (Fun (List b) (Fun (List c) (Fun (List d) (Fun (List e) (Fun (List f) (Fun (List g) (List h))))))))) Source #

hzipWith7 :: R (Fun a (Fun b (Fun c (Fun d (Fun e (Fun f (Fun g h))))))) -> R (List a) -> R (List b) -> R (List c) -> R (List d) -> R (List e) -> R (List f) -> R (List g) -> RefExp -> R (List h) Source #

gunzip :: RefSrcPos -> RefExp -> R (Fun (List (Tuple2 a b)) (Tuple2 (List a) (List b))) Source #

gunzip3 :: RefSrcPos -> RefExp -> R (Fun (List (Tuple3 a b c)) (Tuple3 (List a) (List b) (List c))) Source #

gunzip4 :: RefSrcPos -> RefExp -> R (Fun (List (Tuple4 a b c d)) (Tuple4 (List a) (List b) (List c) (List d))) Source #

gunzip5 :: RefSrcPos -> RefExp -> R (Fun (List (Tuple5 a b c d e)) (Tuple5 (List a) (List b) (List c) (List d) (List e))) Source #

gunzip6 :: RefSrcPos -> RefExp -> R (Fun (List (Tuple6 a b c d e f)) (Tuple6 (List a) (List b) (List c) (List d) (List e) (List f))) Source #

gunzip7 :: RefSrcPos -> RefExp -> R (Fun (List (Tuple7 a b c d e f g)) (Tuple7 (List a) (List b) (List c) (List d) (List e) (List f) (List g))) Source #

gnub :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source #

gdelete :: Eq a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) (List a))) Source #

(!\\) :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) (List a))) Source #

gunion :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) (List a))) Source #

gintersect :: Eq a => RefSrcPos -> RefExp -> R (Fun (List a) (Fun (List a) (List a))) Source #

gsort :: Ord a => RefSrcPos -> RefExp -> R (Fun (List a) (List a)) Source #

ginsert :: Ord a => RefSrcPos -> RefExp -> R (Fun a (Fun (List a) (List a))) Source #

gnubBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Bool)) (Fun (List a) (List a))) Source #

hnubBy :: R (Fun a (Fun a Bool)) -> R (List a) -> RefExp -> R (List a) Source #

gdeleteBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Bool)) (Fun a (Fun (List a) (List a)))) Source #

hdeleteBy :: R (Fun a (Fun a Bool)) -> R a -> R (List a) -> RefExp -> R (List a) Source #

gdeleteFirstsBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Bool)) (Fun (List a) (Fun (List a) (List a)))) Source #

hdeleteFirstsBy :: R (Fun a (Fun a Bool)) -> RefExp -> R (Fun (List a) (Fun (List a) (List a))) Source #

gunionBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Bool)) (Fun (List a) (Fun (List a) (List a)))) Source #

hunionBy :: R (Fun a (Fun a Bool)) -> R (List a) -> R (List a) -> RefExp -> R (List a) Source #

gintersectBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Bool)) (Fun (List a) (Fun (List a) (List a)))) Source #

hintersectBy :: R (Fun a (Fun a Bool)) -> R (List a) -> R (List a) -> RefExp -> R (List a) Source #

ggroupBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Bool)) (Fun (List a) (List (List a)))) Source #

hgroupBy :: R (Fun a (Fun a Bool)) -> R (List a) -> RefExp -> R (List (List a)) Source #

gsortBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Ordering)) (Fun (List a) (List a))) Source #

hsortBy :: R (Fun a (Fun a Ordering)) -> RefExp -> R (Fun (List a) (List a)) Source #

ginsertBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Ordering)) (Fun a (Fun (List a) (List a)))) Source #

hinsertBy :: R (Fun a (Fun a Ordering)) -> R a -> R (List a) -> RefExp -> R (List a) Source #

gmaximumBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Ordering)) (Fun (List a) a)) Source #

hmaximumBy :: R (Fun a (Fun a Ordering)) -> R (List a) -> RefExp -> R a Source #

gminimumBy :: RefSrcPos -> RefExp -> R (Fun (Fun a (Fun a Ordering)) (Fun (List a) a)) Source #

hminimumBy :: R (Fun a (Fun a Ordering)) -> R (List a) -> RefExp -> R a Source #

ggenericTake :: Integral a => RefSrcPos -> RefExp -> R (Fun a (Fun (List b) (List b))) Source #

hgenericTake :: Integral a => R a -> R (List b) -> RefExp -> R (List b) Source #

ggenericDrop :: Integral a => RefSrcPos -> RefExp -> R (Fun a (Fun (List b) (List b))) Source #

hgenericDrop :: Integral a => R a -> R (List b) -> RefExp -> R (List b) Source #

hgenericSplitAt :: Integral a => R a -> R (List b) -> RefExp -> R (Tuple2 (List b) (List b)) Source #

hgenericIndex :: Integral a => R (List b) -> R a -> RefExp -> R b Source #

hgenericReplicate :: Integral a => R a -> R b -> RefExp -> R (List b) Source #