Safe Haskell	None
Language	Haskell2010

Database.Sql.Vertica.Type

Documentation

data Vertica Source #

Instances

Data Vertica Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vertica -> c Vertica # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Vertica # toConstr :: Vertica -> Constr # dataTypeOf :: Vertica -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c Vertica) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Vertica) # gmapT :: (forall b. Data b => b -> b) -> Vertica -> Vertica # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vertica -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vertica -> r # gmapQ :: (forall d. Data d => d -> u) -> Vertica -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Vertica -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vertica -> m Vertica # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vertica -> m Vertica # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vertica -> m Vertica #
Dialect Vertica Source #
Associated Types type DialectCreateTableExtra Vertica r :: * -> * # type DialectColumnDefinitionExtra Vertica :: * -> * # Methods shouldCTEsShadowTables :: Proxy * Vertica -> Bool # areLcolumnsVisibleInLateralViews :: Proxy * Vertica -> Bool # getSelectScope :: Proxy * Vertica -> FromColumns a -> SelectionAliases a -> SelectScope a # resolveCreateTableExtra :: Proxy * Vertica -> DialectCreateTableExtra Vertica RawNames a -> Resolver (DialectCreateTableExtra Vertica ResolvedNames) a #
type DialectColumnDefinitionExtra Vertica Source #
type DialectColumnDefinitionExtra Vertica = Unused
type DialectCreateTableExtra Vertica r Source #
type DialectCreateTableExtra Vertica r = TableInfo r

dialectProxy :: Proxy Vertica Source #

data TableInfo r a Source #

Constructors

TableInfo
Fields tableInfoInfo :: a tableInfoOrdering :: Maybe [Order r a] tableInfoEncoding :: Maybe (TableEncoding r a) tableInfoSegmentation :: Maybe (Segmentation r a) tableInfoKSafety :: Maybe (KSafety a) tableInfoPartitioning :: Maybe (Partitioning r a)

Instances

ConstrainSASNames Functor r => Functor (TableInfo r) Source #
Methods fmap :: (a -> b) -> TableInfo r a -> TableInfo r b # (<$) :: a -> TableInfo r b -> TableInfo r a #
ConstrainSASNames Foldable r => Foldable (TableInfo r) Source #
Methods fold :: Monoid m => TableInfo r m -> m # foldMap :: Monoid m => (a -> m) -> TableInfo r a -> m # foldr :: (a -> b -> b) -> b -> TableInfo r a -> b # foldr' :: (a -> b -> b) -> b -> TableInfo r a -> b # foldl :: (b -> a -> b) -> b -> TableInfo r a -> b # foldl' :: (b -> a -> b) -> b -> TableInfo r a -> b # foldr1 :: (a -> a -> a) -> TableInfo r a -> a # foldl1 :: (a -> a -> a) -> TableInfo r a -> a # toList :: TableInfo r a -> [a] # null :: TableInfo r a -> Bool # length :: TableInfo r a -> Int # elem :: Eq a => a -> TableInfo r a -> Bool # maximum :: Ord a => TableInfo r a -> a # minimum :: Ord a => TableInfo r a -> a # sum :: Num a => TableInfo r a -> a # product :: Num a => TableInfo r a -> a #
ConstrainSASNames Traversable r => Traversable (TableInfo r) Source #
Methods traverse :: Applicative f => (a -> f b) -> TableInfo r a -> f (TableInfo r b) # sequenceA :: Applicative f => TableInfo r (f a) -> f (TableInfo r a) # mapM :: Monad m => (a -> m b) -> TableInfo r a -> m (TableInfo r b) # sequence :: Monad m => TableInfo r (m a) -> m (TableInfo r a) #
ConstrainSNames Eq r a => Eq (TableInfo r a) Source #
Methods (==) :: TableInfo r a -> TableInfo r a -> Bool # (/=) :: TableInfo r a -> TableInfo r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (TableInfo r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TableInfo r a -> c (TableInfo r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (TableInfo r a) # toConstr :: TableInfo r a -> Constr # dataTypeOf :: TableInfo r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (TableInfo r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TableInfo r a)) # gmapT :: (forall b. Data b => b -> b) -> TableInfo r a -> TableInfo r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TableInfo r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TableInfo r a -> r # gmapQ :: (forall d. Data d => d -> u) -> TableInfo r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TableInfo r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TableInfo r a -> m (TableInfo r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TableInfo r a -> m (TableInfo r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TableInfo r a -> m (TableInfo r a) #
ConstrainSNames Show r a => Show (TableInfo r a) Source #
Methods showsPrec :: Int -> TableInfo r a -> ShowS # show :: TableInfo r a -> String # showList :: [TableInfo r a] -> ShowS #
Generic (TableInfo r a) Source #
Associated Types type Rep (TableInfo r a) :: * -> * # Methods from :: TableInfo r a -> Rep (TableInfo r a) x # to :: Rep (TableInfo r a) x -> TableInfo r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (TableInfo r a) Source #
Methods toJSON :: TableInfo r a -> Value # toEncoding :: TableInfo r a -> Encoding # toJSONList :: [TableInfo r a] -> Value # toEncodingList :: [TableInfo r a] -> Encoding #
HasInfo (TableInfo r a) Source #
Associated Types type Info (TableInfo r a) :: * # Methods getInfo :: TableInfo r a -> Info (TableInfo r a) #
type Rep (TableInfo r a) Source #
type Rep (TableInfo r a) = D1 * (MetaData "TableInfo" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "TableInfo" PrefixI True) ((::) ((::) (S1 * (MetaSel (Just Symbol "tableInfoInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((::) (S1 * (MetaSel (Just Symbol "tableInfoOrdering") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe [Order r a]))) (S1 * (MetaSel (Just Symbol "tableInfoEncoding") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (TableEncoding r a)))))) ((::) (S1 * (MetaSel (Just Symbol "tableInfoSegmentation") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (Segmentation r a)))) ((::) (S1 * (MetaSel (Just Symbol "tableInfoKSafety") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (KSafety a)))) (S1 * (MetaSel (Just Symbol "tableInfoPartitioning") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (Partitioning r a))))))))
type Info (TableInfo r a) Source #
type Info (TableInfo r a) = a

resolveTableInfo :: TableInfo RawNames a -> Resolver (TableInfo ResolvedNames) a Source #

data VerticaStatement r a Source #

Constructors

VerticaStandardSqlStatement (Statement Vertica r a)
VerticaCreateProjectionStatement (CreateProjection r a)
VerticaMultipleRenameStatement (MultipleRename r a)
VerticaSetSchemaStatement (SetSchema r a)
VerticaMergeStatement (Merge r a)
VerticaUnhandledStatement a

Instances

ConstrainSASNames Functor r => Functor (VerticaStatement r) Source #
Methods fmap :: (a -> b) -> VerticaStatement r a -> VerticaStatement r b # (<$) :: a -> VerticaStatement r b -> VerticaStatement r a #
ConstrainSASNames Foldable r => Foldable (VerticaStatement r) Source #
Methods fold :: Monoid m => VerticaStatement r m -> m # foldMap :: Monoid m => (a -> m) -> VerticaStatement r a -> m # foldr :: (a -> b -> b) -> b -> VerticaStatement r a -> b # foldr' :: (a -> b -> b) -> b -> VerticaStatement r a -> b # foldl :: (b -> a -> b) -> b -> VerticaStatement r a -> b # foldl' :: (b -> a -> b) -> b -> VerticaStatement r a -> b # foldr1 :: (a -> a -> a) -> VerticaStatement r a -> a # foldl1 :: (a -> a -> a) -> VerticaStatement r a -> a # toList :: VerticaStatement r a -> [a] # null :: VerticaStatement r a -> Bool # length :: VerticaStatement r a -> Int # elem :: Eq a => a -> VerticaStatement r a -> Bool # maximum :: Ord a => VerticaStatement r a -> a # minimum :: Ord a => VerticaStatement r a -> a # sum :: Num a => VerticaStatement r a -> a # product :: Num a => VerticaStatement r a -> a #
ConstrainSASNames Traversable r => Traversable (VerticaStatement r) Source #
Methods traverse :: Applicative f => (a -> f b) -> VerticaStatement r a -> f (VerticaStatement r b) # sequenceA :: Applicative f => VerticaStatement r (f a) -> f (VerticaStatement r a) # mapM :: Monad m => (a -> m b) -> VerticaStatement r a -> m (VerticaStatement r b) # sequence :: Monad m => VerticaStatement r (m a) -> m (VerticaStatement r a) #
ConstrainSNames Eq r a => Eq (VerticaStatement r a) Source #
Methods (==) :: VerticaStatement r a -> VerticaStatement r a -> Bool # (/=) :: VerticaStatement r a -> VerticaStatement r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (VerticaStatement r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> VerticaStatement r a -> c (VerticaStatement r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (VerticaStatement r a) # toConstr :: VerticaStatement r a -> Constr # dataTypeOf :: VerticaStatement r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (VerticaStatement r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (VerticaStatement r a)) # gmapT :: (forall b. Data b => b -> b) -> VerticaStatement r a -> VerticaStatement r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> VerticaStatement r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> VerticaStatement r a -> r # gmapQ :: (forall d. Data d => d -> u) -> VerticaStatement r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> VerticaStatement r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> VerticaStatement r a -> m (VerticaStatement r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> VerticaStatement r a -> m (VerticaStatement r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> VerticaStatement r a -> m (VerticaStatement r a) #
ConstrainSNames Show r a => Show (VerticaStatement r a) Source #
Methods showsPrec :: Int -> VerticaStatement r a -> ShowS # show :: VerticaStatement r a -> String # showList :: [VerticaStatement r a] -> ShowS #
Generic (VerticaStatement r a) Source #
Associated Types type Rep (VerticaStatement r a) :: * -> * # Methods from :: VerticaStatement r a -> Rep (VerticaStatement r a) x # to :: Rep (VerticaStatement r a) x -> VerticaStatement r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (VerticaStatement r a) Source #
Methods toJSON :: VerticaStatement r a -> Value # toEncoding :: VerticaStatement r a -> Encoding # toJSONList :: [VerticaStatement r a] -> Value # toEncodingList :: [VerticaStatement r a] -> Encoding #
HasColumnLineage (VerticaStatement ResolvedNames Range) Source #
Methods getColumnLineage :: VerticaStatement ResolvedNames Range -> (RecordSet ColumnLineage, ColumnLineagePlus) #
HasColumns (VerticaStatement ResolvedNames a) Source #
Methods goColumns :: VerticaStatement ResolvedNames a -> Observer #
HasJoins (VerticaStatement ResolvedNames a) Source #
Methods getJoins :: VerticaStatement ResolvedNames a -> Set Join #
HasTableLineage (VerticaStatement ResolvedNames a) Source #
Methods getTableLineage :: VerticaStatement ResolvedNames a -> TableLineage #
HasSchemaChange (VerticaStatement ResolvedNames a) Source #
Methods getSchemaChange :: VerticaStatement ResolvedNames a -> [SchemaChange] #
HasTables (VerticaStatement ResolvedNames a) Source #
Methods goTables :: VerticaStatement ResolvedNames a -> ReaderT * UsageMode (Writer (Set TableUse)) () #
type Rep (VerticaStatement r a) Source #
type Rep (VerticaStatement r a) = D1 * (MetaData "VerticaStatement" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) ((:+:) * ((:+:) * (C1 * (MetaCons "VerticaStandardSqlStatement" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Statement Vertica r a)))) ((:+:) * (C1 * (MetaCons "VerticaCreateProjectionStatement" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (CreateProjection r a)))) (C1 * (MetaCons "VerticaMultipleRenameStatement" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (MultipleRename r a)))))) ((:+:) * (C1 * (MetaCons "VerticaSetSchemaStatement" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (SetSchema r a)))) ((:+:) * (C1 * (MetaCons "VerticaMergeStatement" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Merge r a)))) (C1 * (MetaCons "VerticaUnhandledStatement" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))))))

