Copyright | (c) 2020-2021 Alexandre Moreno |
---|---|
License | BSD-3-Clause OR Apache-2.0 |
Maintainer | Alexandre Moreno <alexmorenocano@gmail.com> |
Stability | experimental |
Portability | non-portable |
Safe Haskell | None |
Language | Haskell2010 |
Documentation
Instances
Instances
Eq Prim Source # | |
Data Prim Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Prim -> c Prim # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Prim # dataTypeOf :: Prim -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Prim) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Prim) # gmapT :: (forall b. Data b => b -> b) -> Prim -> Prim # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Prim -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Prim -> r # gmapQ :: (forall d. Data d => d -> u) -> Prim -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Prim -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Prim -> m Prim # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Prim -> m Prim # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Prim -> m Prim # | |
Show Prim Source # | |
Generic Prim Source # | |
Binary Prim Source # | |
Alpha Prim Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> Prim -> Prim -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> Prim -> f Prim # close :: AlphaCtx -> NamePatFind -> Prim -> Prim # open :: AlphaCtx -> NthPatFind -> Prim -> Prim # isPat :: Prim -> DisjointSet AnyName # nthPatFind :: Prim -> NthPatFind # namePatFind :: Prim -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> Prim -> Prim # lfreshen' :: LFresh m => AlphaCtx -> Prim -> (Prim -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> Prim -> m (Prim, Perm AnyName) # | |
Lift Prim Source # | |
type Rep Prim Source # | |
Defined in Language.Jsonnet.Common type Rep Prim = D1 ('MetaData "Prim" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) (C1 ('MetaCons "UnyOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnyOp)) :+: (C1 ('MetaCons "BinOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BinOp)) :+: C1 ('MetaCons "Cond" 'PrefixI 'False) (U1 :: Type -> Type))) |
Instances
Eq BinOp Source # | |
Data BinOp Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinOp -> c BinOp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BinOp # dataTypeOf :: BinOp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BinOp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BinOp) # gmapT :: (forall b. Data b => b -> b) -> BinOp -> BinOp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinOp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinOp -> r # gmapQ :: (forall d. Data d => d -> u) -> BinOp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BinOp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinOp -> m BinOp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinOp -> m BinOp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinOp -> m BinOp # | |
Show BinOp Source # | |
Generic BinOp Source # | |
Binary BinOp Source # | |
Alpha BinOp Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> BinOp -> BinOp -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> BinOp -> f BinOp # close :: AlphaCtx -> NamePatFind -> BinOp -> BinOp # open :: AlphaCtx -> NthPatFind -> BinOp -> BinOp # isPat :: BinOp -> DisjointSet AnyName # nthPatFind :: BinOp -> NthPatFind # namePatFind :: BinOp -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> BinOp -> BinOp # lfreshen' :: LFresh m => AlphaCtx -> BinOp -> (BinOp -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> BinOp -> m (BinOp, Perm AnyName) # | |
Lift BinOp Source # | |
type Rep BinOp Source # | |
Defined in Language.Jsonnet.Common type Rep BinOp = D1 ('MetaData "BinOp" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) ((((C1 ('MetaCons "Add" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Sub" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Mul" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Div" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Mod" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "Lt" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Le" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Gt" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Ge" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Eq" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "Ne" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "And" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Or" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Xor" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ShiftL" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "ShiftR" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LAnd" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LOr" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "In" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Lookup" 'PrefixI 'False) (U1 :: Type -> Type)))))) |
Instances
Eq UnyOp Source # | |
Data UnyOp Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UnyOp -> c UnyOp # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UnyOp # dataTypeOf :: UnyOp -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UnyOp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UnyOp) # gmapT :: (forall b. Data b => b -> b) -> UnyOp -> UnyOp # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UnyOp -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UnyOp -> r # gmapQ :: (forall d. Data d => d -> u) -> UnyOp -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UnyOp -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UnyOp -> m UnyOp # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UnyOp -> m UnyOp # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UnyOp -> m UnyOp # | |
Show UnyOp Source # | |
Generic UnyOp Source # | |
Binary UnyOp Source # | |
Alpha UnyOp Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> UnyOp -> UnyOp -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> UnyOp -> f UnyOp # close :: AlphaCtx -> NamePatFind -> UnyOp -> UnyOp # open :: AlphaCtx -> NthPatFind -> UnyOp -> UnyOp # isPat :: UnyOp -> DisjointSet AnyName # nthPatFind :: UnyOp -> NthPatFind # namePatFind :: UnyOp -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> UnyOp -> UnyOp # lfreshen' :: LFresh m => AlphaCtx -> UnyOp -> (UnyOp -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> UnyOp -> m (UnyOp, Perm AnyName) # | |
Lift UnyOp Source # | |
type Rep UnyOp Source # | |
Defined in Language.Jsonnet.Common type Rep UnyOp = D1 ('MetaData "UnyOp" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) ((C1 ('MetaCons "Compl" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LNot" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Plus" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "Minus" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Err" 'PrefixI 'False) (U1 :: Type -> Type)))) |
data Strictness Source #
Instances
Instances
Functor Arg Source # | |
Foldable Arg Source # | |
Defined in Language.Jsonnet.Common fold :: Monoid m => Arg m -> m # foldMap :: Monoid m => (a -> m) -> Arg a -> m # foldMap' :: Monoid m => (a -> m) -> Arg a -> m # foldr :: (a -> b -> b) -> b -> Arg a -> b # foldr' :: (a -> b -> b) -> b -> Arg a -> b # foldl :: (b -> a -> b) -> b -> Arg a -> b # foldl' :: (b -> a -> b) -> b -> Arg a -> b # foldr1 :: (a -> a -> a) -> Arg a -> a # foldl1 :: (a -> a -> a) -> Arg a -> a # elem :: Eq a => a -> Arg a -> Bool # maximum :: Ord a => Arg a -> a # | |
Traversable Arg Source # | |
Show1 Arg Source # | |
Data a => Lift (Arg a :: Type) Source # | |
Eq a => Eq (Arg a) Source # | |
Data a => Data (Arg a) Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Arg a -> c (Arg a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Arg a) # dataTypeOf :: Arg a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Arg a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Arg a)) # gmapT :: (forall b. Data b => b -> b) -> Arg a -> Arg a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Arg a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Arg a -> r # gmapQ :: (forall d. Data d => d -> u) -> Arg a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Arg a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Arg a -> m (Arg a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Arg a -> m (Arg a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Arg a -> m (Arg a) # | |
Read a => Read (Arg a) Source # | |
Show a => Show (Arg a) Source # | |
Generic (Arg a) Source # | |
Binary a => Binary (Arg a) Source # | |
Alpha a => Alpha (Arg a) Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> Arg a -> Arg a -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> Arg a -> f (Arg a) # close :: AlphaCtx -> NamePatFind -> Arg a -> Arg a # open :: AlphaCtx -> NthPatFind -> Arg a -> Arg a # isPat :: Arg a -> DisjointSet AnyName # nthPatFind :: Arg a -> NthPatFind # namePatFind :: Arg a -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> Arg a -> Arg a # lfreshen' :: LFresh m => AlphaCtx -> Arg a -> (Arg a -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> Arg a -> m (Arg a, Perm AnyName) # | |
Generic1 Arg Source # | |
type Rep (Arg a) Source # | |
Defined in Language.Jsonnet.Common type Rep (Arg a) = D1 ('MetaData "Arg" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) (C1 ('MetaCons "Pos" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Named" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))) | |
type Rep1 Arg Source # | |
Defined in Language.Jsonnet.Common type Rep1 Arg = D1 ('MetaData "Arg" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) (C1 ('MetaCons "Pos" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1) :+: C1 ('MetaCons "Named" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) |
Args | |
|
Instances
Functor Args Source # | |
Foldable Args Source # | |
Defined in Language.Jsonnet.Common fold :: Monoid m => Args m -> m # foldMap :: Monoid m => (a -> m) -> Args a -> m # foldMap' :: Monoid m => (a -> m) -> Args a -> m # foldr :: (a -> b -> b) -> b -> Args a -> b # foldr' :: (a -> b -> b) -> b -> Args a -> b # foldl :: (b -> a -> b) -> b -> Args a -> b # foldl' :: (b -> a -> b) -> b -> Args a -> b # foldr1 :: (a -> a -> a) -> Args a -> a # foldl1 :: (a -> a -> a) -> Args a -> a # elem :: Eq a => a -> Args a -> Bool # maximum :: Ord a => Args a -> a # | |
Traversable Args Source # | |
Show1 Args Source # | |
Data a => Lift (Args a :: Type) Source # | |
Eq a => Eq (Args a) Source # | |
Data a => Data (Args a) Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Args a -> c (Args a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Args a) # toConstr :: Args a -> Constr # dataTypeOf :: Args a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Args a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Args a)) # gmapT :: (forall b. Data b => b -> b) -> Args a -> Args a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Args a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Args a -> r # gmapQ :: (forall d. Data d => d -> u) -> Args a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Args a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Args a -> m (Args a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Args a -> m (Args a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Args a -> m (Args a) # | |
Read a => Read (Args a) Source # | |
Show a => Show (Args a) Source # | |
Generic (Args a) Source # | |
Binary a => Binary (Args a) Source # | |
Alpha a => Alpha (Args a) Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> Args a -> Args a -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> Args a -> f (Args a) # close :: AlphaCtx -> NamePatFind -> Args a -> Args a # open :: AlphaCtx -> NthPatFind -> Args a -> Args a # isPat :: Args a -> DisjointSet AnyName # nthPatFind :: Args a -> NthPatFind # namePatFind :: Args a -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> Args a -> Args a # lfreshen' :: LFresh m => AlphaCtx -> Args a -> (Args a -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> Args a -> m (Args a, Perm AnyName) # | |
type Rep (Args a) Source # | |
Defined in Language.Jsonnet.Common type Rep (Args a) = D1 ('MetaData "Args" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) (C1 ('MetaCons "Args" 'PrefixI 'True) (S1 ('MetaSel ('Just "args") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg a]) :*: S1 ('MetaSel ('Just "strictness") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Strictness))) |
Instances
Functor Assert Source # | |
Foldable Assert Source # | |
Defined in Language.Jsonnet.Common fold :: Monoid m => Assert m -> m # foldMap :: Monoid m => (a -> m) -> Assert a -> m # foldMap' :: Monoid m => (a -> m) -> Assert a -> m # foldr :: (a -> b -> b) -> b -> Assert a -> b # foldr' :: (a -> b -> b) -> b -> Assert a -> b # foldl :: (b -> a -> b) -> b -> Assert a -> b # foldl' :: (b -> a -> b) -> b -> Assert a -> b # foldr1 :: (a -> a -> a) -> Assert a -> a # foldl1 :: (a -> a -> a) -> Assert a -> a # elem :: Eq a => a -> Assert a -> Bool # maximum :: Ord a => Assert a -> a # minimum :: Ord a => Assert a -> a # | |
Traversable Assert Source # | |
Show1 Assert Source # | |
Data a => Lift (Assert a :: Type) Source # | |
Eq a => Eq (Assert a) Source # | |
Data a => Data (Assert a) Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Assert a -> c (Assert a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Assert a) # toConstr :: Assert a -> Constr # dataTypeOf :: Assert a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Assert a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Assert a)) # gmapT :: (forall b. Data b => b -> b) -> Assert a -> Assert a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Assert a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Assert a -> r # gmapQ :: (forall d. Data d => d -> u) -> Assert a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Assert a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Assert a -> m (Assert a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Assert a -> m (Assert a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Assert a -> m (Assert a) # | |
Read a => Read (Assert a) Source # | |
Show a => Show (Assert a) Source # | |
Generic (Assert a) Source # | |
Alpha a => Alpha (Assert a) Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> Assert a -> Assert a -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> Assert a -> f (Assert a) # close :: AlphaCtx -> NamePatFind -> Assert a -> Assert a # open :: AlphaCtx -> NthPatFind -> Assert a -> Assert a # isPat :: Assert a -> DisjointSet AnyName # nthPatFind :: Assert a -> NthPatFind # namePatFind :: Assert a -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> Assert a -> Assert a # lfreshen' :: LFresh m => AlphaCtx -> Assert a -> (Assert a -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> Assert a -> m (Assert a, Perm AnyName) # | |
type Rep (Assert a) Source # | |
Defined in Language.Jsonnet.Common type Rep (Assert a) = D1 ('MetaData "Assert" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) (C1 ('MetaCons "Assert" 'PrefixI 'True) (S1 ('MetaSel ('Just "cond") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Just "msg") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe a)) :*: S1 ('MetaSel ('Just "expr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) |
Instances
Functor CompSpec Source # | |
Foldable CompSpec Source # | |
Defined in Language.Jsonnet.Common fold :: Monoid m => CompSpec m -> m # foldMap :: Monoid m => (a -> m) -> CompSpec a -> m # foldMap' :: Monoid m => (a -> m) -> CompSpec a -> m # foldr :: (a -> b -> b) -> b -> CompSpec a -> b # foldr' :: (a -> b -> b) -> b -> CompSpec a -> b # foldl :: (b -> a -> b) -> b -> CompSpec a -> b # foldl' :: (b -> a -> b) -> b -> CompSpec a -> b # foldr1 :: (a -> a -> a) -> CompSpec a -> a # foldl1 :: (a -> a -> a) -> CompSpec a -> a # elem :: Eq a => a -> CompSpec a -> Bool # maximum :: Ord a => CompSpec a -> a # minimum :: Ord a => CompSpec a -> a # | |
Traversable CompSpec Source # | |
Show1 CompSpec Source # | |
Data a => Lift (CompSpec a :: Type) Source # | |
Eq a => Eq (CompSpec a) Source # | |
Data a => Data (CompSpec a) Source # | |
Defined in Language.Jsonnet.Common gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CompSpec a -> c (CompSpec a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CompSpec a) # toConstr :: CompSpec a -> Constr # dataTypeOf :: CompSpec a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CompSpec a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CompSpec a)) # gmapT :: (forall b. Data b => b -> b) -> CompSpec a -> CompSpec a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CompSpec a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CompSpec a -> r # gmapQ :: (forall d. Data d => d -> u) -> CompSpec a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CompSpec a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CompSpec a -> m (CompSpec a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CompSpec a -> m (CompSpec a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CompSpec a -> m (CompSpec a) # | |
Read a => Read (CompSpec a) Source # | |
Show a => Show (CompSpec a) Source # | |
Generic (CompSpec a) Source # | |
Alpha a => Alpha (CompSpec a) Source # | |
Defined in Language.Jsonnet.Common aeq' :: AlphaCtx -> CompSpec a -> CompSpec a -> Bool # fvAny' :: (Contravariant f, Applicative f) => AlphaCtx -> (AnyName -> f AnyName) -> CompSpec a -> f (CompSpec a) # close :: AlphaCtx -> NamePatFind -> CompSpec a -> CompSpec a # open :: AlphaCtx -> NthPatFind -> CompSpec a -> CompSpec a # isPat :: CompSpec a -> DisjointSet AnyName # isEmbed :: CompSpec a -> Bool # nthPatFind :: CompSpec a -> NthPatFind # namePatFind :: CompSpec a -> NamePatFind # swaps' :: AlphaCtx -> Perm AnyName -> CompSpec a -> CompSpec a # lfreshen' :: LFresh m => AlphaCtx -> CompSpec a -> (CompSpec a -> Perm AnyName -> m b) -> m b # freshen' :: Fresh m => AlphaCtx -> CompSpec a -> m (CompSpec a, Perm AnyName) # acompare' :: AlphaCtx -> CompSpec a -> CompSpec a -> Ordering # | |
type Rep (CompSpec a) Source # | |
Defined in Language.Jsonnet.Common type Rep (CompSpec a) = D1 ('MetaData "CompSpec" "Language.Jsonnet.Common" "jsonnet-0.3.1.1-HRvoiMrrp7QzMlnzingfy" 'False) (C1 ('MetaCons "CompSpec" 'PrefixI 'True) (S1 ('MetaSel ('Just "var") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Just "forspec") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "ifspec") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe a))))) |
data StackFrame a Source #
Instances
Eq (StackFrame a) Source # | |
Defined in Language.Jsonnet.Common (==) :: StackFrame a -> StackFrame a -> Bool # (/=) :: StackFrame a -> StackFrame a -> Bool # | |
Show (StackFrame a) Source # | |
Defined in Language.Jsonnet.Common showsPrec :: Int -> StackFrame a -> ShowS # show :: StackFrame a -> String # showList :: [StackFrame a] -> ShowS # | |
Pretty (StackFrame a) Source # | |
Defined in Language.Jsonnet.Pretty pretty :: StackFrame a -> Doc # prettyList :: [StackFrame a] -> Doc # |
Backtrace [StackFrame a] |
data Visibility Source #