Safe Haskell	Safe-Inferred
Language	Haskell2010

Ouroboros.Consensus.Util.HList

Contents

Description

Heterogeneous lists

Intended for qualified import

Synopsis

type family All c as :: Constraint where ...
data HList :: [ Type ] -> Type where
- Nil :: HList '[]
- (:*) :: a -> HList as -> HList (a ': as)
collapse :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => a -> b) -> HList as -> [b]
foldMap :: forall c as b proxy. ( All c as, Monoid b) => proxy c -> ( forall a. c a => a -> b) -> HList as -> b
foldl :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => b -> a -> b) -> b -> HList as -> b
foldlM :: forall c as m b proxy. ( All c as, Monad m) => proxy c -> ( forall a. c a => b -> a -> m b) -> b -> HList as -> m b
foldr :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => a -> b -> b) -> b -> HList as -> b
repeatedly :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => a -> b -> b) -> HList as -> b -> b
repeatedlyM :: forall c as b proxy m. ( Monad m, All c as) => proxy c -> ( forall a. c a => a -> b -> m b) -> HList as -> b -> m b
class IsList (xs :: [ Type ]) where
- isList :: SList xs
data SList :: [ Type ] -> Type
type family Fn as b where ...
afterFn :: SList as -> (b -> c) -> Fn as b -> Fn as c
applyFn :: Fn as b -> HList as -> b

Basic definitions

type family All c as :: Constraint where ... Source #

Equations

All c '[] = ()
All c (a ': as) = (c a, All c as)

data HList :: [ Type ] -> Type where Source #

Constructors

Nil :: HList '[]
(:*) :: a -> HList as -> HList (a ': as) infixr 9

Instances details

( IsList as, All Eq as) => Eq ( HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods (==) :: HList as -> HList as -> Bool Source # (/=) :: HList as -> HList as -> Bool Source #
( IsList as, All Eq as, All Ord as) => Ord ( HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods compare :: HList as -> HList as -> Ordering Source # (<) :: HList as -> HList as -> Bool Source # (<=) :: HList as -> HList as -> Bool Source # (>) :: HList as -> HList as -> Bool Source # (>=) :: HList as -> HList as -> Bool Source # max :: HList as -> HList as -> HList as Source # min :: HList as -> HList as -> HList as Source #
All Show as => Show ( HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods showsPrec :: Int -> HList as -> ShowS Source # show :: HList as -> String Source # showList :: [ HList as] -> ShowS Source #
All Condense as => Condense ( HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.Condense Methods condense :: HList as -> String Source #

Folding

collapse :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => a -> b) -> HList as -> [b] Source #

foldMap :: forall c as b proxy. ( All c as, Monoid b) => proxy c -> ( forall a. c a => a -> b) -> HList as -> b Source #

foldl :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => b -> a -> b) -> b -> HList as -> b Source #

foldlM :: forall c as m b proxy. ( All c as, Monad m) => proxy c -> ( forall a. c a => b -> a -> m b) -> b -> HList as -> m b Source #

foldr :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => a -> b -> b) -> b -> HList as -> b Source #

repeatedly :: forall c as b proxy. All c as => proxy c -> ( forall a. c a => a -> b -> b) -> HList as -> b -> b Source #

Apply function repeatedly for all elements of the list

repeatedly p = flip . foldl p . flip

repeatedlyM :: forall c as b proxy m. ( Monad m, All c as) => proxy c -> ( forall a. c a => a -> b -> m b) -> HList as -> b -> m b Source #

class IsList (xs :: [ Type ]) where Source #

Methods

Instances details

IsList ('[] :: [ Type ]) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods isList :: SList '[] Source #
IsList as => IsList (a ': as) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods isList :: SList (a ': as) Source #

type family Fn as b where ... Source #

Equations

Fn '[] b = b
Fn (a ': as) b = a -> Fn as b

afterFn :: SList as -> (b -> c) -> Fn as b -> Fn as c Source #

applyFn :: Fn as b -> HList as -> b Source #