data TableEncoding r a Source #

Constructors

TableEncoding a [(ColumnRef r a, Encoding a)]

Instances

ConstrainSASNames Functor r => Functor (TableEncoding r) Source #
Methods fmap :: (a -> b) -> TableEncoding r a -> TableEncoding r b # (<$) :: a -> TableEncoding r b -> TableEncoding r a #
ConstrainSASNames Foldable r => Foldable (TableEncoding r) Source #
Methods fold :: Monoid m => TableEncoding r m -> m # foldMap :: Monoid m => (a -> m) -> TableEncoding r a -> m # foldr :: (a -> b -> b) -> b -> TableEncoding r a -> b # foldr' :: (a -> b -> b) -> b -> TableEncoding r a -> b # foldl :: (b -> a -> b) -> b -> TableEncoding r a -> b # foldl' :: (b -> a -> b) -> b -> TableEncoding r a -> b # foldr1 :: (a -> a -> a) -> TableEncoding r a -> a # foldl1 :: (a -> a -> a) -> TableEncoding r a -> a # toList :: TableEncoding r a -> [a] # null :: TableEncoding r a -> Bool # length :: TableEncoding r a -> Int # elem :: Eq a => a -> TableEncoding r a -> Bool # maximum :: Ord a => TableEncoding r a -> a # minimum :: Ord a => TableEncoding r a -> a # sum :: Num a => TableEncoding r a -> a # product :: Num a => TableEncoding r a -> a #
ConstrainSASNames Traversable r => Traversable (TableEncoding r) Source #
Methods traverse :: Applicative f => (a -> f b) -> TableEncoding r a -> f (TableEncoding r b) # sequenceA :: Applicative f => TableEncoding r (f a) -> f (TableEncoding r a) # mapM :: Monad m => (a -> m b) -> TableEncoding r a -> m (TableEncoding r b) # sequence :: Monad m => TableEncoding r (m a) -> m (TableEncoding r a) #
ConstrainSNames Eq r a => Eq (TableEncoding r a) Source #
Methods (==) :: TableEncoding r a -> TableEncoding r a -> Bool # (/=) :: TableEncoding r a -> TableEncoding r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (TableEncoding r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TableEncoding r a -> c (TableEncoding r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (TableEncoding r a) # toConstr :: TableEncoding r a -> Constr # dataTypeOf :: TableEncoding r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (TableEncoding r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TableEncoding r a)) # gmapT :: (forall b. Data b => b -> b) -> TableEncoding r a -> TableEncoding r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TableEncoding r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TableEncoding r a -> r # gmapQ :: (forall d. Data d => d -> u) -> TableEncoding r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TableEncoding r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TableEncoding r a -> m (TableEncoding r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TableEncoding r a -> m (TableEncoding r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TableEncoding r a -> m (TableEncoding r a) #
ConstrainSNames Show r a => Show (TableEncoding r a) Source #
Methods showsPrec :: Int -> TableEncoding r a -> ShowS # show :: TableEncoding r a -> String # showList :: [TableEncoding r a] -> ShowS #
Generic (TableEncoding r a) Source #
Associated Types type Rep (TableEncoding r a) :: * -> * # Methods from :: TableEncoding r a -> Rep (TableEncoding r a) x # to :: Rep (TableEncoding r a) x -> TableEncoding r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (TableEncoding r a) Source #
Methods toJSON :: TableEncoding r a -> Value # toEncoding :: TableEncoding r a -> Encoding # toJSONList :: [TableEncoding r a] -> Value # toEncodingList :: [TableEncoding r a] -> Encoding #
HasInfo (TableEncoding r a) Source #
Associated Types type Info (TableEncoding r a) :: * # Methods getInfo :: TableEncoding r a -> Info (TableEncoding r a) #
type Rep (TableEncoding r a) Source #
type Rep (TableEncoding r a) = D1 * (MetaData "TableEncoding" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "TableEncoding" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * [(ColumnRef r a, Encoding a)]))))
type Info (TableEncoding r a) Source #
type Info (TableEncoding r a) = a

resolveTableEncoding :: TableEncoding RawNames a -> Resolver (TableEncoding ResolvedNames) a Source #

data Segmentation r a Source #

Constructors

UnsegmentedAllNodes a
UnsegmentedOneNode a (Node a)
SegmentedBy a (Expr r a) (NodeList a)

Instances

