{-# language CPP #-}
{-# language DeriveAnyClass #-}
{-# language KindSignatures #-}
{-# language ConstraintKinds #-}
{-# language PatternSynonyms #-}
{-# language RankNTypes #-}
{-# language TemplateHaskell #-}
{-# options_ghc -Wno-missing-signatures #-}
{-# options_ghc -Wno-missing-pattern-synonym-signatures #-}
module Nix.Value
where
import Nix.Prelude
import Control.Comonad ( Comonad
, extract
)
import Control.Monad.Free ( Free(..)
, hoistFree
, iter
, iterM
)
import qualified Data.Aeson as Aeson
import Data.Functor.Classes ( Show1
, liftShowsPrec
, showsUnaryWith
, Eq1(liftEq) )
import qualified Text.Show
import Text.Show ( showsPrec
, showString
, showParen
)
import Lens.Family2.Stock ( _2 )
import Lens.Family2.TH ( makeTraversals
, makeLenses
)
import Nix.Atoms
import Nix.Expr.Types
import Nix.String
import Nix.Thunk
data NValueF p m r
= NVConstantF NAtom
| NVStrF NixString
| NVPathF Path
| NVListF [r]
| NVSetF PositionSet (AttrSet r)
| NVClosureF (Params ()) (p -> m r)
| NVBuiltinF VarName (p -> m r)
deriving (forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall p (m :: * -> *) r x. Rep (NValueF p m r) x -> NValueF p m r
forall p (m :: * -> *) r x. NValueF p m r -> Rep (NValueF p m r) x
$cto :: forall p (m :: * -> *) r x. Rep (NValueF p m r) x -> NValueF p m r
$cfrom :: forall p (m :: * -> *) r x. NValueF p m r -> Rep (NValueF p m r) x
Generic, Typeable, forall a b. a -> NValueF p m b -> NValueF p m a
forall a b. (a -> b) -> NValueF p m a -> NValueF p m b
forall p (m :: * -> *) a b.
Functor m =>
a -> NValueF p m b -> NValueF p m a
forall p (m :: * -> *) a b.
Functor m =>
(a -> b) -> NValueF p m a -> NValueF p m b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> NValueF p m b -> NValueF p m a
$c<$ :: forall p (m :: * -> *) a b.
Functor m =>
a -> NValueF p m b -> NValueF p m a
fmap :: forall a b. (a -> b) -> NValueF p m a -> NValueF p m b
$cfmap :: forall p (m :: * -> *) a b.
Functor m =>
(a -> b) -> NValueF p m a -> NValueF p m b
Functor)
instance Eq r => Eq (NValueF p m r) where
== :: NValueF p m r -> NValueF p m r -> Bool
(==) (NVConstantF NAtom
x) (NVConstantF NAtom
y) = NAtom
x forall a. Eq a => a -> a -> Bool
== NAtom
y
(==) (NVStrF NixString
x) (NVStrF NixString
y) = NixString
x forall a. Eq a => a -> a -> Bool
== NixString
y
(==) (NVPathF Path
x) (NVPathF Path
y) = Path
x forall a. Eq a => a -> a -> Bool
== Path
y
(==) (NVListF [r]
x) (NVListF [r]
y) = [r]
x forall a. Eq a => a -> a -> Bool
== [r]
y
(==) (NVSetF PositionSet
_ AttrSet r
x) (NVSetF PositionSet
_ AttrSet r
y) = AttrSet r
x forall a. Eq a => a -> a -> Bool
== AttrSet r
y
(==) NValueF p m r
_ NValueF p m r
_ = Bool
False
instance Eq1 (NValueF p m) where
liftEq :: forall a b.
(a -> b -> Bool) -> NValueF p m a -> NValueF p m b -> Bool
liftEq a -> b -> Bool
_ (NVConstantF NAtom
x) (NVConstantF NAtom
y) = NAtom
x forall a. Eq a => a -> a -> Bool
== NAtom
y
liftEq a -> b -> Bool
_ (NVStrF NixString
x) (NVStrF NixString
y) = NixString
x forall a. Eq a => a -> a -> Bool
== NixString
y
liftEq a -> b -> Bool
_ (NVPathF Path
x) (NVPathF Path
y) = Path
x forall a. Eq a => a -> a -> Bool
== Path
y
liftEq a -> b -> Bool
eq (NVListF [a]
x) (NVListF [b]
y) = forall (f :: * -> *) a b.
Eq1 f =>
(a -> b -> Bool) -> f a -> f b -> Bool
liftEq a -> b -> Bool
eq [a]
x [b]
y
liftEq a -> b -> Bool
eq (NVSetF PositionSet
_ AttrSet a
x) (NVSetF PositionSet
_ AttrSet b
y) = forall (f :: * -> *) a b.
Eq1 f =>
(a -> b -> Bool) -> f a -> f b -> Bool
liftEq a -> b -> Bool
eq AttrSet a
x AttrSet b
y
liftEq a -> b -> Bool
_ NValueF p m a
_ NValueF p m b
_ = Bool
False
instance Show r => Show (NValueF p m r) where
showsPrec :: Int -> NValueF p m r -> ShowS
showsPrec Int
d =
\case
(NVConstantF NAtom
atom ) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVConstant" NAtom
atom
(NVStrF NixString
ns ) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVStr" forall a b. (a -> b) -> a -> b
$ NixString -> Text
ignoreContext NixString
ns
(NVListF [r]
lst ) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVList" [r]
lst
(NVSetF PositionSet
_ AttrSet r
attrs) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVSet" AttrSet r
attrs
(NVClosureF Params ()
params p -> m r
_ ) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVClosure" Params ()
params
(NVPathF Path
path ) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVPath" Path
path
(NVBuiltinF VarName
name p -> m r
_ ) -> forall a. Show a => String -> a -> ShowS
showsCon1 String
"NVBuiltin" VarName
name
where
showsCon1 :: Show a => String -> a -> String -> String
showsCon1 :: forall a. Show a => String -> a -> ShowS
showsCon1 String
con a
a =
Bool -> ShowS -> ShowS
showParen (Int
d forall a. Ord a => a -> a -> Bool
> Int
10) forall a b. (a -> b) -> a -> b
$ String -> ShowS
showString (String
con forall a. Semigroup a => a -> a -> a
<> String
" ") forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. Show a => Int -> a -> ShowS
showsPrec Int
11 a
a
instance Foldable (NValueF p m) where
foldMap :: forall m a. Monoid m => (a -> m) -> NValueF p m a -> m
foldMap a -> m
f = \case
NVConstantF NAtom
_ -> forall a. Monoid a => a
mempty
NVStrF NixString
_ -> forall a. Monoid a => a
mempty
NVPathF Path
_ -> forall a. Monoid a => a
mempty
NVClosureF Params ()
_ p -> m a
_ -> forall a. Monoid a => a
mempty
NVBuiltinF VarName
_ p -> m a
_ -> forall a. Monoid a => a
mempty
NVListF [a]
l -> forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap a -> m
f [a]
l
NVSetF PositionSet
_ AttrSet a
s -> forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap a -> m
f AttrSet a
s
sequenceNValueF
:: (Functor n, Monad m, Applicative n)
=> (forall x . n x -> m x)
-> NValueF p m (n a)
-> n (NValueF p m a)
sequenceNValueF :: forall (n :: * -> *) (m :: * -> *) p a.
(Functor n, Monad m, Applicative n) =>
(forall x. n x -> m x) -> NValueF p m (n a) -> n (NValueF p m a)
sequenceNValueF forall x. n x -> m x
transform = \case
NVConstantF NAtom
a -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. NAtom -> NValueF p m r
NVConstantF NAtom
a
NVStrF NixString
s -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. NixString -> NValueF p m r
NVStrF NixString
s
NVPathF Path
p -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. Path -> NValueF p m r
NVPathF Path
p
NVListF [n a]
l -> forall p (m :: * -> *) r. [r] -> NValueF p m r
NVListF forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA [n a]
l
NVSetF PositionSet
p AttrSet (n a)
s -> forall p (m :: * -> *) r. PositionSet -> AttrSet r -> NValueF p m r
NVSetF PositionSet
p forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a.
(Traversable t, Applicative f) =>
t (f a) -> f (t a)
sequenceA AttrSet (n a)
s
NVClosureF Params ()
p p -> m (n a)
g -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. Params () -> (p -> m r) -> NValueF p m r
NVClosureF Params ()
p (forall x. n x -> m x
transform forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< p -> m (n a)
g)
NVBuiltinF VarName
s p -> m (n a)
g -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. VarName -> (p -> m r) -> NValueF p m r
NVBuiltinF VarName
s (forall x. n x -> m x
transform forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< p -> m (n a)
g)
bindNValueF
:: (Monad m, Monad n)
=> (forall x . n x -> m x)
-> (a -> n b)
-> NValueF p m a
-> n (NValueF p m b)
bindNValueF :: forall (m :: * -> *) (n :: * -> *) a b p.
(Monad m, Monad n) =>
(forall x. n x -> m x)
-> (a -> n b) -> NValueF p m a -> n (NValueF p m b)
bindNValueF forall x. n x -> m x
transform a -> n b
f = \case
NVConstantF NAtom
a -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. NAtom -> NValueF p m r
NVConstantF NAtom
a
NVStrF NixString
s -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. NixString -> NValueF p m r
NVStrF NixString
s
NVPathF Path
p -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. Path -> NValueF p m r
NVPathF Path
p
NVListF [a]
l -> forall p (m :: * -> *) r. [r] -> NValueF p m r
NVListF forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> n b
f [a]
l
NVSetF PositionSet
p AttrSet a
s -> forall p (m :: * -> *) r. PositionSet -> AttrSet r -> NValueF p m r
NVSetF PositionSet
p forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse a -> n b
f AttrSet a
s
NVClosureF Params ()
p p -> m a
g -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. Params () -> (p -> m r) -> NValueF p m r
NVClosureF Params ()
p (forall x. n x -> m x
transform forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> n b
f forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< p -> m a
g)
NVBuiltinF VarName
s p -> m a
g -> forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. VarName -> (p -> m r) -> NValueF p m r
NVBuiltinF VarName
s (forall x. n x -> m x
transform forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> n b
f forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< p -> m a
g)
liftNValueF
:: (MonadTrans u, Monad m)
=> NValueF p m a
-> NValueF p (u m) a
liftNValueF :: forall (u :: (* -> *) -> * -> *) (m :: * -> *) p a.
(MonadTrans u, Monad m) =>
NValueF p m a -> NValueF p (u m) a
liftNValueF = forall (m :: * -> *) (n :: * -> *) p a.
(forall x. m x -> n x) -> NValueF p m a -> NValueF p n a
hoistNValueF forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift
unliftNValueF
:: (MonadTrans u, Monad m)
=> (forall x . u m x -> m x)
-> NValueF p (u m) a
-> NValueF p m a
unliftNValueF :: forall (u :: (* -> *) -> * -> *) (m :: * -> *) p a.
(MonadTrans u, Monad m) =>
(forall x. u m x -> m x) -> NValueF p (u m) a -> NValueF p m a
unliftNValueF = forall (m :: * -> *) (n :: * -> *) p a.
(forall x. m x -> n x) -> NValueF p m a -> NValueF p n a
hoistNValueF
hoistNValueF
:: (forall x . m x -> n x)
-> NValueF p m a
-> NValueF p n a
hoistNValueF :: forall (m :: * -> *) (n :: * -> *) p a.
(forall x. m x -> n x) -> NValueF p m a -> NValueF p n a
hoistNValueF forall x. m x -> n x
lft =
\case
NVConstantF NAtom
a -> forall p (m :: * -> *) r. NAtom -> NValueF p m r
NVConstantF NAtom
a
NVStrF NixString
s -> forall p (m :: * -> *) r. NixString -> NValueF p m r
NVStrF NixString
s
NVPathF Path
p -> forall p (m :: * -> *) r. Path -> NValueF p m r
NVPathF Path
p
NVListF [a]
l -> forall p (m :: * -> *) r. [r] -> NValueF p m r
NVListF [a]
l
NVSetF PositionSet
p AttrSet a
s -> forall p (m :: * -> *) r. PositionSet -> AttrSet r -> NValueF p m r
NVSetF PositionSet
p AttrSet a
s
NVBuiltinF VarName
s p -> m a
g -> forall p (m :: * -> *) r. VarName -> (p -> m r) -> NValueF p m r
NVBuiltinF VarName
s (forall x. m x -> n x
lft forall b c a. (b -> c) -> (a -> b) -> a -> c
. p -> m a
g)
NVClosureF Params ()
p p -> m a
g -> forall p (m :: * -> *) r. Params () -> (p -> m r) -> NValueF p m r
NVClosureF Params ()
p (forall x. m x -> n x
lft forall b c a. (b -> c) -> (a -> b) -> a -> c
. p -> m a
g)
{-# inline hoistNValueF #-}
type NVConstraint f = (Comonad f, Applicative f)
newtype NValue' t f m a =
NValue'
{
forall t (f :: * -> *) (m :: * -> *) a.
NValue' t f m a -> f (NValueF (NValue t f m) m a)
_nValue :: f (NValueF (NValue t f m) m a)
}
deriving (forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall t (f :: * -> *) (m :: * -> *) a x.
Rep (NValue' t f m a) x -> NValue' t f m a
forall t (f :: * -> *) (m :: * -> *) a x.
NValue' t f m a -> Rep (NValue' t f m a) x
$cto :: forall t (f :: * -> *) (m :: * -> *) a x.
Rep (NValue' t f m a) x -> NValue' t f m a
$cfrom :: forall t (f :: * -> *) (m :: * -> *) a x.
NValue' t f m a -> Rep (NValue' t f m a) x
Generic, Typeable, forall a b. a -> NValue' t f m b -> NValue' t f m a
forall a b. (a -> b) -> NValue' t f m a -> NValue' t f m b
forall t (f :: * -> *) (m :: * -> *) a b.
(Functor f, Functor m) =>
a -> NValue' t f m b -> NValue' t f m a
forall t (f :: * -> *) (m :: * -> *) a b.
(Functor f, Functor m) =>
(a -> b) -> NValue' t f m a -> NValue' t f m b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> NValue' t f m b -> NValue' t f m a
$c<$ :: forall t (f :: * -> *) (m :: * -> *) a b.
(Functor f, Functor m) =>
a -> NValue' t f m b -> NValue' t f m a
fmap :: forall a b. (a -> b) -> NValue' t f m a -> NValue' t f m b
$cfmap :: forall t (f :: * -> *) (m :: * -> *) a b.
(Functor f, Functor m) =>
(a -> b) -> NValue' t f m a -> NValue' t f m b
Functor, forall a. NValue' t f m a -> Bool
forall m a. Monoid m => (a -> m) -> NValue' t f m a -> m
forall a b. (a -> b -> b) -> b -> NValue' t f m a -> b
forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Eq a) =>
a -> NValue' t f m a -> Bool
forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Num a) =>
NValue' t f m a -> a
forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Ord a) =>
NValue' t f m a -> a
forall t (f :: * -> *) (m :: * -> *) m.
(Foldable f, Monoid m) =>
NValue' t f m m -> m
forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
NValue' t f m a -> Bool
forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
NValue' t f m a -> Int
forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
NValue' t f m a -> [a]
forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
(a -> a -> a) -> NValue' t f m a -> a
forall t (f :: * -> *) (m :: * -> *) m a.
(Foldable f, Monoid m) =>
(a -> m) -> NValue' t f m a -> m
forall t (f :: * -> *) (m :: * -> *) b a.
Foldable f =>
(b -> a -> b) -> b -> NValue' t f m a -> b
forall t (f :: * -> *) (m :: * -> *) a b.
Foldable f =>
(a -> b -> b) -> b -> NValue' t f m a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => NValue' t f m a -> a
$cproduct :: forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Num a) =>
NValue' t f m a -> a
sum :: forall a. Num a => NValue' t f m a -> a
$csum :: forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Num a) =>
NValue' t f m a -> a
minimum :: forall a. Ord a => NValue' t f m a -> a
$cminimum :: forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Ord a) =>
NValue' t f m a -> a
maximum :: forall a. Ord a => NValue' t f m a -> a
$cmaximum :: forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Ord a) =>
NValue' t f m a -> a
elem :: forall a. Eq a => a -> NValue' t f m a -> Bool
$celem :: forall t (f :: * -> *) (m :: * -> *) a.
(Foldable f, Eq a) =>
a -> NValue' t f m a -> Bool
length :: forall a. NValue' t f m a -> Int
$clength :: forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
NValue' t f m a -> Int
null :: forall a. NValue' t f m a -> Bool
$cnull :: forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
NValue' t f m a -> Bool
toList :: forall a. NValue' t f m a -> [a]
$ctoList :: forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
NValue' t f m a -> [a]
foldl1 :: forall a. (a -> a -> a) -> NValue' t f m a -> a
$cfoldl1 :: forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
(a -> a -> a) -> NValue' t f m a -> a
foldr1 :: forall a. (a -> a -> a) -> NValue' t f m a -> a
$cfoldr1 :: forall t (f :: * -> *) (m :: * -> *) a.
Foldable f =>
(a -> a -> a) -> NValue' t f m a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> NValue' t f m a -> b
$cfoldl' :: forall t (f :: * -> *) (m :: * -> *) b a.
Foldable f =>
(b -> a -> b) -> b -> NValue' t f m a -> b
foldl :: forall b a. (b -> a -> b) -> b -> NValue' t f m a -> b
$cfoldl :: forall t (f :: * -> *) (m :: * -> *) b a.
Foldable f =>
(b -> a -> b) -> b -> NValue' t f m a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> NValue' t f m a -> b
$cfoldr' :: forall t (f :: * -> *) (m :: * -> *) a b.
Foldable f =>
(a -> b -> b) -> b -> NValue' t f m a -> b
foldr :: forall a b. (a -> b -> b) -> b -> NValue' t f m a -> b
$cfoldr :: forall t (f :: * -> *) (m :: * -> *) a b.
Foldable f =>
(a -> b -> b) -> b -> NValue' t f m a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> NValue' t f m a -> m
$cfoldMap' :: forall t (f :: * -> *) (m :: * -> *) m a.
(Foldable f, Monoid m) =>
(a -> m) -> NValue' t f m a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> NValue' t f m a -> m
$cfoldMap :: forall t (f :: * -> *) (m :: * -> *) m a.
(Foldable f, Monoid m) =>
(a -> m) -> NValue' t f m a -> m
fold :: forall m. Monoid m => NValue' t f m m -> m
$cfold :: forall t (f :: * -> *) (m :: * -> *) m.
(Foldable f, Monoid m) =>
NValue' t f m m -> m
Foldable)
instance (NVConstraint f, Show a) => Show (NValue' t f m a) where
show :: NValue' t f m a -> String
show (NValue' (forall (w :: * -> *) a. Comonad w => w a -> a
extract -> NValueF (NValue t f m) m a
v)) = forall b a. (Show a, IsString b) => a -> b
show NValueF (NValue t f m) m a
v
instance NVConstraint f => Show1 (NValue' t f m) where
liftShowsPrec :: forall a.
(Int -> a -> ShowS)
-> ([a] -> ShowS) -> Int -> NValue' t f m a -> ShowS
liftShowsPrec Int -> a -> ShowS
sp [a] -> ShowS
sl Int
p = \case
NVConstant' NAtom
atom -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith forall a. Show a => Int -> a -> ShowS
showsPrec String
"NVConstantF" Int
p NAtom
atom
NVStr' NixString
ns -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith forall a. Show a => Int -> a -> ShowS
showsPrec String
"NVStrF" Int
p forall a b. (a -> b) -> a -> b
$ NixString -> Text
ignoreContext NixString
ns
NVList' [a]
lst -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith (forall (f :: * -> *) a.
Show1 f =>
(Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> f a -> ShowS
liftShowsPrec Int -> a -> ShowS
sp [a] -> ShowS
sl) String
"NVListF" Int
p [a]
lst
NVSet' PositionSet
_ AttrSet a
attrs -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith (forall (f :: * -> *) a.
Show1 f =>
(Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> f a -> ShowS
liftShowsPrec Int -> a -> ShowS
sp [a] -> ShowS
sl) String
"NVSetF" Int
p AttrSet a
attrs
NVPath' Path
path -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith forall a. Show a => Int -> a -> ShowS
showsPrec String
"NVPathF" Int
p Path
path
NVClosure' Params ()
c NValue t f m -> m a
_ -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith forall a. Show a => Int -> a -> ShowS
showsPrec String
"NVClosureF" Int
p Params ()
c
NVBuiltin' VarName
name NValue t f m -> m a
_ -> forall a. (Int -> a -> ShowS) -> String -> Int -> a -> ShowS
showsUnaryWith forall a. Show a => Int -> a -> ShowS
showsPrec String
"NVBuiltinF" Int
p VarName
name
sequenceNValue'
:: (Functor n, Traversable f, Monad m, Applicative n)
=> (forall x . n x -> m x)
-> NValue' t f m (n a)
-> n (NValue' t f m a)
sequenceNValue' :: forall (n :: * -> *) (f :: * -> *) (m :: * -> *) t a.
(Functor n, Traversable f, Monad m, Applicative n) =>
(forall x. n x -> m x)
-> NValue' t f m (n a) -> n (NValue' t f m a)
sequenceNValue' forall x. n x -> m x
transform (NValue' f (NValueF (NValue t f m) m (n a))
v) =
forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse (forall (n :: * -> *) (m :: * -> *) p a.
(Functor n, Monad m, Applicative n) =>
(forall x. n x -> m x) -> NValueF p m (n a) -> n (NValueF p m a)
sequenceNValueF forall x. n x -> m x
transform) f (NValueF (NValue t f m) m (n a))
v
lmapNValueF :: Functor m => (b -> a) -> NValueF a m r -> NValueF b m r
lmapNValueF :: forall (m :: * -> *) b a r.
Functor m =>
(b -> a) -> NValueF a m r -> NValueF b m r
lmapNValueF b -> a
f = \case
NVConstantF NAtom
a -> forall p (m :: * -> *) r. NAtom -> NValueF p m r
NVConstantF NAtom
a
NVStrF NixString
s -> forall p (m :: * -> *) r. NixString -> NValueF p m r
NVStrF NixString
s
NVPathF Path
p -> forall p (m :: * -> *) r. Path -> NValueF p m r
NVPathF Path
p
NVListF [r]
l -> forall p (m :: * -> *) r. [r] -> NValueF p m r
NVListF [r]
l
NVSetF PositionSet
p AttrSet r
s -> forall p (m :: * -> *) r. PositionSet -> AttrSet r -> NValueF p m r
NVSetF PositionSet
p AttrSet r
s
NVClosureF Params ()
p a -> m r
g -> forall p (m :: * -> *) r. Params () -> (p -> m r) -> NValueF p m r
NVClosureF Params ()
p (a -> m r
g forall b c a. (b -> c) -> (a -> b) -> a -> c
. b -> a
f)
NVBuiltinF VarName
s a -> m r
g -> forall p (m :: * -> *) r. VarName -> (p -> m r) -> NValueF p m r
NVBuiltinF VarName
s (a -> m r
g forall b c a. (b -> c) -> (a -> b) -> a -> c
. b -> a
f)
iterNValue'
:: forall t f m a r
. MonadDataContext f m
=> ((NValue' t f m a -> r) -> a -> r)
-> (NValue' t f m r -> r)
-> NValue' t f m a
-> r
iterNValue' :: forall t (f :: * -> *) (m :: * -> *) a r.
MonadDataContext f m =>
((NValue' t f m a -> r) -> a -> r)
-> (NValue' t f m r -> r) -> NValue' t f m a -> r
iterNValue' (NValue' t f m a -> r) -> a -> r
k NValue' t f m r -> r
f = forall a. (a -> a) -> a
fix ((NValue' t f m r -> r
f forall b c a. (b -> c) -> (a -> b) -> a -> c
.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. (NValue' t f m a -> r) -> a -> r
k)
hoistNValue'
:: (Functor m, Functor n, Functor f)
=> (forall x . n x -> m x)
-> (forall x . m x -> n x)
-> NValue' t f m a
-> NValue' t f n a
hoistNValue' :: forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t a.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue' t f m a -> NValue' t f n a
hoistNValue' forall x. n x -> m x
run forall x. m x -> n x
lft (NValue' f (NValueF (NValue t f m) m a)
v) =
forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall a b. (a -> b) -> a -> b
$ forall (m :: * -> *) b a r.
Functor m =>
(b -> a) -> NValueF a m r -> NValueF b m r
lmapNValueF (forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue t f m -> NValue t f n
hoistNValue forall x. m x -> n x
lft forall x. n x -> m x
run) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (m :: * -> *) (n :: * -> *) p a.
(forall x. m x -> n x) -> NValueF p m a -> NValueF p n a
hoistNValueF forall x. m x -> n x
lft forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> f (NValueF (NValue t f m) m a)
v
{-# inline hoistNValue' #-}
bindNValue'
:: (Traversable f, Monad m, Monad n)
=> (forall x . n x -> m x)
-> (a -> n b)
-> NValue' t f m a
-> n (NValue' t f m b)
bindNValue' :: forall (f :: * -> *) (m :: * -> *) (n :: * -> *) a b t.
(Traversable f, Monad m, Monad n) =>
(forall x. n x -> m x)
-> (a -> n b) -> NValue' t f m a -> n (NValue' t f m b)
bindNValue' forall x. n x -> m x
transform a -> n b
f (NValue' f (NValueF (NValue t f m) m a)
v) =
forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse (forall (m :: * -> *) (n :: * -> *) a b p.
(Monad m, Monad n) =>
(forall x. n x -> m x)
-> (a -> n b) -> NValueF p m a -> n (NValueF p m b)
bindNValueF forall x. n x -> m x
transform a -> n b
f) f (NValueF (NValue t f m) m a)
v
liftNValue'
:: (MonadTrans u, Monad m, Functor (u m), Functor f)
=> (forall x . u m x -> m x)
-> NValue' t f m a
-> NValue' t f (u m) a
liftNValue' :: forall (u :: (* -> *) -> * -> *) (m :: * -> *) (f :: * -> *) t a.
(MonadTrans u, Monad m, Functor (u m), Functor f) =>
(forall x. u m x -> m x) -> NValue' t f m a -> NValue' t f (u m) a
liftNValue' forall x. u m x -> m x
run = forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t a.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue' t f m a -> NValue' t f n a
hoistNValue' forall x. u m x -> m x
run forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift
unliftNValue'
:: (MonadTrans u, Monad m, Functor (u m), Functor f)
=> (forall x . u m x -> m x)
-> NValue' t f (u m) a
-> NValue' t f m a
unliftNValue' :: forall (u :: (* -> *) -> * -> *) (m :: * -> *) (f :: * -> *) t a.
(MonadTrans u, Monad m, Functor (u m), Functor f) =>
(forall x. u m x -> m x) -> NValue' t f (u m) a -> NValue' t f m a
unliftNValue' = forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t a.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue' t f m a -> NValue' t f n a
hoistNValue' forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift
pattern NVNull' :: NVConstraint w => NValue' t w m a
pattern $bNVNull' :: forall (w :: * -> *) t (m :: * -> *) a.
NVConstraint w =>
NValue' t w m a
$mNVNull' :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
NVConstraint w =>
NValue' t w m a -> ((# #) -> r) -> ((# #) -> r) -> r
NVNull' = NVConstant' NNull
pattern NVConstant' :: NVConstraint w => NAtom -> NValue' t w m a
pattern $bNVConstant' :: forall (w :: * -> *) t (m :: * -> *) a.
NVConstraint w =>
NAtom -> NValue' t w m a
$mNVConstant' :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
NVConstraint w =>
NValue' t w m a -> (NAtom -> r) -> ((# #) -> r) -> r
NVConstant' x <- NValue' (extract -> NVConstantF x)
where NVConstant' = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a. Applicative f => a -> f a
pure forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall p (m :: * -> *) r. NAtom -> NValueF p m r
NVConstantF
pattern NVStr' :: NVConstraint w => NixString -> NValue' t w m a
pattern $bNVStr' :: forall (w :: * -> *) t (m :: * -> *) a.
NVConstraint w =>
NixString -> NValue' t w m a
$mNVStr' :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
NVConstraint w =>
NValue' t w m a -> (NixString -> r) -> ((# #) -> r) -> r
NVStr' ns <- NValue' (extract -> NVStrF ns)
where NVStr' = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a. Applicative f => a -> f a
pure forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall p (m :: * -> *) r. NixString -> NValueF p m r
NVStrF
pattern NVPath' :: NVConstraint w => Path -> NValue' t w m a
pattern $bNVPath' :: forall (w :: * -> *) t (m :: * -> *) a.
NVConstraint w =>
Path -> NValue' t w m a
$mNVPath' :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
NVConstraint w =>
NValue' t w m a -> (Path -> r) -> ((# #) -> r) -> r
NVPath' x <- NValue' (extract -> NVPathF x)
where NVPath' = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a. Applicative f => a -> f a
pure forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall p (m :: * -> *) r. Path -> NValueF p m r
NVPathF forall b c a. (b -> c) -> (a -> b) -> a -> c
. coerce :: forall a b. Coercible a b => a -> b
coerce
pattern NVList' :: NVConstraint w => [a] -> NValue' t w m a
pattern $bNVList' :: forall (w :: * -> *) a t (m :: * -> *).
NVConstraint w =>
[a] -> NValue' t w m a
$mNVList' :: forall {r} {w :: * -> *} {a} {t} {m :: * -> *}.
NVConstraint w =>
NValue' t w m a -> ([a] -> r) -> ((# #) -> r) -> r
NVList' l <- NValue' (extract -> NVListF l)
where NVList' = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a. Applicative f => a -> f a
pure forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall p (m :: * -> *) r. [r] -> NValueF p m r
NVListF
pattern NVSet' :: NVConstraint w => PositionSet -> AttrSet a -> NValue' t w m a
pattern $bNVSet' :: forall (w :: * -> *) a t (m :: * -> *).
NVConstraint w =>
PositionSet -> AttrSet a -> NValue' t w m a
$mNVSet' :: forall {r} {w :: * -> *} {a} {t} {m :: * -> *}.
NVConstraint w =>
NValue' t w m a
-> (PositionSet -> AttrSet a -> r) -> ((# #) -> r) -> r
NVSet' p s <- NValue' (extract -> NVSetF p s)
where NVSet' PositionSet
p AttrSet a
s = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall a b. (a -> b) -> a -> b
$ forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. PositionSet -> AttrSet r -> NValueF p m r
NVSetF PositionSet
p AttrSet a
s
pattern NVClosure' :: NVConstraint w => Params () -> (NValue t w m -> m a) -> NValue' t w m a
pattern $bNVClosure' :: forall (w :: * -> *) t (m :: * -> *) a.
NVConstraint w =>
Params () -> (NValue t w m -> m a) -> NValue' t w m a
$mNVClosure' :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
NVConstraint w =>
NValue' t w m a
-> (Params () -> (NValue t w m -> m a) -> r) -> ((# #) -> r) -> r
NVClosure' x f <- NValue' (extract -> NVClosureF x f)
where NVClosure' Params ()
x NValue t w m -> m a
f = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall a b. (a -> b) -> a -> b
$ forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. Params () -> (p -> m r) -> NValueF p m r
NVClosureF Params ()
x NValue t w m -> m a
f
pattern NVBuiltin' :: NVConstraint w => VarName -> (NValue t w m -> m a) -> NValue' t w m a
pattern $bNVBuiltin' :: forall (w :: * -> *) t (m :: * -> *) a.
NVConstraint w =>
VarName -> (NValue t w m -> m a) -> NValue' t w m a
$mNVBuiltin' :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
NVConstraint w =>
NValue' t w m a
-> (VarName -> (NValue t w m -> m a) -> r) -> ((# #) -> r) -> r
NVBuiltin' name f <- NValue' (extract -> NVBuiltinF name f)
where NVBuiltin' VarName
name NValue t w m -> m a
f = forall t (f :: * -> *) (m :: * -> *) a.
f (NValueF (NValue t f m) m a) -> NValue' t f m a
NValue' forall a b. (a -> b) -> a -> b
$ forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ forall p (m :: * -> *) r. VarName -> (p -> m r) -> NValueF p m r
NVBuiltinF VarName
name NValue t w m -> m a
f
{-# complete NVConstant', NVStr', NVPath', NVList', NVSet', NVClosure', NVBuiltin' #-}
type NValue t f m = Free (NValue' t f m) t
iterNValue
:: forall t f m r
. MonadDataContext f m
=> ((NValue t f m -> r) -> t -> r)
-> (NValue' t f m r -> r)
-> NValue t f m
-> r
iterNValue :: forall t (f :: * -> *) (m :: * -> *) r.
MonadDataContext f m =>
((NValue t f m -> r) -> t -> r)
-> (NValue' t f m r -> r) -> NValue t f m -> r
iterNValue (NValue t f m -> r) -> t -> r
k NValue' t f m r -> r
f = forall a. (a -> a) -> a
fix ((forall (f :: * -> *) a. Functor f => (f a -> a) -> Free f a -> a
iter NValue' t f m r -> r
f forall b c a. (b -> c) -> (a -> b) -> a -> c
.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. (NValue t f m -> r) -> t -> r
k)
iterNValueByDiscardWith
:: MonadDataContext f m
=> r
-> (NValue' t f m r -> r)
-> NValue t f m
-> r
iterNValueByDiscardWith :: forall (f :: * -> *) (m :: * -> *) r t.
MonadDataContext f m =>
r -> (NValue' t f m r -> r) -> NValue t f m -> r
iterNValueByDiscardWith = forall t (f :: * -> *) (m :: * -> *) r.
MonadDataContext f m =>
((NValue t f m -> r) -> t -> r)
-> (NValue' t f m r -> r) -> NValue t f m -> r
iterNValue forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. a -> b -> a
const forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. a -> b -> a
const
iterNValueM
:: (MonadDataContext f m, Monad n)
=> (forall x . n x -> m x)
-> ((NValue t f m -> n r) -> t -> n r)
-> (NValue' t f m (n r) -> n r)
-> NValue t f m
-> n r
iterNValueM :: forall (f :: * -> *) (m :: * -> *) (n :: * -> *) t r.
(MonadDataContext f m, Monad n) =>
(forall x. n x -> m x)
-> ((NValue t f m -> n r) -> t -> n r)
-> (NValue' t f m (n r) -> n r)
-> NValue t f m
-> n r
iterNValueM forall x. n x -> m x
transform (NValue t f m -> n r) -> t -> n r
k NValue' t f m (n r) -> n r
f = forall a. (a -> a) -> a
fix (((forall (m :: * -> *) (f :: * -> *) a.
(Monad m, Functor f) =>
(f (m a) -> m a) -> Free f a -> m a
iterM NValue' t f m (n r) -> n r
f forall (m :: * -> *) b c a.
Monad m =>
(b -> m c) -> (a -> m b) -> a -> m c
<=< forall {f :: * -> *} {t} {a}.
Traversable f =>
Free (NValue' t f m) (n a) -> n (Free (NValue' t f m) a)
go) forall b c a. (b -> c) -> (a -> b) -> a -> c
.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap forall b c a. (b -> c) -> (a -> b) -> a -> c
. (NValue t f m -> n r) -> t -> n r
k)
where
go :: Free (NValue' t f m) (n a) -> n (Free (NValue' t f m) a)
go (Pure n a
x) = forall (f :: * -> *) a. a -> Free f a
Pure forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> n a
x
go (Free NValue' t f m (Free (NValue' t f m) (n a))
fa) = forall (f :: * -> *) a. f (Free f a) -> Free f a
Free forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (f :: * -> *) (m :: * -> *) (n :: * -> *) a b t.
(Traversable f, Monad m, Monad n) =>
(forall x. n x -> m x)
-> (a -> n b) -> NValue' t f m a -> n (NValue' t f m b)
bindNValue' forall x. n x -> m x
transform Free (NValue' t f m) (n a) -> n (Free (NValue' t f m) a)
go NValue' t f m (Free (NValue' t f m) (n a))
fa
hoistNValue
:: (Functor m, Functor n, Functor f)
=> (forall x . n x -> m x)
-> (forall x . m x -> n x)
-> NValue t f m
-> NValue t f n
hoistNValue :: forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue t f m -> NValue t f n
hoistNValue forall x. n x -> m x
run forall x. m x -> n x
lft = forall (g :: * -> *) (f :: * -> *) b.
Functor g =>
(forall a. f a -> g a) -> Free f b -> Free g b
hoistFree forall a b. (a -> b) -> a -> b
$ forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t a.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue' t f m a -> NValue' t f n a
hoistNValue' forall x. n x -> m x
run forall x. m x -> n x
lft
{-# inline hoistNValue #-}
liftNValue
:: (MonadTrans u, Monad m, Functor (u m), Functor f)
=> (forall x . u m x -> m x)
-> NValue t f m
-> NValue t f (u m)
liftNValue :: forall (u :: (* -> *) -> * -> *) (m :: * -> *) (f :: * -> *) t.
(MonadTrans u, Monad m, Functor (u m), Functor f) =>
(forall x. u m x -> m x) -> NValue t f m -> NValue t f (u m)
liftNValue forall x. u m x -> m x
f = forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue t f m -> NValue t f n
hoistNValue forall x. u m x -> m x
f forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift
unliftNValue
:: (MonadTrans u, Monad m, Functor (u m), Functor f)
=> (forall x . u m x -> m x)
-> NValue t f (u m)
-> NValue t f m
unliftNValue :: forall (u :: (* -> *) -> * -> *) (m :: * -> *) (f :: * -> *) t.
(MonadTrans u, Monad m, Functor (u m), Functor f) =>
(forall x. u m x -> m x) -> NValue t f (u m) -> NValue t f m
unliftNValue = forall (m :: * -> *) (n :: * -> *) (f :: * -> *) t.
(Functor m, Functor n, Functor f) =>
(forall x. n x -> m x)
-> (forall x. m x -> n x) -> NValue t f m -> NValue t f n
hoistNValue forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift
mkNVStrWithoutContext :: NVConstraint f
=> Text
-> NValue t f m
mkNVStrWithoutContext :: forall (f :: * -> *) t (m :: * -> *).
NVConstraint f =>
Text -> NValue t f m
mkNVStrWithoutContext = forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
NixString -> Free (NValue' t w m) a
NVStr forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> NixString
mkNixStringWithoutContext
builtin
:: forall m f t
. (MonadThunk t m (NValue t f m), MonadDataContext f m)
=> VarName
-> ( NValue t f m
-> m (NValue t f m)
)
-> m (NValue t f m)
builtin :: forall (m :: * -> *) (f :: * -> *) t.
(MonadThunk t m (NValue t f m), MonadDataContext f m) =>
VarName -> (NValue t f m -> m (NValue t f m)) -> m (NValue t f m)
builtin = (forall (f :: * -> *) a. Applicative f => a -> f a
pure forall b c a. (b -> c) -> (a -> b) -> a -> c
.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
VarName
-> (NValue t w m -> m (Free (NValue' t w m) a))
-> Free (NValue' t w m) a
NVBuiltin
builtin2
:: (MonadThunk t m (NValue t f m), MonadDataContext f m)
=> VarName
-> ( NValue t f m
-> NValue t f m
-> m (NValue t f m)
)
-> m (NValue t f m)
builtin2 :: forall t (m :: * -> *) (f :: * -> *).
(MonadThunk t m (NValue t f m), MonadDataContext f m) =>
VarName
-> (NValue t f m -> NValue t f m -> m (NValue t f m))
-> m (NValue t f m)
builtin2 = (forall b c a. (b -> c) -> (a -> b) -> a -> c
(.) forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> forall b c a. (b -> c) -> (a -> b) -> a -> c
(.)) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (m :: * -> *) (f :: * -> *) t.
(MonadThunk t m (NValue t f m), MonadDataContext f m) =>
VarName -> (NValue t f m -> m (NValue t f m)) -> m (NValue t f m)
builtin
builtin3
:: (MonadThunk t m (NValue t f m), MonadDataContext f m)
=> VarName
-> ( NValue t f m
-> NValue t f m
-> NValue t f m
-> m (NValue t f m)
)
-> m (NValue t f m)
builtin3 :: forall t (m :: * -> *) (f :: * -> *).
(MonadThunk t m (NValue t f m), MonadDataContext f m) =>
VarName
-> (NValue t f m
-> NValue t f m -> NValue t f m -> m (NValue t f m))
-> m (NValue t f m)
builtin3 =
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 forall b c a. (b -> c) -> (a -> b) -> a -> c
(.)
forall (m :: * -> *) (f :: * -> *) t.
(MonadThunk t m (NValue t f m), MonadDataContext f m) =>
VarName -> (NValue t f m -> m (NValue t f m)) -> m (NValue t f m)
builtin
(forall b c a. (b -> c) -> (a -> b) -> a -> c
(.) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall t (m :: * -> *) (f :: * -> *).
(MonadThunk t m (NValue t f m), MonadDataContext f m) =>
VarName
-> (NValue t f m -> NValue t f m -> m (NValue t f m))
-> m (NValue t f m)
builtin2)
pattern $bNVNull :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a
$mNVNull :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a -> ((# #) -> r) -> ((# #) -> r) -> r
NVNull = Free NVNull'
pattern $bNVThunk :: forall (f :: * -> *) a. a -> Free f a
$mNVThunk :: forall {r} {f :: * -> *} {a}.
Free f a -> (a -> r) -> ((# #) -> r) -> r
NVThunk t = Pure t
pattern $bNVValue :: forall (f :: * -> *) a. f (Free f a) -> Free f a
$mNVValue :: forall {r} {f :: * -> *} {a}.
Free f a -> (f (Free f a) -> r) -> ((# #) -> r) -> r
NVValue v = Free v
{-# complete NVThunk, NVValue, NVNull #-}
pattern $bNVConstant :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
NAtom -> Free (NValue' t w m) a
$mNVConstant :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a -> (NAtom -> r) -> ((# #) -> r) -> r
NVConstant x = Free (NVConstant' x)
pattern $bNVStr :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
NixString -> Free (NValue' t w m) a
$mNVStr :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a -> (NixString -> r) -> ((# #) -> r) -> r
NVStr ns = Free (NVStr' ns)
pattern $bNVPath :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Path -> Free (NValue' t w m) a
$mNVPath :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a -> (Path -> r) -> ((# #) -> r) -> r
NVPath x = Free (NVPath' x)
pattern $bNVList :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
[Free (NValue' t w m) a] -> Free (NValue' t w m) a
$mNVList :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a
-> ([Free (NValue' t w m) a] -> r) -> ((# #) -> r) -> r
NVList l = Free (NVList' l)
pattern $bNVSet :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
PositionSet
-> AttrSet (Free (NValue' t w m) a) -> Free (NValue' t w m) a
$mNVSet :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a
-> (PositionSet -> AttrSet (Free (NValue' t w m) a) -> r)
-> ((# #) -> r)
-> r
NVSet s x = Free (NVSet' s x)
pattern $bNVBuiltin :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
VarName
-> (NValue t w m -> m (Free (NValue' t w m) a))
-> Free (NValue' t w m) a
$mNVBuiltin :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a
-> (VarName -> (NValue t w m -> m (Free (NValue' t w m) a)) -> r)
-> ((# #) -> r)
-> r
NVBuiltin name f = Free (NVBuiltin' name f)
pattern $bNVClosure :: forall {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Params ()
-> (NValue t w m -> m (Free (NValue' t w m) a))
-> Free (NValue' t w m) a
$mNVClosure :: forall {r} {w :: * -> *} {t} {m :: * -> *} {a}.
(Comonad w, Applicative w) =>
Free (NValue' t w m) a
-> (Params () -> (NValue t w m -> m (Free (NValue' t w m) a)) -> r)
-> ((# #) -> r)
-> r
NVClosure x f = Free (NVClosure' x f)
{-# complete NVThunk, NVConstant, NVStr, NVPath, NVList, NVSet, NVClosure, NVBuiltin #-}
data TStringContext = NoContext | HasContext
deriving Int -> TStringContext -> ShowS
[TStringContext] -> ShowS
TStringContext -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [TStringContext] -> ShowS
$cshowList :: [TStringContext] -> ShowS
show :: TStringContext -> String
$cshow :: TStringContext -> String
showsPrec :: Int -> TStringContext -> ShowS
$cshowsPrec :: Int -> TStringContext -> ShowS
Show
instance Semigroup TStringContext where
<> :: TStringContext -> TStringContext -> TStringContext
(<>) TStringContext
NoContext TStringContext
NoContext = TStringContext
NoContext
(<>) TStringContext
_ TStringContext
_ = TStringContext
HasContext
instance Monoid TStringContext where
mempty :: TStringContext
mempty = TStringContext
NoContext
data ValueType
= TInt
| TFloat
| TBool
| TNull
| TString TStringContext
| TList
| TSet
| TClosure
| TPath
| TBuiltin
deriving Int -> ValueType -> ShowS
[ValueType] -> ShowS
ValueType -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ValueType] -> ShowS
$cshowList :: [ValueType] -> ShowS
show :: ValueType -> String
$cshow :: ValueType -> String
showsPrec :: Int -> ValueType -> ShowS
$cshowsPrec :: Int -> ValueType -> ShowS
Show
valueType :: NValueF a m r -> ValueType
valueType :: forall a (m :: * -> *) r. NValueF a m r -> ValueType
valueType =
\case
NVConstantF NAtom
a ->
case NAtom
a of
NURI Text
_ -> TStringContext -> ValueType
TString forall a. Monoid a => a
mempty
NInt Integer
_ -> ValueType
TInt
NFloat Float
_ -> ValueType
TFloat
NBool Bool
_ -> ValueType
TBool
NAtom
NNull -> ValueType
TNull
NVStrF NixString
ns ->
TStringContext -> ValueType
TString forall a b. (a -> b) -> a -> b
$
TStringContext
HasContext forall a. Monoid a => a -> Bool -> a
`whenTrue` NixString -> Bool
hasContext NixString
ns
NVListF{} -> ValueType
TList
NVSetF{} -> ValueType
TSet
NVClosureF{} -> ValueType
TClosure
NVPathF{} -> ValueType
TPath
NVBuiltinF{} -> ValueType
TBuiltin
describeValue :: ValueType -> Text
describeValue :: ValueType -> Text
describeValue =
\case
ValueType
TInt -> Text
"an integer"
ValueType
TFloat -> Text
"a float"
ValueType
TBool -> Text
"a boolean"
ValueType
TNull -> Text
"a null"
TString TStringContext
NoContext -> Text
"a string with no context"
TString TStringContext
HasContext -> Text
"a string"
ValueType
TList -> Text
"a list"
ValueType
TSet -> Text
"an attr set"
ValueType
TClosure -> Text
"a function"
ValueType
TPath -> Text
"a path"
ValueType
TBuiltin -> Text
"a builtin function"
showValueType :: (MonadThunk t m (NValue t f m), Comonad f)
=> NValue t f m
-> m Text
showValueType :: forall t (m :: * -> *) (f :: * -> *).
(MonadThunk t m (NValue t f m), Comonad f) =>
NValue t f m -> m Text
showValueType (Pure t
t) = forall t (m :: * -> *) (f :: * -> *).
(MonadThunk t m (NValue t f m), Comonad f) =>
NValue t f m -> m Text
showValueType forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
=<< forall t (m :: * -> *) a. MonadThunk t m a => t -> m a
force t
t
showValueType (Free (NValue' (forall (w :: * -> *) a. Comonad w => w a -> a
extract -> NValueF (NValue t f m) m (NValue t f m)
v))) =
forall (f :: * -> *) a. Applicative f => a -> f a
pure forall a b. (a -> b) -> a -> b
$ ValueType -> Text
describeValue forall a b. (a -> b) -> a -> b
$ forall a (m :: * -> *) r. NValueF a m r -> ValueType
valueType NValueF (NValue t f m) m (NValue t f m)
v
data ValueFrame t f m
= ForcingThunk t
| ConcerningValue (NValue t f m)
| Comparison (NValue t f m) (NValue t f m)
| Addition (NValue t f m) (NValue t f m)
| Multiplication (NValue t f m) (NValue t f m)
| Division (NValue t f m) (NValue t f m)
| Coercion ValueType ValueType
| CoercionToJson (NValue t f m)
| CoercionFromJson Aeson.Value
| Expectation ValueType (NValue t f m)
deriving Typeable
deriving instance (NVConstraint f, Show t) => Show (ValueFrame t f m)
type MonadDataContext f (m :: Type -> Type)
= (Comonad f, Applicative f, Traversable f, Monad m)
type MonadDataErrorContext t f m
= (Show t, Typeable t, Typeable m, Typeable f, MonadDataContext f m, MonadFail m)
instance MonadDataErrorContext t f m => Exception (ValueFrame t f m)
instance (Eq a, Comonad f) => Eq (NValue' t f m a) where
== :: NValue' t f m a -> NValue' t f m a -> Bool
(==) (NValue' (forall (w :: * -> *) a. Comonad w => w a -> a
extract -> NValueF (NValue t f m) m a
x)) (NValue' (forall (w :: * -> *) a. Comonad w => w a -> a
extract -> NValueF (NValue t f m) m a
y)) = NValueF (NValue t f m) m a
x forall a. Eq a => a -> a -> Bool
== NValueF (NValue t f m) m a
y
instance Comonad f => Eq1 (NValue' t f m) where
liftEq :: forall a b.
(a -> b -> Bool) -> NValue' t f m a -> NValue' t f m b -> Bool
liftEq a -> b -> Bool
eq (NValue' (forall (w :: * -> *) a. Comonad w => w a -> a
extract -> NValueF (NValue t f m) m a
x)) (NValue' (forall (w :: * -> *) a. Comonad w => w a -> a
extract -> NValueF (NValue t f m) m b
y)) = forall (f :: * -> *) a b.
Eq1 f =>
(a -> b -> Bool) -> f a -> f b -> Bool
liftEq a -> b -> Bool
eq NValueF (NValue t f m) m a
x NValueF (NValue t f m) m b
y
$(makeTraversals ''NValueF)
$(makeLenses ''NValue')
key
:: (Traversable f, Applicative g)
=> VarName
-> LensLike' g (NValue' t f m a) (Maybe a)
key :: forall (f :: * -> *) (g :: * -> *) t (m :: * -> *) a.
(Traversable f, Applicative g) =>
VarName -> LensLike' g (NValue' t f m a) (Maybe a)
key VarName
k = forall {f :: * -> *} {f :: * -> *} {t} {m :: * -> *} {a}
{f :: * -> *} {t} {m :: * -> *} {a}.
Functor f =>
(f (NValueF (NValue t f m) m a)
-> f (f (NValueF (NValue t f m) m a)))
-> NValue' t f m a -> f (NValue' t f m a)
nValue forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {f :: * -> *} {r} {p} {m :: * -> *}.
Applicative f =>
((PositionSet, AttrSet r) -> f (PositionSet, AttrSet r))
-> NValueF p m r -> f (NValueF p m r)
_NVSetF forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall r a b. Lens (r, a) (r, b) a b
_2 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (f :: * -> *) v.
Functor f =>
VarName -> (Maybe v -> f (Maybe v)) -> AttrSet v -> f (AttrSet v)
hashAt VarName
k