Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
- maxTup :: Ord t => (t, t) -> (t, t) -> (t, t)
- minTup :: Ord t => (t, t) -> (t, t) -> (t, t)
- denseIxArray :: [b] -> [(Int, b)]
- denseIxArray2 :: Int -> [c] -> [(Int, Int, c)]
- foldrMap :: (Foldable t, Functor t) => (a -> b) -> (b -> c -> c) -> c -> t a -> c
- foldlStrict :: (a -> b -> a) -> a -> [b] -> a
- ifoldr :: Num i => (a -> b -> b) -> b -> (i -> c -> d -> a) -> c -> [d] -> b
- type LB = Int
- type UB = Int
- inBounds :: LB -> UB -> Int -> Bool
- inBounds2 :: (LB, UB) -> (Int, Int) -> Bool
- inBounds0 :: UB -> Int -> Bool
- inBounds02 :: (UB, UB) -> (Int, Int) -> Bool
Misc. utilities
maxTup :: Ord t => (t, t) -> (t, t) -> (t, t) Source #
Componentwise tuple operations TODO : use semilattice properties instead
minTup :: Ord t => (t, t) -> (t, t) -> (t, t) Source #
Componentwise tuple operations TODO : use semilattice properties instead
denseIxArray :: [b] -> [(Int, b)] Source #
integer-indexed ziplist
foldrMap :: (Foldable t, Functor t) => (a -> b) -> (b -> c -> c) -> c -> t a -> c Source #
foldr over the results of a fmap
foldlStrict :: (a -> b -> a) -> a -> [b] -> a Source #
strict left fold
ifoldr :: Num i => (a -> b -> b) -> b -> (i -> c -> d -> a) -> c -> [d] -> b Source #
indexed right fold