Camfort.Helpers

Documentation

collect :: (Eq a, Ord k) => [(k, a)] -> Map k [a]

type Filename = String

type Directory = String

type SourceText = ByteString

type FileOrDir = String

getDir :: String -> String

checkDir :: [Char] -> IO ()

Creates a directory (from a filename string) if it doesn't exist

isDirectory :: FileOrDir -> IO Bool

fanout :: (a -> b) -> (a -> c) -> a -> (b, c)

(<>) :: (a -> b) -> (a -> c) -> a -> (b, c)

(><) :: (a -> c) -> (b -> d) -> (a, b) -> (c, d)

lookups :: Eq a => a -> [(a, b)] -> [b]

lookups' :: Eq a => a -> [((a, b), c)] -> [(b, c)]

pairs :: [a] -> [(a, a)]

Computes all pairwise combinations

mfmap :: Functor f => (a -> b) -> [f a] -> [f b]

Functor composed with list functor

each :: [a] -> (a -> b) -> [b]

An infix map operation.

cmpEq :: Ordering -> Bool

Is the Ordering an EQ?

cmpFst :: (a -> a -> Ordering) -> (a, b) -> (a, b) -> Ordering

cmpSnd :: (b -> b -> Ordering) -> (a, b) -> (a, b) -> Ordering

type (:?) a b = a

used for type-level annotations giving documentation

foldPair :: (a -> a -> Maybe a) -> [a] -> [a]

class PartialMonoid x where

Minimal complete definition

emptyM, appendM

Methods

emptyM :: x

appendM :: x -> x -> Maybe x

Instances

PartialMonoid RegionProd

Methods

emptyM :: RegionProd

appendM :: RegionProd -> RegionProd -> Maybe RegionProd

normalise :: (Ord t, PartialMonoid t) => [t] -> [t]

normaliseNoSort :: (Ord t, PartialMonoid t) => [t] -> [t]

normaliseBy :: Ord t => (t -> t -> Maybe t) -> [t] -> [t]

reduceCollect :: (Data s, Data t, Uniplate t, Biplate t s) => (s -> Maybe a) -> t -> [a]

everywhere :: (Zipper a -> Zipper a) -> Zipper a -> Zipper a

zfmap :: Data a => (a -> a) -> Zipper (d a) -> Zipper (d a)