queryparser-0.1.0.1: Analysis and parsing library for SQL queries.

Safe HaskellNone
LanguageHaskell2010

Database.Sql.Type

Synopsis

Documentation

type ConstrainSAll (c :: * -> Constraint) d r a = (ConstrainSNames c r a, ConstrainSDialectParts c d r a) Source #

data Unparsed a Source #

Constructors

Unparsed a 

Instances

Eq a => Eq (Unparsed a) Source # 

Methods

(==) :: Unparsed a -> Unparsed a -> Bool #

(/=) :: Unparsed a -> Unparsed a -> Bool #

Show a => Show (Unparsed a) Source # 

Methods

showsPrec :: Int -> Unparsed a -> ShowS #

show :: Unparsed a -> String #

showList :: [Unparsed a] -> ShowS #

data Statement d r a Source #

Instances

ConstrainSASAll Functor d r => Functor (Statement d r) Source # 

Methods

fmap :: (a -> b) -> Statement d r a -> Statement d r b #

(<$) :: a -> Statement d r b -> Statement d r a #

ConstrainSASAll Foldable d r => Foldable (Statement d r) Source # 

Methods

fold :: Monoid m => Statement d r m -> m #

foldMap :: Monoid m => (a -> m) -> Statement d r a -> m #

foldr :: (a -> b -> b) -> b -> Statement d r a -> b #

foldr' :: (a -> b -> b) -> b -> Statement d r a -> b #

foldl :: (b -> a -> b) -> b -> Statement d r a -> b #

foldl' :: (b -> a -> b) -> b -> Statement d r a -> b #

foldr1 :: (a -> a -> a) -> Statement d r a -> a #

foldl1 :: (a -> a -> a) -> Statement d r a -> a #

toList :: Statement d r a -> [a] #

null :: Statement d r a -> Bool #

length :: Statement d r a -> Int #

elem :: Eq a => a -> Statement d r a -> Bool #

maximum :: Ord a => Statement d r a -> a #

minimum :: Ord a => Statement d r a -> a #

sum :: Num a => Statement d r a -> a #

product :: Num a => Statement d r a -> a #

ConstrainSASAll Traversable d r => Traversable (Statement d r) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> Statement d r a -> f (Statement d r b) #

sequenceA :: Applicative f => Statement d r (f a) -> f (Statement d r a) #

mapM :: Monad m => (a -> m b) -> Statement d r a -> m (Statement d r b) #

sequence :: Monad m => Statement d r (m a) -> m (Statement d r a) #

ConstrainSAll Eq d r a => Eq (Statement d r a) Source # 

Methods

(==) :: Statement d r a -> Statement d r a -> Bool #

(/=) :: Statement d r a -> Statement d r a -> Bool #

(ConstrainSAll Data d r a, Data d, Data r) => Data (Statement d r a) Source # 

Methods

gfoldl :: (forall b c. Data b => c (b -> c) -> b -> c c) -> (forall g. g -> c g) -> Statement d r a -> c (Statement d r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Statement d r a) #

toConstr :: Statement d r a -> Constr #

dataTypeOf :: Statement d r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall b. Data b => c (t b)) -> Maybe (c (Statement d r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall b e. (Data b, Data e) => c (t b e)) -> Maybe (c (Statement d r a)) #

gmapT :: (forall b. Data b => b -> b) -> Statement d r a -> Statement d r a #

gmapQl :: (r -> r' -> r) -> r -> (forall b. Data b => b -> r') -> Statement d r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall b. Data b => b -> r') -> Statement d r a -> r #

gmapQ :: (forall b. Data b => b -> u) -> Statement d r a -> [u] #

gmapQi :: Int -> (forall b. Data b => b -> u) -> Statement d r a -> u #

gmapM :: Monad m => (forall b. Data b => b -> m b) -> Statement d r a -> m (Statement d r a) #

gmapMp :: MonadPlus m => (forall b. Data b => b -> m b) -> Statement d r a -> m (Statement d r a) #

gmapMo :: MonadPlus m => (forall b. Data b => b -> m b) -> Statement d r a -> m (Statement d r a) #

ConstrainSAll Show d r a => Show (Statement d r a) Source # 

Methods

showsPrec :: Int -> Statement d r a -> ShowS #

show :: Statement d r a -> String #

showList :: [Statement d r a] -> ShowS #

Generic (Statement d r a) Source # 

Associated Types

type Rep (Statement d r a) :: * -> * #

Methods

from :: Statement d r a -> Rep (Statement d r a) x #

to :: Rep (Statement d r a) x -> Statement d r a #

ConstrainSAll ToJSON d r a => ToJSON (Statement d r a) Source # 

Methods

toJSON :: Statement d r a -> Value #

toEncoding :: Statement d r a -> Encoding #

toJSONList :: [Statement d r a] -> Value #

toEncodingList :: [Statement d r a] -> Encoding #

ConstrainSAll FromJSON d r a => FromJSON (Statement d r a) Source # 

Methods

parseJSON :: Value -> Parser (Statement d r a) #

parseJSONList :: Value -> Parser [Statement d r a] #

HasTables (Statement d ResolvedNames a) Source # 
HasSchemaChange (Statement d ResolvedNames a) Source # 
HasTableLineage (Statement d ResolvedNames a) Source # 
HasJoins (Statement d ResolvedNames a) Source # 

Methods

getJoins :: Statement d ResolvedNames a -> Set Join Source #

HasColumns (Statement d ResolvedNames a) Source # 

Methods

goColumns :: Statement d ResolvedNames a -> Observer Source #

HasInfo (Statement d r a) Source # 

Associated Types

type Info (Statement d r a) :: * Source #

Methods

getInfo :: Statement d r a -> Info (Statement d r a) Source #

HasColumnLineage (Statement d ResolvedNames Range) Source # 
type Rep (Statement d r a) Source # 
type Rep (Statement d r a) = D1 * (MetaData "Statement" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) ((:+:) * ((:+:) * ((:+:) * ((:+:) * (C1 * (MetaCons "QueryStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Query r a)))) (C1 * (MetaCons "InsertStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Insert r a))))) ((:+:) * (C1 * (MetaCons "UpdateStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Update r a)))) (C1 * (MetaCons "DeleteStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Delete r a)))))) ((:+:) * ((:+:) * (C1 * (MetaCons "TruncateStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Truncate r a)))) (C1 * (MetaCons "CreateTableStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateTable d r a))))) ((:+:) * (C1 * (MetaCons "AlterTableStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (AlterTable r a)))) ((:+:) * (C1 * (MetaCons "DropTableStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (DropTable r a)))) (C1 * (MetaCons "CreateViewStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateView r a)))))))) ((:+:) * ((:+:) * ((:+:) * (C1 * (MetaCons "DropViewStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (DropView r a)))) (C1 * (MetaCons "CreateSchemaStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateSchema r a))))) ((:+:) * (C1 * (MetaCons "GrantStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Grant a)))) (C1 * (MetaCons "RevokeStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Revoke a)))))) ((:+:) * ((:+:) * (C1 * (MetaCons "BeginStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "CommitStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))) ((:+:) * (C1 * (MetaCons "RollbackStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) ((:+:) * (C1 * (MetaCons "ExplainStmt" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Statement d r a))))) (C1 * (MetaCons "EmptyStmt" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))))))))
type Info (Statement d r a) Source # 
type Info (Statement d r a) = a

data Insert r a Source #

Instances

ConstrainSASNames Functor r => Functor (Insert r) Source # 

Methods

fmap :: (a -> b) -> Insert r a -> Insert r b #

(<$) :: a -> Insert r b -> Insert r a #

ConstrainSASNames Foldable r => Foldable (Insert r) Source # 

Methods

fold :: Monoid m => Insert r m -> m #

foldMap :: Monoid m => (a -> m) -> Insert r a -> m #

foldr :: (a -> b -> b) -> b -> Insert r a -> b #

foldr' :: (a -> b -> b) -> b -> Insert r a -> b #

foldl :: (b -> a -> b) -> b -> Insert r a -> b #

foldl' :: (b -> a -> b) -> b -> Insert r a -> b #

foldr1 :: (a -> a -> a) -> Insert r a -> a #

foldl1 :: (a -> a -> a) -> Insert r a -> a #

toList :: Insert r a -> [a] #

null :: Insert r a -> Bool #

length :: Insert r a -> Int #

elem :: Eq a => a -> Insert r a -> Bool #

maximum :: Ord a => Insert r a -> a #

minimum :: Ord a => Insert r a -> a #

sum :: Num a => Insert r a -> a #

product :: Num a => Insert r a -> a #

ConstrainSASNames Traversable r => Traversable (Insert r) Source # 

Methods

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

sequenceA :: Applicative f => Insert r (f a) -> f (Insert r a) #

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

sequence :: Monad m => Insert r (m a) -> m (Insert r a) #

ConstrainSNames Eq r a => Eq (Insert r a) Source # 

Methods

(==) :: Insert r a -> Insert r a -> Bool #

(/=) :: Insert r a -> Insert r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (Insert r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Insert r a -> c (Insert r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Insert r a) #

toConstr :: Insert r a -> Constr #

dataTypeOf :: Insert r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Insert r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Insert r a)) #