ConstrainSASNames Functor r => Functor (Segmentation r) Source #
Methods fmap :: (a -> b) -> Segmentation r a -> Segmentation r b # (<$) :: a -> Segmentation r b -> Segmentation r a #
ConstrainSASNames Foldable r => Foldable (Segmentation r) Source #
Methods fold :: Monoid m => Segmentation r m -> m # foldMap :: Monoid m => (a -> m) -> Segmentation r a -> m # foldr :: (a -> b -> b) -> b -> Segmentation r a -> b # foldr' :: (a -> b -> b) -> b -> Segmentation r a -> b # foldl :: (b -> a -> b) -> b -> Segmentation r a -> b # foldl' :: (b -> a -> b) -> b -> Segmentation r a -> b # foldr1 :: (a -> a -> a) -> Segmentation r a -> a # foldl1 :: (a -> a -> a) -> Segmentation r a -> a # toList :: Segmentation r a -> [a] # null :: Segmentation r a -> Bool # length :: Segmentation r a -> Int # elem :: Eq a => a -> Segmentation r a -> Bool # maximum :: Ord a => Segmentation r a -> a # minimum :: Ord a => Segmentation r a -> a # sum :: Num a => Segmentation r a -> a # product :: Num a => Segmentation r a -> a #
ConstrainSASNames Traversable r => Traversable (Segmentation r) Source #
Methods traverse :: Applicative f => (a -> f b) -> Segmentation r a -> f (Segmentation r b) # sequenceA :: Applicative f => Segmentation r (f a) -> f (Segmentation r a) # mapM :: Monad m => (a -> m b) -> Segmentation r a -> m (Segmentation r b) # sequence :: Monad m => Segmentation r (m a) -> m (Segmentation r a) #
ConstrainSNames Eq r a => Eq (Segmentation r a) Source #
Methods (==) :: Segmentation r a -> Segmentation r a -> Bool # (/=) :: Segmentation r a -> Segmentation r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (Segmentation r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Segmentation r a -> c (Segmentation r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Segmentation r a) # toConstr :: Segmentation r a -> Constr # dataTypeOf :: Segmentation r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Segmentation r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Segmentation r a)) # gmapT :: (forall b. Data b => b -> b) -> Segmentation r a -> Segmentation r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Segmentation r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Segmentation r a -> r # gmapQ :: (forall d. Data d => d -> u) -> Segmentation r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Segmentation r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Segmentation r a -> m (Segmentation r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Segmentation r a -> m (Segmentation r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Segmentation r a -> m (Segmentation r a) #
ConstrainSNames Show r a => Show (Segmentation r a) Source #
Methods showsPrec :: Int -> Segmentation r a -> ShowS # show :: Segmentation r a -> String # showList :: [Segmentation r a] -> ShowS #
Generic (Segmentation r a) Source #
Associated Types type Rep (Segmentation r a) :: * -> * # Methods from :: Segmentation r a -> Rep (Segmentation r a) x # to :: Rep (Segmentation r a) x -> Segmentation r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (Segmentation r a) Source #
Methods toJSON :: Segmentation r a -> Value # toEncoding :: Segmentation r a -> Encoding # toJSONList :: [Segmentation r a] -> Value # toEncodingList :: [Segmentation r a] -> Encoding #
HasInfo (Segmentation r a) Source #
Associated Types type Info (Segmentation r a) :: * # Methods getInfo :: Segmentation r a -> Info (Segmentation r a) #
HasColumns (Segmentation ResolvedNames a) Source #
Methods goColumns :: Segmentation ResolvedNames a -> Observer #
type Rep (Segmentation r a) Source #
type Rep (Segmentation r a) = D1 * (MetaData "Segmentation" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) ((:+:) * (C1 * (MetaCons "UnsegmentedAllNodes" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) ((:+:) * (C1 * (MetaCons "UnsegmentedOneNode" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Node a))))) (C1 * (MetaCons "SegmentedBy" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Expr r a))) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (NodeList a))))))))
type Info (Segmentation r a) Source #
type Info (Segmentation r a) = a

resolveSegmentation :: Segmentation RawNames a -> Resolver (Segmentation ResolvedNames) a Source #

data Node a Source #

Constructors

Node a Text

Instances

Functor Node Source #
Methods fmap :: (a -> b) -> Node a -> Node b # (<$) :: a -> Node b -> Node a #
Foldable Node Source #
Methods fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # toList :: Node a -> [a] # null :: Node a -> Bool # length :: Node a -> Int # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # minimum :: Ord a => Node a -> a # sum :: Num a => Node a -> a # product :: Num a => Node a -> a #
Traversable Node Source #
Methods traverse :: Applicative f => (a -> f b) -> Node a -> f (Node b) # sequenceA :: Applicative f => Node (f a) -> f (Node a) # mapM :: Monad m => (a -> m b) -> Node a -> m (Node b) # sequence :: Monad m => Node (m a) -> m (Node a) #
Eq a => Eq (Node a) Source #
Methods (==) :: Node a -> Node a -> Bool # (/=) :: Node a -> Node a -> Bool #
Data a => Data (Node a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Node a -> c (Node a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Node a) # toConstr :: Node a -> Constr # dataTypeOf :: Node a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Node a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Node a)) # gmapT :: (forall b. Data b => b -> b) -> Node a -> Node a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Node a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Node a -> r # gmapQ :: (forall d. Data d => d -> u) -> Node a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Node a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Node a -> m (Node a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Node a -> m (Node a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Node a -> m (Node a) #
Show a => Show (Node a) Source #
Methods showsPrec :: Int -> Node a -> ShowS # show :: Node a -> String # showList :: [Node a] -> ShowS #
Generic (Node a) Source #
Associated Types type Rep (Node a) :: * -> * # Methods from :: Node a -> Rep (Node a) x # to :: Rep (Node a) x -> Node a #
ToJSON a => ToJSON (Node a) Source #
Methods toJSON :: Node a -> Value # toEncoding :: Node a -> Encoding # toJSONList :: [Node a] -> Value # toEncodingList :: [Node a] -> Encoding #
HasInfo (Node a) Source #
Associated Types type Info (Node a) :: * # Methods getInfo :: Node a -> Info (Node a) #
type Rep (Node a) Source #
type Rep (Node a) = D1 * (MetaData "Node" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "Node" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Text))))
type Info (Node a) Source #
type Info (Node a) = a

data NodeListOffset a Source #

Constructors

NodeListOffset a Int

Instances

Functor NodeListOffset Source #
Methods fmap :: (a -> b) -> NodeListOffset a -> NodeListOffset b # (<$) :: a -> NodeListOffset b -> NodeListOffset a #
Foldable NodeListOffset Source #
Methods fold :: Monoid m => NodeListOffset m -> m # foldMap :: Monoid m => (a -> m) -> NodeListOffset a -> m # foldr :: (a -> b -> b) -> b -> NodeListOffset a -> b # foldr' :: (a -> b -> b) -> b -> NodeListOffset a -> b # foldl :: (b -> a -> b) -> b -> NodeListOffset a -> b # foldl' :: (b -> a -> b) -> b -> NodeListOffset a -> b # foldr1 :: (a -> a -> a) -> NodeListOffset a -> a # foldl1 :: (a -> a -> a) -> NodeListOffset a -> a # toList :: NodeListOffset a -> [a] # null :: NodeListOffset a -> Bool # length :: NodeListOffset a -> Int # elem :: Eq a => a -> NodeListOffset a -> Bool # maximum :: Ord a => NodeListOffset a -> a # minimum :: Ord a => NodeListOffset a -> a # sum :: Num a => NodeListOffset a -> a # product :: Num a => NodeListOffset a -> a #
Traversable NodeListOffset Source #
Methods traverse :: Applicative f => (a -> f b) -> NodeListOffset a -> f (NodeListOffset b) # sequenceA :: Applicative f => NodeListOffset (f a) -> f (NodeListOffset a) # mapM :: Monad m => (a -> m b) -> NodeListOffset a -> m (NodeListOffset b) # sequence :: Monad m => NodeListOffset (m a) -> m (NodeListOffset a) #
Eq a => Eq (NodeListOffset a) Source #
Methods (==) :: NodeListOffset a -> NodeListOffset a -> Bool # (/=) :: NodeListOffset a -> NodeListOffset a -> Bool #
Data a => Data (NodeListOffset a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NodeListOffset a -> c (NodeListOffset a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NodeListOffset a) # toConstr :: NodeListOffset a -> Constr # dataTypeOf :: NodeListOffset a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (NodeListOffset a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NodeListOffset a)) # gmapT :: (forall b. Data b => b -> b) -> NodeListOffset a -> NodeListOffset a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NodeListOffset a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NodeListOffset a -> r # gmapQ :: (forall d. Data d => d -> u) -> NodeListOffset a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NodeListOffset a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NodeListOffset a -> m (NodeListOffset a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeListOffset a -> m (NodeListOffset a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeListOffset a -> m (NodeListOffset a) #
Show a => Show (NodeListOffset a) Source #
Methods showsPrec :: Int -> NodeListOffset a -> ShowS # show :: NodeListOffset a -> String # showList :: [NodeListOffset a] -> ShowS #
Generic (NodeListOffset a) Source #
Associated Types type Rep (NodeListOffset a) :: * -> * # Methods from :: NodeListOffset a -> Rep (NodeListOffset a) x # to :: Rep (NodeListOffset a) x -> NodeListOffset a #
ToJSON a => ToJSON (NodeListOffset a) Source #
Methods toJSON :: NodeListOffset a -> Value # toEncoding :: NodeListOffset a -> Encoding # toJSONList :: [NodeListOffset a] -> Value # toEncodingList :: [NodeListOffset a] -> Encoding #
HasInfo (NodeListOffset a) Source #
Associated Types type Info (NodeListOffset a) :: * # Methods getInfo :: NodeListOffset a -> Info (NodeListOffset a) #
type Rep (NodeListOffset a) Source #
type Rep (NodeListOffset a) = D1 * (MetaData "NodeListOffset" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "NodeListOffset" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Int))))
type Info (NodeListOffset a) Source #
type Info (NodeListOffset a) = a

data NodeList a Source #

Constructors

AllNodes a (Maybe (NodeListOffset a))
Nodes a (NonEmpty (Node a))

Instances

