Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.SOP.InPairs

Contents

InPairs
Convenience constructors
SOP-like operators
Requiring

Description

Intended for qualified import

import           Data.SOP.InPairs (InPairs(..))
import qualified Data.SOP.InPairs as InPairs

Synopsis

data InPairs f xs where
- PNil ∷ InPairs f '[x]
- PCons ∷ f x y → InPairs f (y ': zs) → InPairs f (x ': (y ': zs))
mk1 ∷ InPairs f '[x]
mk2 ∷ f x y → InPairs f '[x, y]
mk3 ∷ f x y → f y z → InPairs f '[x, y, z]
hcmap ∷ ∀ proxy c f g xs. All c xs ⇒ proxy c → (∀ x y. (c x, c y) ⇒ f x y → g x y) → InPairs f xs → InPairs g xs
hcpure ∷ ∀ proxy c xs f. (All c xs, IsNonEmpty xs) ⇒ proxy c → (∀ x y. (c x, c y) ⇒ f x y) → InPairs f xs
hczipWith ∷ ∀ proxy c f f' f'' xs. All c xs ⇒ proxy c → (∀ x y. (c x, c y) ⇒ f x y → f' x y → f'' x y) → InPairs f xs → InPairs f' xs → InPairs f'' xs
hmap ∷ SListI xs ⇒ (∀ x y. f x y → g x y) → InPairs f xs → InPairs g xs
hpure ∷ (SListI xs, IsNonEmpty xs) ⇒ (∀ x y. f x y) → InPairs f xs
newtype Requiring h f x y = Require {
- provide ∷ h x → f x y
}
newtype RequiringBoth h f x y = RequireBoth {
- provideBoth ∷ h x → h y → f x y
}
ignoring ∷ f x y → Requiring h f x y
ignoringBoth ∷ f x y → RequiringBoth h f x y
requiring ∷ SListI xs ⇒ NP h xs → InPairs (Requiring h f) xs → InPairs f xs
requiringBoth ∷ NP h xs → InPairs (RequiringBoth h f) xs → InPairs f xs

InPairs

data InPairs f xs where Source #

We have an f x y for each pair (x, y) of successive list elements

Constructors

PNil ∷ InPairs f '[x]
PCons ∷ f x y → InPairs f (y ': zs) → InPairs f (x ': (y ': zs))

Convenience constructors

mk1 ∷ InPairs f '[x] Source #

mk2 ∷ f x y → InPairs f '[x, y] Source #

mk3 ∷ f x y → f y z → InPairs f '[x, y, z] Source #

SOP-like operators

hcmap ∷ ∀ proxy c f g xs. All c xs ⇒ proxy c → (∀ x y. (c x, c y) ⇒ f x y → g x y) → InPairs f xs → InPairs g xs Source #

hcpure ∷ ∀ proxy c xs f. (All c xs, IsNonEmpty xs) ⇒ proxy c → (∀ x y. (c x, c y) ⇒ f x y) → InPairs f xs Source #

hczipWith ∷ ∀ proxy c f f' f'' xs. All c xs ⇒ proxy c → (∀ x y. (c x, c y) ⇒ f x y → f' x y → f'' x y) → InPairs f xs → InPairs f' xs → InPairs f'' xs Source #

hmap ∷ SListI xs ⇒ (∀ x y. f x y → g x y) → InPairs f xs → InPairs g xs Source #

hpure ∷ (SListI xs, IsNonEmpty xs) ⇒ (∀ x y. f x y) → InPairs f xs Source #

Requiring

newtype Requiring h f x y Source #

Constructors

Require
Fields provide ∷ h x → f x y

newtype RequiringBoth h f x y Source #

Constructors

RequireBoth
Fields provideBoth ∷ h x → h y → f x y

ignoring ∷ f x y → Requiring h f x y Source #

ignoringBoth ∷ f x y → RequiringBoth h f x y Source #

requiring ∷ SListI xs ⇒ NP h xs → InPairs (Requiring h f) xs → InPairs f xs Source #

requiringBoth ∷ NP h xs → InPairs (RequiringBoth h f) xs → InPairs f xs Source #