SuperRecord

Basics

data label := value infix 6

Field named l labels value of type t adapted from the awesome labels package. Example: (#name := "Chris") :: ("name" := String)

Constructors

KnownSymbol label => (FldProxy label) := !value infix 6

Instances

(RecEq rts (RemoveAccessTo l lts), Has l rts idx s v, Eq v) => RecEq rts ((:) * ((:=) l t) lts)

Methods

recEq :: Rec rts -> Rec rts -> Proxy [*] ((* ': (l := t)) lts) -> Bool

(KnownSymbol l, RecApply rts (RemoveAccessTo l lts) c, Has l rts idx s v, c v) => RecApply rts ((:) * ((:=) l t) lts) c

Methods

recApply :: (forall a. Dict (c a) -> String -> a -> r) -> Rec rts -> Proxy [*] ((* ': (l := t)) lts) -> [r]

Eq value => Eq ((:=) label value)

Methods

(==) :: (label := value) -> (label := value) -> Bool

(/=) :: (label := value) -> (label := value) -> Bool

Ord value => Ord ((:=) label value)

Methods

compare :: (label := value) -> (label := value) -> Ordering

(<) :: (label := value) -> (label := value) -> Bool

(<=) :: (label := value) -> (label := value) -> Bool

(>) :: (label := value) -> (label := value) -> Bool

(>=) :: (label := value) -> (label := value) -> Bool

max :: (label := value) -> (label := value) -> label := value

min :: (label := value) -> (label := value) -> label := value

Show t => Show ((:=) l t)

Methods

showsPrec :: Int -> (l := t) -> ShowS

show :: (l := t) -> String

showList :: [l := t] -> ShowS

(KnownSymbol l, FromJSON t, RecJsonParse lts, (~) Nat (RecSize lts) s, KnownNat s) => RecJsonParse ((:) * ((:=) l t) lts)

Methods

recJsonParse :: Int -> Object -> Parser (Rec ((* ': (l := t)) lts))

(KnownSymbol l, RecKeys lts) => RecKeys ((:) * ((:=) l t) lts)

Associated Types

type RecKeysT ((:) * ((:=) l t) lts :: [*]) :: [Symbol]

Methods

recKeys :: t ((* ': (l := t)) lts) -> [String]

(Has l rts idx s v, NFData v, RecNfData (RemoveAccessTo l lts) rts) => RecNfData ((:) * ((:=) l t) lts) rts

Methods

recNfData :: Proxy [*] ((* ': (l := t)) lts) -> Rec rts -> ()

type RecKeysT ((:) * ((:=) l t) lts)

type RecKeysT ((:) * ((:=) l t) lts) = (:) Symbol l (RecKeysT lts)

data Rec lts

The core record type.

Instances

RecEq lts lts => Eq (Rec lts)

Methods

(==) :: Rec lts -> Rec lts -> Bool

(/=) :: Rec lts -> Rec lts -> Bool

RecApply lts lts Show => Show (Rec lts)

Methods

showsPrec :: Int -> Rec lts -> ShowS

show :: Rec lts -> String

showList :: [Rec lts] -> ShowS

RecApply lts lts ToJSON => ToJSON (Rec lts)

Methods

toJSON :: Rec lts -> Value

toEncoding :: Rec lts -> Encoding

toJSONList :: [Rec lts] -> Value

toEncodingList :: [Rec lts] -> Encoding

((~) Nat (RecSize lts) s, KnownNat s, RecJsonParse lts) => FromJSON (Rec lts)

Methods

parseJSON :: Value -> Parser (Rec lts)

parseJSONList :: Value -> Parser [Rec lts]

RecNfData lts lts => NFData (Rec lts)

Methods

rnf :: Rec lts -> ()

(SetPath more v, Has l lts idx s v, (~) * (RecDeepTy * ((:) Symbol l more) (Rec lts)) (RecDeepTy * more v)) => SetPath ((:) Symbol l more) (Rec lts)

Methods

setPath :: SPath ((Symbol ': l) more) -> RecDeepTy * ((Symbol ': l) more) (Rec lts) -> Rec lts -> Rec lts

rnil :: Rec '[]

An empty record

rcons :: forall l t lts s. (RecSize lts ~ s, KnownNat s) => (l := t) -> Rec lts -> Rec ((l := t) ': lts)

Prepend a record entry to a record Rec

(&) :: forall l t lts s. (RecSize lts ~ s, KnownNat s) => (l := t) -> Rec lts -> Rec ((l := t) ': lts) infixr 5

Alias for rcons

type Has l lts idx s v = (RecTyIdxH 0 l lts ~ idx, RecIdxTyH idx 0 lts ~ v, KnownNat idx, RecSize lts ~ s, KnownNat s)

State that a record contains a label. Leave idx an s free variables, used internally

get :: forall l v lts idx s. Has l lts idx s v => FldProxy l -> Rec lts -> v

Get an existing record field

(&.) :: forall l v lts idx s. Has l lts idx s v => Rec lts -> FldProxy l -> v infixl 3

Alias for get

set :: forall l v lts idx s. Has l lts idx s v => FldProxy l -> v -> Rec lts -> Rec lts

Update an existing record field

class SetPath k x where

Minimal complete definition

setPath

Methods

setPath :: SPath k -> RecDeepTy k x -> x -> x

Perform a deep update, setting the key along the path to the desired value

Instances

SetPath ([] Symbol) v

Methods

setPath :: SPath [Symbol] -> RecDeepTy * [Symbol] v -> v -> v

(SetPath more v, Has l lts idx s v, (~) * (RecDeepTy * ((:) Symbol l more) (Rec lts)) (RecDeepTy * more v)) => SetPath ((:) Symbol l more) (Rec lts)

Methods

setPath :: SPath ((Symbol ': l) more) -> RecDeepTy * ((Symbol ': l) more) (Rec lts) -> Rec lts -> Rec lts

data SPath t where

Path to the key that should be updated

Constructors

SCons :: FldProxy l -> SPath ls -> SPath (l ': ls)

SNil :: SPath '[]

(&:) :: FldProxy l -> SPath ls -> SPath (l ': ls) infixr 8

Alias for SCons

snil :: SPath '[]

Alias for SNil

Reflection

reflectRec :: forall c r lts. RecApply lts lts c => Proxy c -> (forall a. c a => String -> a -> r) -> Rec lts -> [r]

Apply a function to each key element pair for a record

class RecApply rts lts c where

Machinery needed to implement reflectRec

Minimal complete definition

recApply

Methods

recApply :: (forall a. Dict (c a) -> String -> a -> r) -> Rec rts -> Proxy lts -> [r]

Instances

RecApply rts ([] *) c

Methods

recApply :: (forall a. Dict (c a) -> String -> a -> r) -> Rec rts -> Proxy [*] [*] -> [r]

(KnownSymbol l, RecApply rts (RemoveAccessTo l lts) c, Has l rts idx s v, c v) => RecApply rts ((:) * ((:=) l t) lts) c

Methods

recApply :: (forall a. Dict (c a) -> String -> a -> r) -> Rec rts -> Proxy [*] ((* ': (l := t)) lts) -> [r]

Machinery

type family RecTyIdxH (i :: Nat) (l :: Symbol) (lts :: [*]) :: Nat where ...

Equations

RecTyIdxH idx l ((l := t) ': lts) = idx

RecTyIdxH idx m ((l := t) ': lts) = RecTyIdxH (1 + idx) m lts

RecTyIdxH idx m '[] = TypeError (Text "Could not find label " :<>: Text m)

type family RecIdxTyH (i :: Nat) (r :: Nat) (lts :: [*]) :: * where ...

Equations

RecIdxTyH idx idx ((l := t) ': lts) = t

RecIdxTyH idx other ((l := t) ': lts) = RecIdxTyH idx (other + 1) lts

RecIdxTyH idx other '[] = TypeError (Text "Could not find index " :<>: ShowType idx)

showRec :: forall lts. RecApply lts lts Show => Rec lts -> [(String, String)]

Convert all elements of a record to a String

class RecKeys lts where

Get keys of a record on value and type level

Minimal complete definition

recKeys

Associated Types

type RecKeysT lts :: [Symbol]

Methods

recKeys :: t lts -> [String]

Instances

RecKeys ([] *)

Associated Types

type RecKeysT ([] * :: [*]) :: [Symbol]

Methods

recKeys :: t [*] -> [String]

(KnownSymbol l, RecKeys lts) => RecKeys ((:) * ((:=) l t) lts)

Associated Types

type RecKeysT ((:) * ((:=) l t) lts :: [*]) :: [Symbol]

Methods

recKeys :: t ((* ': (l := t)) lts) -> [String]

class RecEq rts lts where

Machinery to implement equality

Minimal complete definition

recEq

Methods

recEq :: Rec rts -> Rec rts -> Proxy lts -> Bool

Instances

RecEq rts ([] *)

Methods

recEq :: Rec rts -> Rec rts -> Proxy [*] [*] -> Bool

(RecEq rts (RemoveAccessTo l lts), Has l rts idx s v, Eq v) => RecEq rts ((:) * ((:=) l t) lts)

Methods

recEq :: Rec rts -> Rec rts -> Proxy [*] ((* ': (l := t)) lts) -> Bool

recToValue :: forall lts. RecApply lts lts ToJSON => Rec lts -> Value

recToEncoding :: forall lts. RecApply lts lts ToJSON => Rec lts -> Encoding

recJsonParser :: forall lts s. (RecSize lts ~ s, KnownNat s, RecJsonParse lts) => Value -> Parser (Rec lts)

class RecJsonParse lts where

Machinery to implement parseJSON

Minimal complete definition

recJsonParse

Methods

recJsonParse :: Int -> Object -> Parser (Rec lts)

Instances

RecJsonParse ([] *)

Methods

recJsonParse :: Int -> Object -> Parser (Rec [*])

(KnownSymbol l, FromJSON t, RecJsonParse lts, (~) Nat (RecSize lts) s, KnownNat s) => RecJsonParse ((:) * ((:=) l t) lts)

Methods

recJsonParse :: Int -> Object -> Parser (Rec ((* ': (l := t)) lts))

class RecNfData lts rts where

Machinery for NFData

Minimal complete definition

recNfData

Methods

recNfData :: Proxy lts -> Rec rts -> ()

Instances

RecNfData ([] *) rts

Methods

recNfData :: Proxy [*] [*] -> Rec rts -> ()

(Has l rts idx s v, NFData v, RecNfData (RemoveAccessTo l lts) rts) => RecNfData ((:) * ((:=) l t) lts) rts

Methods

recNfData :: Proxy [*] ((* ': (l := t)) lts) -> Rec rts -> ()

type family RecSize (lts :: [*]) :: Nat where ...

Equations

RecSize '[] = 0

RecSize ((l := t) ': lts) = 1 + RecSize lts

type family RemoveAccessTo (l :: Symbol) (lts :: [*]) :: [*] where ...

Equations

RemoveAccessTo l ((l := t) ': lts) = RemoveAccessTo l lts

RemoveAccessTo q ((l := t) ': lts) = (l := t) ': RemoveAccessTo l lts

RemoveAccessTo q '[] = '[]

data FldProxy t

A proxy witness for a label. Very similar to Proxy, but needed to implement a non-orphan IsLabel instance

Constructors

FldProxy

Instances

(~) Symbol l l' => IsLabel l (FldProxy l')

Methods

fromLabel :: Proxy# Symbol l -> FldProxy l'

Eq (FldProxy t)

Methods

(==) :: FldProxy t -> FldProxy t -> Bool

(/=) :: FldProxy t -> FldProxy t -> Bool

Ord (FldProxy t)

Methods

compare :: FldProxy t -> FldProxy t -> Ordering

(<) :: FldProxy t -> FldProxy t -> Bool

(<=) :: FldProxy t -> FldProxy t -> Bool

(>) :: FldProxy t -> FldProxy t -> Bool

(>=) :: FldProxy t -> FldProxy t -> Bool

max :: FldProxy t -> FldProxy t -> FldProxy t

min :: FldProxy t -> FldProxy t -> FldProxy t

Read (FldProxy t)

Methods

readsPrec :: Int -> ReadS (FldProxy t)

readList :: ReadS [FldProxy t]

readPrec :: ReadPrec (FldProxy t)

readListPrec :: ReadPrec [FldProxy t]

Show (FldProxy t)

Methods

showsPrec :: Int -> FldProxy t -> ShowS

show :: FldProxy t -> String

showList :: [FldProxy t] -> ShowS

type family RecDeepTy (ls :: [Symbol]) (lts :: k) :: * where ...

Equations

RecDeepTy (l ': more) (Rec q) = RecDeepTy (l ': more) q

RecDeepTy (l ': more) ((l := Rec t) ': lts) = RecDeepTy more t

RecDeepTy (l ': more) ((l := t) ': lts) = t

RecDeepTy (l ': more) ((q := t) ': lts) = RecDeepTy (l ': more) lts

RecDeepTy '[] v = v