Functor NodeList Source #
Methods fmap :: (a -> b) -> NodeList a -> NodeList b # (<$) :: a -> NodeList b -> NodeList a #
Foldable NodeList Source #
Methods fold :: Monoid m => NodeList m -> m # foldMap :: Monoid m => (a -> m) -> NodeList a -> m # foldr :: (a -> b -> b) -> b -> NodeList a -> b # foldr' :: (a -> b -> b) -> b -> NodeList a -> b # foldl :: (b -> a -> b) -> b -> NodeList a -> b # foldl' :: (b -> a -> b) -> b -> NodeList a -> b # foldr1 :: (a -> a -> a) -> NodeList a -> a # foldl1 :: (a -> a -> a) -> NodeList a -> a # toList :: NodeList a -> [a] # null :: NodeList a -> Bool # length :: NodeList a -> Int # elem :: Eq a => a -> NodeList a -> Bool # maximum :: Ord a => NodeList a -> a # minimum :: Ord a => NodeList a -> a # sum :: Num a => NodeList a -> a # product :: Num a => NodeList a -> a #
Traversable NodeList Source #
Methods traverse :: Applicative f => (a -> f b) -> NodeList a -> f (NodeList b) # sequenceA :: Applicative f => NodeList (f a) -> f (NodeList a) # mapM :: Monad m => (a -> m b) -> NodeList a -> m (NodeList b) # sequence :: Monad m => NodeList (m a) -> m (NodeList a) #
Eq a => Eq (NodeList a) Source #
Methods (==) :: NodeList a -> NodeList a -> Bool # (/=) :: NodeList a -> NodeList a -> Bool #
Data a => Data (NodeList a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NodeList a -> c (NodeList a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NodeList a) # toConstr :: NodeList a -> Constr # dataTypeOf :: NodeList a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (NodeList a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NodeList a)) # gmapT :: (forall b. Data b => b -> b) -> NodeList a -> NodeList a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NodeList a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NodeList a -> r # gmapQ :: (forall d. Data d => d -> u) -> NodeList a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NodeList a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NodeList a -> m (NodeList a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeList a -> m (NodeList a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeList a -> m (NodeList a) #
Show a => Show (NodeList a) Source #
Methods showsPrec :: Int -> NodeList a -> ShowS # show :: NodeList a -> String # showList :: [NodeList a] -> ShowS #
Generic (NodeList a) Source #
Associated Types type Rep (NodeList a) :: * -> * # Methods from :: NodeList a -> Rep (NodeList a) x # to :: Rep (NodeList a) x -> NodeList a #
ToJSON a => ToJSON (NodeList a) Source #
Methods toJSON :: NodeList a -> Value # toEncoding :: NodeList a -> Encoding # toJSONList :: [NodeList a] -> Value # toEncodingList :: [NodeList a] -> Encoding #
HasInfo (NodeList a) Source #
Associated Types type Info (NodeList a) :: * # Methods getInfo :: NodeList a -> Info (NodeList a) #
type Rep (NodeList a) Source #
type Rep (NodeList a) = D1 * (MetaData "NodeList" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) ((:+:) * (C1 * (MetaCons "AllNodes" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NodeListOffset a)))))) (C1 * (MetaCons "Nodes" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (NonEmpty (Node a)))))))
type Info (NodeList a) Source #
type Info (NodeList a) = a

data KSafety a Source #

Constructors

KSafety a (Maybe Int)

Instances

Functor KSafety Source #
Methods fmap :: (a -> b) -> KSafety a -> KSafety b # (<$) :: a -> KSafety b -> KSafety a #
Foldable KSafety Source #
Methods fold :: Monoid m => KSafety m -> m # foldMap :: Monoid m => (a -> m) -> KSafety a -> m # foldr :: (a -> b -> b) -> b -> KSafety a -> b # foldr' :: (a -> b -> b) -> b -> KSafety a -> b # foldl :: (b -> a -> b) -> b -> KSafety a -> b # foldl' :: (b -> a -> b) -> b -> KSafety a -> b # foldr1 :: (a -> a -> a) -> KSafety a -> a # foldl1 :: (a -> a -> a) -> KSafety a -> a # toList :: KSafety a -> [a] # null :: KSafety a -> Bool # length :: KSafety a -> Int # elem :: Eq a => a -> KSafety a -> Bool # maximum :: Ord a => KSafety a -> a # minimum :: Ord a => KSafety a -> a # sum :: Num a => KSafety a -> a # product :: Num a => KSafety a -> a #
Traversable KSafety Source #
Methods traverse :: Applicative f => (a -> f b) -> KSafety a -> f (KSafety b) # sequenceA :: Applicative f => KSafety (f a) -> f (KSafety a) # mapM :: Monad m => (a -> m b) -> KSafety a -> m (KSafety b) # sequence :: Monad m => KSafety (m a) -> m (KSafety a) #
Eq a => Eq (KSafety a) Source #
Methods (==) :: KSafety a -> KSafety a -> Bool # (/=) :: KSafety a -> KSafety a -> Bool #
Data a => Data (KSafety a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> KSafety a -> c (KSafety a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (KSafety a) # toConstr :: KSafety a -> Constr # dataTypeOf :: KSafety a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (KSafety a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (KSafety a)) # gmapT :: (forall b. Data b => b -> b) -> KSafety a -> KSafety a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> KSafety a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> KSafety a -> r # gmapQ :: (forall d. Data d => d -> u) -> KSafety a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> KSafety a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> KSafety a -> m (KSafety a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> KSafety a -> m (KSafety a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> KSafety a -> m (KSafety a) #
Show a => Show (KSafety a) Source #
Methods showsPrec :: Int -> KSafety a -> ShowS # show :: KSafety a -> String # showList :: [KSafety a] -> ShowS #
Generic (KSafety a) Source #
Associated Types type Rep (KSafety a) :: * -> * # Methods from :: KSafety a -> Rep (KSafety a) x # to :: Rep (KSafety a) x -> KSafety a #
ToJSON a => ToJSON (KSafety a) Source #
Methods toJSON :: KSafety a -> Value # toEncoding :: KSafety a -> Encoding # toJSONList :: [KSafety a] -> Value # toEncodingList :: [KSafety a] -> Encoding #
HasInfo (KSafety a) Source #
Associated Types type Info (KSafety a) :: * # Methods getInfo :: KSafety a -> Info (KSafety a) #
type Rep (KSafety a) Source #
type Rep (KSafety a) = D1 * (MetaData "KSafety" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "KSafety" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe Int)))))
type Info (KSafety a) Source #
type Info (KSafety a) = a

data Partitioning r a Source #

Constructors

Partitioning a (Expr r a)

Instances

ConstrainSASNames Functor r => Functor (Partitioning r) Source #
Methods fmap :: (a -> b) -> Partitioning r a -> Partitioning r b # (<$) :: a -> Partitioning r b -> Partitioning r a #
ConstrainSASNames Foldable r => Foldable (Partitioning r) Source #
Methods fold :: Monoid m => Partitioning r m -> m # foldMap :: Monoid m => (a -> m) -> Partitioning r a -> m # foldr :: (a -> b -> b) -> b -> Partitioning r a -> b # foldr' :: (a -> b -> b) -> b -> Partitioning r a -> b # foldl :: (b -> a -> b) -> b -> Partitioning r a -> b # foldl' :: (b -> a -> b) -> b -> Partitioning r a -> b # foldr1 :: (a -> a -> a) -> Partitioning r a -> a # foldl1 :: (a -> a -> a) -> Partitioning r a -> a # toList :: Partitioning r a -> [a] # null :: Partitioning r a -> Bool # length :: Partitioning r a -> Int # elem :: Eq a => a -> Partitioning r a -> Bool # maximum :: Ord a => Partitioning r a -> a # minimum :: Ord a => Partitioning r a -> a # sum :: Num a => Partitioning r a -> a # product :: Num a => Partitioning r a -> a #
ConstrainSASNames Traversable r => Traversable (Partitioning r) Source #
Methods traverse :: Applicative f => (a -> f b) -> Partitioning r a -> f (Partitioning r b) # sequenceA :: Applicative f => Partitioning r (f a) -> f (Partitioning r a) # mapM :: Monad m => (a -> m b) -> Partitioning r a -> m (Partitioning r b) # sequence :: Monad m => Partitioning r (m a) -> m (Partitioning r a) #
ConstrainSNames Eq r a => Eq (Partitioning r a) Source #
Methods (==) :: Partitioning r a -> Partitioning r a -> Bool # (/=) :: Partitioning r a -> Partitioning r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (Partitioning r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Partitioning r a -> c (Partitioning r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Partitioning r a) # toConstr :: Partitioning r a -> Constr # dataTypeOf :: Partitioning r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Partitioning r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Partitioning r a)) # gmapT :: (forall b. Data b => b -> b) -> Partitioning r a -> Partitioning r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Partitioning r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Partitioning r a -> r # gmapQ :: (forall d. Data d => d -> u) -> Partitioning r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Partitioning r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Partitioning r a -> m (Partitioning r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Partitioning r a -> m (Partitioning r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Partitioning r a -> m (Partitioning r a) #
ConstrainSNames Show r a => Show (Partitioning r a) Source #
Methods showsPrec :: Int -> Partitioning r a -> ShowS # show :: Partitioning r a -> String # showList :: [Partitioning r a] -> ShowS #
Generic (Partitioning r a) Source #
Associated Types type Rep (Partitioning r a) :: * -> * # Methods from :: Partitioning r a -> Rep (Partitioning r a) x # to :: Rep (Partitioning r a) x -> Partitioning r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (Partitioning r a) Source #
Methods toJSON :: Partitioning r a -> Value # toEncoding :: Partitioning r a -> Encoding # toJSONList :: [Partitioning r a] -> Value # toEncodingList :: [Partitioning r a] -> Encoding #
HasInfo (Partitioning r a) Source #
Associated Types type Info (Partitioning r a) :: * # Methods getInfo :: Partitioning r a -> Info (Partitioning r a) #
type Rep (Partitioning r a) Source #
type Rep (Partitioning r a) = D1 * (MetaData "Partitioning" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "Partitioning" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Expr r a)))))
type Info (Partitioning r a) Source #
type Info (Partitioning r a) = a