gmapT :: (forall b. Data b => b -> b) -> Insert r a -> Insert r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Insert r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Insert r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Insert r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Insert r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Insert r a -> m (Insert r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Insert r a -> m (Insert r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Insert r a -> m (Insert r a) #

ConstrainSNames Show r a => Show (Insert r a) Source # 

Methods

showsPrec :: Int -> Insert r a -> ShowS #

show :: Insert r a -> String #

showList :: [Insert r a] -> ShowS #

Generic (Insert r a) Source # 

Associated Types

type Rep (Insert r a) :: * -> * #

Methods

from :: Insert r a -> Rep (Insert r a) x #

to :: Rep (Insert r a) x -> Insert r a #

ConstrainSNames ToJSON r a => ToJSON (Insert r a) Source # 

Methods

toJSON :: Insert r a -> Value #

toEncoding :: Insert r a -> Encoding #

toJSONList :: [Insert r a] -> Value #

toEncodingList :: [Insert r a] -> Encoding #

ConstrainSNames FromJSON r a => FromJSON (Insert r a) Source # 

Methods

parseJSON :: Value -> Parser (Insert r a) #

parseJSONList :: Value -> Parser [Insert r a] #

HasTables (Insert ResolvedNames a) Source # 
HasColumns (Insert ResolvedNames a) Source # 

Methods

goColumns :: Insert ResolvedNames a -> Observer Source #

HasInfo (Insert r a) Source # 

Associated Types

type Info (Insert r a) :: * Source #

Methods

getInfo :: Insert r a -> Info (Insert r a) Source #

type Rep (Insert r a) Source # 
type Info (Insert r a) Source # 
type Info (Insert r a) = a

data InsertBehavior a Source #

Instances

Functor InsertBehavior Source # 

Methods

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

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

Foldable InsertBehavior Source # 

Methods

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

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

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

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

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

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

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

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

toList :: InsertBehavior a -> [a] #

null :: InsertBehavior a -> Bool #

length :: InsertBehavior a -> Int #

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

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

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

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

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

Traversable InsertBehavior Source # 

Methods

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

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

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

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

Eq a => Eq (InsertBehavior a) Source # 
Data a => Data (InsertBehavior a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InsertBehavior a -> c (InsertBehavior a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InsertBehavior a) #

toConstr :: InsertBehavior a -> Constr #

dataTypeOf :: InsertBehavior a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (InsertBehavior a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InsertBehavior a)) #

gmapT :: (forall b. Data b => b -> b) -> InsertBehavior a -> InsertBehavior a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InsertBehavior a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InsertBehavior a -> r #

gmapQ :: (forall d. Data d => d -> u) -> InsertBehavior a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> InsertBehavior a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InsertBehavior a -> m (InsertBehavior a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InsertBehavior a -> m (InsertBehavior a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InsertBehavior a -> m (InsertBehavior a) #

Show a => Show (InsertBehavior a) Source # 
Generic (InsertBehavior a) Source # 

Associated Types

type Rep (InsertBehavior a) :: * -> * #

Arbitrary a => Arbitrary (InsertBehavior a) Source # 
ToJSON a => ToJSON (InsertBehavior a) Source # 
FromJSON a => FromJSON (InsertBehavior a) Source # 
type Rep (InsertBehavior a) Source # 

data InsertValues r a Source #

Instances

ConstrainSASNames Functor r => Functor (InsertValues r) Source # 

Methods

fmap :: (a -> b) -> InsertValues r a -> InsertValues r b #

(<$) :: a -> InsertValues r b -> InsertValues r a #

ConstrainSASNames Foldable r => Foldable (InsertValues r) Source # 

Methods

fold :: Monoid m => InsertValues r m -> m #

foldMap :: Monoid m => (a -> m) -> InsertValues r a -> m #

foldr :: (a -> b -> b) -> b -> InsertValues r a -> b #

foldr' :: (a -> b -> b) -> b -> InsertValues r a -> b #

foldl :: (b -> a -> b) -> b -> InsertValues r a -> b #

foldl' :: (b -> a -> b) -> b -> InsertValues r a -> b #

foldr1 :: (a -> a -> a) -> InsertValues r a -> a #

foldl1 :: (a -> a -> a) -> InsertValues r a -> a #

toList :: InsertValues r a -> [a] #

null :: InsertValues r a -> Bool #

length :: InsertValues r a -> Int #

elem :: Eq a => a -> InsertValues r a -> Bool #

maximum :: Ord a => InsertValues r a -> a #

minimum :: Ord a => InsertValues r a -> a #

sum :: Num a => InsertValues r a -> a #

product :: Num a => InsertValues r a -> a #

ConstrainSASNames Traversable r => Traversable (InsertValues r) Source # 

Methods

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

sequenceA :: Applicative f => InsertValues r (f a) -> f (InsertValues r a) #

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

sequence :: Monad m => InsertValues r (m a) -> m (InsertValues r a) #

ConstrainSNames Eq r a => Eq (InsertValues r a) Source # 

Methods

(==) :: InsertValues r a -> InsertValues r a -> Bool #

(/=) :: InsertValues r a -> InsertValues r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (InsertValues r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InsertValues r a -> c (InsertValues r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (InsertValues r a) #

toConstr :: InsertValues r a -> Constr #

dataTypeOf :: InsertValues r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (InsertValues r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InsertValues r a)) #

gmapT :: (forall b. Data b => b -> b) -> InsertValues r a -> InsertValues r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InsertValues r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InsertValues r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> InsertValues r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> InsertValues r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InsertValues r a -> m (InsertValues r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InsertValues r a -> m (InsertValues r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InsertValues r a -> m (InsertValues r a) #

ConstrainSNames Show r a => Show (InsertValues r a) Source # 
Generic (InsertValues r a) Source # 

Associated Types

type Rep (InsertValues r a) :: * -> * #

Methods

from :: InsertValues r a -> Rep (InsertValues r a) x #

to :: Rep (InsertValues r a) x -> InsertValues r a #

ConstrainSNames ToJSON r a => ToJSON (InsertValues r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (InsertValues r a) Source # 
HasTables (InsertValues ResolvedNames a) Source # 
HasColumns (InsertValues ResolvedNames a) Source # 

Methods

goColumns :: InsertValues ResolvedNames a -> Observer Source #

HasInfo (InsertValues r a) Source # 

Associated Types

type Info (InsertValues r a) :: * Source #

Methods

getInfo :: InsertValues r a -> Info (InsertValues r a) Source #

type Rep (InsertValues r a) Source # 
type Info (InsertValues r a) Source # 
type Info (InsertValues r a) = a

data DefaultExpr r a Source #

Constructors

DefaultValue a 
ExprValue (Expr r a) 

Instances

ConstrainSASNames Functor r => Functor (DefaultExpr r) Source # 

Methods

fmap :: (a -> b) -> DefaultExpr r a -> DefaultExpr r b #

(<$) :: a -> DefaultExpr r b -> DefaultExpr r a #

ConstrainSASNames Foldable r => Foldable (DefaultExpr r) Source # 

Methods

fold :: Monoid m => DefaultExpr r m -> m #

foldMap :: Monoid m => (a -> m) -> DefaultExpr r a -> m #

foldr :: (a -> b -> b) -> b -> DefaultExpr r a -> b #

foldr' :: (a -> b -> b) -> b -> DefaultExpr r a -> b #

foldl :: (b -> a -> b) -> b -> DefaultExpr r a -> b #

foldl' :: (b -> a -> b) -> b -> DefaultExpr r a -> b #

foldr1 :: (a -> a -> a) -> DefaultExpr r a -> a #

foldl1 :: (a -> a -> a) -> DefaultExpr r a -> a #

toList :: DefaultExpr r a -> [a] #

null :: DefaultExpr r a -> Bool #

length :: DefaultExpr r a -> Int #

elem :: Eq a => a -> DefaultExpr r a -> Bool #

maximum :: Ord a => DefaultExpr r a -> a #

minimum :: Ord a => DefaultExpr r a -> a #

sum :: Num a => DefaultExpr r a -> a #

product :: Num a => DefaultExpr r a -> a #

ConstrainSASNames Traversable r => Traversable (DefaultExpr r) Source # 

Methods

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

sequenceA :: Applicative f => DefaultExpr r (f a) -> f (DefaultExpr r a) #

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

sequence :: Monad m => DefaultExpr r (m a) -> m (DefaultExpr r a) #

ConstrainSNames Eq r a => Eq (DefaultExpr r a) Source # 

Methods

(==) :: DefaultExpr r a -> DefaultExpr r a -> Bool #

(/=) :: DefaultExpr r a -> DefaultExpr r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (DefaultExpr r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DefaultExpr r a -> c (DefaultExpr r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (DefaultExpr r a) #

toConstr :: DefaultExpr r a -> Constr #

dataTypeOf :: DefaultExpr r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (DefaultExpr r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DefaultExpr r a)) #

gmapT :: (forall b. Data b => b -> b) -> DefaultExpr r a -> DefaultExpr r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DefaultExpr r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DefaultExpr r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> DefaultExpr r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DefaultExpr r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DefaultExpr r a -> m (DefaultExpr r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DefaultExpr r a -> m (DefaultExpr r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DefaultExpr r a -> m (DefaultExpr r a) #

ConstrainSNames Show r a => Show (DefaultExpr r a) Source # 

Methods

showsPrec :: Int -> DefaultExpr r a -> ShowS #

show :: DefaultExpr r a -> String #

showList :: [DefaultExpr r a] -> ShowS #

Generic (DefaultExpr r a) Source # 

Associated Types

type Rep (DefaultExpr r a) :: * -> * #

Methods

from :: DefaultExpr r a -> Rep (DefaultExpr r a) x #

to :: Rep (DefaultExpr r a) x -> DefaultExpr r a #

ConstrainSNames ToJSON r a => ToJSON (DefaultExpr r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (DefaultExpr r a) Source # 
HasTables (DefaultExpr ResolvedNames a) Source # 
HasColumns (DefaultExpr ResolvedNames a) Source # 

Methods

goColumns :: DefaultExpr ResolvedNames a -> Observer Source #

HasInfo (DefaultExpr r a) Source # 

Associated Types

type Info (DefaultExpr r a) :: * Source #

Methods

getInfo :: DefaultExpr r a -> Info (DefaultExpr r a) Source #

type Rep (DefaultExpr r a) Source # 
type Rep (DefaultExpr r a) = D1 * (MetaData "DefaultExpr" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) ((:+:) * (C1 * (MetaCons "DefaultValue" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "ExprValue" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Expr r a)))))
type Info (DefaultExpr r a) Source # 
type Info (DefaultExpr r a) = a

data Update r a Source #

Instances

ConstrainSASNames Functor r => Functor (Update r) Source # 

Methods

fmap :: (a -> b) -> Update r a -> Update r b #

(<$) :: a -> Update r b -> Update r a #

ConstrainSASNames Foldable r => Foldable (Update r) Source # 

Methods

fold :: Monoid m => Update r m -> m #

foldMap :: Monoid m => (a -> m) -> Update r a -> m #

foldr :: (a -> b -> b) -> b -> Update r a -> b #

foldr' :: (a -> b -> b) -> b -> Update r a -> b #

foldl :: (b -> a -> b) -> b -> Update r a -> b #

foldl' :: (b -> a -> b) -> b -> Update r a -> b #

foldr1 :: (a -> a -> a) -> Update r a -> a #

foldl1 :: (a -> a -> a) -> Update r a -> a #

toList :: Update r a -> [a] #

null :: Update r a -> Bool #

length :: Update r a -> Int #

elem :: Eq a => a -> Update r a -> Bool #

maximum :: Ord a => Update r a -> a #

minimum :: Ord a => Update r a -> a #

sum :: Num a => Update r a -> a #

product :: Num a => Update r a -> a #

ConstrainSASNames Traversable r => Traversable (Update r) Source # 

Methods

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

sequenceA :: Applicative f => Update r (f a) -> f (Update r a) #

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

sequence :: Monad m => Update r (m a) -> m (Update r a) #

ConstrainSNames Eq r a => Eq (Update r a) Source # 

Methods

(==) :: Update r a -> Update r a -> Bool #

(/=) :: Update r a -> Update r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (Update r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Update r a -> c (Update r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Update r a) #

toConstr :: Update r a -> Constr #

dataTypeOf :: Update r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Update r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Update r a)) #

gmapT :: (forall b. Data b => b -> b) -> Update r a -> Update r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Update r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Update r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Update r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Update r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Update r a -> m (Update r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Update r a -> m (Update r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Update r a -> m (Update r a) #

ConstrainSNames Show r a => Show (Update r a) Source # 

Methods

showsPrec :: Int -> Update r a -> ShowS #

show :: Update r a -> String #

showList :: [Update r a] -> ShowS #

Generic (Update r a) Source # 

Associated Types

type Rep (Update r a) :: * -> * #

Methods

from :: Update r a -> Rep (Update r a) x #

to :: Rep (Update r a) x -> Update r a #

ConstrainSNames ToJSON r a => ToJSON (Update r a) Source # 

Methods

toJSON :: Update r a -> Value #

toEncoding :: Update r a -> Encoding #

toJSONList :: [Update r a] -> Value #

toEncodingList :: [Update r a] -> Encoding #

ConstrainSNames FromJSON r a => FromJSON (Update r a) Source # 

Methods

parseJSON :: Value -> Parser (Update r a) #

parseJSONList :: Value -> Parser [Update r a] #

HasTables (Update ResolvedNames a) Source # 
HasColumns (Update ResolvedNames a) Source # 

Methods

goColumns :: Update ResolvedNames a -> Observer Source #

HasInfo (Update r a) Source # 

Associated Types

type Info (Update r a) :: * Source #

Methods

getInfo :: Update r a -> Info (Update r a) Source #

type Rep (Update r a) Source # 
type Info (Update r a) Source # 
type Info (Update r a) = a

data Delete r a Source #

Constructors

Delete a (TableName r a) (Maybe (Expr r a)) 

Instances

ConstrainSASNames Functor r => Functor (Delete r) Source # 

Methods

fmap :: (a -> b) -> Delete r a -> Delete r b #

(<$) :: a -> Delete r b -> Delete r a #

ConstrainSASNames Foldable r => Foldable (Delete r) Source # 

Methods

fold :: Monoid m => Delete r m -> m #

foldMap :: Monoid m => (a -> m) -> Delete r a -> m #

foldr :: (a -> b -> b) -> b -> Delete r a -> b #

foldr' :: (a -> b -> b) -> b -> Delete r a -> b #

foldl :: (b -> a -> b) -> b -> Delete r a -> b #

foldl' :: (b -> a -> b) -> b -> Delete r a -> b #

foldr1 :: (a -> a -> a) -> Delete r a -> a #

foldl1 :: (a -> a -> a) -> Delete r a -> a #

toList :: Delete r a -> [a] #

null :: Delete r a -> Bool #

length :: Delete r a -> Int #

elem :: Eq a => a -> Delete r a -> Bool #

maximum :: Ord a => Delete r a -> a #

minimum :: Ord a => Delete r a -> a #

sum :: Num a => Delete r a -> a #

product :: Num a => Delete r a -> a #

ConstrainSASNames Traversable r => Traversable (Delete r) Source # 

Methods

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

sequenceA :: Applicative f => Delete r (f a) -> f (Delete r a) #

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

sequence :: Monad m => Delete r (m a) -> m (Delete r a) #

ConstrainSNames Eq r a => Eq (Delete r a) Source # 

Methods

(==) :: Delete r a -> Delete r a -> Bool #

(/=) :: Delete r a -> Delete r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (Delete r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Delete r a -> c (Delete r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Delete r a) #

toConstr :: Delete r a -> Constr #

dataTypeOf :: Delete r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Delete r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Delete r a)) #

gmapT :: (forall b. Data b => b -> b) -> Delete r a -> Delete r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Delete r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Delete r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Delete r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Delete r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Delete r a -> m (Delete r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Delete r a -> m (Delete r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Delete r a -> m (Delete r a) #

ConstrainSNames Show r a => Show (Delete r a) Source # 

Methods

showsPrec :: Int -> Delete r a -> ShowS #

show :: Delete r a -> String #

showList :: [Delete r a] -> ShowS #

Generic (Delete r a) Source # 

Associated Types

type Rep (Delete r a) :: * -> * #

Methods

from :: Delete r a -> Rep (Delete r a) x #

to :: Rep (Delete r a) x -> Delete r a #

ConstrainSNames ToJSON r a => ToJSON (Delete r a) Source # 

Methods

toJSON :: Delete r a -> Value #

toEncoding :: Delete r a -> Encoding #

toJSONList :: [Delete r a] -> Value #

toEncodingList :: [Delete r a] -> Encoding #

ConstrainSNames FromJSON r a => FromJSON (Delete r a) Source # 

Methods

parseJSON :: Value -> Parser (Delete r a) #

parseJSONList :: Value -> Parser [Delete r a] #

HasTables (Delete ResolvedNames a) Source # 
HasColumns (Delete ResolvedNames a) Source # 

Methods

goColumns :: Delete ResolvedNames a -> Observer Source #

HasInfo (Delete r a) Source # 

Associated Types

type Info (Delete r a) :: * Source #

Methods

getInfo :: Delete r a -> Info (Delete r a) Source #

type Rep (Delete r a) Source # 
type Info (Delete r a) Source # 
type Info (Delete r a) = a

data Truncate r a Source #

Constructors

Truncate a (TableName r a) 

Instances

ConstrainSASNames Functor r => Functor (Truncate r) Source # 

Methods

fmap :: (a -> b) -> Truncate r a -> Truncate r b #

(<$) :: a -> Truncate r b -> Truncate r a #

ConstrainSASNames Foldable r => Foldable (Truncate r) Source # 

Methods

fold :: Monoid m => Truncate r m -> m #

foldMap :: Monoid m => (a -> m) -> Truncate r a -> m #

foldr :: (a -> b -> b) -> b -> Truncate r a -> b #

foldr' :: (a -> b -> b) -> b -> Truncate r a -> b #

foldl :: (b -> a -> b) -> b -> Truncate r a -> b #

foldl' :: (b -> a -> b) -> b -> Truncate r a -> b #

foldr1 :: (a -> a -> a) -> Truncate r a -> a #

foldl1 :: (a -> a -> a) -> Truncate r a -> a #

toList :: Truncate r a -> [a] #

null :: Truncate r a -> Bool #

length :: Truncate r a -> Int #

elem :: Eq a => a -> Truncate r a -> Bool #

maximum :: Ord a => Truncate r a -> a #

minimum :: Ord a => Truncate r a -> a #

sum :: Num a => Truncate r a -> a #

product :: Num a => Truncate r a -> a #

ConstrainSASNames Traversable r => Traversable (Truncate r) Source # 

Methods

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

sequenceA :: Applicative f => Truncate r (f a) -> f (Truncate r a) #

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

sequence :: Monad m => Truncate r (m a) -> m (Truncate r a) #

ConstrainSNames Eq r a => Eq (Truncate r a) Source # 

Methods

(==) :: Truncate r a -> Truncate r a -> Bool #

(/=) :: Truncate r a -> Truncate r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (Truncate r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Truncate r a -> c (Truncate r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Truncate r a) #

toConstr :: Truncate r a -> Constr #

dataTypeOf :: Truncate r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Truncate r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Truncate r a)) #

gmapT :: (forall b. Data b => b -> b) -> Truncate r a -> Truncate r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Truncate r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Truncate r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Truncate r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Truncate r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Truncate r a -> m (Truncate r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Truncate r a -> m (Truncate r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Truncate r a -> m (Truncate r a) #

ConstrainSNames Show r a => Show (Truncate r a) Source # 

Methods

showsPrec :: Int -> Truncate r a -> ShowS #

show :: Truncate r a -> String #

showList :: [Truncate r a] -> ShowS #

Generic (Truncate r a) Source # 

Associated Types

type Rep (Truncate r a) :: * -> * #

Methods

from :: Truncate r a -> Rep (Truncate r a) x #

to :: Rep (Truncate r a) x -> Truncate r a #

ConstrainSNames ToJSON r a => ToJSON (Truncate r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (Truncate r a) Source # 
HasTables (Truncate ResolvedNames a) Source # 
HasInfo (Truncate r a) Source # 

Associated Types

type Info (Truncate r a) :: * Source #

Methods

getInfo :: Truncate r a -> Info (Truncate r a) Source #

type Rep (Truncate r a) Source # 
type Rep (Truncate r a) = D1 * (MetaData "Truncate" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "Truncate" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (TableName r a)))))
type Info (Truncate r a) Source # 
type Info (Truncate r a) = a

data CreateTable d r a Source #

Instances

ConstrainSASAll Functor d r => Functor (CreateTable d r) Source # 

Methods

fmap :: (a -> b) -> CreateTable d r a -> CreateTable d r b #

(<$) :: a -> CreateTable d r b -> CreateTable d r a #

ConstrainSASAll Foldable d r => Foldable (CreateTable d r) Source # 

Methods

fold :: Monoid m => CreateTable d r m -> m #

foldMap :: Monoid m => (a -> m) -> CreateTable d r a -> m #

foldr :: (a -> b -> b) -> b -> CreateTable d r a -> b #

foldr' :: (a -> b -> b) -> b -> CreateTable d r a -> b #

foldl :: (b -> a -> b) -> b -> CreateTable d r a -> b #

foldl' :: (b -> a -> b) -> b -> CreateTable d r a -> b #

foldr1 :: (a -> a -> a) -> CreateTable d r a -> a #

foldl1 :: (a -> a -> a) -> CreateTable d r a -> a #

toList :: CreateTable d r a -> [a] #

null :: CreateTable d r a -> Bool #

length :: CreateTable d r a -> Int #

elem :: Eq a => a -> CreateTable d r a -> Bool #

maximum :: Ord a => CreateTable d r a -> a #

minimum :: Ord a => CreateTable d r a -> a #

sum :: Num a => CreateTable d r a -> a #

product :: Num a => CreateTable d r a -> a #

ConstrainSASAll Traversable d r => Traversable (CreateTable d r) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> CreateTable d r a -> f (CreateTable d r b) #

sequenceA :: Applicative f => CreateTable d r (f a) -> f (CreateTable d r a) #

mapM :: Monad m => (a -> m b) -> CreateTable d r a -> m (CreateTable d r b) #

sequence :: Monad m => CreateTable d r (m a) -> m (CreateTable d r a) #

ConstrainSAll Eq d r a => Eq (CreateTable d r a) Source # 

Methods

(==) :: CreateTable d r a -> CreateTable d r a -> Bool #

(/=) :: CreateTable d r a -> CreateTable d r a -> Bool #

(ConstrainSAll Data d r a, Data d, Data r) => Data (CreateTable d r a) Source # 

Methods

gfoldl :: (forall b c. Data b => c (b -> c) -> b -> c c) -> (forall g. g -> c g) -> CreateTable d r a -> c (CreateTable d r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (CreateTable d r a) #

toConstr :: CreateTable d r a -> Constr #

dataTypeOf :: CreateTable d r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall b. Data b => c (t b)) -> Maybe (c (CreateTable d r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall b e. (Data b, Data e) => c (t b e)) -> Maybe (c (CreateTable d r a)) #

gmapT :: (forall b. Data b => b -> b) -> CreateTable d r a -> CreateTable d r a #

gmapQl :: (r -> r' -> r) -> r -> (forall b. Data b => b -> r') -> CreateTable d r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall b. Data b => b -> r') -> CreateTable d r a -> r #

gmapQ :: (forall b. Data b => b -> u) -> CreateTable d r a -> [u] #

gmapQi :: Int -> (forall b. Data b => b -> u) -> CreateTable d r a -> u #

gmapM :: Monad m => (forall b. Data b => b -> m b) -> CreateTable d r a -> m (CreateTable d r a) #

gmapMp :: MonadPlus m => (forall b. Data b => b -> m b) -> CreateTable d r a -> m (CreateTable d r a) #

gmapMo :: MonadPlus m => (forall b. Data b => b -> m b) -> CreateTable d r a -> m (CreateTable d r a) #

ConstrainSAll Show d r a => Show (CreateTable d r a) Source # 

Methods

showsPrec :: Int -> CreateTable d r a -> ShowS #

show :: CreateTable d r a -> String #

showList :: [CreateTable d r a] -> ShowS #

Generic (CreateTable d r a) Source # 

Associated Types

type Rep (CreateTable d r a) :: * -> * #

Methods

from :: CreateTable d r a -> Rep (CreateTable d r a) x #

to :: Rep (CreateTable d r a) x -> CreateTable d r a #

ConstrainSAll ToJSON d r a => ToJSON (CreateTable d r a) Source # 
ConstrainSAll FromJSON d r a => FromJSON (CreateTable d r a) Source # 
HasTables (CreateTable d ResolvedNames a) Source # 
HasColumns (CreateTable d ResolvedNames a) Source # 

Methods

goColumns :: CreateTable d ResolvedNames a -> Observer Source #

HasInfo (CreateTable d r a) Source # 

Associated Types

type Info (CreateTable d r a) :: * Source #

Methods

getInfo :: CreateTable d r a -> Info (CreateTable d r a) Source #

type Rep (CreateTable d r a) Source # 
type Rep (CreateTable d r a) = D1 * (MetaData "CreateTable" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "CreateTable" PrefixI True) ((:*:) * ((:*:) * (S1 * (MetaSel (Just Symbol "createTableInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((:*:) * (S1 * (MetaSel (Just Symbol "createTablePersistence") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Persistence a))) (S1 * (MetaSel (Just Symbol "createTableExternality") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Externality a))))) ((:*:) * ((:*:) * (S1 * (MetaSel (Just Symbol "createTableIfNotExists") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe a))) (S1 * (MetaSel (Just Symbol "createTableName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateTableName r a)))) ((:*:) * (S1 * (MetaSel (Just Symbol "createTableDefinition") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (TableDefinition d r a))) (S1 * (MetaSel (Just Symbol "createTableExtra") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (DialectCreateTableExtra d r a))))))))
type Info (CreateTable d r a) Source # 
type Info (CreateTable d r a) = a

data AlterTable r a Source #

Instances

ConstrainSASNames Functor r => Functor (AlterTable r) Source # 

Methods

fmap :: (a -> b) -> AlterTable r a -> AlterTable r b #

(<$) :: a -> AlterTable r b -> AlterTable r a #

ConstrainSASNames Foldable r => Foldable (AlterTable r) Source # 

Methods

fold :: Monoid m => AlterTable r m -> m #

foldMap :: Monoid m => (a -> m) -> AlterTable r a -> m #

foldr :: (a -> b -> b) -> b -> AlterTable r a -> b #

foldr' :: (a -> b -> b) -> b -> AlterTable r a -> b #

foldl :: (b -> a -> b) -> b -> AlterTable r a -> b #

foldl' :: (b -> a -> b) -> b -> AlterTable r a -> b #

foldr1 :: (a -> a -> a) -> AlterTable r a -> a #

foldl1 :: (a -> a -> a) -> AlterTable r a -> a #

toList :: AlterTable r a -> [a] #

null :: AlterTable r a -> Bool #

length :: AlterTable r a -> Int #

elem :: Eq a => a -> AlterTable r a -> Bool #

maximum :: Ord a => AlterTable r a -> a #

minimum :: Ord a => AlterTable r a -> a #

sum :: Num a => AlterTable r a -> a #

product :: Num a => AlterTable r a -> a #

ConstrainSASNames Traversable r => Traversable (AlterTable r) Source # 

Methods

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

sequenceA :: Applicative f => AlterTable r (f a) -> f (AlterTable r a) #

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

sequence :: Monad m => AlterTable r (m a) -> m (AlterTable r a) #

ConstrainSNames Eq r a => Eq (AlterTable r a) Source # 

Methods

(==) :: AlterTable r a -> AlterTable r a -> Bool #

(/=) :: AlterTable r a -> AlterTable r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (AlterTable r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AlterTable r a -> c (AlterTable r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (AlterTable r a) #

toConstr :: AlterTable r a -> Constr #

dataTypeOf :: AlterTable r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (AlterTable r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (AlterTable r a)) #

gmapT :: (forall b. Data b => b -> b) -> AlterTable r a -> AlterTable r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AlterTable r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AlterTable r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> AlterTable r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> AlterTable r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AlterTable r a -> m (AlterTable r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AlterTable r a -> m (AlterTable r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AlterTable r a -> m (AlterTable r a) #

ConstrainSNames Show r a => Show (AlterTable r a) Source # 

Methods

showsPrec :: Int -> AlterTable r a -> ShowS #

show :: AlterTable r a -> String #

showList :: [AlterTable r a] -> ShowS #

Generic (AlterTable r a) Source # 

Associated Types

type Rep (AlterTable r a) :: * -> * #

Methods

from :: AlterTable r a -> Rep (AlterTable r a) x #

to :: Rep (AlterTable r a) x -> AlterTable r a #

(ToJSON a, ToJSON (TableName r a)) => ToJSON (AlterTable r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (AlterTable r a) Source # 
HasTables (AlterTable ResolvedNames a) Source # 
HasSchemaChange (AlterTable ResolvedNames a) Source # 
HasColumns (AlterTable ResolvedNames a) Source # 

Methods

goColumns :: AlterTable ResolvedNames a -> Observer Source #

HasInfo (AlterTable r a) Source # 

Associated Types

type Info (AlterTable r a) :: * Source #

Methods

getInfo :: AlterTable r a -> Info (AlterTable r a) Source #

type Rep (AlterTable r a) Source # 
type Info (AlterTable r a) Source # 
type Info (AlterTable r a) = a

data DropTable r a Source #

Instances

ConstrainSASNames Functor r => Functor (DropTable r) Source # 

Methods

fmap :: (a -> b) -> DropTable r a -> DropTable r b #

(<$) :: a -> DropTable r b -> DropTable r a #

ConstrainSASNames Foldable r => Foldable (DropTable r) Source # 

Methods

fold :: Monoid m => DropTable r m -> m #

foldMap :: Monoid m => (a -> m) -> DropTable r a -> m #

foldr :: (a -> b -> b) -> b -> DropTable r a -> b #

foldr' :: (a -> b -> b) -> b -> DropTable r a -> b #

foldl :: (b -> a -> b) -> b -> DropTable r a -> b #

foldl' :: (b -> a -> b) -> b -> DropTable r a -> b #

foldr1 :: (a -> a -> a) -> DropTable r a -> a #

foldl1 :: (a -> a -> a) -> DropTable r a -> a #

toList :: DropTable r a -> [a] #

null :: DropTable r a -> Bool #

length :: DropTable r a -> Int #

elem :: Eq a => a -> DropTable r a -> Bool #

maximum :: Ord a => DropTable r a -> a #

minimum :: Ord a => DropTable r a -> a #

sum :: Num a => DropTable r a -> a #

product :: Num a => DropTable r a -> a #

ConstrainSASNames Traversable r => Traversable (DropTable r) Source # 

Methods

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

sequenceA :: Applicative f => DropTable r (f a) -> f (DropTable r a) #

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

sequence :: Monad m => DropTable r (m a) -> m (DropTable r a) #

ConstrainSNames Eq r a => Eq (DropTable r a) Source # 

Methods

(==) :: DropTable r a -> DropTable r a -> Bool #

(/=) :: DropTable r a -> DropTable r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (DropTable r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DropTable r a -> c (DropTable r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (DropTable r a) #

toConstr :: DropTable r a -> Constr #

dataTypeOf :: DropTable r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (DropTable r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DropTable r a)) #

gmapT :: (forall b. Data b => b -> b) -> DropTable r a -> DropTable r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DropTable r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DropTable r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> DropTable r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DropTable r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DropTable r a -> m (DropTable r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DropTable r a -> m (DropTable r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DropTable r a -> m (DropTable r a) #

ConstrainSNames Show r a => Show (DropTable r a) Source # 

Methods

showsPrec :: Int -> DropTable r a -> ShowS #

show :: DropTable r a -> String #

showList :: [DropTable r a] -> ShowS #

Generic (DropTable r a) Source # 

Associated Types

type Rep (DropTable r a) :: * -> * #

Methods

from :: DropTable r a -> Rep (DropTable r a) x #

to :: Rep (DropTable r a) x -> DropTable r a #

(ToJSON a, ToJSON (DropTableName r a)) => ToJSON (DropTable r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (DropTable r a) Source # 
HasTables (DropTable ResolvedNames a) Source # 
HasInfo (DropTable r a) Source # 

Associated Types

type Info (DropTable r a) :: * Source #

Methods

getInfo :: DropTable r a -> Info (DropTable r a) Source #

type Rep (DropTable r a) Source # 
type Rep (DropTable r a) = D1 * (MetaData "DropTable" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "DropTable" PrefixI True) ((:*:) * (S1 * (MetaSel (Just Symbol "dropTableInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((:*:) * (S1 * (MetaSel (Just Symbol "dropTableIfExists") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe a))) (S1 * (MetaSel (Just Symbol "dropTableNames") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (NonEmpty (DropTableName r a)))))))
type Info (DropTable r a) Source # 
type Info (DropTable r a) = a

data CreateView r a Source #

Instances

ConstrainSASNames Functor r => Functor (CreateView r) Source # 

Methods

fmap :: (a -> b) -> CreateView r a -> CreateView r b #

(<$) :: a -> CreateView r b -> CreateView r a #

ConstrainSASNames Foldable r => Foldable (CreateView r) Source # 

Methods

fold :: Monoid m => CreateView r m -> m #

foldMap :: Monoid m => (a -> m) -> CreateView r a -> m #

foldr :: (a -> b -> b) -> b -> CreateView r a -> b #

foldr' :: (a -> b -> b) -> b -> CreateView r a -> b #

foldl :: (b -> a -> b) -> b -> CreateView r a -> b #

foldl' :: (b -> a -> b) -> b -> CreateView r a -> b #

foldr1 :: (a -> a -> a) -> CreateView r a -> a #

foldl1 :: (a -> a -> a) -> CreateView r a -> a #

toList :: CreateView r a -> [a] #

null :: CreateView r a -> Bool #

length :: CreateView r a -> Int #

elem :: Eq a => a -> CreateView r a -> Bool #

maximum :: Ord a => CreateView r a -> a #

minimum :: Ord a => CreateView r a -> a #

sum :: Num a => CreateView r a -> a #

product :: Num a => CreateView r a -> a #

ConstrainSASNames Traversable r => Traversable (CreateView r) Source # 

Methods

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

sequenceA :: Applicative f => CreateView r (f a) -> f (CreateView r a) #

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

sequence :: Monad m => CreateView r (m a) -> m (CreateView r a) #

ConstrainSNames Eq r a => Eq (CreateView r a) Source # 

Methods

(==) :: CreateView r a -> CreateView r a -> Bool #

(/=) :: CreateView r a -> CreateView r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (CreateView r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CreateView r a -> c (CreateView r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (CreateView r a) #

toConstr :: CreateView r a -> Constr #

dataTypeOf :: CreateView r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (CreateView r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CreateView r a)) #

gmapT :: (forall b. Data b => b -> b) -> CreateView r a -> CreateView r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CreateView r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CreateView r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> CreateView r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> CreateView r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CreateView r a -> m (CreateView r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CreateView r a -> m (CreateView r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CreateView r a -> m (CreateView r a) #

ConstrainSNames Show r a => Show (CreateView r a) Source # 

Methods

showsPrec :: Int -> CreateView r a -> ShowS #

show :: CreateView r a -> String #

showList :: [CreateView r a] -> ShowS #

Generic (CreateView r a) Source # 

Associated Types

type Rep (CreateView r a) :: * -> * #

Methods

from :: CreateView r a -> Rep (CreateView r a) x #

to :: Rep (CreateView r a) x -> CreateView r a #

ConstrainSNames ToJSON r a => ToJSON (CreateView r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (CreateView r a) Source # 
HasTables (CreateView ResolvedNames a) Source # 
HasColumns (CreateView ResolvedNames a) Source # 

Methods

goColumns :: CreateView ResolvedNames a -> Observer Source #

HasInfo (CreateView r a) Source # 

Associated Types

type Info (CreateView r a) :: * Source #

Methods

getInfo :: CreateView r a -> Info (CreateView r a) Source #

type Rep (CreateView r a) Source # 
type Rep (CreateView r a) = D1 * (MetaData "CreateView" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "CreateView" PrefixI True) ((:*:) * ((:*:) * (S1 * (MetaSel (Just Symbol "createViewInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((:*:) * (S1 * (MetaSel (Just Symbol "createViewPersistence") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Persistence a))) (S1 * (MetaSel (Just Symbol "createViewIfNotExists") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe a))))) ((:*:) * (S1 * (MetaSel (Just Symbol "createViewColumns") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NonEmpty (UQColumnName a))))) ((:*:) * (S1 * (MetaSel (Just Symbol "createViewName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateTableName r a))) (S1 * (MetaSel (Just Symbol "createViewQuery") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Query r a)))))))
type Info (CreateView r a) Source # 
type Info (CreateView r a) = a

data DropView r a Source #

Constructors

DropView 

Instances

ConstrainSASNames Functor r => Functor (DropView r) Source # 

Methods

fmap :: (a -> b) -> DropView r a -> DropView r b #

(<$) :: a -> DropView r b -> DropView r a #

ConstrainSASNames Foldable r => Foldable (DropView r) Source # 

Methods

fold :: Monoid m => DropView r m -> m #

foldMap :: Monoid m => (a -> m) -> DropView r a -> m #

foldr :: (a -> b -> b) -> b -> DropView r a -> b #

foldr' :: (a -> b -> b) -> b -> DropView r a -> b #

foldl :: (b -> a -> b) -> b -> DropView r a -> b #

foldl' :: (b -> a -> b) -> b -> DropView r a -> b #

foldr1 :: (a -> a -> a) -> DropView r a -> a #

foldl1 :: (a -> a -> a) -> DropView r a -> a #

toList :: DropView r a -> [a] #

null :: DropView r a -> Bool #

length :: DropView r a -> Int #

elem :: Eq a => a -> DropView r a -> Bool #

maximum :: Ord a => DropView r a -> a #

minimum :: Ord a => DropView r a -> a #

sum :: Num a => DropView r a -> a #

product :: Num a => DropView r a -> a #

ConstrainSASNames Traversable r => Traversable (DropView r) Source # 

Methods

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

sequenceA :: Applicative f => DropView r (f a) -> f (DropView r a) #

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

sequence :: Monad m => DropView r (m a) -> m (DropView r a) #

ConstrainSNames Eq r a => Eq (DropView r a) Source # 

Methods

(==) :: DropView r a -> DropView r a -> Bool #

(/=) :: DropView r a -> DropView r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (DropView r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DropView r a -> c (DropView r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (DropView r a) #

toConstr :: DropView r a -> Constr #

dataTypeOf :: DropView r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (DropView r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DropView r a)) #

gmapT :: (forall b. Data b => b -> b) -> DropView r a -> DropView r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DropView r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DropView r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> DropView r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DropView r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DropView r a -> m (DropView r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DropView r a -> m (DropView r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DropView r a -> m (DropView r a) #

ConstrainSNames Show r a => Show (DropView r a) Source # 

Methods

showsPrec :: Int -> DropView r a -> ShowS #

show :: DropView r a -> String #

showList :: [DropView r a] -> ShowS #

Generic (DropView r a) Source # 

Associated Types

type Rep (DropView r a) :: * -> * #

Methods

from :: DropView r a -> Rep (DropView r a) x #

to :: Rep (DropView r a) x -> DropView r a #

ConstrainSNames ToJSON r a => ToJSON (DropView r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (DropView r a) Source # 
HasTables (DropView ResolvedNames a) Source # 
HasInfo (DropView r a) Source # 

Associated Types

type Info (DropView r a) :: * Source #

Methods

getInfo :: DropView r a -> Info (DropView r a) Source #

type Rep (DropView r a) Source # 
type Rep (DropView r a) = D1 * (MetaData "DropView" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "DropView" PrefixI True) ((:*:) * (S1 * (MetaSel (Just Symbol "dropViewInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((:*:) * (S1 * (MetaSel (Just Symbol "dropViewIfExists") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe a))) (S1 * (MetaSel (Just Symbol "dropViewName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (DropTableName r a))))))
type Info (DropView r a) Source # 
type Info (DropView r a) = a

data CreateSchema r a Source #

Instances

ConstrainSASNames Functor r => Functor (CreateSchema r) Source # 

Methods

fmap :: (a -> b) -> CreateSchema r a -> CreateSchema r b #

(<$) :: a -> CreateSchema r b -> CreateSchema r a #

ConstrainSASNames Foldable r => Foldable (CreateSchema r) Source # 

Methods

fold :: Monoid m => CreateSchema r m -> m #

foldMap :: Monoid m => (a -> m) -> CreateSchema r a -> m #

foldr :: (a -> b -> b) -> b -> CreateSchema r a -> b #

foldr' :: (a -> b -> b) -> b -> CreateSchema r a -> b #

foldl :: (b -> a -> b) -> b -> CreateSchema r a -> b #

foldl' :: (b -> a -> b) -> b -> CreateSchema r a -> b #

foldr1 :: (a -> a -> a) -> CreateSchema r a -> a #

foldl1 :: (a -> a -> a) -> CreateSchema r a -> a #

toList :: CreateSchema r a -> [a] #

null :: CreateSchema r a -> Bool #

length :: CreateSchema r a -> Int #

elem :: Eq a => a -> CreateSchema r a -> Bool #

maximum :: Ord a => CreateSchema r a -> a #

minimum :: Ord a => CreateSchema r a -> a #

sum :: Num a => CreateSchema r a -> a #

product :: Num a => CreateSchema r a -> a #

ConstrainSASNames Traversable r => Traversable (CreateSchema r) Source # 

Methods

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

sequenceA :: Applicative f => CreateSchema r (f a) -> f (CreateSchema r a) #

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

sequence :: Monad m => CreateSchema r (m a) -> m (CreateSchema r a) #

ConstrainSNames Eq r a => Eq (CreateSchema r a) Source # 

Methods

(==) :: CreateSchema r a -> CreateSchema r a -> Bool #

(/=) :: CreateSchema r a -> CreateSchema r a -> Bool #

(ConstrainSNames Data r a, Data r) => Data (CreateSchema r a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CreateSchema r a -> c (CreateSchema r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (CreateSchema r a) #

toConstr :: CreateSchema r a -> Constr #

dataTypeOf :: CreateSchema r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (CreateSchema r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CreateSchema r a)) #

gmapT :: (forall b. Data b => b -> b) -> CreateSchema r a -> CreateSchema r a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CreateSchema r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CreateSchema r a -> r #

gmapQ :: (forall d. Data d => d -> u) -> CreateSchema r a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> CreateSchema r a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CreateSchema r a -> m (CreateSchema r a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CreateSchema r a -> m (CreateSchema r a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CreateSchema r a -> m (CreateSchema r a) #

ConstrainSNames Show r a => Show (CreateSchema r a) Source # 
Generic (CreateSchema r a) Source # 

Associated Types

type Rep (CreateSchema r a) :: * -> * #

Methods

from :: CreateSchema r a -> Rep (CreateSchema r a) x #

to :: Rep (CreateSchema r a) x -> CreateSchema r a #

(ToJSON a, ToJSON (CreateSchemaName r a)) => ToJSON (CreateSchema r a) Source # 
ConstrainSNames FromJSON r a => FromJSON (CreateSchema r a) Source # 
HasInfo (CreateSchema r a) Source # 

Associated Types

type Info (CreateSchema r a) :: * Source #

Methods

getInfo :: CreateSchema r a -> Info (CreateSchema r a) Source #

type Rep (CreateSchema r a) Source # 
type Rep (CreateSchema r a) = D1 * (MetaData "CreateSchema" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "CreateSchema" PrefixI True) ((:*:) * (S1 * (MetaSel (Just Symbol "createSchemaInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((:*:) * (S1 * (MetaSel (Just Symbol "createSchemaIfNotExists") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe a))) (S1 * (MetaSel (Just Symbol "createSchemaName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateSchemaName r a))))))
type Info (CreateSchema r a) Source # 
type Info (CreateSchema r a) = a

data Grant a Source #

Constructors

Grant a 

Instances

Functor Grant Source # 

Methods

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

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

Foldable Grant Source # 

Methods

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

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

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

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

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

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

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

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

toList :: Grant a -> [a] #

null :: Grant a -> Bool #

length :: Grant a -> Int #

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

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

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

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

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

Traversable Grant Source # 

Methods

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

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

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

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

Eq a => Eq (Grant a) Source # 

Methods

(==) :: Grant a -> Grant a -> Bool #

(/=) :: Grant a -> Grant a -> Bool #

Data a => Data (Grant a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Grant a -> c (Grant a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Grant a) #

toConstr :: Grant a -> Constr #

dataTypeOf :: Grant a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Grant a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Grant a)) #

gmapT :: (forall b. Data b => b -> b) -> Grant a -> Grant a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Grant a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Grant a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Grant a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Grant a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Grant a -> m (Grant a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Grant a -> m (Grant a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Grant a -> m (Grant a) #

Show a => Show (Grant a) Source # 

Methods

showsPrec :: Int -> Grant a -> ShowS #

show :: Grant a -> String #

showList :: [Grant a] -> ShowS #

Generic (Grant a) Source # 

Associated Types

type Rep (Grant a) :: * -> * #

Methods

from :: Grant a -> Rep (Grant a) x #

to :: Rep (Grant a) x -> Grant a #

ToJSON a => ToJSON (Grant a) Source # 
FromJSON a => FromJSON (Grant a) Source # 
HasInfo (Grant a) Source # 

Associated Types

type Info (Grant a) :: * Source #

Methods

getInfo :: Grant a -> Info (Grant a) Source #

type Rep (Grant a) Source # 
type Rep (Grant a) = D1 * (MetaData "Grant" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "Grant" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))
type Info (Grant a) Source # 
type Info (Grant a) = a

data Revoke a Source #

Constructors

Revoke a 

Instances

Functor Revoke Source # 

Methods

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

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

Foldable Revoke Source # 

Methods

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

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

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

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

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

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

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

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

toList :: Revoke a -> [a] #

null :: Revoke a -> Bool #

length :: Revoke a -> Int #

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

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

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

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

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

Traversable Revoke Source # 

Methods

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

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

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

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

Eq a => Eq (Revoke a) Source # 

Methods

(==) :: Revoke a -> Revoke a -> Bool #

(/=) :: Revoke a -> Revoke a -> Bool #

Data a => Data (Revoke a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Revoke a -> c (Revoke a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Revoke a) #

toConstr :: Revoke a -> Constr #

dataTypeOf :: Revoke a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Revoke a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Revoke a)) #

gmapT :: (forall b. Data b => b -> b) -> Revoke a -> Revoke a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Revoke a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Revoke a -> r #

gmapQ :: (forall d. Data d => d -> u) -> Revoke a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Revoke a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Revoke a -> m (Revoke a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Revoke a -> m (Revoke a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Revoke a -> m (Revoke a) #

Show a => Show (Revoke a) Source # 

Methods

showsPrec :: Int -> Revoke a -> ShowS #

show :: Revoke a -> String #

showList :: [Revoke a] -> ShowS #

Generic (Revoke a) Source # 

Associated Types

type Rep (Revoke a) :: * -> * #

Methods

from :: Revoke a -> Rep (Revoke a) x #

to :: Rep (Revoke a) x -> Revoke a #

ToJSON a => ToJSON (Revoke a) Source # 
FromJSON a => FromJSON (Revoke a) Source # 
HasInfo (Revoke a) Source # 

Associated Types

type Info (Revoke a) :: * Source #

Methods

getInfo :: Revoke a -> Info (Revoke a) Source #

type Rep (Revoke a) Source # 
type Rep (Revoke a) = D1 * (MetaData "Revoke" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "Revoke" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))
type Info (Revoke a) Source # 
type Info (Revoke a) = a

data TableDefinition d r a Source #

Instances

ConstrainSASAll Functor d r => Functor (TableDefinition d r) Source # 

Methods

fmap :: (a -> b) -> TableDefinition d r a -> TableDefinition d r b #

(<$) :: a -> TableDefinition d r b -> TableDefinition d r a #

ConstrainSASAll Foldable d r => Foldable (TableDefinition d r) Source # 

Methods

fold :: Monoid m => TableDefinition d r m -> m #

foldMap :: Monoid m => (a -> m) -> TableDefinition d r a -> m #

foldr :: (a -> b -> b) -> b -> TableDefinition d r a -> b #

foldr' :: (a -> b -> b) -> b -> TableDefinition d r a -> b #

foldl :: (b -> a -> b) -> b -> TableDefinition d r a -> b #

foldl' :: (b -> a -> b) -> b -> TableDefinition d r a -> b #

foldr1 :: (a -> a -> a) -> TableDefinition d r a -> a #

foldl1 :: (a -> a -> a) -> TableDefinition d r a -> a #

toList :: TableDefinition d r a -> [a] #

null :: TableDefinition d r a -> Bool #

length :: TableDefinition d r a -> Int #

elem :: Eq a => a -> TableDefinition d r a -> Bool #

maximum :: Ord a => TableDefinition d r a -> a #

minimum :: Ord a => TableDefinition d r a -> a #

sum :: Num a => TableDefinition d r a -> a #

product :: Num a => TableDefinition d r a -> a #

ConstrainSASAll Traversable d r => Traversable (TableDefinition d r) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> TableDefinition d r a -> f (TableDefinition d r b) #

sequenceA :: Applicative f => TableDefinition d r (f a) -> f (TableDefinition d r a) #

mapM :: Monad m => (a -> m b) -> TableDefinition d r a -> m (TableDefinition d r b) #

sequence :: Monad m => TableDefinition d r (m a) -> m (TableDefinition d r a) #

ConstrainSAll Eq d r a => Eq (TableDefinition d r a) Source # 

Methods

(==) :: TableDefinition d r a -> TableDefinition d r a -> Bool #

(/=) :: TableDefinition d r a -> TableDefinition d r a -> Bool #

(ConstrainSAll Data d r a, Data d, Data r) => Data (TableDefinition d r a) Source # 

Methods

gfoldl :: (forall b c. Data b => c (b -> c) -> b -> c c) -> (forall g. g -> c g) -> TableDefinition d r a -> c (TableDefinition d r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (TableDefinition d r a) #

toConstr :: TableDefinition d r a -> Constr #

dataTypeOf :: TableDefinition d r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall b. Data b => c (t b)) -> Maybe (c (TableDefinition d r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall b e. (Data b, Data e) => c (t b e)) -> Maybe (c (TableDefinition d r a)) #

gmapT :: (forall b. Data b => b -> b) -> TableDefinition d r a -> TableDefinition d r a #

gmapQl :: (r -> r' -> r) -> r -> (forall b. Data b => b -> r') -> TableDefinition d r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall b. Data b => b -> r') -> TableDefinition d r a -> r #

gmapQ :: (forall b. Data b => b -> u) -> TableDefinition d r a -> [u] #

gmapQi :: Int -> (forall b. Data b => b -> u) -> TableDefinition d r a -> u #

gmapM :: Monad m => (forall b. Data b => b -> m b) -> TableDefinition d r a -> m (TableDefinition d r a) #

gmapMp :: MonadPlus m => (forall b. Data b => b -> m b) -> TableDefinition d r a -> m (TableDefinition d r a) #

gmapMo :: MonadPlus m => (forall b. Data b => b -> m b) -> TableDefinition d r a -> m (TableDefinition d r a) #

ConstrainSAll Show d r a => Show (TableDefinition d r a) Source # 
Generic (TableDefinition d r a) Source # 

Associated Types

type Rep (TableDefinition d r a) :: * -> * #

Methods

from :: TableDefinition d r a -> Rep (TableDefinition d r a) x #

to :: Rep (TableDefinition d r a) x -> TableDefinition d r a #

ConstrainSAll ToJSON d r a => ToJSON (TableDefinition d r a) Source # 
ConstrainSAll FromJSON d r a => FromJSON (TableDefinition d r a) Source # 
HasTables (TableDefinition d ResolvedNames a) Source # 
HasColumns (TableDefinition d ResolvedNames a) Source # 

Methods

goColumns :: TableDefinition d ResolvedNames a -> Observer Source #

HasInfo (TableDefinition d r a) Source # 

Associated Types

type Info (TableDefinition d r a) :: * Source #

Methods

getInfo :: TableDefinition d r a -> Info (TableDefinition d r a) Source #

type Rep (TableDefinition d r a) Source # 
type Info (TableDefinition d r a) Source # 
type Info (TableDefinition d r a) = a

data ColumnOrConstraint d r a Source #

ColumnOrConstraint Column definition or *table level* constraint Column-level constraints are carried with the column

Instances

ConstrainSASAll Functor d r => Functor (ColumnOrConstraint d r) Source # 

Methods

fmap :: (a -> b) -> ColumnOrConstraint d r a -> ColumnOrConstraint d r b #

(<$) :: a -> ColumnOrConstraint d r b -> ColumnOrConstraint d r a #

ConstrainSASAll Foldable d r => Foldable (ColumnOrConstraint d r) Source # 

Methods

fold :: Monoid m => ColumnOrConstraint d r m -> m #

foldMap :: Monoid m => (a -> m) -> ColumnOrConstraint d r a -> m #

foldr :: (a -> b -> b) -> b -> ColumnOrConstraint d r a -> b #

foldr' :: (a -> b -> b) -> b -> ColumnOrConstraint d r a -> b #

foldl :: (b -> a -> b) -> b -> ColumnOrConstraint d r a -> b #

foldl' :: (b -> a -> b) -> b -> ColumnOrConstraint d r a -> b #

foldr1 :: (a -> a -> a) -> ColumnOrConstraint d r a -> a #

foldl1 :: (a -> a -> a) -> ColumnOrConstraint d r a -> a #

toList :: ColumnOrConstraint d r a -> [a] #

null :: ColumnOrConstraint d r a -> Bool #

length :: ColumnOrConstraint d r a -> Int #

elem :: Eq a => a -> ColumnOrConstraint d r a -> Bool #

maximum :: Ord a => ColumnOrConstraint d r a -> a #

minimum :: Ord a => ColumnOrConstraint d r a -> a #

sum :: Num a => ColumnOrConstraint d r a -> a #

product :: Num a => ColumnOrConstraint d r a -> a #

ConstrainSASAll Traversable d r => Traversable (ColumnOrConstraint d r) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> ColumnOrConstraint d r a -> f (ColumnOrConstraint d r b) #

sequenceA :: Applicative f => ColumnOrConstraint d r (f a) -> f (ColumnOrConstraint d r a) #

mapM :: Monad m => (a -> m b) -> ColumnOrConstraint d r a -> m (ColumnOrConstraint d r b) #

sequence :: Monad m => ColumnOrConstraint d r (m a) -> m (ColumnOrConstraint d r a) #

ConstrainSAll Eq d r a => Eq (ColumnOrConstraint d r a) Source # 
(ConstrainSAll Data d r a, Data d, Data r) => Data (ColumnOrConstraint d r a) Source # 

Methods

gfoldl :: (forall b c. Data b => c (b -> c) -> b -> c c) -> (forall g. g -> c g) -> ColumnOrConstraint d r a -> c (ColumnOrConstraint d r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (ColumnOrConstraint d r a) #

toConstr :: ColumnOrConstraint d r a -> Constr #

dataTypeOf :: ColumnOrConstraint d r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall b. Data b => c (t b)) -> Maybe (c (ColumnOrConstraint d r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall b e. (Data b, Data e) => c (t b e)) -> Maybe (c (ColumnOrConstraint d r a)) #

gmapT :: (forall b. Data b => b -> b) -> ColumnOrConstraint d r a -> ColumnOrConstraint d r a #

gmapQl :: (r -> r' -> r) -> r -> (forall b. Data b => b -> r') -> ColumnOrConstraint d r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall b. Data b => b -> r') -> ColumnOrConstraint d r a -> r #

gmapQ :: (forall b. Data b => b -> u) -> ColumnOrConstraint d r a -> [u] #

gmapQi :: Int -> (forall b. Data b => b -> u) -> ColumnOrConstraint d r a -> u #

gmapM :: Monad m => (forall b. Data b => b -> m b) -> ColumnOrConstraint d r a -> m (ColumnOrConstraint d r a) #

gmapMp :: MonadPlus m => (forall b. Data b => b -> m b) -> ColumnOrConstraint d r a -> m (ColumnOrConstraint d r a) #

gmapMo :: MonadPlus m => (forall b. Data b => b -> m b) -> ColumnOrConstraint d r a -> m (ColumnOrConstraint d r a) #

ConstrainSAll Show d r a => Show (ColumnOrConstraint d r a) Source # 
Generic (ColumnOrConstraint d r a) Source # 

Associated Types

type Rep (ColumnOrConstraint d r a) :: * -> * #

Methods

from :: ColumnOrConstraint d r a -> Rep (ColumnOrConstraint d r a) x #

to :: Rep (ColumnOrConstraint d r a) x -> ColumnOrConstraint d r a #

ConstrainSAll ToJSON d r a => ToJSON (ColumnOrConstraint d r a) Source # 
ConstrainSAll FromJSON d r a => FromJSON (ColumnOrConstraint d r a) Source # 
HasTables (ColumnOrConstraint d ResolvedNames a) Source # 
HasColumns (ColumnOrConstraint d ResolvedNames a) Source # 
type Rep (ColumnOrConstraint d r a) Source # 
type Rep (ColumnOrConstraint d r a) = D1 * (MetaData "ColumnOrConstraint" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) ((:+:) * (C1 * (MetaCons "ColumnOrConstraintColumn" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (ColumnDefinition d r a)))) (C1 * (MetaCons "ColumnOrConstraintConstraint" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (ConstraintDefinition a)))))

data ColumnDefinition d r a Source #

Instances

ConstrainSASAll Functor d r => Functor (ColumnDefinition d r) Source # 

Methods

fmap :: (a -> b) -> ColumnDefinition d r a -> ColumnDefinition d r b #

(<$) :: a -> ColumnDefinition d r b -> ColumnDefinition d r a #

ConstrainSASAll Foldable d r => Foldable (ColumnDefinition d r) Source # 

Methods

fold :: Monoid m => ColumnDefinition d r m -> m #

foldMap :: Monoid m => (a -> m) -> ColumnDefinition d r a -> m #

foldr :: (a -> b -> b) -> b -> ColumnDefinition d r a -> b #

foldr' :: (a -> b -> b) -> b -> ColumnDefinition d r a -> b #

foldl :: (b -> a -> b) -> b -> ColumnDefinition d r a -> b #

foldl' :: (b -> a -> b) -> b -> ColumnDefinition d r a -> b #

foldr1 :: (a -> a -> a) -> ColumnDefinition d r a -> a #

foldl1 :: (a -> a -> a) -> ColumnDefinition d r a -> a #

toList :: ColumnDefinition d r a -> [a] #

null :: ColumnDefinition d r a -> Bool #

length :: ColumnDefinition d r a -> Int #

elem :: Eq a => a -> ColumnDefinition d r a -> Bool #

maximum :: Ord a => ColumnDefinition d r a -> a #

minimum :: Ord a => ColumnDefinition d r a -> a #

sum :: Num a => ColumnDefinition d r a -> a #

product :: Num a => ColumnDefinition d r a -> a #

ConstrainSASAll Traversable d r => Traversable (ColumnDefinition d r) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> ColumnDefinition d r a -> f (ColumnDefinition d r b) #

sequenceA :: Applicative f => ColumnDefinition d r (f a) -> f (ColumnDefinition d r a) #

mapM :: Monad m => (a -> m b) -> ColumnDefinition d r a -> m (ColumnDefinition d r b) #

sequence :: Monad m => ColumnDefinition d r (m a) -> m (ColumnDefinition d r a) #

ConstrainSAll Eq d r a => Eq (ColumnDefinition d r a) Source # 

Methods

(==) :: ColumnDefinition d r a -> ColumnDefinition d r a -> Bool #

(/=) :: ColumnDefinition d r a -> ColumnDefinition d r a -> Bool #

(ConstrainSAll Data d r a, Data d, Data r) => Data (ColumnDefinition d r a) Source # 

Methods

gfoldl :: (forall b c. Data b => c (b -> c) -> b -> c c) -> (forall g. g -> c g) -> ColumnDefinition d r a -> c (ColumnDefinition d r a) #

gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (ColumnDefinition d r a) #

toConstr :: ColumnDefinition d r a -> Constr #

dataTypeOf :: ColumnDefinition d r a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall b. Data b => c (t b)) -> Maybe (c (ColumnDefinition d r a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall b e. (Data b, Data e) => c (t b e)) -> Maybe (c (ColumnDefinition d r a)) #

gmapT :: (forall b. Data b => b -> b) -> ColumnDefinition d r a -> ColumnDefinition d r a #

gmapQl :: (r -> r' -> r) -> r -> (forall b. Data b => b -> r') -> ColumnDefinition d r a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall b. Data b => b -> r') -> ColumnDefinition d r a -> r #

gmapQ :: (forall b. Data b => b -> u) -> ColumnDefinition d r a -> [u] #

gmapQi :: Int -> (forall b. Data b => b -> u) -> ColumnDefinition d r a -> u #

gmapM :: Monad m => (forall b. Data b => b -> m b) -> ColumnDefinition d r a -> m (ColumnDefinition d r a) #

gmapMp :: MonadPlus m => (forall b. Data b => b -> m b) -> ColumnDefinition d r a -> m (ColumnDefinition d r a) #

gmapMo :: MonadPlus m => (forall b. Data b => b -> m b) -> ColumnDefinition d r a -> m (ColumnDefinition d r a) #

ConstrainSAll Show d r a => Show (ColumnDefinition d r a) Source # 
Generic (ColumnDefinition d r a) Source # 

Associated Types

type Rep (ColumnDefinition d r a) :: * -> * #

Methods

from :: ColumnDefinition d r a -> Rep (ColumnDefinition d r a) x #

to :: Rep (ColumnDefinition d r a) x -> ColumnDefinition d r a #

ConstrainSAll ToJSON d r a => ToJSON (ColumnDefinition d r a) Source # 
ConstrainSAll FromJSON d r a => FromJSON (ColumnDefinition d r a) Source # 
HasTables (ColumnDefinition d ResolvedNames a) Source # 
HasColumns (ColumnDefinition d ResolvedNames a) Source # 

Methods

goColumns :: ColumnDefinition d ResolvedNames a -> Observer Source #

type Rep (ColumnDefinition d r a) Source # 
type Rep (ColumnDefinition d r a) = D1 * (MetaData "ColumnDefinition" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "ColumnDefinition" PrefixI True) ((:*:) * ((:*:) * (S1 * (MetaSel (Just Symbol "columnDefinitionInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((:*:) * (S1 * (MetaSel (Just Symbol "columnDefinitionName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (UQColumnName a))) (S1 * (MetaSel (Just Symbol "columnDefinitionType") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (DataType a))))) ((:*:) * (S1 * (MetaSel (Just Symbol "columnDefinitionNull") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NullConstraint a)))) ((:*:) * (S1 * (MetaSel (Just Symbol "columnDefinitionDefault") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (Expr r a)))) (S1 * (MetaSel (Just Symbol "columnDefinitionExtra") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (DialectColumnDefinitionExtra d a))))))))

data NullConstraint a Source #

Constructors

Nullable a 
NotNull a 

Instances

Functor NullConstraint Source # 

Methods

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

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

Foldable NullConstraint Source # 

Methods

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

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

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

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

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

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

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

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

toList :: NullConstraint a -> [a] #

null :: NullConstraint a -> Bool #

length :: NullConstraint a -> Int #

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

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

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

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

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

Traversable NullConstraint Source # 

Methods

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

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

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

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

Eq a => Eq (NullConstraint a) Source # 
Data a => Data (NullConstraint a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NullConstraint a -> c (NullConstraint a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NullConstraint a) #

toConstr :: NullConstraint a -> Constr #

dataTypeOf :: NullConstraint a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (NullConstraint a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NullConstraint a)) #

gmapT :: (forall b. Data b => b -> b) -> NullConstraint a -> NullConstraint a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NullConstraint a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NullConstraint a -> r #

gmapQ :: (forall d. Data d => d -> u) -> NullConstraint a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> NullConstraint a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NullConstraint a -> m (NullConstraint a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NullConstraint a -> m (NullConstraint a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NullConstraint a -> m (NullConstraint a) #

Show a => Show (NullConstraint a) Source # 
Generic (NullConstraint a) Source # 

Associated Types

type Rep (NullConstraint a) :: * -> * #

ToJSON a => ToJSON (NullConstraint a) Source # 
FromJSON a => FromJSON (NullConstraint a) Source # 
type Rep (NullConstraint a) Source # 
type Rep (NullConstraint a) = D1 * (MetaData "NullConstraint" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) ((:+:) * (C1 * (MetaCons "Nullable" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "NotNull" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))))

data ConstraintDefinition a Source #

Instances

Functor ConstraintDefinition Source # 
Foldable ConstraintDefinition Source # 

Methods

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

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

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

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

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

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

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

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

toList :: ConstraintDefinition a -> [a] #

null :: ConstraintDefinition a -> Bool #

length :: ConstraintDefinition a -> Int #

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

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

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

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

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

Traversable ConstraintDefinition Source # 
Eq a => Eq (ConstraintDefinition a) Source # 
Data a => Data (ConstraintDefinition a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ConstraintDefinition a -> c (ConstraintDefinition a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ConstraintDefinition a) #

toConstr :: ConstraintDefinition a -> Constr #

dataTypeOf :: ConstraintDefinition a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (ConstraintDefinition a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ConstraintDefinition a)) #

gmapT :: (forall b. Data b => b -> b) -> ConstraintDefinition a -> ConstraintDefinition a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ConstraintDefinition a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ConstraintDefinition a -> r #

gmapQ :: (forall d. Data d => d -> u) -> ConstraintDefinition a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ConstraintDefinition a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ConstraintDefinition a -> m (ConstraintDefinition a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ConstraintDefinition a -> m (ConstraintDefinition a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ConstraintDefinition a -> m (ConstraintDefinition a) #

Show a => Show (ConstraintDefinition a) Source # 
Generic (ConstraintDefinition a) Source # 
ToJSON a => ToJSON (ConstraintDefinition a) Source # 
FromJSON a => FromJSON (ConstraintDefinition a) Source # 
type Rep (ConstraintDefinition a) Source # 
type Rep (ConstraintDefinition a) = D1 * (MetaData "ConstraintDefinition" "Database.Sql.Type" "queryparser-0.1.0.1-L3r1ujeH5Ss7CLthXKM008" False) (C1 * (MetaCons "ConstraintDefinition" PrefixI True) (S1 * (MetaSel (Just Symbol "constraintDefinitionInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))