{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE ViewPatterns #-}
module Data.Record.Anon.Internal.Advanced (
Record
, Field(..)
, empty
, insert
, insertA
, get
, set
, merge
, lens
, project
, inject
, applyPending
, map
, cmap
, pure
, cpure
, ap
, collapse
, toList
, mapM
, cmapM
, sequenceA
, sequenceA'
, zip
, zipWith
, zipWithM
, czipWith
, czipWithM
, reifyKnownFields
, reflectKnownFields
, reifyAllFields
, reflectAllFields
, InRow(..)
, reifySubRow
, reflectSubRow
, Some(..)
, SomeRecord(..)
, someRecord
, letRecordT
, letInsertAs
) where
import Prelude hiding (map, mapM, zip, zipWith, sequenceA, pure)
import qualified Prelude
import Control.DeepSeq (NFData (..))
import Data.Aeson (ToJSON(..), FromJSON(..))
import Data.Bifunctor
import Data.Coerce (coerce)
import Data.Functor.Product
import Data.Kind
import Data.Primitive.SmallArray
import Data.Proxy
import Data.Record.Generic hiding (FieldName)
import Data.SOP.Classes (fn_2)
import Data.SOP.Constraint
import Data.Tagged
import GHC.Exts (Any)
import GHC.OverloadedLabels
import GHC.TypeLits
import TypeLet.UserAPI
import qualified Optics.Core as Optics
import qualified GHC.Records as Base
import qualified GHC.Records.Compat as RecordHasfield
import qualified Data.Record.Generic.Eq as Generic
import qualified Data.Record.Generic.JSON as Generic
import qualified Data.Record.Generic.NFData as Generic
import qualified Data.Record.Generic.Show as Generic
import Data.Record.Anon.Internal.Core.Canonical (Canonical)
import Data.Record.Anon.Internal.Core.Diff (Diff)
import Data.Record.Anon.Internal.Core.FieldName
import Data.Record.Anon.Internal.Reflection (Reflected(..))
import Data.Record.Anon.Internal.Util.StrictArray (StrictArray)
import Data.Record.Anon.Plugin.Internal.Runtime
import qualified Data.Record.Anon.Internal.Core.Canonical as Canon
import qualified Data.Record.Anon.Internal.Core.Diff as Diff
import qualified Data.Record.Anon.Internal.Reflection as Unsafe
import qualified Data.Record.Anon.Internal.Util.StrictArray as Strict
data Record (f :: k -> Type) (r :: Row k) =
NoPending {-# UNPACK #-} !(Canonical f)
| HasPending {-# UNPACK #-} !(Canonical f) !(Diff f)
toCanonical :: Record f r -> Canonical f
toCanonical :: forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical (NoPending Canonical f
c) = Canonical f
c
toCanonical (HasPending Canonical f
c Diff f
d) = forall {k} (f :: k -> *). Diff f -> Canonical f -> Canonical f
Diff.apply Diff f
d Canonical f
c
unsafeFromCanonical :: Canonical f -> Record f r
unsafeFromCanonical :: forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
NoPending
data Field n where
Field :: (KnownSymbol n, KnownHash n) => Proxy n -> Field n
instance (n ~ n', KnownSymbol n, KnownHash n) => IsLabel n' (Field n) where
fromLabel :: Field n
fromLabel = forall (n :: Symbol).
(KnownSymbol n, KnownHash n) =>
Proxy n -> Field n
Field (forall {k} (t :: k). Proxy t
Proxy @n)
instance forall k (n :: Symbol) (f :: k -> Type) (r :: Row k) (a :: k).
(KnownSymbol n, KnownHash n, RowHasField n r a)
=> RecordHasfield.HasField n (Record f r) (f a) where
{-# INLINE hasField #-}
hasField :: Record f r -> (f a -> Record f r, f a)
hasField Record f r
r = (
\f a
x -> forall k (f :: k -> *) (r :: Row k) (a :: k).
Int -> FieldName -> f a -> Record f r -> Record f r
unsafeSetField Int
ix FieldName
name f a
x Record f r
r
, forall k (f :: k -> *) (r :: Row k) (a :: k).
Int -> FieldName -> Record f r -> f a
unsafeGetField Int
ix FieldName
name Record f r
r
)
where
name :: FieldName
name :: FieldName
name = forall (n :: Symbol).
(KnownSymbol n, KnownHash n) =>
Proxy n -> FieldName
mkFieldName (forall {k} (t :: k). Proxy t
Proxy @n)
ix :: Int
ix :: Int
ix = forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (n :: Symbol) (r :: Row k) (a :: k).
RowHasField n r a =>
DictRowHasField k n r a
rowHasField (forall {k} (t :: k). Proxy t
Proxy @'(n, r, a))
mkFieldName :: (KnownSymbol n, KnownHash n) => Proxy n -> FieldName
mkFieldName :: forall (n :: Symbol).
(KnownSymbol n, KnownHash n) =>
Proxy n -> FieldName
mkFieldName Proxy n
p = Int -> String -> FieldName
FieldName (forall (s :: Symbol) (proxy :: Symbol -> *).
KnownHash s =>
proxy s -> Int
hashVal Proxy n
p) (forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal Proxy n
p)
instance (RowHasField n r a, KnownSymbol n, KnownHash n)
=> Optics.LabelOptic n Optics.A_Lens (Record f r) (Record f r) (f a) (f a) where
labelOptic :: Optic A_Lens NoIx (Record f r) (Record f r) (f a) (f a)
labelOptic = Field n -> Optic A_Lens NoIx (Record f r) (Record f r) (f a) (f a)
aux (forall (x :: Symbol) a. IsLabel x a => a
fromLabel @n)
where
aux :: Field n -> Optics.Lens' (Record f r) (f a)
aux :: Field n -> Optic A_Lens NoIx (Record f r) (Record f r) (f a) (f a)
aux Field n
n = forall s a b t. (s -> a) -> (s -> b -> t) -> Lens s t a b
Optics.lens (forall {k} (n :: Symbol) (f :: k -> *) (r :: Row k) (a :: k).
RowHasField n r a =>
Field n -> Record f r -> f a
get Field n
n) (forall a b c. (a -> b -> c) -> b -> a -> c
flip (forall {k} (n :: Symbol) (f :: k -> *) (r :: Row k) (a :: k).
RowHasField n r a =>
Field n -> f a -> Record f r -> Record f r
set Field n
n))
unsafeGetField :: forall k (f :: k -> Type) (r :: Row k) (a :: k).
Int -> FieldName -> Record f r -> f a
unsafeGetField :: forall k (f :: k -> *) (r :: Row k) (a :: k).
Int -> FieldName -> Record f r -> f a
unsafeGetField Int
i FieldName
n = f Any -> f a
co forall b c a. (b -> c) -> (a -> b) -> a -> c
. \case
NoPending Canonical f
c -> forall {k} (f :: k -> *). Canonical f -> Int -> f Any
Canon.getAtIndex Canonical f
c Int
i
HasPending Canonical f
c Diff f
d -> forall {k} (f :: k -> *).
(Int, FieldName) -> Diff f -> Canonical f -> f Any
Diff.get (Int
i, FieldName
n) Diff f
d Canonical f
c
where
co :: f Any -> f a
co :: f Any -> f a
co = forall a b. a -> b
noInlineUnsafeCo
unsafeSetField :: forall k (f :: k -> Type) (r :: Row k) (a :: k).
Int -> FieldName -> f a -> Record f r -> Record f r
unsafeSetField :: forall k (f :: k -> *) (r :: Row k) (a :: k).
Int -> FieldName -> f a -> Record f r -> Record f r
unsafeSetField Int
i FieldName
n f a
x = \case
NoPending Canonical f
c -> forall k (f :: k -> *) (r :: Row k).
Canonical f -> Diff f -> Record f r
HasPending Canonical f
c (Diff f -> Diff f
go forall {k} (f :: k -> *). Diff f
Diff.empty)
HasPending Canonical f
c Diff f
d -> forall k (f :: k -> *) (r :: Row k).
Canonical f -> Diff f -> Record f r
HasPending Canonical f
c (Diff f -> Diff f
go Diff f
d)
where
go :: Diff f -> Diff f
go :: Diff f -> Diff f
go = forall {k} (f :: k -> *).
(Int, FieldName) -> f Any -> Diff f -> Diff f
Diff.set (Int
i, FieldName
n) (f a -> f Any
co f a
x)
co :: f a -> f Any
co :: f a -> f Any
co = forall a b. a -> b
noInlineUnsafeCo
get :: forall n f r a.
RowHasField n r a
=> Field n -> Record f r -> f a
get :: forall {k} (n :: Symbol) (f :: k -> *) (r :: Row k) (a :: k).
RowHasField n r a =>
Field n -> Record f r -> f a
get (Field Proxy n
_) = forall {k} (x :: k) r a. HasField x r a => r -> a
RecordHasfield.getField @n @(Record f r)
set :: forall n f r a.
RowHasField n r a
=> Field n -> f a -> Record f r -> Record f r
set :: forall {k} (n :: Symbol) (f :: k -> *) (r :: Row k) (a :: k).
RowHasField n r a =>
Field n -> f a -> Record f r -> Record f r
set (Field Proxy n
_) = forall a b c. (a -> b -> c) -> b -> a -> c
flip (forall {k} (x :: k) r a. HasField x r a => r -> a -> r
RecordHasfield.setField @n @(Record f r))
instance (KnownSymbol n, KnownHash n, RowHasField n r a)
=> Base.HasField n (Record f r) (f a) where
getField :: Record f r -> f a
getField = forall a b. (a, b) -> b
snd forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (x :: k) r a. HasField x r a => r -> (a -> r, a)
RecordHasfield.hasField @n
empty :: Record f '[]
empty :: forall {k} (f :: k -> *). Record f '[]
empty = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
NoPending forall a. Monoid a => a
mempty
insert :: forall k (f :: k -> Type) (r :: Row k) (a :: k) (n :: Symbol).
Field n -> f a -> Record f r -> Record f (n := a : r)
insert :: forall k (f :: k -> *) (r :: Row k) (a :: k) (n :: Symbol).
Field n -> f a -> Record f r -> Record f ((n ':= a) : r)
insert (Field Proxy n
n) f a
x = \case
NoPending Canonical f
c -> forall k (f :: k -> *) (r :: Row k).
Canonical f -> Diff f -> Record f r
HasPending Canonical f
c (Diff f -> Diff f
go forall {k} (f :: k -> *). Diff f
Diff.empty)
HasPending Canonical f
c Diff f
d -> forall k (f :: k -> *) (r :: Row k).
Canonical f -> Diff f -> Record f r
HasPending Canonical f
c (Diff f -> Diff f
go Diff f
d)
where
go :: Diff f -> Diff f
go :: Diff f -> Diff f
go = forall {k} (f :: k -> *). FieldName -> f Any -> Diff f -> Diff f
Diff.insert (forall (n :: Symbol).
(KnownSymbol n, KnownHash n) =>
Proxy n -> FieldName
mkFieldName Proxy n
n) (f a -> f Any
co f a
x)
co :: f a -> f Any
co :: f a -> f Any
co = forall a b. a -> b
noInlineUnsafeCo
insertA ::
Applicative m
=> Field n -> m (f a) -> m (Record f r) -> m (Record f (n := a : r))
insertA :: forall {b} (m :: * -> *) (n :: Symbol) (f :: b -> *) (a :: b)
(r :: Row b).
Applicative m =>
Field n
-> m (f a) -> m (Record f r) -> m (Record f ((n ':= a) : r))
insertA Field n
f m (f a)
x m (Record f r)
r = forall k (f :: k -> *) (r :: Row k) (a :: k) (n :: Symbol).
Field n -> f a -> Record f r -> Record f ((n ':= a) : r)
insert Field n
f forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> m (f a)
x forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> m (Record f r)
r
merge :: Record f r -> Record f r' -> Record f (Merge r r')
merge :: forall {k} (f :: k -> *) (r :: Row k) (r' :: Row k).
Record f r -> Record f r' -> Record f (Merge r r')
merge (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r') =
forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$ Canonical f
r forall a. Semigroup a => a -> a -> a
<> Canonical f
r'
lens :: forall f r r'.
SubRow r r'
=> Record f r -> (Record f r', Record f r' -> Record f r)
lens :: forall {k} (f :: k -> *) (r :: Row k) (r' :: Row k).
SubRow r r' =>
Record f r -> (Record f r', Record f r' -> Record f r)
lens = \(forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) ->
forall (p :: * -> * -> *) a b c d.
Bifunctor p =>
(a -> b) -> (c -> d) -> p a c -> p b d
bimap Canonical f -> Record f r'
getter (Canonical f -> Canonical f) -> Record f r' -> Record f r
setter forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *).
StrictArray Int
-> Canonical f -> (Canonical f, Canonical f -> Canonical f)
Canon.lens (forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (r :: Row k) (r' :: Row k).
SubRow r r' =>
DictSubRow k r r'
projectIndices (forall {k} (t :: k). Proxy t
Proxy @'(r, r'))) Canonical f
r
where
getter :: Canonical f -> Record f r'
getter :: Canonical f -> Record f r'
getter = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical
setter :: (Canonical f -> Canonical f) -> Record f r' -> Record f r
setter :: (Canonical f -> Canonical f) -> Record f r' -> Record f r
setter Canonical f -> Canonical f
f (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical (Canonical f -> Canonical f
f Canonical f
r)
project :: SubRow r r' => Record f r -> Record f r'
project :: forall {k} (r :: Row k) (r' :: Row k) (f :: k -> *).
SubRow r r' =>
Record f r -> Record f r'
project = forall a b. (a, b) -> a
fst forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (f :: k -> *) (r :: Row k) (r' :: Row k).
SubRow r r' =>
Record f r -> (Record f r', Record f r' -> Record f r)
lens
inject :: SubRow r r' => Record f r' -> Record f r -> Record f r
inject :: forall {k} (r :: Row k) (r' :: Row k) (f :: k -> *).
SubRow r r' =>
Record f r' -> Record f r -> Record f r
inject Record f r'
small = (forall a b. (a -> b) -> a -> b
$ Record f r'
small) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. (a, b) -> b
snd forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (f :: k -> *) (r :: Row k) (r' :: Row k).
SubRow r r' =>
Record f r -> (Record f r', Record f r' -> Record f r)
lens
applyPending :: Record f r -> Record f r
applyPending :: forall {k} (f :: k -> *) (r :: Row k). Record f r -> Record f r
applyPending (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical Canonical f
r
map :: (forall x. f x -> g x) -> Record f r -> Record g r
map :: forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x) -> Record f r -> Record g r
map forall (x :: k). f x -> g x
f (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *) (g :: k -> *).
(forall (x :: k). f x -> g x) -> Canonical f -> Canonical g
Canon.map forall (x :: k). f x -> g x
f Canonical f
r
mapM ::
Applicative m
=> (forall x. f x -> m (g x))
-> Record f r -> m (Record g r)
mapM :: forall {k} (m :: * -> *) (f :: k -> *) (g :: k -> *) (r :: Row k).
Applicative m =>
(forall (x :: k). f x -> m (g x)) -> Record f r -> m (Record g r)
mapM forall (x :: k). f x -> m (g x)
f (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (m :: * -> *) (f :: k -> *) (g :: k -> *).
Applicative m =>
(forall (x :: k). f x -> m (g x)) -> Canonical f -> m (Canonical g)
Canon.mapM forall (x :: k). f x -> m (g x)
f Canonical f
r
zip :: Record f r -> Record g r -> Record (Product f g) r
zip :: forall {k} (f :: k -> *) (r :: Row k) (g :: k -> *).
Record f r -> Record g r -> Record (Product f g) r
zip = forall {k} (f :: k -> *) (g :: k -> *) (h :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x -> h x)
-> Record f r -> Record g r -> Record h r
zipWith forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> Product f g a
Pair
zipWith ::
(forall x. f x -> g x -> h x)
-> Record f r -> Record g r -> Record h r
zipWith :: forall {k} (f :: k -> *) (g :: k -> *) (h :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x -> h x)
-> Record f r -> Record g r -> Record h r
zipWith forall (x :: k). f x -> g x -> h x
f (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical g
r') = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *) (g :: k -> *) (h :: k -> *).
(forall (x :: k). f x -> g x -> h x)
-> Canonical f -> Canonical g -> Canonical h
Canon.zipWith forall (x :: k). f x -> g x -> h x
f Canonical f
r Canonical g
r'
zipWithM ::
Applicative m
=> (forall x. f x -> g x -> m (h x))
-> Record f r -> Record g r -> m (Record h r)
zipWithM :: forall {k} (m :: * -> *) (f :: k -> *) (g :: k -> *) (h :: k -> *)
(r :: Row k).
Applicative m =>
(forall (x :: k). f x -> g x -> m (h x))
-> Record f r -> Record g r -> m (Record h r)
zipWithM forall (x :: k). f x -> g x -> m (h x)
f (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical g
r') = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (m :: * -> *) (f :: k -> *) (g :: k -> *) (h :: k -> *).
Applicative m =>
(forall (x :: k). f x -> g x -> m (h x))
-> Canonical f -> Canonical g -> m (Canonical h)
Canon.zipWithM forall (x :: k). f x -> g x -> m (h x)
f Canonical f
r Canonical g
r'
collapse :: Record (K a) r -> [a]
collapse :: forall {k} a (r :: Row k). Record (K a) r -> [a]
collapse (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical (K a)
r) =
forall {k} a. Canonical (K a) -> [a]
Canon.collapse Canonical (K a)
r
sequenceA :: Applicative m => Record (m :.: f) r -> m (Record f r)
sequenceA :: forall {k} (m :: * -> *) (f :: k -> *) (r :: Row k).
Applicative m =>
Record (m :.: f) r -> m (Record f r)
sequenceA (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical (m :.: f)
r) = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (m :: * -> *) (f :: k -> *).
Applicative m =>
Canonical (m :.: f) -> m (Canonical f)
Canon.sequenceA Canonical (m :.: f)
r
sequenceA' :: Applicative m => Record m r -> m (Record I r)
sequenceA' :: forall (m :: * -> *) (r :: Row (*)).
Applicative m =>
Record m r -> m (Record I r)
sequenceA' = forall {k} (m :: * -> *) (f :: k -> *) (r :: Row k).
Applicative m =>
Record (m :.: f) r -> m (Record f r)
sequenceA forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (m :: * -> *) (r :: Row (*)).
Record m r -> Record (m :.: I) r
co
where
co :: Record m r -> Record (m :.: I) r
co :: forall (m :: * -> *) (r :: Row (*)).
Record m r -> Record (m :.: I) r
co = forall a b. a -> b
noInlineUnsafeCo
pure :: forall f r. KnownFields r => (forall x. f x) -> Record f r
pure :: forall {k} (f :: k -> *) (r :: Row k).
KnownFields r =>
(forall (x :: k). f x) -> Record f r
pure forall (x :: k). f x
f = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *). [f Any] -> Canonical f
Canon.fromList forall a b. (a -> b) -> a -> b
$ forall a b. (a -> b) -> [a] -> [b]
Prelude.map (forall a b. a -> b -> a
const forall (x :: k). f x
f) (forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (r :: Row k). KnownFields r => DictKnownFields k r
fieldNames (forall {k} (t :: k). Proxy t
Proxy @r))
ap :: Record (f -.-> g) r -> Record f r -> Record g r
ap :: forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
Record (f -.-> g) r -> Record f r -> Record g r
ap (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical (f -.-> g)
r) (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r') = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *) (g :: k -> *).
Canonical (f -.-> g) -> Canonical f -> Canonical g
Canon.ap Canonical (f -.-> g)
r Canonical f
r'
reifyKnownFields :: forall k (r :: Row k) proxy.
KnownFields r
=> proxy r -> Record (K String) r
reifyKnownFields :: forall k (r :: Row k) (proxy :: Row k -> *).
KnownFields r =>
proxy r -> Record (K String) r
reifyKnownFields proxy r
_ =
forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *). [f Any] -> Canonical f
Canon.fromList forall a b. (a -> b) -> a -> b
$ forall {k}. [String] -> [K String Any]
co forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (r :: Row k). KnownFields r => DictKnownFields k r
fieldNames (forall {k} (t :: k). Proxy t
Proxy @r)
where
co :: [String] -> [K String Any]
co :: forall {k}. [String] -> [K String Any]
co = coerce :: forall a b. Coercible a b => a -> b
coerce
reflectKnownFields :: forall k (r :: Row k).
Record (K String) r
-> Reflected (KnownFields r)
reflectKnownFields :: forall k (r :: Row k).
Record (K String) r -> Reflected (KnownFields r)
reflectKnownFields Record (K String) r
names =
forall k (r :: Row k).
DictKnownFields k r -> Reflected (KnownFields r)
Unsafe.reflectKnownFields forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) b. b -> Tagged s b
Tagged forall a b. (a -> b) -> a -> b
$ forall {k} a (r :: Row k). Record (K a) r -> [a]
collapse Record (K String) r
names
reifyAllFields :: forall k (r :: Row k) (c :: k -> Constraint) proxy.
AllFields r c
=> proxy c -> Record (Dict c) r
reifyAllFields :: forall k (r :: Row k) (c :: k -> Constraint)
(proxy :: (k -> Constraint) -> *).
AllFields r c =>
proxy c -> Record (Dict c) r
reifyAllFields proxy c
_ = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *). StrictArray (f Any) -> Canonical f
Canon.fromVector forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. SmallArray a -> StrictArray a
Strict.fromLazy forall a b. (a -> b) -> a -> b
$
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap DictAny c -> Dict c Any
aux forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (r :: Row k) (c :: k -> Constraint).
AllFields r c =>
DictAllFields k r c
fieldDicts (forall {k} (t :: k). Proxy t
Proxy @r)
where
aux :: DictAny c -> Dict c Any
aux :: DictAny c -> Dict c Any
aux DictAny c
DictAny = forall {k} (c :: k -> Constraint) (a :: k). c a => Dict c a
Dict
reflectAllFields :: forall k (c :: k -> Constraint) (r :: Row k).
Record (Dict c) r
-> Reflected (AllFields r c)
reflectAllFields :: forall k (c :: k -> Constraint) (r :: Row k).
Record (Dict c) r -> Reflected (AllFields r c)
reflectAllFields Record (Dict c) r
dicts =
forall k (r :: Row k) (c :: k -> Constraint).
DictAllFields k r c -> Reflected (AllFields r c)
Unsafe.reflectAllFields forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) b. b -> Tagged s b
Tagged forall a b. (a -> b) -> a -> b
$
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Dict c Any -> DictAny c
aux forall a b. (a -> b) -> a -> b
$ forall a. StrictArray a -> SmallArray a
Strict.toLazy forall a b. (a -> b) -> a -> b
$ forall {k} (f :: k -> *). Canonical f -> StrictArray (f Any)
Canon.toVector forall a b. (a -> b) -> a -> b
$ forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical Record (Dict c) r
dicts
where
aux :: Dict c Any -> DictAny c
aux :: Dict c Any -> DictAny c
aux Dict c Any
Dict = forall {k} (c :: k -> Constraint). c Any => DictAny c
DictAny
data InRow (r :: Row k) (a :: k) where
InRow :: forall k (n :: Symbol) (r :: Row k) (a :: k).
( KnownSymbol n
, RowHasField n r a
)
=> Proxy n -> InRow r a
reifySubRow :: forall k (r :: Row k) (r' :: Row k).
(SubRow r r', KnownFields r')
=> Record (InRow r) r'
reifySubRow :: forall k (r :: Row k) (r' :: Row k).
(SubRow r r', KnownFields r') =>
Record (InRow r) r'
reifySubRow =
forall {k} (f :: k -> *) (g :: k -> *) (h :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x -> h x)
-> Record f r -> Record g r -> Record h r
zipWith forall (x :: k). K Int x -> K String x -> InRow r x
aux Record (K Int) r'
ixs (forall k (r :: Row k) (proxy :: Row k -> *).
KnownFields r =>
proxy r -> Record (K String) r
reifyKnownFields (forall {k} (t :: k). Proxy t
Proxy @r'))
where
ixs :: Record (K Int) r'
ixs :: Record (K Int) r'
ixs = forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *). StrictArray (f Any) -> Canonical f
Canon.fromVector forall a b. (a -> b) -> a -> b
$ forall {k}. StrictArray Int -> StrictArray (K Int Any)
co forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (r :: Row k) (r' :: Row k).
SubRow r r' =>
DictSubRow k r r'
projectIndices (forall {k} (t :: k). Proxy t
Proxy @'(r, r'))
co :: StrictArray Int -> StrictArray (K Int Any)
co :: forall {k}. StrictArray Int -> StrictArray (K Int Any)
co = coerce :: forall a b. Coercible a b => a -> b
coerce
aux :: forall x. K Int x -> K String x -> InRow r x
aux :: forall (x :: k). K Int x -> K String x -> InRow r x
aux (K Int
i) (K String
name) =
case String -> SomeSymbol
someSymbolVal String
name of
SomeSymbol Proxy n
p -> forall {k} (n :: Symbol) (r :: Row k) (a :: k).
KnownSymbol n =>
Int -> Proxy n -> InRow r a
unsafeInRow Int
i Proxy n
p
reflectSubRow :: forall k (r :: Row k) (r' :: Row k).
Record (InRow r) r'
-> Reflected (SubRow r r')
reflectSubRow :: forall k (r :: Row k) (r' :: Row k).
Record (InRow r) r' -> Reflected (SubRow r r')
reflectSubRow (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical (InRow r)
ixs) =
forall k (r :: Row k) (r' :: Row k).
DictSubRow k r r' -> Reflected (SubRow r r')
Unsafe.reflectSubRow forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) b. b -> Tagged s b
Tagged forall a b. (a -> b) -> a -> b
$
(\inRow :: InRow r Any
inRow@(InRow Proxy n
p) -> forall (x :: k) (n :: Symbol).
RowHasField n r x =>
InRow r x -> Proxy n -> Int
aux InRow r Any
inRow Proxy n
p) forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall {k} (f :: k -> *). Canonical f -> StrictArray (f Any)
Canon.toVector Canonical (InRow r)
ixs
where
aux :: forall x n. RowHasField n r x => InRow r x -> Proxy n -> Int
aux :: forall (x :: k) (n :: Symbol).
RowHasField n r x =>
InRow r x -> Proxy n -> Int
aux InRow r x
_ Proxy n
_ = forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (n :: Symbol) (r :: Row k) (a :: k).
RowHasField n r a =>
DictRowHasField k n r a
rowHasField (forall {k} (t :: k). Proxy t
Proxy @'(n, r, x))
unsafeInRow :: forall n r a. KnownSymbol n => Int -> Proxy n -> InRow r a
unsafeInRow :: forall {k} (n :: Symbol) (r :: Row k) (a :: k).
KnownSymbol n =>
Int -> Proxy n -> InRow r a
unsafeInRow Int
i Proxy n
p =
case Reflected (RowHasField n r a)
reflected of
Reflected (RowHasField n r a)
Reflected -> forall k (r :: Symbol) (r :: Row k) (a :: k).
(KnownSymbol r, RowHasField r r a) =>
Proxy r -> InRow r a
InRow Proxy n
p
where
reflected :: Reflected (RowHasField n r a)
reflected :: Reflected (RowHasField n r a)
reflected = forall k (n :: Symbol) (r :: Row k) (a :: k).
DictRowHasField k n r a -> Reflected (RowHasField n r a)
Unsafe.reflectRowHasField forall a b. (a -> b) -> a -> b
$ forall {k} (s :: k) b. b -> Tagged s b
Tagged Int
i
data Some (f :: k -> Type) where
Some :: forall k (f :: k -> Type) (x :: k). f x -> Some f
data SomeRecord (f :: k -> Type) where
SomeRecord :: forall k (r :: Row k) (f :: k -> Type).
KnownFields r
=> Record (Product (InRow r) f) r
-> SomeRecord f
someRecord :: forall k (f :: k -> Type). [(String, Some f)] -> SomeRecord f
someRecord :: forall k (f :: k -> *). [(String, Some f)] -> SomeRecord f
someRecord [(String, Some f)]
fields =
forall (r :: Row k). Record (Product (InRow r) f) r -> SomeRecord f
mkSomeRecord forall a b. (a -> b) -> a -> b
$
forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (f :: k -> *). [f Any] -> Canonical f
Canon.fromList forall a b. (a -> b) -> a -> b
$
forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
Prelude.zipWith forall (r :: Row k).
Int -> (SomeSymbol, Some f) -> Product (InRow r) f Any
aux [Int
0..] (forall a b. (a -> b) -> [a] -> [b]
Prelude.map (forall (p :: * -> * -> *) a b c.
Bifunctor p =>
(a -> b) -> p a c -> p b c
first String -> SomeSymbol
someSymbolVal) [(String, Some f)]
fields)
where
aux :: Int -> (SomeSymbol, Some f) -> Product (InRow r) f Any
aux :: forall (r :: Row k).
Int -> (SomeSymbol, Some f) -> Product (InRow r) f Any
aux Int
i (SomeSymbol Proxy n
n, Some f x
fx) = forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> Product f g a
Pair (forall {k} (n :: Symbol) (r :: Row k) (a :: k).
KnownSymbol n =>
Int -> Proxy n -> InRow r a
unsafeInRow Int
i Proxy n
n) (forall (x :: k). f x -> f Any
co f x
fx)
co :: f x -> f Any
co :: forall (x :: k). f x -> f Any
co = forall a b. a -> b
noInlineUnsafeCo
mkSomeRecord :: forall r. Record (Product (InRow r) f) r -> SomeRecord f
mkSomeRecord :: forall (r :: Row k). Record (Product (InRow r) f) r -> SomeRecord f
mkSomeRecord Record (Product (InRow r) f) r
r =
case Reflected (KnownFields r)
reflected of
Reflected (KnownFields r)
Reflected -> forall k (r :: Row k) (f :: k -> *).
KnownFields r =>
Record (Product (InRow r) f) r -> SomeRecord f
SomeRecord Record (Product (InRow r) f) r
r
where
reflected :: Reflected (KnownFields r)
reflected :: Reflected (KnownFields r)
reflected = forall k (r :: Row k).
Record (K String) r -> Reflected (KnownFields r)
reflectKnownFields forall a b. (a -> b) -> a -> b
$ forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x) -> Record f r -> Record g r
map forall (x :: k). Product (InRow r) f x -> K String x
getName Record (Product (InRow r) f) r
r
getName :: Product (InRow r) f x -> K String x
getName :: forall (x :: k). Product (InRow r) f x -> K String x
getName (Pair (InRow Proxy n
p) f x
_) = forall k a (b :: k). a -> K a b
K forall a b. (a -> b) -> a -> b
$ forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal Proxy n
p
recordToRep :: Record f r -> Rep I (Record f r)
recordToRep :: forall {k} (f :: k -> *) (r :: Row k).
Record f r -> Rep I (Record f r)
recordToRep (forall {k} (f :: k -> *) (r :: Row k). Record f r -> Canonical f
toCanonical -> Canonical f
r) =
forall (f :: * -> *) a. SmallArray (f Any) -> Rep f a
Rep forall a b. (a -> b) -> a -> b
$ forall {k} (f :: k -> *). SmallArray (f Any) -> SmallArray (I Any)
co forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. StrictArray a -> SmallArray a
Strict.toLazy forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (f :: k -> *). Canonical f -> StrictArray (f Any)
Canon.toVector forall a b. (a -> b) -> a -> b
$ Canonical f
r
where
co :: SmallArray (f Any) -> SmallArray (I Any)
co :: forall {k} (f :: k -> *). SmallArray (f Any) -> SmallArray (I Any)
co = forall a b. a -> b
noInlineUnsafeCo
repToRecord :: Rep I (Record f r) -> Record f r
repToRecord :: forall {k} (f :: k -> *) (r :: Row k).
Rep I (Record f r) -> Record f r
repToRecord (Rep SmallArray (I Any)
r) =
forall {k} (f :: k -> *) (r :: Row k). Canonical f -> Record f r
unsafeFromCanonical forall a b. (a -> b) -> a -> b
$ forall {k} (f :: k -> *). StrictArray (f Any) -> Canonical f
Canon.fromVector forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. SmallArray a -> StrictArray a
Strict.fromLazy forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (f :: k -> *). SmallArray (I Any) -> SmallArray (f Any)
co forall a b. (a -> b) -> a -> b
$ SmallArray (I Any)
r
where
co :: SmallArray (I Any) -> SmallArray (f Any)
co :: forall {k} (f :: k -> *). SmallArray (I Any) -> SmallArray (f Any)
co = forall a b. a -> b
noInlineUnsafeCo
class (AllFields r (Compose c f), KnownFields r) => RecordConstraints f r c
instance (AllFields r (Compose c f), KnownFields r) => RecordConstraints f r c
recordConstraints :: forall f r c.
RecordConstraints f r c
=> Proxy c -> Rep (Dict c) (Record f r)
recordConstraints :: forall {k} (f :: k -> *) (r :: Row k) (c :: * -> Constraint).
RecordConstraints f r c =>
Proxy c -> Rep (Dict c) (Record f r)
recordConstraints Proxy c
_ = forall (f :: * -> *) a. SmallArray (f Any) -> Rep f a
Rep forall a b. (a -> b) -> a -> b
$
Dict (Compose c f) Any -> Dict c Any
co forall b c a. (b -> c) -> (a -> b) -> a -> c
. DictAny (Compose c f) -> Dict (Compose c f) Any
aux forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall {k} (s :: k) a (proxy :: k -> *). Tagged s a -> proxy s -> a
proxy forall k (r :: Row k) (c :: k -> Constraint).
AllFields r c =>
DictAllFields k r c
fieldDicts (forall {k} (t :: k). Proxy t
Proxy @r)
where
aux :: DictAny (Compose c f) -> Dict (Compose c f) Any
aux :: DictAny (Compose c f) -> Dict (Compose c f) Any
aux DictAny (Compose c f)
DictAny = forall {k} (c :: k -> Constraint) (a :: k). c a => Dict c a
Dict
co :: Dict (Compose c f) Any -> Dict c Any
co :: Dict (Compose c f) Any -> Dict c Any
co = forall a b. a -> b
noInlineUnsafeCo
recordMetadata :: forall k (f :: k -> Type) (r :: Row k).
KnownFields r
=> Metadata (Record f r)
recordMetadata :: forall k (f :: k -> *) (r :: Row k).
KnownFields r =>
Metadata (Record f r)
recordMetadata = Metadata {
recordName :: String
recordName = String
"Record"
, recordConstructor :: String
recordConstructor = String
"ANON_F"
, recordSize :: Int
recordSize = forall (t :: * -> *) a. Foldable t => t a -> Int
length [FieldMetadata Any]
fields
, recordFieldMetadata :: Rep FieldMetadata (Record f r)
recordFieldMetadata = forall (f :: * -> *) a. SmallArray (f Any) -> Rep f a
Rep forall a b. (a -> b) -> a -> b
$ forall a. [a] -> SmallArray a
smallArrayFromList [FieldMetadata Any]
fields
}
where
fields :: [FieldMetadata Any]
fields :: [FieldMetadata Any]
fields = forall k (r :: Row k) (proxy :: Row k -> *).
KnownFields r =>
proxy r -> [FieldMetadata Any]
fieldMetadata (forall {k} (t :: k). Proxy t
Proxy @r)
instance KnownFields r => Generic (Record f r) where
type Constraints (Record f r) = RecordConstraints f r
type MetadataOf (Record f r) = FieldTypes f r
from :: Record f r -> Rep I (Record f r)
from = forall {k} (f :: k -> *) (r :: Row k).
Record f r -> Rep I (Record f r)
recordToRep
to :: Rep I (Record f r) -> Record f r
to = forall {k} (f :: k -> *) (r :: Row k).
Rep I (Record f r) -> Record f r
repToRecord
dict :: forall (c :: * -> Constraint).
Constraints (Record f r) c =>
Proxy c -> Rep (Dict c) (Record f r)
dict = forall {k} (f :: k -> *) (r :: Row k) (c :: * -> Constraint).
RecordConstraints f r c =>
Proxy c -> Rep (Dict c) (Record f r)
recordConstraints
metadata :: forall (proxy :: * -> *).
proxy (Record f r) -> Metadata (Record f r)
metadata = forall a b. a -> b -> a
const forall k (f :: k -> *) (r :: Row k).
KnownFields r =>
Metadata (Record f r)
recordMetadata
instance RecordConstraints f r Show => Show (Record f r) where
showsPrec :: Int -> Record f r -> ShowS
showsPrec = forall a. (Generic a, Constraints a Show) => Int -> a -> ShowS
Generic.gshowsPrec
instance RecordConstraints f r Eq => Eq (Record f r) where
== :: Record f r -> Record f r -> Bool
(==) = forall a. (Generic a, Constraints a Eq) => a -> a -> Bool
Generic.geq
instance ( RecordConstraints f r Eq
, RecordConstraints f r Ord
) => Ord (Record f r) where
compare :: Record f r -> Record f r -> Ordering
compare = forall a. (Generic a, Constraints a Ord) => a -> a -> Ordering
Generic.gcompare
instance RecordConstraints f r NFData => NFData (Record f r) where
rnf :: Record f r -> ()
rnf = forall a. (Generic a, Constraints a NFData) => a -> ()
Generic.grnf
instance RecordConstraints f r ToJSON => ToJSON (Record f r) where
toJSON :: Record f r -> Value
toJSON = forall a. (Generic a, Constraints a ToJSON) => a -> Value
Generic.gtoJSON
instance RecordConstraints f r FromJSON => FromJSON (Record f r) where
parseJSON :: Value -> Parser (Record f r)
parseJSON = forall a. (Generic a, Constraints a FromJSON) => Value -> Parser a
Generic.gparseJSON
cpure :: forall r f c.
AllFields r c
=> Proxy c
-> (forall x. c x => f x)
-> Record f r
cpure :: forall {k} (r :: Row k) (f :: k -> *) (c :: k -> Constraint).
AllFields r c =>
Proxy c -> (forall (x :: k). c x => f x) -> Record f r
cpure Proxy c
p forall (x :: k). c x => f x
f = forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x) -> Record f r -> Record g r
map (\Dict c x
Dict -> forall (x :: k). c x => f x
f) forall a b. (a -> b) -> a -> b
$ forall k (r :: Row k) (c :: k -> Constraint)
(proxy :: (k -> Constraint) -> *).
AllFields r c =>
proxy c -> Record (Dict c) r
reifyAllFields Proxy c
p
cmap :: forall r c f g.
AllFields r c
=> Proxy c
-> (forall x. c x => f x -> g x)
-> Record f r -> Record g r
cmap :: forall {k} (r :: Row k) (c :: k -> Constraint) (f :: k -> *)
(g :: k -> *).
AllFields r c =>
Proxy c
-> (forall (x :: k). c x => f x -> g x) -> Record f r -> Record g r
cmap Proxy c
p forall (x :: k). c x => f x -> g x
f = forall {k} (f :: k -> *) (g :: k -> *) (h :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x -> h x)
-> Record f r -> Record g r -> Record h r
zipWith (\Dict c x
Dict -> forall (x :: k). c x => f x -> g x
f) (forall k (r :: Row k) (c :: k -> Constraint)
(proxy :: (k -> Constraint) -> *).
AllFields r c =>
proxy c -> Record (Dict c) r
reifyAllFields Proxy c
p)
cmapM ::
(Applicative m, AllFields r c)
=> Proxy c
-> (forall x. c x => f x -> m (g x))
-> Record f r -> m (Record g r)
cmapM :: forall {k} (m :: * -> *) (r :: Row k) (c :: k -> Constraint)
(f :: k -> *) (g :: k -> *).
(Applicative m, AllFields r c) =>
Proxy c
-> (forall (x :: k). c x => f x -> m (g x))
-> Record f r
-> m (Record g r)
cmapM Proxy c
p forall (x :: k). c x => f x -> m (g x)
f = forall {k} (m :: * -> *) (f :: k -> *) (r :: Row k).
Applicative m =>
Record (m :.: f) r -> m (Record f r)
sequenceA forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} (r :: Row k) (c :: k -> Constraint) (f :: k -> *)
(g :: k -> *).
AllFields r c =>
Proxy c
-> (forall (x :: k). c x => f x -> g x) -> Record f r -> Record g r
cmap Proxy c
p (forall l k (f :: l -> *) (g :: k -> l) (p :: k).
f (g p) -> (:.:) f g p
Comp forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (x :: k). c x => f x -> m (g x)
f)
toList :: forall r a. KnownFields r => Record (K a) r -> [(String, a)]
toList :: forall {k} (r :: Row k) a.
KnownFields r =>
Record (K a) r -> [(String, a)]
toList = forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
Prelude.zipWith forall b. FieldMetadata b -> a -> (String, a)
aux (forall k (r :: Row k) (proxy :: Row k -> *).
KnownFields r =>
proxy r -> [FieldMetadata Any]
fieldMetadata (forall {k} (t :: k). Proxy t
Proxy @r)) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {k} a (r :: Row k). Record (K a) r -> [a]
collapse
where
aux :: FieldMetadata b -> a -> (String, a)
aux :: forall b. FieldMetadata b -> a -> (String, a)
aux (FieldMetadata Proxy name
p FieldStrictness
_) a
a = (forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal Proxy name
p, a
a)
czipWithM :: forall m r c f g h.
(Applicative m, AllFields r c)
=> Proxy c
-> (forall x. c x => f x -> g x -> m (h x))
-> Record f r -> Record g r -> m (Record h r)
czipWithM :: forall {k} (m :: * -> *) (r :: Row k) (c :: k -> Constraint)
(f :: k -> *) (g :: k -> *) (h :: k -> *).
(Applicative m, AllFields r c) =>
Proxy c
-> (forall (x :: k). c x => f x -> g x -> m (h x))
-> Record f r
-> Record g r
-> m (Record h r)
czipWithM Proxy c
p forall (x :: k). c x => f x -> g x -> m (h x)
f Record f r
r Record g r
r' =
forall {k} (m :: * -> *) (f :: k -> *) (r :: Row k).
Applicative m =>
Record (m :.: f) r -> m (Record f r)
sequenceA forall a b. (a -> b) -> a -> b
$ forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
(forall (x :: k). f x -> g x) -> Record f r -> Record g r
map (forall {k} (f :: k -> *) (a :: k) (f' :: k -> *) (f'' :: k -> *).
(f a -> f' a -> f'' a) -> (-.->) f (f' -.-> f'') a
fn_2 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (x :: k). Dict c x -> f x -> g x -> (:.:) m h x
f') (forall k (r :: Row k) (c :: k -> Constraint)
(proxy :: (k -> Constraint) -> *).
AllFields r c =>
proxy c -> Record (Dict c) r
reifyAllFields Proxy c
p) forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
Record (f -.-> g) r -> Record f r -> Record g r
`ap` Record f r
r forall {k} (f :: k -> *) (g :: k -> *) (r :: Row k).
Record (f -.-> g) r -> Record f r -> Record g r
`ap` Record g r
r'
where
f' :: Dict c x -> f x -> g x -> (m :.: h) x
f' :: forall (x :: k). Dict c x -> f x -> g x -> (:.:) m h x
f' Dict c x
Dict f x
fx g x
gx = forall l k (f :: l -> *) (g :: k -> l) (p :: k).
f (g p) -> (:.:) f g p
Comp forall a b. (a -> b) -> a -> b
$ forall (x :: k). c x => f x -> g x -> m (h x)
f f x
fx g x
gx
czipWith ::
AllFields r c
=> Proxy c
-> (forall x. c x => f x -> g x -> h x)
-> Record f r -> Record g r -> Record h r
czipWith :: forall {k} (r :: Row k) (c :: k -> Constraint) (f :: k -> *)
(g :: k -> *) (h :: k -> *).
AllFields r c =>
Proxy c
-> (forall (x :: k). c x => f x -> g x -> h x)
-> Record f r
-> Record g r
-> Record h r
czipWith Proxy c
p forall (x :: k). c x => f x -> g x -> h x
f Record f r
a Record g r
b = forall a. I a -> a
unI forall a b. (a -> b) -> a -> b
$ forall {k} (m :: * -> *) (r :: Row k) (c :: k -> Constraint)
(f :: k -> *) (g :: k -> *) (h :: k -> *).
(Applicative m, AllFields r c) =>
Proxy c
-> (forall (x :: k). c x => f x -> g x -> m (h x))
-> Record f r
-> Record g r
-> m (Record h r)
czipWithM Proxy c
p (\f x
x g x
y -> forall a. a -> I a
I (forall (x :: k). c x => f x -> g x -> h x
f f x
x g x
y)) Record f r
a Record g r
b
letRecordT :: forall r f.
(forall r'. Let r' r => Proxy r' -> Record f r)
-> Record f r
letRecordT :: forall {k} (r :: Row k) (f :: k -> *).
(forall (r' :: Row k). Let r' r => Proxy r' -> Record f r)
-> Record f r
letRecordT forall (r' :: Row k). Let r' r => Proxy r' -> Record f r
f = forall {k} r (a :: k).
Proxy a -> (forall (b :: k). Let b a => Proxy b -> r) -> r
letT' (forall {k} (t :: k). Proxy t
Proxy @r) forall (r' :: Row k). Let r' r => Proxy r' -> Record f r
f
letInsertAs :: forall r r' f n a.
Proxy r
-> Field n
-> f a
-> Record f r'
-> (forall r''. Let r'' (n := a : r') => Record f r'' -> Record f r)
-> Record f r
letInsertAs :: forall {k} (r :: Row k) (r' :: Row k) (f :: k -> *) (n :: Symbol)
(a :: k).
Proxy r
-> Field n
-> f a
-> Record f r'
-> (forall (r'' :: Row k).
Let r'' ((n ':= a) : r') =>
Record f r'' -> Record f r)
-> Record f r
letInsertAs Proxy r
_ Field n
n f a
x Record f r'
r = forall {k} r (f :: k -> *) (a :: k).
f a -> (forall (b :: k). Let b a => f b -> r) -> r
letAs' (forall k (f :: k -> *) (r :: Row k) (a :: k) (n :: Symbol).
Field n -> f a -> Record f r -> Record f ((n ':= a) : r)
insert Field n
n f a
x Record f r'
r)