resolvePartitioning :: Partitioning RawNames a -> Resolver (Partitioning ResolvedNames) a Source #

data Encoding a Source #

Constructors

EncodingAuto a
EncodingBlockDict a
EncodingBlockDictComp a
EncodingBZipComp a
EncodingCommonDeltaComp a
EncodingDeltaRangeComp a
EncodingDeltaVal a
EncodingGCDDelta a
EncodingGZipComp a
EncodingRLE a
EncodingNone a

Instances

Functor Encoding Source #
Methods fmap :: (a -> b) -> Encoding a -> Encoding b # (<$) :: a -> Encoding b -> Encoding a #
Foldable Encoding Source #
Methods fold :: Monoid m => Encoding m -> m # foldMap :: Monoid m => (a -> m) -> Encoding a -> m # foldr :: (a -> b -> b) -> b -> Encoding a -> b # foldr' :: (a -> b -> b) -> b -> Encoding a -> b # foldl :: (b -> a -> b) -> b -> Encoding a -> b # foldl' :: (b -> a -> b) -> b -> Encoding a -> b # foldr1 :: (a -> a -> a) -> Encoding a -> a # foldl1 :: (a -> a -> a) -> Encoding a -> a # toList :: Encoding a -> [a] # null :: Encoding a -> Bool # length :: Encoding a -> Int # elem :: Eq a => a -> Encoding a -> Bool # maximum :: Ord a => Encoding a -> a # minimum :: Ord a => Encoding a -> a # sum :: Num a => Encoding a -> a # product :: Num a => Encoding a -> a #
Traversable Encoding Source #
Methods traverse :: Applicative f => (a -> f b) -> Encoding a -> f (Encoding b) # sequenceA :: Applicative f => Encoding (f a) -> f (Encoding a) # mapM :: Monad m => (a -> m b) -> Encoding a -> m (Encoding b) # sequence :: Monad m => Encoding (m a) -> m (Encoding a) #
Eq a => Eq (Encoding a) Source #
Methods (==) :: Encoding a -> Encoding a -> Bool # (/=) :: Encoding a -> Encoding a -> Bool #
Data a => Data (Encoding a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Encoding a -> c (Encoding a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Encoding a) # toConstr :: Encoding a -> Constr # dataTypeOf :: Encoding a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Encoding a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Encoding a)) # gmapT :: (forall b. Data b => b -> b) -> Encoding a -> Encoding a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Encoding a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Encoding a -> r # gmapQ :: (forall d. Data d => d -> u) -> Encoding a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Encoding a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Encoding a -> m (Encoding a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Encoding a -> m (Encoding a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Encoding a -> m (Encoding a) #
Show a => Show (Encoding a) Source #
Methods showsPrec :: Int -> Encoding a -> ShowS # show :: Encoding a -> String # showList :: [Encoding a] -> ShowS #
Generic (Encoding a) Source #
Associated Types type Rep (Encoding a) :: * -> * # Methods from :: Encoding a -> Rep (Encoding a) x # to :: Rep (Encoding a) x -> Encoding a #
ToJSON a => ToJSON (Encoding a) Source #
Methods toJSON :: Encoding a -> Value # toEncoding :: Encoding a -> Encoding # toJSONList :: [Encoding a] -> Value # toEncodingList :: [Encoding a] -> Encoding #
HasInfo (Encoding a) Source #
Associated Types type Info (Encoding a) :: * # Methods getInfo :: Encoding a -> Info (Encoding a) #
type Rep (Encoding a) Source #
type Rep (Encoding a) = D1 * (MetaData "Encoding" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) ((:+:) * ((:+:) * ((:+:) * (C1 * (MetaCons "EncodingAuto" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "EncodingBlockDict" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))) ((:+:) * (C1 * (MetaCons "EncodingBlockDictComp" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) ((:+:) * (C1 * (MetaCons "EncodingBZipComp" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "EncodingCommonDeltaComp" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))))) ((:+:) * ((:+:) * (C1 * (MetaCons "EncodingDeltaRangeComp" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) ((:+:) * (C1 * (MetaCons "EncodingDeltaVal" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "EncodingGCDDelta" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))))) ((:+:) * (C1 * (MetaCons "EncodingGZipComp" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) ((:+:) * (C1 * (MetaCons "EncodingRLE" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a))) (C1 * (MetaCons "EncodingNone" PrefixI False) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)))))))
type Info (Encoding a) Source #
type Info (Encoding a) = a

data CreateProjection r a Source #

Constructors

CreateProjection
Fields createProjectionInfo :: a createProjectionIfNotExists :: Maybe a createProjectionName :: ProjectionName a createProjectionColumns :: Maybe (NonEmpty (ProjectionColumn a)) createProjectionQuery :: Query r a createProjectionSegmentation :: Maybe (Segmentation r a) createProjectionKSafety :: Maybe (KSafety a)

Instances

ConstrainSASNames Functor r => Functor (CreateProjection r) Source #
Methods fmap :: (a -> b) -> CreateProjection r a -> CreateProjection r b # (<$) :: a -> CreateProjection r b -> CreateProjection r a #
ConstrainSASNames Foldable r => Foldable (CreateProjection r) Source #
Methods fold :: Monoid m => CreateProjection r m -> m # foldMap :: Monoid m => (a -> m) -> CreateProjection r a -> m # foldr :: (a -> b -> b) -> b -> CreateProjection r a -> b # foldr' :: (a -> b -> b) -> b -> CreateProjection r a -> b # foldl :: (b -> a -> b) -> b -> CreateProjection r a -> b # foldl' :: (b -> a -> b) -> b -> CreateProjection r a -> b # foldr1 :: (a -> a -> a) -> CreateProjection r a -> a # foldl1 :: (a -> a -> a) -> CreateProjection r a -> a # toList :: CreateProjection r a -> [a] # null :: CreateProjection r a -> Bool # length :: CreateProjection r a -> Int # elem :: Eq a => a -> CreateProjection r a -> Bool # maximum :: Ord a => CreateProjection r a -> a # minimum :: Ord a => CreateProjection r a -> a # sum :: Num a => CreateProjection r a -> a # product :: Num a => CreateProjection r a -> a #
ConstrainSASNames Traversable r => Traversable (CreateProjection r) Source #
Methods traverse :: Applicative f => (a -> f b) -> CreateProjection r a -> f (CreateProjection r b) # sequenceA :: Applicative f => CreateProjection r (f a) -> f (CreateProjection r a) # mapM :: Monad m => (a -> m b) -> CreateProjection r a -> m (CreateProjection r b) # sequence :: Monad m => CreateProjection r (m a) -> m (CreateProjection r a) #
ConstrainSNames Eq r a => Eq (CreateProjection r a) Source #
Methods (==) :: CreateProjection r a -> CreateProjection r a -> Bool # (/=) :: CreateProjection r a -> CreateProjection r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (CreateProjection r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CreateProjection r a -> c (CreateProjection r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (CreateProjection r a) # toConstr :: CreateProjection r a -> Constr # dataTypeOf :: CreateProjection r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (CreateProjection r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CreateProjection r a)) # gmapT :: (forall b. Data b => b -> b) -> CreateProjection r a -> CreateProjection r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CreateProjection r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CreateProjection r a -> r # gmapQ :: (forall d. Data d => d -> u) -> CreateProjection r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CreateProjection r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CreateProjection r a -> m (CreateProjection r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CreateProjection r a -> m (CreateProjection r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CreateProjection r a -> m (CreateProjection r a) #
ConstrainSNames Show r a => Show (CreateProjection r a) Source #
Methods showsPrec :: Int -> CreateProjection r a -> ShowS # show :: CreateProjection r a -> String # showList :: [CreateProjection r a] -> ShowS #
Generic (CreateProjection r a) Source #
Associated Types type Rep (CreateProjection r a) :: * -> * # Methods from :: CreateProjection r a -> Rep (CreateProjection r a) x # to :: Rep (CreateProjection r a) x -> CreateProjection r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (CreateProjection r a) Source #
Methods toJSON :: CreateProjection r a -> Value # toEncoding :: CreateProjection r a -> Encoding # toJSONList :: [CreateProjection r a] -> Value # toEncodingList :: [CreateProjection r a] -> Encoding #
HasColumns (CreateProjection ResolvedNames a) Source #
Methods goColumns :: CreateProjection ResolvedNames a -> Observer #
type Rep (CreateProjection r a) Source #
type Rep (CreateProjection r a) = D1 * (MetaData "CreateProjection" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "CreateProjection" PrefixI True) ((::) ((::) (S1 * (MetaSel (Just Symbol "createProjectionInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((::) (S1 * (MetaSel (Just Symbol "createProjectionIfNotExists") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe a))) (S1 * (MetaSel (Just Symbol "createProjectionName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (ProjectionName a))))) ((::) ((::) (S1 * (MetaSel (Just Symbol "createProjectionColumns") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NonEmpty (ProjectionColumn a))))) (S1 * (MetaSel (Just Symbol "createProjectionQuery") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Query r a)))) ((::) (S1 * (MetaSel (Just Symbol "createProjectionSegmentation") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (Segmentation r a)))) (S1 * (MetaSel (Just Symbol "createProjectionKSafety") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (KSafety a))))))))

