Safe Haskell	Safe-Inferred
Language	Haskell2010

Hasura.RQL.IR.Conflict

Documentation

data ConflictTarget (b :: BackendType) Source #

Constructors

CTColumn [Column b]
CTConstraint (ConstraintName b)

Instances

Instances details

Backend b => Show (ConflictTarget b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods showsPrec :: Int -> ConflictTarget b -> ShowS # show :: ConflictTarget b -> String # showList :: [ConflictTarget b] -> ShowS #
Backend b => Eq (ConflictTarget b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods (==) :: ConflictTarget b -> ConflictTarget b -> Bool # (/=) :: ConflictTarget b -> ConflictTarget b -> Bool #

data OnConflictClauseData b v Source #

Constructors

OnConflictClauseData
Fields cp1udConflictTarget :: ConflictTarget b cp1udAffectedColumns :: [Column b] cp1udValues :: PreSetColsG b v cp1udFilter :: AnnBoolExp b v

Instances

Instances details

Backend b => Foldable (OnConflictClauseData b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods fold :: Monoid m => OnConflictClauseData b m -> m # foldMap :: Monoid m => (a -> m) -> OnConflictClauseData b a -> m # foldMap' :: Monoid m => (a -> m) -> OnConflictClauseData b a -> m # foldr :: (a -> b0 -> b0) -> b0 -> OnConflictClauseData b a -> b0 # foldr' :: (a -> b0 -> b0) -> b0 -> OnConflictClauseData b a -> b0 # foldl :: (b0 -> a -> b0) -> b0 -> OnConflictClauseData b a -> b0 # foldl' :: (b0 -> a -> b0) -> b0 -> OnConflictClauseData b a -> b0 # foldr1 :: (a -> a -> a) -> OnConflictClauseData b a -> a # foldl1 :: (a -> a -> a) -> OnConflictClauseData b a -> a # toList :: OnConflictClauseData b a -> [a] # null :: OnConflictClauseData b a -> Bool # length :: OnConflictClauseData b a -> Int # elem :: Eq a => a -> OnConflictClauseData b a -> Bool # maximum :: Ord a => OnConflictClauseData b a -> a # minimum :: Ord a => OnConflictClauseData b a -> a # sum :: Num a => OnConflictClauseData b a -> a # product :: Num a => OnConflictClauseData b a -> a #
Backend b => Traversable (OnConflictClauseData b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods traverse :: Applicative f => (a -> f b0) -> OnConflictClauseData b a -> f (OnConflictClauseData b b0) # sequenceA :: Applicative f => OnConflictClauseData b (f a) -> f (OnConflictClauseData b a) # mapM :: Monad m => (a -> m b0) -> OnConflictClauseData b a -> m (OnConflictClauseData b b0) # sequence :: Monad m => OnConflictClauseData b (m a) -> m (OnConflictClauseData b a) #
Backend b => Functor (OnConflictClauseData b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods fmap :: (a -> b0) -> OnConflictClauseData b a -> OnConflictClauseData b b0 # (<$) :: a -> OnConflictClauseData b b0 -> OnConflictClauseData b a #

data OnConflictClause (b :: BackendType) v Source #

Constructors

OCCDoNothing (Maybe (ConflictTarget b))
OCCUpdate (OnConflictClauseData b v)

Instances

Instances details

Backend b => Foldable (OnConflictClause b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods fold :: Monoid m => OnConflictClause b m -> m # foldMap :: Monoid m => (a -> m) -> OnConflictClause b a -> m # foldMap' :: Monoid m => (a -> m) -> OnConflictClause b a -> m # foldr :: (a -> b0 -> b0) -> b0 -> OnConflictClause b a -> b0 # foldr' :: (a -> b0 -> b0) -> b0 -> OnConflictClause b a -> b0 # foldl :: (b0 -> a -> b0) -> b0 -> OnConflictClause b a -> b0 # foldl' :: (b0 -> a -> b0) -> b0 -> OnConflictClause b a -> b0 # foldr1 :: (a -> a -> a) -> OnConflictClause b a -> a # foldl1 :: (a -> a -> a) -> OnConflictClause b a -> a # toList :: OnConflictClause b a -> [a] # null :: OnConflictClause b a -> Bool # length :: OnConflictClause b a -> Int # elem :: Eq a => a -> OnConflictClause b a -> Bool # maximum :: Ord a => OnConflictClause b a -> a # minimum :: Ord a => OnConflictClause b a -> a # sum :: Num a => OnConflictClause b a -> a # product :: Num a => OnConflictClause b a -> a #
Backend b => Traversable (OnConflictClause b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods traverse :: Applicative f => (a -> f b0) -> OnConflictClause b a -> f (OnConflictClause b b0) # sequenceA :: Applicative f => OnConflictClause b (f a) -> f (OnConflictClause b a) # mapM :: Monad m => (a -> m b0) -> OnConflictClause b a -> m (OnConflictClause b b0) # sequence :: Monad m => OnConflictClause b (m a) -> m (OnConflictClause b a) #
Backend b => Functor (OnConflictClause b) Source #
Instance details Defined in Hasura.RQL.IR.Conflict Methods fmap :: (a -> b0) -> OnConflictClause b a -> OnConflictClause b b0 # (<$) :: a -> OnConflictClause b b0 -> OnConflictClause b a #