Safe Haskell | None |
---|---|
Language | Haskell2010 |
Postgres Types Insert
This module defines the Insert-related IR types specific to Postgres.
Synopsis
- newtype BackendInsert pgKind v = BackendInsert {
- _biConflictClause :: Maybe (OnConflictClause ('Postgres pgKind) v)
Documentation
newtype BackendInsert pgKind v Source #
The PostgreSQL-specific data of an Insert expression.
This is parameterised over v
which enables different phases of IR
transformation to maintain the overall structure while enriching/transforming
the data at the leaves.
BackendInsert | |
|
Instances
Backend ('Postgres pgKind) => Functor (BackendInsert pgKind) Source # | |
Defined in Hasura.Backends.Postgres.Types.Insert fmap :: (a -> b) -> BackendInsert pgKind a -> BackendInsert pgKind b # (<$) :: a -> BackendInsert pgKind b -> BackendInsert pgKind a # | |
Backend ('Postgres pgKind) => Foldable (BackendInsert pgKind) Source # | |
Defined in Hasura.Backends.Postgres.Types.Insert fold :: Monoid m => BackendInsert pgKind m -> m # foldMap :: Monoid m => (a -> m) -> BackendInsert pgKind a -> m # foldMap' :: Monoid m => (a -> m) -> BackendInsert pgKind a -> m # foldr :: (a -> b -> b) -> b -> BackendInsert pgKind a -> b # foldr' :: (a -> b -> b) -> b -> BackendInsert pgKind a -> b # foldl :: (b -> a -> b) -> b -> BackendInsert pgKind a -> b # foldl' :: (b -> a -> b) -> b -> BackendInsert pgKind a -> b # foldr1 :: (a -> a -> a) -> BackendInsert pgKind a -> a # foldl1 :: (a -> a -> a) -> BackendInsert pgKind a -> a # toList :: BackendInsert pgKind a -> [a] # null :: BackendInsert pgKind a -> Bool # length :: BackendInsert pgKind a -> Int # elem :: Eq a => a -> BackendInsert pgKind a -> Bool # maximum :: Ord a => BackendInsert pgKind a -> a # minimum :: Ord a => BackendInsert pgKind a -> a # sum :: Num a => BackendInsert pgKind a -> a # product :: Num a => BackendInsert pgKind a -> a # | |
Backend ('Postgres pgKind) => Traversable (BackendInsert pgKind) Source # | |
Defined in Hasura.Backends.Postgres.Types.Insert traverse :: Applicative f => (a -> f b) -> BackendInsert pgKind a -> f (BackendInsert pgKind b) # sequenceA :: Applicative f => BackendInsert pgKind (f a) -> f (BackendInsert pgKind a) # mapM :: Monad m => (a -> m b) -> BackendInsert pgKind a -> m (BackendInsert pgKind b) # sequence :: Monad m => BackendInsert pgKind (m a) -> m (BackendInsert pgKind a) # |