data ProjectionName a Source #

Constructors

ProjectionName a (Maybe (QSchemaName Maybe a)) Text

Instances

Functor ProjectionName Source #
Methods fmap :: (a -> b) -> ProjectionName a -> ProjectionName b # (<$) :: a -> ProjectionName b -> ProjectionName a #
Foldable ProjectionName Source #
Methods fold :: Monoid m => ProjectionName m -> m # foldMap :: Monoid m => (a -> m) -> ProjectionName a -> m # foldr :: (a -> b -> b) -> b -> ProjectionName a -> b # foldr' :: (a -> b -> b) -> b -> ProjectionName a -> b # foldl :: (b -> a -> b) -> b -> ProjectionName a -> b # foldl' :: (b -> a -> b) -> b -> ProjectionName a -> b # foldr1 :: (a -> a -> a) -> ProjectionName a -> a # foldl1 :: (a -> a -> a) -> ProjectionName a -> a # toList :: ProjectionName a -> [a] # null :: ProjectionName a -> Bool # length :: ProjectionName a -> Int # elem :: Eq a => a -> ProjectionName a -> Bool # maximum :: Ord a => ProjectionName a -> a # minimum :: Ord a => ProjectionName a -> a # sum :: Num a => ProjectionName a -> a # product :: Num a => ProjectionName a -> a #
Traversable ProjectionName Source #
Methods traverse :: Applicative f => (a -> f b) -> ProjectionName a -> f (ProjectionName b) # sequenceA :: Applicative f => ProjectionName (f a) -> f (ProjectionName a) # mapM :: Monad m => (a -> m b) -> ProjectionName a -> m (ProjectionName b) # sequence :: Monad m => ProjectionName (m a) -> m (ProjectionName a) #
Eq a => Eq (ProjectionName a) Source #
Methods (==) :: ProjectionName a -> ProjectionName a -> Bool # (/=) :: ProjectionName a -> ProjectionName a -> Bool #
Data a => Data (ProjectionName a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ProjectionName a -> c (ProjectionName a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ProjectionName a) # toConstr :: ProjectionName a -> Constr # dataTypeOf :: ProjectionName a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (ProjectionName a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ProjectionName a)) # gmapT :: (forall b. Data b => b -> b) -> ProjectionName a -> ProjectionName a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ProjectionName a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ProjectionName a -> r # gmapQ :: (forall d. Data d => d -> u) -> ProjectionName a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ProjectionName a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ProjectionName a -> m (ProjectionName a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjectionName a -> m (ProjectionName a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjectionName a -> m (ProjectionName a) #
Show a => Show (ProjectionName a) Source #
Methods showsPrec :: Int -> ProjectionName a -> ShowS # show :: ProjectionName a -> String # showList :: [ProjectionName a] -> ShowS #
Generic (ProjectionName a) Source #
Associated Types type Rep (ProjectionName a) :: * -> * # Methods from :: ProjectionName a -> Rep (ProjectionName a) x # to :: Rep (ProjectionName a) x -> ProjectionName a #
ToJSON a => ToJSON (ProjectionName a) Source #
Methods toJSON :: ProjectionName a -> Value # toEncoding :: ProjectionName a -> Encoding # toJSONList :: [ProjectionName a] -> Value # toEncodingList :: [ProjectionName a] -> Encoding #
HasInfo (ProjectionName a) Source #
Associated Types type Info (ProjectionName a) :: * # Methods getInfo :: ProjectionName a -> Info (ProjectionName a) #
type Rep (ProjectionName a) Source #
type Rep (ProjectionName a) = D1 * (MetaData "ProjectionName" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "ProjectionName" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (QSchemaName Maybe a)))) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Text)))))
type Info (ProjectionName a) Source #
type Info (ProjectionName a) = a

data ProjectionColumn a Source #

Constructors

ProjectionColumn
Fields projectionColumnInfo :: a projectionColumnName :: Text projectionColumnAccessRank :: Maybe (AccessRank a) projectionColumnEncoding :: Maybe (Encoding a)

Instances

Functor ProjectionColumn Source #
Methods fmap :: (a -> b) -> ProjectionColumn a -> ProjectionColumn b # (<$) :: a -> ProjectionColumn b -> ProjectionColumn a #
Foldable ProjectionColumn Source #
Methods fold :: Monoid m => ProjectionColumn m -> m # foldMap :: Monoid m => (a -> m) -> ProjectionColumn a -> m # foldr :: (a -> b -> b) -> b -> ProjectionColumn a -> b # foldr' :: (a -> b -> b) -> b -> ProjectionColumn a -> b # foldl :: (b -> a -> b) -> b -> ProjectionColumn a -> b # foldl' :: (b -> a -> b) -> b -> ProjectionColumn a -> b # foldr1 :: (a -> a -> a) -> ProjectionColumn a -> a # foldl1 :: (a -> a -> a) -> ProjectionColumn a -> a # toList :: ProjectionColumn a -> [a] # null :: ProjectionColumn a -> Bool # length :: ProjectionColumn a -> Int # elem :: Eq a => a -> ProjectionColumn a -> Bool # maximum :: Ord a => ProjectionColumn a -> a # minimum :: Ord a => ProjectionColumn a -> a # sum :: Num a => ProjectionColumn a -> a # product :: Num a => ProjectionColumn a -> a #
Traversable ProjectionColumn Source #
Methods traverse :: Applicative f => (a -> f b) -> ProjectionColumn a -> f (ProjectionColumn b) # sequenceA :: Applicative f => ProjectionColumn (f a) -> f (ProjectionColumn a) # mapM :: Monad m => (a -> m b) -> ProjectionColumn a -> m (ProjectionColumn b) # sequence :: Monad m => ProjectionColumn (m a) -> m (ProjectionColumn a) #
Eq a => Eq (ProjectionColumn a) Source #
Methods (==) :: ProjectionColumn a -> ProjectionColumn a -> Bool # (/=) :: ProjectionColumn a -> ProjectionColumn a -> Bool #
Data a => Data (ProjectionColumn a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ProjectionColumn a -> c (ProjectionColumn a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ProjectionColumn a) # toConstr :: ProjectionColumn a -> Constr # dataTypeOf :: ProjectionColumn a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (ProjectionColumn a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ProjectionColumn a)) # gmapT :: (forall b. Data b => b -> b) -> ProjectionColumn a -> ProjectionColumn a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ProjectionColumn a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ProjectionColumn a -> r # gmapQ :: (forall d. Data d => d -> u) -> ProjectionColumn a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ProjectionColumn a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ProjectionColumn a -> m (ProjectionColumn a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjectionColumn a -> m (ProjectionColumn a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjectionColumn a -> m (ProjectionColumn a) #
Show a => Show (ProjectionColumn a) Source #
Methods showsPrec :: Int -> ProjectionColumn a -> ShowS # show :: ProjectionColumn a -> String # showList :: [ProjectionColumn a] -> ShowS #
Generic (ProjectionColumn a) Source #
Associated Types type Rep (ProjectionColumn a) :: * -> * # Methods from :: ProjectionColumn a -> Rep (ProjectionColumn a) x # to :: Rep (ProjectionColumn a) x -> ProjectionColumn a #
ToJSON a => ToJSON (ProjectionColumn a) Source #
Methods toJSON :: ProjectionColumn a -> Value # toEncoding :: ProjectionColumn a -> Encoding # toJSONList :: [ProjectionColumn a] -> Value # toEncodingList :: [ProjectionColumn a] -> Encoding #
type Rep (ProjectionColumn a) Source #
type Rep (ProjectionColumn a) = D1 * (MetaData "ProjectionColumn" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "ProjectionColumn" PrefixI True) ((::) ((::) (S1 * (MetaSel (Just Symbol "projectionColumnInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Just Symbol "projectionColumnName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Text))) ((::) (S1 * (MetaSel (Just Symbol "projectionColumnAccessRank") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (AccessRank a)))) (S1 * (MetaSel (Just Symbol "projectionColumnEncoding") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (Encoding a)))))))

data AccessRank a Source #

Constructors

AccessRank a Int

Instances

