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 ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ a → b) → HList as → [b]
foldMap ∷ ∀ c as b proxy. (All c as, Monoid b) ⇒ proxy c → (∀ a. c a ⇒ a → b) → HList as → b
foldl ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ b → a → b) → b → HList as → b
foldlM ∷ ∀ c as m b proxy. (All c as, Monad m) ⇒ proxy c → (∀ a. c a ⇒ b → a → m b) → b → HList as → m b
foldr ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ a → b → b) → b → HList as → b
repeatedly ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ a → b → b) → HList as → b → b
repeatedlyM ∷ ∀ c as b proxy m. (Monad m, All c as) ⇒ proxy c → (∀ 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

All Show as ⇒ Show (HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods showsPrec ∷ Int → HList as → ShowS # show ∷ HList as → String # showList ∷ [HList as] → ShowS #
(IsList as, All Eq as) ⇒ Eq (HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.HList Methods (==) ∷ HList as → HList as → Bool # (/=) ∷ HList as → HList as → Bool #
(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 # (<) ∷ HList as → HList as → Bool # (<=) ∷ HList as → HList as → Bool # (>) ∷ HList as → HList as → Bool # (>=) ∷ HList as → HList as → Bool # max ∷ HList as → HList as → HList as # min ∷ HList as → HList as → HList as #
All Condense as ⇒ Condense (HList as) Source #
Instance details Defined in Ouroboros.Consensus.Util.Condense Methods condense ∷ HList as → String Source #

Folding

collapse ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ a → b) → HList as → [b] Source #

foldMap ∷ ∀ c as b proxy. (All c as, Monoid b) ⇒ proxy c → (∀ a. c a ⇒ a → b) → HList as → b Source #

foldl ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ b → a → b) → b → HList as → b Source #

foldlM ∷ ∀ c as m b proxy. (All c as, Monad m) ⇒ proxy c → (∀ a. c a ⇒ b → a → m b) → b → HList as → m b Source #

foldr ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ a. c a ⇒ a → b → b) → b → HList as → b Source #

repeatedly ∷ ∀ c as b proxy. All c as ⇒ proxy c → (∀ 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 ∷ ∀ c as b proxy m. (Monad m, All c as) ⇒ proxy c → (∀ 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 #