graphql-engine-1.0.0: GraphQL API over Postgres
Safe HaskellNone
LanguageHaskell2010

Hasura.Backends.MSSQL.Types.Insert

Description

MSSQL Types Insert

Types for MSSQL Insert IR.

Synopsis

Documentation

data BackendInsert v Source #

Defines the part in insert mutation that is unique for MSSQL the if_matched clause.

Constructors

BackendInsert 

Fields

  • _biIfMatched :: Maybe (IfMatched v)

    if_matched can be omitted (and in that case will be Nothing). If omitted, we only insert new rows (without upserting).

Instances

Instances details
Backend 'MSSQL => Functor BackendInsert Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

Methods

fmap :: (a -> b) -> BackendInsert a -> BackendInsert b #

(<$) :: a -> BackendInsert b -> BackendInsert a #

Backend 'MSSQL => Foldable BackendInsert Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

Methods

fold :: Monoid m => BackendInsert m -> m #

foldMap :: Monoid m => (a -> m) -> BackendInsert a -> m #

foldMap' :: Monoid m => (a -> m) -> BackendInsert a -> m #

foldr :: (a -> b -> b) -> b -> BackendInsert a -> b #

foldr' :: (a -> b -> b) -> b -> BackendInsert a -> b #

foldl :: (b -> a -> b) -> b -> BackendInsert a -> b #

foldl' :: (b -> a -> b) -> b -> BackendInsert a -> b #

foldr1 :: (a -> a -> a) -> BackendInsert a -> a #

foldl1 :: (a -> a -> a) -> BackendInsert a -> a #

toList :: BackendInsert a -> [a] #

null :: BackendInsert a -> Bool #

length :: BackendInsert a -> Int #

elem :: Eq a => a -> BackendInsert a -> Bool #

maximum :: Ord a => BackendInsert a -> a #

minimum :: Ord a => BackendInsert a -> a #

sum :: Num a => BackendInsert a -> a #

product :: Num a => BackendInsert a -> a #

Backend 'MSSQL => Traversable BackendInsert Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

Methods

traverse :: Applicative f => (a -> f b) -> BackendInsert a -> f (BackendInsert b) #

sequenceA :: Applicative f => BackendInsert (f a) -> f (BackendInsert a) #

mapM :: Monad m => (a -> m b) -> BackendInsert a -> m (BackendInsert b) #

sequence :: Monad m => BackendInsert (m a) -> m (BackendInsert a) #

(Backend 'MSSQL, Show (IfMatched v), Show v) => Show (BackendInsert v) Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

data IfMatched v Source #

The IR data representing an if_matched clause, which handles upserts.

Constructors

IfMatched 

Fields

Instances

Instances details
Backend 'MSSQL => Functor IfMatched Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

Methods

fmap :: (a -> b) -> IfMatched a -> IfMatched b #

(<$) :: a -> IfMatched b -> IfMatched a #

Backend 'MSSQL => Foldable IfMatched Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

Methods

fold :: Monoid m => IfMatched m -> m #

foldMap :: Monoid m => (a -> m) -> IfMatched a -> m #

foldMap' :: Monoid m => (a -> m) -> IfMatched a -> m #

foldr :: (a -> b -> b) -> b -> IfMatched a -> b #

foldr' :: (a -> b -> b) -> b -> IfMatched a -> b #

foldl :: (b -> a -> b) -> b -> IfMatched a -> b #

foldl' :: (b -> a -> b) -> b -> IfMatched a -> b #

foldr1 :: (a -> a -> a) -> IfMatched a -> a #

foldl1 :: (a -> a -> a) -> IfMatched a -> a #

toList :: IfMatched a -> [a] #

null :: IfMatched a -> Bool #

length :: IfMatched a -> Int #

elem :: Eq a => a -> IfMatched a -> Bool #

maximum :: Ord a => IfMatched a -> a #

minimum :: Ord a => IfMatched a -> a #

sum :: Num a => IfMatched a -> a #

product :: Num a => IfMatched a -> a #

Backend 'MSSQL => Traversable IfMatched Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert

Methods

traverse :: Applicative f => (a -> f b) -> IfMatched a -> f (IfMatched b) #

sequenceA :: Applicative f => IfMatched (f a) -> f (IfMatched a) #

mapM :: Monad m => (a -> m b) -> IfMatched a -> m (IfMatched b) #

sequence :: Monad m => IfMatched (m a) -> m (IfMatched a) #

(Backend 'MSSQL, Show (AnnBoolExp 'MSSQL v), Show v) => Show (IfMatched v) Source # 
Instance details

Defined in Hasura.Backends.MSSQL.Types.Insert