Functor AccessRank Source #
Methods fmap :: (a -> b) -> AccessRank a -> AccessRank b # (<$) :: a -> AccessRank b -> AccessRank a #
Foldable AccessRank Source #
Methods fold :: Monoid m => AccessRank m -> m # foldMap :: Monoid m => (a -> m) -> AccessRank a -> m # foldr :: (a -> b -> b) -> b -> AccessRank a -> b # foldr' :: (a -> b -> b) -> b -> AccessRank a -> b # foldl :: (b -> a -> b) -> b -> AccessRank a -> b # foldl' :: (b -> a -> b) -> b -> AccessRank a -> b # foldr1 :: (a -> a -> a) -> AccessRank a -> a # foldl1 :: (a -> a -> a) -> AccessRank a -> a # toList :: AccessRank a -> [a] # null :: AccessRank a -> Bool # length :: AccessRank a -> Int # elem :: Eq a => a -> AccessRank a -> Bool # maximum :: Ord a => AccessRank a -> a # minimum :: Ord a => AccessRank a -> a # sum :: Num a => AccessRank a -> a # product :: Num a => AccessRank a -> a #
Traversable AccessRank Source #
Methods traverse :: Applicative f => (a -> f b) -> AccessRank a -> f (AccessRank b) # sequenceA :: Applicative f => AccessRank (f a) -> f (AccessRank a) # mapM :: Monad m => (a -> m b) -> AccessRank a -> m (AccessRank b) # sequence :: Monad m => AccessRank (m a) -> m (AccessRank a) #
Eq a => Eq (AccessRank a) Source #
Methods (==) :: AccessRank a -> AccessRank a -> Bool # (/=) :: AccessRank a -> AccessRank a -> Bool #
Data a => Data (AccessRank a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AccessRank a -> c (AccessRank a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (AccessRank a) # toConstr :: AccessRank a -> Constr # dataTypeOf :: AccessRank a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (AccessRank a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (AccessRank a)) # gmapT :: (forall b. Data b => b -> b) -> AccessRank a -> AccessRank a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AccessRank a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AccessRank a -> r # gmapQ :: (forall d. Data d => d -> u) -> AccessRank a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> AccessRank a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> AccessRank a -> m (AccessRank a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AccessRank a -> m (AccessRank a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AccessRank a -> m (AccessRank a) #
Ord a => Ord (AccessRank a) Source #
Methods compare :: AccessRank a -> AccessRank a -> Ordering # (<) :: AccessRank a -> AccessRank a -> Bool # (<=) :: AccessRank a -> AccessRank a -> Bool # (>) :: AccessRank a -> AccessRank a -> Bool # (>=) :: AccessRank a -> AccessRank a -> Bool # max :: AccessRank a -> AccessRank a -> AccessRank a # min :: AccessRank a -> AccessRank a -> AccessRank a #
Read a => Read (AccessRank a) Source #
Methods readsPrec :: Int -> ReadS (AccessRank a) # readList :: ReadS [AccessRank a] # readPrec :: ReadPrec (AccessRank a) # readListPrec :: ReadPrec [AccessRank a] #
Show a => Show (AccessRank a) Source #
Methods showsPrec :: Int -> AccessRank a -> ShowS # show :: AccessRank a -> String # showList :: [AccessRank a] -> ShowS #
Generic (AccessRank a) Source #
Associated Types type Rep (AccessRank a) :: * -> * # Methods from :: AccessRank a -> Rep (AccessRank a) x # to :: Rep (AccessRank a) x -> AccessRank a #
ToJSON a => ToJSON (AccessRank a) Source #
Methods toJSON :: AccessRank a -> Value # toEncoding :: AccessRank a -> Encoding # toJSONList :: [AccessRank a] -> Value # toEncodingList :: [AccessRank a] -> Encoding #
HasInfo (AccessRank a) Source #
Associated Types type Info (AccessRank a) :: * # Methods getInfo :: AccessRank a -> Info (AccessRank a) #
type Rep (AccessRank a) Source #
type Rep (AccessRank a) = D1 * (MetaData "AccessRank" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "AccessRank" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * Int))))
type Info (AccessRank a) Source #
type Info (AccessRank a) = a

data MultipleRename r a Source #

Constructors

MultipleRename a [AlterTable r a]

Instances

ConstrainSASNames Functor r => Functor (MultipleRename r) Source #
Methods fmap :: (a -> b) -> MultipleRename r a -> MultipleRename r b # (<$) :: a -> MultipleRename r b -> MultipleRename r a #
ConstrainSASNames Foldable r => Foldable (MultipleRename r) Source #
Methods fold :: Monoid m => MultipleRename r m -> m # foldMap :: Monoid m => (a -> m) -> MultipleRename r a -> m # foldr :: (a -> b -> b) -> b -> MultipleRename r a -> b # foldr' :: (a -> b -> b) -> b -> MultipleRename r a -> b # foldl :: (b -> a -> b) -> b -> MultipleRename r a -> b # foldl' :: (b -> a -> b) -> b -> MultipleRename r a -> b # foldr1 :: (a -> a -> a) -> MultipleRename r a -> a # foldl1 :: (a -> a -> a) -> MultipleRename r a -> a # toList :: MultipleRename r a -> [a] # null :: MultipleRename r a -> Bool # length :: MultipleRename r a -> Int # elem :: Eq a => a -> MultipleRename r a -> Bool # maximum :: Ord a => MultipleRename r a -> a # minimum :: Ord a => MultipleRename r a -> a # sum :: Num a => MultipleRename r a -> a # product :: Num a => MultipleRename r a -> a #
ConstrainSASNames Traversable r => Traversable (MultipleRename r) Source #
Methods traverse :: Applicative f => (a -> f b) -> MultipleRename r a -> f (MultipleRename r b) # sequenceA :: Applicative f => MultipleRename r (f a) -> f (MultipleRename r a) # mapM :: Monad m => (a -> m b) -> MultipleRename r a -> m (MultipleRename r b) # sequence :: Monad m => MultipleRename r (m a) -> m (MultipleRename r a) #
ConstrainSNames Eq r a => Eq (MultipleRename r a) Source #
Methods (==) :: MultipleRename r a -> MultipleRename r a -> Bool # (/=) :: MultipleRename r a -> MultipleRename r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (MultipleRename r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MultipleRename r a -> c (MultipleRename r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (MultipleRename r a) # toConstr :: MultipleRename r a -> Constr # dataTypeOf :: MultipleRename r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (MultipleRename r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MultipleRename r a)) # gmapT :: (forall b. Data b => b -> b) -> MultipleRename r a -> MultipleRename r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MultipleRename r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MultipleRename r a -> r # gmapQ :: (forall d. Data d => d -> u) -> MultipleRename r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MultipleRename r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MultipleRename r a -> m (MultipleRename r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MultipleRename r a -> m (MultipleRename r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MultipleRename r a -> m (MultipleRename r a) #
ConstrainSNames Show r a => Show (MultipleRename r a) Source #
Methods showsPrec :: Int -> MultipleRename r a -> ShowS # show :: MultipleRename r a -> String # showList :: [MultipleRename r a] -> ShowS #
Generic (MultipleRename r a) Source #
Associated Types type Rep (MultipleRename r a) :: * -> * # Methods from :: MultipleRename r a -> Rep (MultipleRename r a) x # to :: Rep (MultipleRename r a) x -> MultipleRename r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (MultipleRename r a) Source #
Methods toJSON :: MultipleRename r a -> Value # toEncoding :: MultipleRename r a -> Encoding # toJSONList :: [MultipleRename r a] -> Value # toEncodingList :: [MultipleRename r a] -> Encoding #
HasInfo (MultipleRename r a) Source #
Associated Types type Info (MultipleRename r a) :: * # Methods getInfo :: MultipleRename r a -> Info (MultipleRename r a) #
HasSchemaChange (MultipleRename ResolvedNames a) Source #
Methods getSchemaChange :: MultipleRename ResolvedNames a -> [SchemaChange] #
HasTables (MultipleRename ResolvedNames a) Source #
Methods goTables :: MultipleRename ResolvedNames a -> ReaderT * UsageMode (Writer (Set TableUse)) () #
type Rep (MultipleRename r a) Source #
type Rep (MultipleRename r a) = D1 * (MetaData "MultipleRename" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "MultipleRename" PrefixI False) ((::) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * [AlterTable r a]))))
type Info (MultipleRename r a) Source #
type Info (MultipleRename r a) = a

data SetSchema r a Source #

Constructors

SetSchema
Fields setSchemaInfo :: a setSchemaTable :: TableName r a setSchemaName :: SchemaName r a

Instances

