| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Camfort.Helpers
- 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 ()
- 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)]
- mfmap :: Functor f => (a -> b) -> [f a] -> [f b]
- each :: [a] -> (a -> b) -> [b]
- cmpEq :: Ordering -> Bool
- cmpFst :: (a -> a -> Ordering) -> (a, b) -> (a, b) -> Ordering
- cmpSnd :: (b -> b -> Ordering) -> (a, b) -> (a, b) -> Ordering
- type (:?) a b = a
- foldPair :: (a -> a -> Maybe a) -> [a] -> [a]
- class PartialMonoid x where
- 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)
- data Reverse f a = Reverse {
- unwrapReverse :: f a
- descendReverseM :: (Data on, Monad m, Uniplate on) => (on -> m on) -> on -> m on
- descendBiReverseM :: (Data from, Data to, Monad m, Biplate from to) => (to -> m to) -> from -> m from
Documentation
type SourceText = ByteString Source #
checkDir :: [Char] -> IO () Source #
Creates a directory (from a filename string) if it doesn't exist
class PartialMonoid x where Source #
normalise :: (Ord t, PartialMonoid t) => [t] -> [t] Source #
normaliseNoSort :: (Ord t, PartialMonoid t) => [t] -> [t] Source #
normaliseBy :: Ord t => (t -> t -> Maybe t) -> [t] -> [t] Source #
Constructors
| Reverse | |
Fields
| |