Data.Hetero.KVList

A simple heterogeneous linked-list for k-v pairs.

Documentation

data KV v

(kind) key-value pair

Constructors

Symbol := v

Instances

(InDict k v kvs, (~) GetResult (Index i) (Ix k ((:) (KV *) ((:=) * k' v') kvs)), KnownNat i) => InDict k v ((:) (KV *) ((:=) * k' v') kvs)

Methods

get' :: Proxy Symbol k -> Dict ((KV * ': (* := k') v') kvs) -> v

InDict k v ((:) (KV *) ((:=) * k v) kvs)

Methods

get' :: Proxy Symbol k -> Dict ((KV * ': (* := k) v) kvs) -> v

(InDict k v kvs, (~) GetResult (Index i) (Ix k ((:) (KV *) ((:=) * k' v') kvs)), KnownNat i) => InDict k v ((:) (KV *) ((:=) * k' v') kvs)

Methods

get' :: Proxy Symbol k -> DynDict ((KV * ': (* := k') v') kvs) -> v

modify' :: Proxy Symbol k -> (v -> v) -> DynDict ((KV * ': (* := k') v') kvs) -> DynDict ((KV * ': (* := k') v') kvs)

InDict k v ((:) (KV *) ((:=) * k v) kvs)

Methods

get' :: Proxy Symbol k -> DynDict ((KV * ': (* := k) v) kvs) -> v

modify' :: Proxy Symbol k -> (v -> v) -> DynDict ((KV * ': (* := k) v) kvs) -> DynDict ((KV * ': (* := k) v) kvs)

(KnownSymbol k, ToJSON v, ToJSON (DynDict kvs)) => ToJSON (DynDict ((:) (KV *) ((:=) * k v) kvs))

Methods

toJSON :: DynDict ((KV * ': (* := k) v) kvs) -> Value

toEncoding :: DynDict ((KV * ': (* := k) v) kvs) -> Encoding

ToJSON (DynDict ([] (KV *)))

Methods

toJSON :: DynDict [KV *] -> Value

toEncoding :: DynDict [KV *] -> Encoding

(KnownSymbol k, FromJSON v, FromJSON (DynDict kvs)) => FromJSON (DynDict ((:) (KV *) ((:=) * k v) kvs))

Methods

parseJSON :: Value -> Parser (DynDict ((KV * ': (* := k) v) kvs))

FromJSON (DynDict ([] (KV *)))

Methods

parseJSON :: Value -> Parser (DynDict [KV *])

ShowDict ([] (KV *))

Methods

showDict :: Int -> Dict [KV *] -> [(String, String, TypeRep)]

(KnownSymbol k, Typeable * v, Show v, ShowDict kvs) => ShowDict ((:) (KV *) ((:=) * k v) kvs)

Methods

showDict :: Int -> Dict ((KV * ': (* := k) v) kvs) -> [(String, String, TypeRep)]

data KVList kvs where

A simple heterogeneous kv linked-list.

Constructors

Cons :: !v -> KVList kvs -> KVList ((k := v) ': kvs)

Empty :: KVList '[]

key :: QuasiQuoter

Quoter for constructing string literal proxy.

[key|foo|] == (Proxy :: Proxy "foo")

type family AddKey (k :: Symbol) (kvs :: [KV *]) :: AddResult where ...

Add a key's type to KVList if not existed.

Equations

AddKey k '[] = HasKey k

AddKey k ((k := v) ': kvs) = DuplicatedKey k

AddKey k ((k' := v) ': kvs) = AddKey k kvs

data AddResult

(kind) pretty print type error for NotHasKey.

> add [key|foo|] 12 $ add [key|foo|] "a" emptyStore
Couldn't match type ‘'DuplicatedKey "foo"’ with ‘'HasKey "foo"’

Constructors

HasKey Symbol

DuplicatedKey Symbol

type NotHasKey k kvs = AddKey k kvs ~ HasKey k

Constraint ensure a key will be inserted into Store.

data GetResult

(kind) pretty print type error for Ix

> get [key|b|] (mkDict $ add [key|a|] 123 emptyStore)
Couldn't match type ‘'Index i0’ with ‘'NotFoundKey "b"’

Constructors

Index Nat

NotFoundKey Symbol

type Ix k kvs = Ix' 0 k kvs

Indexing a key at compile time.