ConstrainSASNames Functor r => Functor (SetSchema r) Source #
Methods fmap :: (a -> b) -> SetSchema r a -> SetSchema r b # (<$) :: a -> SetSchema r b -> SetSchema r a #
ConstrainSASNames Foldable r => Foldable (SetSchema r) Source #
Methods fold :: Monoid m => SetSchema r m -> m # foldMap :: Monoid m => (a -> m) -> SetSchema r a -> m # foldr :: (a -> b -> b) -> b -> SetSchema r a -> b # foldr' :: (a -> b -> b) -> b -> SetSchema r a -> b # foldl :: (b -> a -> b) -> b -> SetSchema r a -> b # foldl' :: (b -> a -> b) -> b -> SetSchema r a -> b # foldr1 :: (a -> a -> a) -> SetSchema r a -> a # foldl1 :: (a -> a -> a) -> SetSchema r a -> a # toList :: SetSchema r a -> [a] # null :: SetSchema r a -> Bool # length :: SetSchema r a -> Int # elem :: Eq a => a -> SetSchema r a -> Bool # maximum :: Ord a => SetSchema r a -> a # minimum :: Ord a => SetSchema r a -> a # sum :: Num a => SetSchema r a -> a # product :: Num a => SetSchema r a -> a #
ConstrainSASNames Traversable r => Traversable (SetSchema r) Source #
Methods traverse :: Applicative f => (a -> f b) -> SetSchema r a -> f (SetSchema r b) # sequenceA :: Applicative f => SetSchema r (f a) -> f (SetSchema r a) # mapM :: Monad m => (a -> m b) -> SetSchema r a -> m (SetSchema r b) # sequence :: Monad m => SetSchema r (m a) -> m (SetSchema r a) #
ConstrainSNames Eq r a => Eq (SetSchema r a) Source #
Methods (==) :: SetSchema r a -> SetSchema r a -> Bool # (/=) :: SetSchema r a -> SetSchema r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (SetSchema r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SetSchema r a -> c (SetSchema r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (SetSchema r a) # toConstr :: SetSchema r a -> Constr # dataTypeOf :: SetSchema r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (SetSchema r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SetSchema r a)) # gmapT :: (forall b. Data b => b -> b) -> SetSchema r a -> SetSchema r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SetSchema r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SetSchema r a -> r # gmapQ :: (forall d. Data d => d -> u) -> SetSchema r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SetSchema r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SetSchema r a -> m (SetSchema r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SetSchema r a -> m (SetSchema r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SetSchema r a -> m (SetSchema r a) #
ConstrainSNames Show r a => Show (SetSchema r a) Source #
Methods showsPrec :: Int -> SetSchema r a -> ShowS # show :: SetSchema r a -> String # showList :: [SetSchema r a] -> ShowS #
Generic (SetSchema r a) Source #
Associated Types type Rep (SetSchema r a) :: * -> * # Methods from :: SetSchema r a -> Rep (SetSchema r a) x # to :: Rep (SetSchema r a) x -> SetSchema r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (SetSchema r a) Source #
Methods toJSON :: SetSchema r a -> Value # toEncoding :: SetSchema r a -> Encoding # toJSONList :: [SetSchema r a] -> Value # toEncodingList :: [SetSchema r a] -> Encoding #
HasInfo (SetSchema r a) Source #
Associated Types type Info (SetSchema r a) :: * # Methods getInfo :: SetSchema r a -> Info (SetSchema r a) #
HasSchemaChange (SetSchema ResolvedNames a) Source #
Methods getSchemaChange :: SetSchema ResolvedNames a -> [SchemaChange] #
type Rep (SetSchema r a) Source #
type Rep (SetSchema r a) = D1 * (MetaData "SetSchema" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "SetSchema" PrefixI True) ((::) (S1 * (MetaSel (Just Symbol "setSchemaInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) ((::) (S1 * (MetaSel (Just Symbol "setSchemaTable") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (TableName r a))) (S1 * (MetaSel (Just Symbol "setSchemaName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (SchemaName r a))))))
type Info (SetSchema r a) Source #
type Info (SetSchema r a) = a

data Merge r a Source #

Constructors

Merge

Fields

mergeInfo :: a
mergeTargetTable :: TableName r a
mergeTargetAlias :: Maybe (TableAlias a)
mergeSourceTable :: TableName r a
mergeSourceAlias :: Maybe (TableAlias a)
mergeCondition :: Expr r a
mergeUpdateDirective :: Maybe (NonEmpty (ColumnRef r a, DefaultExpr r a))
mergeInsertDirectiveColumns :: Maybe (NonEmpty (ColumnRef r a))
mergeInsertDirectiveValues :: Maybe (NonEmpty (DefaultExpr r a))

Instances

ConstrainSASNames Functor r => Functor (Merge r) Source #
Methods fmap :: (a -> b) -> Merge r a -> Merge r b # (<$) :: a -> Merge r b -> Merge r a #
ConstrainSASNames Foldable r => Foldable (Merge r) Source #
Methods fold :: Monoid m => Merge r m -> m # foldMap :: Monoid m => (a -> m) -> Merge r a -> m # foldr :: (a -> b -> b) -> b -> Merge r a -> b # foldr' :: (a -> b -> b) -> b -> Merge r a -> b # foldl :: (b -> a -> b) -> b -> Merge r a -> b # foldl' :: (b -> a -> b) -> b -> Merge r a -> b # foldr1 :: (a -> a -> a) -> Merge r a -> a # foldl1 :: (a -> a -> a) -> Merge r a -> a # toList :: Merge r a -> [a] # null :: Merge r a -> Bool # length :: Merge r a -> Int # elem :: Eq a => a -> Merge r a -> Bool # maximum :: Ord a => Merge r a -> a # minimum :: Ord a => Merge r a -> a # sum :: Num a => Merge r a -> a # product :: Num a => Merge r a -> a #
ConstrainSASNames Traversable r => Traversable (Merge r) Source #
Methods traverse :: Applicative f => (a -> f b) -> Merge r a -> f (Merge r b) # sequenceA :: Applicative f => Merge r (f a) -> f (Merge r a) # mapM :: Monad m => (a -> m b) -> Merge r a -> m (Merge r b) # sequence :: Monad m => Merge r (m a) -> m (Merge r a) #
ConstrainSNames Eq r a => Eq (Merge r a) Source #
Methods (==) :: Merge r a -> Merge r a -> Bool # (/=) :: Merge r a -> Merge r a -> Bool #
(ConstrainSNames Data r a, Data r) => Data (Merge r a) Source #
Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Merge r a -> c (Merge r a) # gunfold :: (forall b c. Data b => c (b -> c) -> c c) -> (forall b. b -> c b) -> Constr -> c (Merge r a) # toConstr :: Merge r a -> Constr # dataTypeOf :: Merge r a -> DataType # dataCast1 :: Typeable (* -> ) t => (forall d. Data d => c (t d)) -> Maybe (c (Merge r a)) # dataCast2 :: Typeable ( -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Merge r a)) # gmapT :: (forall b. Data b => b -> b) -> Merge r a -> Merge r a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Merge r a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Merge r a -> r # gmapQ :: (forall d. Data d => d -> u) -> Merge r a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Merge r a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Merge r a -> m (Merge r a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Merge r a -> m (Merge r a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Merge r a -> m (Merge r a) #
ConstrainSNames Show r a => Show (Merge r a) Source #
Methods showsPrec :: Int -> Merge r a -> ShowS # show :: Merge r a -> String # showList :: [Merge r a] -> ShowS #
Generic (Merge r a) Source #
Associated Types type Rep (Merge r a) :: * -> * # Methods from :: Merge r a -> Rep (Merge r a) x # to :: Rep (Merge r a) x -> Merge r a #
(ConstrainSNames ToJSON r a, ToJSON a) => ToJSON (Merge r a) Source #
Methods toJSON :: Merge r a -> Value # toEncoding :: Merge r a -> Encoding # toJSONList :: [Merge r a] -> Value # toEncodingList :: [Merge r a] -> Encoding #
HasInfo (Merge r a) Source #
Associated Types type Info (Merge r a) :: * # Methods getInfo :: Merge r a -> Info (Merge r a) #
HasColumns (Merge ResolvedNames a) Source #
Methods goColumns :: Merge ResolvedNames a -> Observer #
HasTables (Merge ResolvedNames a) Source #
Methods goTables :: Merge ResolvedNames a -> ReaderT * UsageMode (Writer (Set TableUse)) () #
type Rep (Merge r a) Source #
type Rep (Merge r a) = D1 * (MetaData "Merge" "Database.Sql.Vertica.Type" "queryparser-vertica-0.1.0.1-BRTwaTAwPea1JjOchNWIDS" False) (C1 * (MetaCons "Merge" PrefixI True) ((::) ((::) ((::) (S1 * (MetaSel (Just Symbol "mergeInfo") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * a)) (S1 * (MetaSel (Just Symbol "mergeTargetTable") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (TableName r a)))) ((::) (S1 * (MetaSel (Just Symbol "mergeTargetAlias") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (TableAlias a)))) (S1 * (MetaSel (Just Symbol "mergeSourceTable") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (TableName r a))))) ((::) ((::) (S1 * (MetaSel (Just Symbol "mergeSourceAlias") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (TableAlias a)))) (S1 * (MetaSel (Just Symbol "mergeCondition") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Expr r a)))) ((::) (S1 * (MetaSel (Just Symbol "mergeUpdateDirective") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NonEmpty (ColumnRef r a, DefaultExpr r a))))) ((::) (S1 * (MetaSel (Just Symbol "mergeInsertDirectiveColumns") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NonEmpty (ColumnRef r a))))) (S1 * (MetaSel (Just Symbol "mergeInsertDirectiveValues") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Maybe (NonEmpty (DefaultExpr r a))))))))))
type Info (Merge r a) Source #
type Info (Merge r a) = a

decomposeMerge :: forall d a. Merge ResolvedNames a -> NonEmpty (Statement d ResolvedNames a) Source #

resolveVerticaStatement :: VerticaStatement RawNames a -> Resolver (VerticaStatement ResolvedNames) a Source #

resolveMultipleRename :: MultipleRename RawNames a -> Resolver (MultipleRename ResolvedNames) a Source #

resolveSetSchema :: SetSchema RawNames a -> Resolver (SetSchema ResolvedNames) a Source #

typeExample :: () Source #