2022-02-08 12:24:34 +03:00
|
|
|
-- | Postgres SQL DML
|
|
|
|
--
|
|
|
|
-- Provide types and combinators for defining Postgres SQL queries and mutations.
|
2021-11-04 19:08:33 +03:00
|
|
|
module Hasura.Backends.Postgres.SQL.DML
|
2022-07-18 12:44:17 +03:00
|
|
|
( ColumnAlias (..),
|
|
|
|
TableAlias (..),
|
2021-11-04 19:08:33 +03:00
|
|
|
BinOp (AndOp, OrOp),
|
|
|
|
BoolExp (..),
|
2023-01-27 17:36:35 +03:00
|
|
|
TopLevelCTE (CTEDelete, CTEInsert, CTESelect, CTEUpdate, CTEUnsafeRawSQL),
|
2023-02-28 14:17:08 +03:00
|
|
|
InnerCTE (..),
|
2021-11-04 19:08:33 +03:00
|
|
|
CompareOp (SContainedIn, SContains, SEQ, SGT, SGTE, SHasKey, SHasKeysAll, SHasKeysAny, SILIKE, SIREGEX, SLIKE, SLT, SLTE, SMatchesFulltext, SNE, SNILIKE, SNIREGEX, SNLIKE, SNREGEX, SNSIMILAR, SREGEX, SSIMILAR),
|
|
|
|
CountType (CTDistinct, CTSimple, CTStar),
|
|
|
|
DistinctExpr (DistinctOn, DistinctSimple),
|
|
|
|
Extractor (..),
|
|
|
|
FromExp (..),
|
|
|
|
FromItem (..),
|
|
|
|
FunctionAlias (FunctionAlias),
|
2022-07-22 18:27:42 +03:00
|
|
|
FunctionDefinitionListItem (..),
|
2021-11-04 19:08:33 +03:00
|
|
|
FunctionArgs (FunctionArgs),
|
|
|
|
FunctionExp (FunctionExp),
|
|
|
|
GroupByExp (GroupByExp),
|
|
|
|
HavingExp (HavingExp),
|
|
|
|
JoinCond (..),
|
|
|
|
JoinExpr (JoinExpr),
|
|
|
|
JoinType (Inner, LeftOuter),
|
|
|
|
Lateral (Lateral),
|
|
|
|
LimitExp (LimitExp),
|
2022-07-18 12:44:17 +03:00
|
|
|
NullsOrder (NullsFirst, NullsLast),
|
2021-11-04 19:08:33 +03:00
|
|
|
OffsetExp (OffsetExp),
|
|
|
|
OrderByExp (..),
|
2022-07-18 12:44:17 +03:00
|
|
|
OrderByItem (OrderByItem, oExpression),
|
2021-11-04 19:08:33 +03:00
|
|
|
OrderType (OTAsc, OTDesc),
|
|
|
|
QIdentifier (QIdentifier),
|
|
|
|
Qual (QualTable, QualVar, QualifiedIdentifier),
|
|
|
|
RetExp (RetExp),
|
|
|
|
SQLConflict (..),
|
|
|
|
SQLConflictTarget (SQLColumn, SQLConstraint),
|
|
|
|
SQLDelete (SQLDelete),
|
|
|
|
SQLExp (..),
|
|
|
|
SQLInsert (SQLInsert, siCols, siConflict, siRet, siTable, siValues),
|
|
|
|
SQLOp (SQLOp),
|
2022-05-03 11:58:56 +03:00
|
|
|
ColumnOp (..),
|
2022-07-18 18:15:34 +03:00
|
|
|
SQLUpdate (..),
|
2021-11-04 19:08:33 +03:00
|
|
|
Select (Select, selCTEs, selDistinct, selExtr, selFrom, selLimit, selOffset, selOrderBy, selWhere),
|
|
|
|
SelectWith,
|
2023-01-27 17:36:35 +03:00
|
|
|
SelectWithG (..),
|
2021-11-04 19:08:33 +03:00
|
|
|
SetExp (SetExp),
|
|
|
|
SetExpItem (..),
|
|
|
|
TupleExp (TupleExp),
|
|
|
|
TypeAnn (TypeAnn),
|
|
|
|
ValuesExp (ValuesExp),
|
|
|
|
WhereFrag (WhereFrag),
|
2022-09-22 16:56:50 +03:00
|
|
|
dummySelectList,
|
2021-11-04 19:08:33 +03:00
|
|
|
applyJsonBuildArray,
|
|
|
|
applyJsonBuildObj,
|
|
|
|
applyRowToJson,
|
2022-07-19 09:55:42 +03:00
|
|
|
applyUppercase,
|
2021-11-04 19:08:33 +03:00
|
|
|
boolTypeAnn,
|
|
|
|
buildUpsertSetExp,
|
|
|
|
columnDefaultValue,
|
|
|
|
countStar,
|
|
|
|
handleIfNull,
|
|
|
|
incOp,
|
|
|
|
int64ToSQLExp,
|
|
|
|
intToSQLExp,
|
|
|
|
intTypeAnn,
|
|
|
|
jsonTypeAnn,
|
|
|
|
jsonbConcatOp,
|
|
|
|
jsonbDeleteAtPathOp,
|
|
|
|
jsonbDeleteOp,
|
|
|
|
jsonbPathOp,
|
|
|
|
jsonbTypeAnn,
|
|
|
|
mkExists,
|
|
|
|
mkExtr,
|
|
|
|
mkFunctionAlias,
|
|
|
|
mkIdenFromExp,
|
|
|
|
mkLateralFromItem,
|
|
|
|
mkQIdenExp,
|
2022-09-16 17:59:23 +03:00
|
|
|
mkQIdentifier,
|
2021-11-04 19:08:33 +03:00
|
|
|
mkQIdentifierTable,
|
|
|
|
mkQual,
|
|
|
|
mkRowExp,
|
2022-09-16 17:59:23 +03:00
|
|
|
mkIdentifierSQLExp,
|
2021-11-04 19:08:33 +03:00
|
|
|
mkSIdenExp,
|
|
|
|
mkSQLOpExp,
|
|
|
|
mkSelFromExp,
|
|
|
|
mkSelFromItem,
|
|
|
|
mkSelect,
|
|
|
|
mkSelectWithFromItem,
|
|
|
|
mkSimpleFromExp,
|
|
|
|
mkTypeAnn,
|
|
|
|
mulOp,
|
|
|
|
numericTypeAnn,
|
|
|
|
returningStar,
|
|
|
|
selectStar,
|
|
|
|
selectStar',
|
|
|
|
simplifyBoolExp,
|
|
|
|
textArrTypeAnn,
|
|
|
|
textTypeAnn,
|
2022-10-11 13:42:15 +03:00
|
|
|
mkColumnAlias,
|
2022-10-05 13:03:36 +03:00
|
|
|
mkTableAlias,
|
2022-07-18 12:44:17 +03:00
|
|
|
toTableAlias,
|
2022-10-05 13:03:36 +03:00
|
|
|
tableAliasToIdentifier,
|
2022-07-18 12:44:17 +03:00
|
|
|
toColumnAlias,
|
2022-10-11 13:42:15 +03:00
|
|
|
tableIdentifierToColumnAlias,
|
2021-11-04 19:08:33 +03:00
|
|
|
)
|
|
|
|
where
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-11-12 12:25:48 +03:00
|
|
|
import Data.Aeson qualified as J
|
|
|
|
import Data.Aeson.Casing qualified as J
|
2023-04-26 18:42:13 +03:00
|
|
|
import Data.HashMap.Strict qualified as HashMap
|
2021-06-10 19:13:20 +03:00
|
|
|
import Data.Int (Int64)
|
2020-11-12 12:25:48 +03:00
|
|
|
import Data.String (fromString)
|
2022-10-11 13:42:15 +03:00
|
|
|
import Data.Text (pack)
|
2020-10-22 23:42:27 +03:00
|
|
|
import Data.Text.Extended
|
2020-10-27 16:53:49 +03:00
|
|
|
import Hasura.Backends.Postgres.SQL.Types
|
2023-04-13 19:10:38 +03:00
|
|
|
import Hasura.NativeQuery.Metadata
|
2018-06-27 16:11:32 +03:00
|
|
|
import Hasura.Prelude
|
2020-08-27 19:36:39 +03:00
|
|
|
import Hasura.SQL.Types
|
2020-11-12 12:25:48 +03:00
|
|
|
import Text.Builder qualified as TB
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | An select statement that does not require mutation CTEs.
|
|
|
|
--
|
|
|
|
-- See 'SelectWithG' or 'SelectWith' for select statements with mutations as CTEs.
|
2018-06-27 16:11:32 +03:00
|
|
|
data Select = Select
|
2020-05-13 11:09:44 +03:00
|
|
|
{ -- | Unlike 'SelectWith', does not allow data-modifying statements (as those are only allowed at
|
|
|
|
-- the top level of a query).
|
2023-02-28 14:17:08 +03:00
|
|
|
selCTEs :: [(TableAlias, InnerCTE)],
|
2022-07-29 17:05:03 +03:00
|
|
|
selDistinct :: Maybe DistinctExpr,
|
|
|
|
selExtr :: [Extractor],
|
|
|
|
selFrom :: Maybe FromExp,
|
|
|
|
selWhere :: Maybe WhereFrag,
|
|
|
|
selGroupBy :: Maybe GroupByExp,
|
|
|
|
selHaving :: Maybe HavingExp,
|
|
|
|
selOrderBy :: Maybe OrderByExp,
|
|
|
|
selLimit :: Maybe LimitExp,
|
|
|
|
selOffset :: Maybe OffsetExp
|
2019-12-13 00:46:33 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData Select
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable Select
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | An empty select statement.
|
2018-06-27 16:11:32 +03:00
|
|
|
mkSelect :: Select
|
2020-05-13 11:09:44 +03:00
|
|
|
mkSelect =
|
|
|
|
Select
|
|
|
|
[]
|
|
|
|
Nothing
|
|
|
|
[]
|
2018-06-27 16:11:32 +03:00
|
|
|
Nothing
|
|
|
|
Nothing
|
|
|
|
Nothing
|
|
|
|
Nothing
|
|
|
|
Nothing
|
|
|
|
Nothing
|
2021-09-24 01:56:37 +03:00
|
|
|
Nothing
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-09-22 16:56:50 +03:00
|
|
|
-- | A dummy select list to avoid an empty select list, which doesn't work for cockroach db.
|
|
|
|
-- This is just the value @1@ without an alias.
|
|
|
|
dummySelectList :: [Extractor]
|
|
|
|
dummySelectList = [Extractor (SEUnsafe "1") Nothing]
|
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
newtype LimitExp
|
|
|
|
= LimitExp SQLExp
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL LimitExp where
|
|
|
|
toSQL (LimitExp se) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"LIMIT" <~> toSQL se
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype OffsetExp
|
|
|
|
= OffsetExp SQLExp
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL OffsetExp where
|
|
|
|
toSQL (OffsetExp se) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"OFFSET" <~> toSQL se
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype OrderByExp
|
2020-06-08 15:13:01 +03:00
|
|
|
= OrderByExp (NonEmpty OrderByItem)
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
data OrderByItem = OrderByItem
|
2022-07-29 17:05:03 +03:00
|
|
|
{ oExpression :: SQLExp,
|
|
|
|
oOrdering :: Maybe OrderType,
|
|
|
|
oNullsOrder :: Maybe NullsOrder
|
2019-12-13 00:46:33 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData OrderByItem
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable OrderByItem
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL OrderByItem where
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL (OrderByItem expr ordering nullsOrder) =
|
|
|
|
toSQL expr <~> toSQL ordering <~> toSQL nullsOrder
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | Order by ascending or descending
|
2019-12-13 00:46:33 +03:00
|
|
|
data OrderType = OTAsc | OTDesc
|
2020-11-26 16:57:03 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData OrderType
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable OrderType
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL OrderType where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL OTAsc = "ASC"
|
|
|
|
toSQL OTDesc = "DESC"
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-11-12 12:25:48 +03:00
|
|
|
instance J.FromJSON OrderType where
|
|
|
|
parseJSON = J.genericParseJSON $ J.defaultOptions {J.constructorTagModifier = J.snakeCase . drop 2}
|
|
|
|
|
|
|
|
instance J.ToJSON OrderType where
|
|
|
|
toJSON = J.genericToJSON $ J.defaultOptions {J.constructorTagModifier = J.snakeCase . drop 2}
|
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
data NullsOrder
|
2022-07-18 12:44:17 +03:00
|
|
|
= NullsFirst
|
|
|
|
| NullsLast
|
2020-11-26 16:57:03 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData NullsOrder
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable NullsOrder
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL NullsOrder where
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL NullsFirst = "NULLS FIRST"
|
|
|
|
toSQL NullsLast = "NULLS LAST"
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-11-12 12:25:48 +03:00
|
|
|
instance J.FromJSON NullsOrder where
|
2022-08-15 18:41:28 +03:00
|
|
|
-- Todo: write a proper parser https://github.com/hasura/graphql-engine-mono/issues/5484
|
|
|
|
parseJSON = J.genericParseJSON $ J.defaultOptions {J.constructorTagModifier = J.snakeCase . drop 5}
|
2020-11-12 12:25:48 +03:00
|
|
|
|
|
|
|
instance J.ToJSON NullsOrder where
|
2022-08-15 18:41:28 +03:00
|
|
|
-- Todo: write a proper parser https://github.com/hasura/graphql-engine-mono/issues/5484
|
|
|
|
toJSON = J.genericToJSON $ J.defaultOptions {J.constructorTagModifier = J.snakeCase . drop 5}
|
2020-11-12 12:25:48 +03:00
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
instance ToSQL OrderByExp where
|
|
|
|
toSQL (OrderByExp l) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"ORDER BY" <~> (", " <+> toList l)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype GroupByExp
|
|
|
|
= GroupByExp [SQLExp]
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL GroupByExp where
|
|
|
|
toSQL (GroupByExp idens) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"GROUP BY" <~> (", " <+> idens)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype FromExp
|
|
|
|
= FromExp [FromItem]
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL FromExp where
|
|
|
|
toSQL (FromExp items) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"FROM" <~> (", " <+> items)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-10-05 13:03:36 +03:00
|
|
|
mkIdenFromExp :: TableIdentifier -> FromExp
|
|
|
|
mkIdenFromExp ident =
|
|
|
|
FromExp [FIIdentifier ident]
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
mkSimpleFromExp :: QualifiedTable -> FromExp
|
|
|
|
mkSimpleFromExp qt =
|
|
|
|
FromExp [FISimple qt Nothing]
|
|
|
|
|
|
|
|
mkSelFromExp :: Bool -> Select -> TableName -> FromItem
|
|
|
|
mkSelFromExp isLateral sel tn =
|
|
|
|
FISelect (Lateral isLateral) sel alias
|
|
|
|
where
|
2022-07-18 12:44:17 +03:00
|
|
|
alias = toTableAlias $ toIdentifier tn
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-07-09 10:25:49 +03:00
|
|
|
mkRowExp :: [Extractor] -> SQLExp
|
|
|
|
mkRowExp extrs =
|
|
|
|
let innerSel = mkSelect {selExtr = extrs}
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2018-07-09 10:25:49 +03:00
|
|
|
innerSelName = TableName "e"
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2018-07-09 10:25:49 +03:00
|
|
|
-- SELECT r FROM (SELECT col1, col2, .. ) AS r
|
|
|
|
outerSel =
|
|
|
|
mkSelect
|
2020-10-27 13:34:31 +03:00
|
|
|
{ selExtr = [Extractor (SERowIdentifier $ toIdentifier innerSelName) Nothing],
|
2018-07-09 10:25:49 +03:00
|
|
|
selFrom =
|
|
|
|
Just $
|
|
|
|
FromExp
|
|
|
|
[mkSelFromExp False innerSel innerSelName]
|
|
|
|
}
|
|
|
|
in SESelect outerSel
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype HavingExp
|
|
|
|
= HavingExp BoolExp
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL HavingExp where
|
|
|
|
toSQL (HavingExp be) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"HAVING" <~> toSQL be
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype WhereFrag = WhereFrag {getWFBoolExp :: BoolExp}
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL WhereFrag where
|
|
|
|
toSQL (WhereFrag be) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"WHERE" <~> parenB (toSQL be)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL Select where
|
2020-05-13 11:09:44 +03:00
|
|
|
toSQL sel = case selCTEs sel of
|
|
|
|
[] ->
|
|
|
|
"SELECT"
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL (selDistinct sel)
|
|
|
|
<~> (", " <+> selExtr sel)
|
|
|
|
<~> toSQL (selFrom sel)
|
|
|
|
<~> toSQL (selWhere sel)
|
|
|
|
<~> toSQL (selGroupBy sel)
|
|
|
|
<~> toSQL (selHaving sel)
|
|
|
|
<~> toSQL (selOrderBy sel)
|
|
|
|
<~> toSQL (selLimit sel)
|
|
|
|
<~> toSQL (selOffset sel)
|
2020-05-13 11:09:44 +03:00
|
|
|
-- reuse SelectWith if there are any CTEs, since the generated SQL is the same
|
2023-02-28 14:17:08 +03:00
|
|
|
ctes -> toSQL $ SelectWith (map (toTopLevelCTE <$>) ctes) sel {selCTEs = []}
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-10-27 13:34:31 +03:00
|
|
|
mkSIdenExp :: (IsIdentifier a) => a -> SQLExp
|
|
|
|
mkSIdenExp = SEIdentifier . toIdentifier
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-10-11 13:42:15 +03:00
|
|
|
mkQIdenExp :: (IsIdentifier b) => TableIdentifier -> b -> SQLExp
|
2020-10-27 13:34:31 +03:00
|
|
|
mkQIdenExp q t = SEQIdentifier $ mkQIdentifier q t
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
data Qual
|
2022-10-11 13:42:15 +03:00
|
|
|
= QualifiedIdentifier TableIdentifier (Maybe TypeAnn)
|
2022-07-29 17:05:03 +03:00
|
|
|
| QualTable QualifiedTable
|
|
|
|
| QualVar Text
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData Qual
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable Qual
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
mkQual :: QualifiedTable -> Qual
|
|
|
|
mkQual = QualTable
|
|
|
|
|
|
|
|
instance ToSQL Qual where
|
2021-07-07 14:58:37 +03:00
|
|
|
toSQL (QualifiedIdentifier i Nothing) = toSQL i
|
|
|
|
toSQL (QualifiedIdentifier i (Just ty)) = parenB (toSQL i <> toSQL ty)
|
|
|
|
toSQL (QualTable qt) = toSQL qt
|
|
|
|
toSQL (QualVar v) = TB.text v
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-10-11 13:42:15 +03:00
|
|
|
mkQIdentifier :: (IsIdentifier b) => TableIdentifier -> b -> QIdentifier
|
|
|
|
mkQIdentifier q t = QIdentifier (QualifiedIdentifier q Nothing) (toIdentifier t)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-11-25 13:56:44 +03:00
|
|
|
mkQIdentifierTable :: (IsIdentifier a) => QualifiedTable -> a -> QIdentifier
|
|
|
|
mkQIdentifierTable q = QIdentifier (mkQual q) . toIdentifier
|
|
|
|
|
2022-09-16 17:59:23 +03:00
|
|
|
mkIdentifierSQLExp :: forall a. IsIdentifier a => Qual -> a -> SQLExp
|
|
|
|
mkIdentifierSQLExp q = SEQIdentifier . QIdentifier q . toIdentifier
|
|
|
|
|
2020-10-27 13:34:31 +03:00
|
|
|
data QIdentifier
|
2022-07-29 17:05:03 +03:00
|
|
|
= QIdentifier Qual Identifier
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-10-27 13:34:31 +03:00
|
|
|
instance NFData QIdentifier
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-10-27 13:34:31 +03:00
|
|
|
instance Hashable QIdentifier
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-10-27 13:34:31 +03:00
|
|
|
instance ToSQL QIdentifier where
|
|
|
|
toSQL (QIdentifier qual iden) =
|
2018-10-19 05:15:28 +03:00
|
|
|
mconcat [toSQL qual, TB.char '.', toSQL iden]
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-05-03 11:58:56 +03:00
|
|
|
data ColumnOp = ColumnOp
|
|
|
|
{ _colOp :: SQLOp,
|
|
|
|
_colExp :: SQLExp
|
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
|
|
|
|
|
|
|
instance NFData ColumnOp
|
|
|
|
|
|
|
|
instance Hashable ColumnOp
|
|
|
|
|
2020-10-21 19:35:06 +03:00
|
|
|
newtype SQLOp = SQLOp {sqlOpTxt :: Text}
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-07-20 13:51:20 +03:00
|
|
|
|
|
|
|
incOp :: SQLOp
|
|
|
|
incOp = SQLOp "+"
|
|
|
|
|
|
|
|
mulOp :: SQLOp
|
|
|
|
mulOp = SQLOp "*"
|
|
|
|
|
2019-03-25 16:45:35 +03:00
|
|
|
jsonbPathOp :: SQLOp
|
|
|
|
jsonbPathOp = SQLOp "#>"
|
|
|
|
|
2018-07-20 13:51:20 +03:00
|
|
|
jsonbConcatOp :: SQLOp
|
|
|
|
jsonbConcatOp = SQLOp "||"
|
|
|
|
|
|
|
|
jsonbDeleteOp :: SQLOp
|
|
|
|
jsonbDeleteOp = SQLOp "-"
|
|
|
|
|
|
|
|
jsonbDeleteAtPathOp :: SQLOp
|
|
|
|
jsonbDeleteAtPathOp = SQLOp "#-"
|
|
|
|
|
2020-10-21 19:35:06 +03:00
|
|
|
newtype TypeAnn = TypeAnn {unTypeAnn :: Text}
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2018-07-20 13:51:20 +03:00
|
|
|
|
2020-02-04 18:34:17 +03:00
|
|
|
instance ToSQL TypeAnn where
|
|
|
|
toSQL (TypeAnn ty) = "::" <> TB.text ty
|
|
|
|
|
2020-12-01 18:50:18 +03:00
|
|
|
mkTypeAnn :: CollectableType PGScalarType -> TypeAnn
|
2019-08-06 18:24:08 +03:00
|
|
|
mkTypeAnn = TypeAnn . toSQLTxt
|
2018-07-20 13:51:20 +03:00
|
|
|
|
2019-07-10 13:19:58 +03:00
|
|
|
intTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
intTypeAnn = mkTypeAnn $ CollectableTypeScalar PGInteger
|
2018-07-20 13:51:20 +03:00
|
|
|
|
2020-04-17 12:32:09 +03:00
|
|
|
numericTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
numericTypeAnn = mkTypeAnn $ CollectableTypeScalar PGNumeric
|
2020-04-17 12:32:09 +03:00
|
|
|
|
2019-07-10 13:19:58 +03:00
|
|
|
textTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
textTypeAnn = mkTypeAnn $ CollectableTypeScalar PGText
|
2018-07-20 13:51:20 +03:00
|
|
|
|
2019-07-10 13:19:58 +03:00
|
|
|
textArrTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
textArrTypeAnn = mkTypeAnn $ CollectableTypeArray PGText
|
2018-07-20 13:51:20 +03:00
|
|
|
|
2019-07-10 13:19:58 +03:00
|
|
|
jsonTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
jsonTypeAnn = mkTypeAnn $ CollectableTypeScalar PGJSON
|
2019-07-10 13:19:58 +03:00
|
|
|
|
|
|
|
jsonbTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
jsonbTypeAnn = mkTypeAnn $ CollectableTypeScalar PGJSONB
|
2018-07-20 13:51:20 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
boolTypeAnn :: TypeAnn
|
2020-12-01 18:50:18 +03:00
|
|
|
boolTypeAnn = mkTypeAnn $ CollectableTypeScalar PGBoolean
|
2020-06-08 15:13:01 +03:00
|
|
|
|
2018-11-14 15:59:59 +03:00
|
|
|
data CountType
|
|
|
|
= CTStar
|
2022-07-29 17:05:03 +03:00
|
|
|
| CTSimple [PGCol]
|
|
|
|
| CTDistinct [PGCol]
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData CountType
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable CountType
|
2018-11-14 15:59:59 +03:00
|
|
|
|
|
|
|
instance ToSQL CountType where
|
|
|
|
toSQL CTStar = "*"
|
|
|
|
toSQL (CTSimple cols) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB $ ", " <+> cols
|
2018-11-14 15:59:59 +03:00
|
|
|
toSQL (CTDistinct cols) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"DISTINCT" <~> parenB (", " <+> cols)
|
2018-11-14 15:59:59 +03:00
|
|
|
|
2019-03-22 10:08:42 +03:00
|
|
|
newtype TupleExp
|
|
|
|
= TupleExp [SQLExp]
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2019-03-22 10:08:42 +03:00
|
|
|
|
|
|
|
instance ToSQL TupleExp where
|
|
|
|
toSQL (TupleExp exps) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB $ ", " <+> exps
|
2019-03-22 10:08:42 +03:00
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
data SQLExp
|
2022-07-29 17:05:03 +03:00
|
|
|
= SEPrep Int
|
2019-07-22 15:47:13 +03:00
|
|
|
| SENull
|
2022-07-29 17:05:03 +03:00
|
|
|
| SELit Text
|
|
|
|
| SEUnsafe Text
|
|
|
|
| SESelect Select
|
2020-01-16 07:53:28 +03:00
|
|
|
| -- | all fields (@*@) or all fields from relation (@iden.*@)
|
2022-07-29 17:05:03 +03:00
|
|
|
SEStar (Maybe Qual)
|
2022-07-18 12:44:17 +03:00
|
|
|
| -- | A column name
|
2022-07-29 17:05:03 +03:00
|
|
|
SEIdentifier Identifier
|
2022-07-18 12:44:17 +03:00
|
|
|
| -- | SEIdentifier and SERowIdentifier are distinguished for easier rewrite rules
|
2022-07-29 17:05:03 +03:00
|
|
|
SERowIdentifier Identifier
|
2022-07-18 12:44:17 +03:00
|
|
|
| -- | A qualified column name
|
2022-07-29 17:05:03 +03:00
|
|
|
SEQIdentifier QIdentifier
|
2021-05-20 10:23:21 +03:00
|
|
|
| -- | this is used to apply a sql function to an expression. The 'Text' is the function name
|
2022-07-29 17:05:03 +03:00
|
|
|
SEFnApp Text [SQLExp] (Maybe OrderByExp)
|
|
|
|
| SEOpApp SQLOp [SQLExp]
|
|
|
|
| SETyAnn SQLExp TypeAnn
|
|
|
|
| SECond BoolExp SQLExp SQLExp
|
|
|
|
| SEBool BoolExp
|
|
|
|
| SEExcluded Identifier
|
|
|
|
| SEArray [SQLExp]
|
|
|
|
| SEArrayIndex SQLExp SQLExp
|
|
|
|
| SETuple TupleExp
|
|
|
|
| SECount CountType
|
|
|
|
| SENamedArg Identifier SQLExp
|
|
|
|
| SEFunction FunctionExp
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData SQLExp
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable SQLExp
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-12-13 10:26:15 +03:00
|
|
|
instance J.ToJSON SQLExp where
|
|
|
|
toJSON = J.toJSON . toSQLTxt
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | Represents an alias assignment for a column
|
|
|
|
newtype ColumnAlias = ColumnAlias {getColumnAlias :: Identifier}
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Hashable)
|
2022-07-18 12:44:17 +03:00
|
|
|
|
2022-10-11 13:42:15 +03:00
|
|
|
instance IsString ColumnAlias where
|
|
|
|
fromString = mkColumnAlias . pack
|
|
|
|
|
|
|
|
instance Semigroup ColumnAlias where
|
|
|
|
(ColumnAlias ca1) <> (ColumnAlias ca2) = ColumnAlias (ca1 <> ca2)
|
|
|
|
|
|
|
|
mkColumnAlias :: Text -> ColumnAlias
|
|
|
|
mkColumnAlias = ColumnAlias . Identifier
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
instance IsIdentifier ColumnAlias where
|
|
|
|
toIdentifier (ColumnAlias identifier) = identifier
|
|
|
|
|
2022-10-11 13:42:15 +03:00
|
|
|
tableIdentifierToColumnAlias :: TableIdentifier -> ColumnAlias
|
|
|
|
tableIdentifierToColumnAlias = mkColumnAlias . unTableIdentifier
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
toColumnAlias :: (IsIdentifier a) => a -> ColumnAlias
|
|
|
|
toColumnAlias = ColumnAlias . toIdentifier
|
|
|
|
|
|
|
|
-- | Convert a column alias assignment to SQL _with_ @AS@ prefix
|
|
|
|
columnAliasToSqlWithAs :: ColumnAlias -> TB.Builder
|
|
|
|
columnAliasToSqlWithAs (ColumnAlias alias) = "AS" <~> toSQL alias
|
|
|
|
|
|
|
|
-- | Convert a column alias assignment to SQL _without_ @AS@ prefix
|
|
|
|
columnAliasToSqlWithoutAs :: ColumnAlias -> TB.Builder
|
|
|
|
columnAliasToSqlWithoutAs alias = toSQL (toIdentifier alias)
|
|
|
|
|
|
|
|
-- | Represents an alias assignment for a table, relation or row
|
|
|
|
newtype TableAlias = TableAlias {getTableAlias :: Identifier}
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, NFData, Data, Generic, Hashable)
|
2018-10-05 11:56:47 +03:00
|
|
|
|
2022-10-11 13:42:15 +03:00
|
|
|
instance IsString TableAlias where
|
|
|
|
fromString = mkTableAlias . pack
|
|
|
|
|
|
|
|
instance Semigroup TableAlias where
|
|
|
|
(TableAlias ta1) <> (TableAlias ta2) = TableAlias (ta1 <> ta2)
|
|
|
|
|
2022-10-05 13:03:36 +03:00
|
|
|
-- | Create a table alias.
|
|
|
|
mkTableAlias :: Text -> TableAlias
|
|
|
|
mkTableAlias = TableAlias . Identifier
|
|
|
|
|
|
|
|
-- | Create a table identifier from a table alias.
|
|
|
|
tableAliasToIdentifier :: TableAlias -> TableIdentifier
|
|
|
|
tableAliasToIdentifier = TableIdentifier . getIdenTxt . getTableAlias
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
instance IsIdentifier TableAlias where
|
|
|
|
toIdentifier (TableAlias identifier) = identifier
|
|
|
|
|
2022-10-05 13:03:36 +03:00
|
|
|
-- TODO: Remove when we remove 'Identifier'. We should only be able to create
|
|
|
|
-- identifiers from aliases, not aliases from identifiers. Aliases represent
|
|
|
|
-- definition sites and identifiers usage sites.
|
2022-07-18 12:44:17 +03:00
|
|
|
toTableAlias :: (IsIdentifier a) => a -> TableAlias
|
|
|
|
toTableAlias = TableAlias . toIdentifier
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | Convert a table alias assignment to SQL _with_ @AS@ prefix
|
|
|
|
tableAliasToSqlWithAs :: TableAlias -> TB.Builder
|
|
|
|
tableAliasToSqlWithAs alias = "AS" <~> toSQL (toIdentifier alias)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | Convert a table alias assignment to SQL _without_ @AS@ prefix
|
|
|
|
tableAliasToSqlWithoutAs :: TableAlias -> TB.Builder
|
|
|
|
tableAliasToSqlWithoutAs alias = toSQL (toIdentifier alias)
|
2018-10-05 11:56:47 +03:00
|
|
|
|
2018-11-14 15:59:59 +03:00
|
|
|
countStar :: SQLExp
|
|
|
|
countStar = SECount CTStar
|
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
instance ToSQL SQLExp where
|
|
|
|
toSQL (SEPrep argNumber) =
|
2018-10-19 05:15:28 +03:00
|
|
|
TB.char '$' <> fromString (show argNumber)
|
2019-07-22 15:47:13 +03:00
|
|
|
toSQL SENull =
|
2019-08-29 16:07:05 +03:00
|
|
|
TB.text "NULL"
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SELit tv) =
|
2018-10-19 05:15:28 +03:00
|
|
|
TB.text $ pgFmtLit tv
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SEUnsafe t) =
|
2018-10-19 05:15:28 +03:00
|
|
|
TB.text t
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SESelect se) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB $ toSQL se
|
2020-01-16 07:53:28 +03:00
|
|
|
toSQL (SEStar Nothing) =
|
2018-10-19 05:15:28 +03:00
|
|
|
TB.char '*'
|
2020-01-16 07:53:28 +03:00
|
|
|
toSQL (SEStar (Just qual)) =
|
2021-07-07 14:58:37 +03:00
|
|
|
mconcat [toSQL qual, TB.char '.', TB.char '*']
|
2020-10-27 13:34:31 +03:00
|
|
|
toSQL (SEIdentifier iden) =
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL iden
|
2020-10-27 13:34:31 +03:00
|
|
|
toSQL (SERowIdentifier iden) =
|
2018-10-12 12:28:43 +03:00
|
|
|
toSQL iden
|
2020-10-27 13:34:31 +03:00
|
|
|
toSQL (SEQIdentifier qIdentifier) =
|
|
|
|
toSQL qIdentifier
|
2018-06-27 16:11:32 +03:00
|
|
|
-- https://www.postgresql.org/docs/10/static/sql-expressions.html#SYNTAX-AGGREGATES
|
|
|
|
toSQL (SEFnApp name args mObe) =
|
2020-10-21 19:35:06 +03:00
|
|
|
TB.text name <> parenB ((", " <+> args) <~> toSQL mObe)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SEOpApp op args) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (sqlOpTxt op <+> args)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SETyAnn e ty) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL e) <> toSQL ty
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SECond cond te fe) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"CASE WHEN"
|
|
|
|
<~> toSQL cond
|
|
|
|
<~> "THEN"
|
|
|
|
<~> toSQL te
|
|
|
|
<~> "ELSE"
|
|
|
|
<~> toSQL fe
|
2018-10-19 05:15:28 +03:00
|
|
|
<~> "END"
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SEBool be) = toSQL be
|
2019-09-19 07:47:36 +03:00
|
|
|
toSQL (SEExcluded i) =
|
|
|
|
"EXCLUDED."
|
|
|
|
<> toSQL i
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL (SEArray exps) =
|
|
|
|
"ARRAY"
|
|
|
|
<> TB.char '['
|
|
|
|
<> (", " <+> exps)
|
|
|
|
<> TB.char ']'
|
2020-06-08 15:13:01 +03:00
|
|
|
toSQL (SEArrayIndex arrayExp indexExp) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL arrayExp)
|
2020-06-08 15:13:01 +03:00
|
|
|
<> TB.char '['
|
|
|
|
<> toSQL indexExp
|
|
|
|
<> TB.char ']'
|
2019-03-22 10:08:42 +03:00
|
|
|
toSQL (SETuple tup) = toSQL tup
|
2020-10-21 19:35:06 +03:00
|
|
|
toSQL (SECount ty) = "COUNT" <> parenB (toSQL ty)
|
2019-08-28 22:27:15 +03:00
|
|
|
-- https://www.postgresql.org/docs/current/sql-syntax-calling-funcs.html
|
2020-10-21 19:35:06 +03:00
|
|
|
toSQL (SENamedArg arg val) = toSQL arg <~> "=>" <~> toSQL val
|
2019-10-18 11:29:47 +03:00
|
|
|
toSQL (SEFunction funcExp) = toSQL funcExp
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-08-06 15:15:08 +03:00
|
|
|
intToSQLExp :: Int -> SQLExp
|
2021-01-19 22:14:42 +03:00
|
|
|
intToSQLExp = SEUnsafe . tshow
|
2018-08-06 15:15:08 +03:00
|
|
|
|
2021-06-10 19:13:20 +03:00
|
|
|
int64ToSQLExp :: Int64 -> SQLExp
|
|
|
|
int64ToSQLExp = SEUnsafe . tshow
|
|
|
|
|
2021-05-20 10:23:21 +03:00
|
|
|
-- | Extractor can be used to apply Postgres alias to a column
|
2022-07-29 17:05:03 +03:00
|
|
|
data Extractor = Extractor SQLExp (Maybe ColumnAlias)
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData Extractor
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable Extractor
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-07-20 13:51:20 +03:00
|
|
|
mkSQLOpExp ::
|
|
|
|
SQLOp ->
|
|
|
|
SQLExp -> -- lhs
|
|
|
|
SQLExp -> -- rhs
|
|
|
|
SQLExp -- result
|
|
|
|
mkSQLOpExp op lhs rhs = SEOpApp op [lhs, rhs]
|
|
|
|
|
2021-02-08 13:39:59 +03:00
|
|
|
columnDefaultValue :: SQLExp
|
|
|
|
columnDefaultValue = SEUnsafe "DEFAULT"
|
2018-11-02 18:08:38 +03:00
|
|
|
|
2018-10-05 18:13:51 +03:00
|
|
|
handleIfNull :: SQLExp -> SQLExp -> SQLExp
|
|
|
|
handleIfNull l e = SEFnApp "coalesce" [e, l] Nothing
|
2018-08-08 10:01:49 +03:00
|
|
|
|
2018-10-26 12:02:44 +03:00
|
|
|
applyJsonBuildObj :: [SQLExp] -> SQLExp
|
|
|
|
applyJsonBuildObj args =
|
|
|
|
SEFnApp "json_build_object" args Nothing
|
|
|
|
|
2020-06-16 17:25:49 +03:00
|
|
|
applyJsonBuildArray :: [SQLExp] -> SQLExp
|
|
|
|
applyJsonBuildArray args =
|
|
|
|
SEFnApp "json_build_array" args Nothing
|
|
|
|
|
2018-10-26 12:02:44 +03:00
|
|
|
applyRowToJson :: [Extractor] -> SQLExp
|
|
|
|
applyRowToJson extrs =
|
|
|
|
SEFnApp "row_to_json" [mkRowExp extrs] Nothing
|
|
|
|
|
2022-07-19 09:55:42 +03:00
|
|
|
applyUppercase :: SQLExp -> SQLExp
|
|
|
|
applyUppercase arg =
|
|
|
|
SEFnApp "upper" [arg] Nothing
|
|
|
|
|
2020-10-27 13:34:31 +03:00
|
|
|
mkExtr :: (IsIdentifier a) => a -> Extractor
|
2018-06-27 16:11:32 +03:00
|
|
|
mkExtr t = Extractor (mkSIdenExp t) Nothing
|
|
|
|
|
|
|
|
instance ToSQL Extractor where
|
|
|
|
toSQL (Extractor ce mal) =
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL ce <~> maybe "" columnAliasToSqlWithAs mal
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-10-12 12:28:43 +03:00
|
|
|
data DistinctExpr
|
|
|
|
= DistinctSimple
|
2022-07-29 17:05:03 +03:00
|
|
|
| DistinctOn [SQLExp]
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData DistinctExpr
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable DistinctExpr
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL DistinctExpr where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL DistinctSimple = "DISTINCT"
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL (DistinctOn exprs) =
|
|
|
|
"DISTINCT ON" <~> parenB ("," <+> exprs)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2019-08-28 22:27:15 +03:00
|
|
|
data FunctionArgs = FunctionArgs
|
2022-07-29 17:05:03 +03:00
|
|
|
{ fasPostional :: [SQLExp],
|
2023-04-26 18:42:13 +03:00
|
|
|
fasNamed :: (HashMap.HashMap Text SQLExp)
|
2019-12-13 00:46:33 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData FunctionArgs
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable FunctionArgs
|
2019-08-28 22:27:15 +03:00
|
|
|
|
|
|
|
instance ToSQL FunctionArgs where
|
|
|
|
toSQL (FunctionArgs positionalArgs namedArgsMap) =
|
2023-04-26 18:42:13 +03:00
|
|
|
let namedArgs = flip map (HashMap.toList namedArgsMap) $
|
2020-10-27 13:34:31 +03:00
|
|
|
\(argName, argVal) -> SENamedArg (Identifier argName) argVal
|
2020-10-21 19:35:06 +03:00
|
|
|
in parenB $ ", " <+> (positionalArgs <> namedArgs)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2022-07-22 18:27:42 +03:00
|
|
|
data FunctionDefinitionListItem = FunctionDefinitionListItem
|
|
|
|
{ _dliColumn :: ColumnAlias,
|
2022-07-18 12:44:17 +03:00
|
|
|
_dliType :: PGScalarType
|
2020-02-13 20:38:23 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Data, Generic)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2022-07-22 18:27:42 +03:00
|
|
|
instance NFData FunctionDefinitionListItem
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2022-07-22 18:27:42 +03:00
|
|
|
instance Hashable FunctionDefinitionListItem
|
2020-02-13 20:38:23 +03:00
|
|
|
|
2022-07-22 18:27:42 +03:00
|
|
|
instance ToSQL FunctionDefinitionListItem where
|
|
|
|
toSQL (FunctionDefinitionListItem column columnType) =
|
|
|
|
columnAliasToSqlWithoutAs column <~> toSQL columnType
|
2020-02-13 20:38:23 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | We can alias the result of a function call that returns a @SETOF RECORD@
|
|
|
|
-- by naming the result relation, and the columns and their types. For example:
|
|
|
|
--
|
|
|
|
-- > SELECT * FROM
|
|
|
|
-- > function_returns_record(arg1, arg2 ...) AS relation_name(column_1 column_1_type, column_2 column_2_type, ...)
|
|
|
|
--
|
|
|
|
-- Note: a function that returns a table (instead of a record) cannot name the types
|
|
|
|
-- as seen in the above example.
|
2020-02-13 20:38:23 +03:00
|
|
|
data FunctionAlias = FunctionAlias
|
2022-10-05 13:03:36 +03:00
|
|
|
{ _faIdentifier :: TableAlias, -- TODO: Rename to _faAlias
|
2022-07-29 17:05:03 +03:00
|
|
|
_faDefinitionList :: Maybe [FunctionDefinitionListItem]
|
2020-02-13 20:38:23 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Data, Generic)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-02-13 20:38:23 +03:00
|
|
|
instance NFData FunctionAlias
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable FunctionAlias
|
2020-02-13 20:38:23 +03:00
|
|
|
|
2022-10-05 13:03:36 +03:00
|
|
|
functionNameToTableAlias :: QualifiedFunction -> TableAlias
|
|
|
|
functionNameToTableAlias = mkTableAlias . qualifiedObjectToText
|
|
|
|
|
|
|
|
-- | Construct a function alias which represents the "relation signature" for the function invocation,
|
|
|
|
-- Using the function name as the relation name, and the columns as the relation schema.
|
|
|
|
mkFunctionAlias :: QualifiedObject FunctionName -> Maybe [(ColumnAlias, PGScalarType)] -> FunctionAlias
|
2022-07-22 18:27:42 +03:00
|
|
|
mkFunctionAlias alias listM =
|
2022-10-05 13:03:36 +03:00
|
|
|
FunctionAlias (functionNameToTableAlias alias) $
|
2022-07-22 18:27:42 +03:00
|
|
|
fmap (map (uncurry FunctionDefinitionListItem)) listM
|
2020-02-13 20:38:23 +03:00
|
|
|
|
|
|
|
instance ToSQL FunctionAlias where
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL (FunctionAlias tableAlias (Just definitionList)) =
|
|
|
|
tableAliasToSqlWithAs tableAlias <> parenB (", " <+> definitionList)
|
|
|
|
toSQL (FunctionAlias tableAlias Nothing) =
|
|
|
|
tableAliasToSqlWithAs tableAlias
|
2020-02-13 20:38:23 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | A function call
|
2019-10-18 11:29:47 +03:00
|
|
|
data FunctionExp = FunctionExp
|
2022-07-29 17:05:03 +03:00
|
|
|
{ feName :: QualifiedFunction,
|
|
|
|
feArgs :: FunctionArgs,
|
|
|
|
feAlias :: Maybe FunctionAlias
|
2019-12-13 00:46:33 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData FunctionExp
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable FunctionExp
|
2019-10-18 11:29:47 +03:00
|
|
|
|
|
|
|
instance ToSQL FunctionExp where
|
|
|
|
toSQL (FunctionExp qf args alsM) =
|
2020-10-21 19:35:06 +03:00
|
|
|
toSQL qf <> toSQL args <~> toSQL alsM
|
2019-10-18 11:29:47 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | See @from_item@ in <https://www.postgresql.org/docs/current/sql-select.html>
|
2018-06-27 16:11:32 +03:00
|
|
|
data FromItem
|
2022-07-18 12:44:17 +03:00
|
|
|
= -- | A simple table
|
|
|
|
FISimple QualifiedTable (Maybe TableAlias)
|
|
|
|
| -- | An identifier (from CTEs)
|
2022-10-05 13:03:36 +03:00
|
|
|
FIIdentifier TableIdentifier
|
2022-07-18 12:44:17 +03:00
|
|
|
| -- | A function call (that should return a relation (@SETOF@) and not a scalar)
|
|
|
|
FIFunc FunctionExp
|
|
|
|
| -- | @unnest@ converts (an) array(s) to a relation.
|
|
|
|
--
|
|
|
|
-- We have:
|
|
|
|
-- * The unnest function arguments
|
|
|
|
-- * The relation alias
|
|
|
|
-- * A list of column aliases
|
|
|
|
--
|
|
|
|
-- See @unnest@ in <https://www.postgresql.org/docs/current/functions-array.html>.
|
|
|
|
FIUnnest [SQLExp] TableAlias [ColumnAlias]
|
|
|
|
| FISelect Lateral Select TableAlias
|
|
|
|
| FISelectWith Lateral (SelectWithG Select) TableAlias
|
2022-07-22 18:27:42 +03:00
|
|
|
| FIValues ValuesExp TableAlias (Maybe [ColumnAlias])
|
2022-07-18 12:44:17 +03:00
|
|
|
| FIJoin JoinExpr
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData FromItem
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable FromItem
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
mkSelFromItem :: Select -> TableAlias -> FromItem
|
2018-10-05 11:56:47 +03:00
|
|
|
mkSelFromItem = FISelect (Lateral False)
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
mkSelectWithFromItem :: SelectWithG Select -> TableAlias -> FromItem
|
Rewrite GraphQL schema generation and query parsing (close #2801) (#4111)
Aka “the PDV refactor.” History is preserved on the branch 2801-graphql-schema-parser-refactor.
* [skip ci] remove stale benchmark commit from commit_diff
* [skip ci] Check for root field name conflicts between remotes
* [skip ci] Additionally check for conflicts between remotes and DB
* [skip ci] Check for conflicts in schema when tracking a table
* [skip ci] Fix equality checking in GraphQL AST
* server: fix mishandling of GeoJSON inputs in subscriptions (fix #3239) (#4551)
* Add support for multiple top-level fields in a subscription to improve testability of subscriptions
* Add an internal flag to enable multiple subscriptions
* Add missing call to withConstructorFn in live queries (fix #3239)
Co-authored-by: Alexis King <lexi.lambda@gmail.com>
* Scheduled triggers (close #1914) (#3553)
server: add scheduled triggers
Co-authored-by: Alexis King <lexi.lambda@gmail.com>
Co-authored-by: Marion Schleifer <marion@hasura.io>
Co-authored-by: Karthikeyan Chinnakonda <karthikeyan@hasura.io>
Co-authored-by: Aleksandra Sikora <ola.zxcvbnm@gmail.com>
* dev.sh: bump version due to addition of croniter python dependency
* server: fix an introspection query caching issue (fix #4547) (#4661)
Introspection queries accept variables, but we need to make sure to
also touch the variables that we ignore, so that an introspection
query is marked not reusable if we are not able to build a correct
query plan for it.
A better solution here would be to deal with such unused variables
correctly, so that more introspection queries become reusable.
An even better solution would be to type-safely track *how* to reuse
which variables, rather than to split the reusage marking from the
planning.
Co-authored-by: Tirumarai Selvan <tiru@hasura.io>
* flush log buffer on exception in mkWaiApp ( fix #4772 ) (#4801)
* flush log buffer on exception in mkWaiApp
* add comment to explain the introduced change
* add changelog
* allow logging details of a live query polling thread (#4959)
* changes for poller-log
add various multiplexed query info in poller-log
* minor cleanup, also fixes a bug which will return duplicate data
* Live query poller stats can now be logged
This also removes in-memory stats that are collected about batched
query execution as the log lines when piped into an monitoring tool
will give us better insights.
* allow poller-log to be configurable
* log minimal information in the livequery-poller-log
Other information can be retrieved from /dev/subscriptions/extended
* fix few review comments
* avoid marshalling and unmarshalling from ByteString to EncJSON
* separate out SubscriberId and SubscriberMetadata
Co-authored-by: Anon Ray <rayanon004@gmail.com>
* Don't compile in developer APIs by default
* Tighten up handling of admin secret, more docs
Store the admin secret only as a hash to prevent leaking the secret
inadvertently, and to prevent timing attacks on the secret.
NOTE: best practice for stored user passwords is a function with a
tunable cost like bcrypt, but our threat model is quite different (even
if we thought we could reasonably protect the secret from an attacker
who could read arbitrary regions of memory), and bcrypt is far too slow
(by design) to perform on each request. We'd have to rely on our
(technically savvy) users to choose high entropy passwords in any case.
Referencing #4736
* server/docs: add instructions to fix loss of float precision in PostgreSQL <= 11 (#5187)
This adds a server flag, --pg-connection-options, that can be used to set a PostgreSQL connection parameter, extra_float_digits, that needs to be used to avoid loss of data on older versions of PostgreSQL, which have odd default behavior when returning float values. (fixes #5092)
* [skip ci] Add new commits from master to the commit diff
* [skip ci] serve default directives (skip & include) over introspection
* [skip ci] Update non-Haskell assets with the version on master
* server: refactor GQL execution check and config API (#5094)
Co-authored-by: Vamshi Surabhi <vamshi@hasura.io>
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* [skip ci] fix js issues in tests by pinning dependencies version
* [skip ci] bump graphql version
* [skip ci] Add note about memory usage
* generalize query execution logic on Postgres (#5110)
* generalize PGExecCtx to support specialized functions for various operations
* fix tests compilation
* allow customising PGExecCtx when starting the web server
* server: changes catalog initialization and logging for pro customization (#5139)
* new typeclass to abstract the logic of QueryLog-ing
* abstract the logic of logging websocket-server logs
introduce a MonadWSLog typeclass
* move catalog initialization to init step
expose a helper function to migrate catalog
create schema cache in initialiseCtx
* expose various modules and functions for pro
* [skip ci] cosmetic change
* [skip ci] fix test calling a mutation that does not exist
* [skip ci] minor text change
* [skip ci] refactored input values
* [skip ci] remove VString Origin
* server: fix updating of headers behaviour in the update cron trigger API and create future events immediately (#5151)
* server: fix bug to update headers in an existing cron trigger and create future events
Co-authored-by: Tirumarai Selvan <tiru@hasura.io>
* Lower stack chunk size in RTS to reduce thread STACK memory (closes #5190)
This reduces memory consumption for new idle subscriptions significantly
(see linked ticket).
The hypothesis is: we fork a lot of threads per websocket, and some of
these use slightly more than the initial 1K stack size, so the first
overflow balloons to 32K, when significantly less is required.
However: running with `+RTS -K1K -xc` did not seem to show evidence of
any overflows! So it's a mystery why this improves things.
GHC should probably also be doubling the stack buffer at each overflow
or doing something even smarter; the knobs we have aren't so helpful.
* [skip ci] fix todo and schema generation for aggregate fields
* 5087 libpq pool leak (#5089)
Shrink libpq buffers to 1MB before returning connection to pool. Closes #5087
See: https://github.com/hasura/pg-client-hs/pull/19
Also related: #3388 #4077
* bump pg-client-hs version (fixes a build issue on some environments) (#5267)
* do not use prepared statements for mutations
* server: unlock scheduled events on graceful shutdown (#4928)
* Fix buggy parsing of new --conn-lifetime flag in 2b0e3774
* [skip ci] remove cherry-picked commit from commit_diff.txt
* server: include additional fields in scheduled trigger webhook payload (#5262)
* include scheduled triggers metadata in the webhook body
Co-authored-by: Tirumarai Selvan <tiru@hasura.io>
* server: call the webhook asynchronously in event triggers (#5352)
* server: call the webhook asynchronosly in event triggers
* Expose all modules in Cabal file (#5371)
* [skip ci] update commit_diff.txt
* [skip ci] fix cast exp parser & few TODOs
* [skip ci] fix remote fields arguments
* [skip ci] fix few more TODO, no-op refactor, move resolve/action.hs to execute/action.hs
* Pass environment variables around as a data structure, via @sordina (#5374)
* Pass environment variables around as a data structure, via @sordina
* Resolving build error
* Adding Environment passing note to changelog
* Removing references to ILTPollerLog as this seems to have been reintroduced from a bad merge
* removing commented-out imports
* Language pragmas already set by project
* Linking async thread
* Apply suggestions from code review
Use `runQueryTx` instead of `runLazyTx` for queries.
* remove the non-user facing entry in the changelog
Co-authored-by: Phil Freeman <paf31@cantab.net>
Co-authored-by: Phil Freeman <phil@hasura.io>
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* [skip ci] fix: restrict remote relationship field generation for hasura queries
* [skip ci] no-op refactor; move insert execution code from schema parser module
* server: call the webhook asynchronously in event triggers (#5352)
* server: call the webhook asynchronosly in event triggers
* Expose all modules in Cabal file (#5371)
* [skip ci] update commit_diff.txt
* Pass environment variables around as a data structure, via @sordina (#5374)
* Pass environment variables around as a data structure, via @sordina
* Resolving build error
* Adding Environment passing note to changelog
* Removing references to ILTPollerLog as this seems to have been reintroduced from a bad merge
* removing commented-out imports
* Language pragmas already set by project
* Linking async thread
* Apply suggestions from code review
Use `runQueryTx` instead of `runLazyTx` for queries.
* remove the non-user facing entry in the changelog
Co-authored-by: Phil Freeman <paf31@cantab.net>
Co-authored-by: Phil Freeman <phil@hasura.io>
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* [skip ci] implement header checking
Probably closes #14 and #3659.
* server: refactor 'pollQuery' to have a hook to process 'PollDetails' (#5391)
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* update pg-client (#5421)
* [skip ci] update commit_diff
* Fix latency buckets for telemetry data
These must have gotten messed up during a refactor. As a consequence
almost all samples received so far fall into the single erroneous 0 to
1K seconds (originally supposed to be 1ms?) bucket.
I also re-thought what the numbers should be, but these are still
arbitrary and might want adjusting in the future.
* [skip ci] include the latest commit compared against master in commit_diff
* [skip ci] include new commits from master in commit_diff
* [skip ci] improve description generation
* [skip ci] sort all introspect arrays
* [skip ci] allow parsers to specify error codes
* [skip ci] fix integer and float parsing error code
* [skip ci] scalar from json errors are now parse errors
* [skip ci] fixed negative integer error message and code
* [skip ci] Re-fix nullability in relationships
* [skip ci] no-op refactor and removed couple of FIXMEs
* [skip ci] uncomment code in 'deleteMetadataObject'
* [skip ci] Fix re-fix of nullability for relationships
* [skip ci] fix default arguments error code
* [skip ci] updated test error message
!!! WARNING !!!
Since all fields accept `null`, they all are technically optional in
the new schema. Meaning there's no such thing as a missing mandatory
field anymore: a field that doesn't have a default value, and which
therefore isn't labelled as "optional" in the schema, will be assumed
to be null if it's missing, meaning it isn't possible anymore to have
an error for a missing mandatory field. The only possible error is now
when a optional positional argument is omitted but is not the last
positional argument.
* [skip ci] cleanup of int scalar parser
* [skip ci] retro-compatibility of offset as string
* [skip ci] Remove commit from commit_diff.txt
Although strictly speaking we don't know if this will work correctly in PDV
if we would implement query plan caching, the fact is that in the theoretical
case that we would have the same issue in PDV, it would probably apply not just
to introspection, and the fix would be written completely differently. So this
old commit is of no value to us other than the heads-up "make sure query plan
caching works correctly even in the presence of unused variables", which is
already part of the test suite.
* Add MonadTrace and MonadExecuteQuery abstractions (#5383)
* [skip ci] Fix accumulation of input object types
Just like object types, interface types, and union types, we have to avoid
circularities when collecting input types from the GraphQL AST.
Additionally, this fixes equality checks for input object types (whose fields
are unordered, and hence should be compared as sets) and enum types (ditto).
* [skip ci] fix fragment error path
* [skip ci] fix node error code
* [skip ci] fix paths in insert queries
* [skip ci] fix path in objects
* [skip ci] manually alter node id path for consistency
* [skip ci] more node error fixups
* [skip ci] one last relay error message fix
* [skip ci] update commit_diff
* Propagate the trace context to event triggers (#5409)
* Propagate the trace context to event triggers
* Handle missing trace and span IDs
* Store trace context as one LOCAL
* Add migrations
* Documentation
* changelog
* Fix warnings
* Respond to code review suggestions
* Respond to code review
* Undo changelog
* Update CHANGELOG.md
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* server: log request/response sizes for event triggers (#5463)
* server: log request/response sizes for event triggers
event triggers (and scheduled triggers) now have request/response size
in their logs.
* add changelog entry
* Tracing: Simplify HTTP traced request (#5451)
Remove the Inversion of Control (SuspendRequest) and simplify
the tracing of HTTP Requests.
Co-authored-by: Phil Freeman <phil@hasura.io>
* Attach request ID as tracing metadata (#5456)
* Propagate the trace context to event triggers
* Handle missing trace and span IDs
* Store trace context as one LOCAL
* Add migrations
* Documentation
* Include the request ID as trace metadata
* changelog
* Fix warnings
* Respond to code review suggestions
* Respond to code review
* Undo changelog
* Update CHANGELOG.md
* Typo
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* server: add logging for action handlers (#5471)
* server: add logging for action handlers
* add changelog entry
* change action-handler log type from internal to non-internal
* fix action-handler-log name
* server: pass http and websocket request to logging context (#5470)
* pass request body to logging context in all cases
* add message size logging on the websocket API
this is required by graphql-engine-pro/#416
* message size logging on websocket API
As we need to log all messages recieved/sent by the websocket server,
it makes sense to log them as part of the websocket server event logs.
Previously message recieved were logged inside the onMessage handler,
and messages sent were logged only for "data" messages (as a server event log)
* fix review comments
Co-authored-by: Phil Freeman <phil@hasura.io>
* server: stop eventing subsystem threads when shutting down (#5479)
* server: stop eventing subsystem threads when shutting down
* Apply suggestions from code review
Co-authored-by: Karthikeyan Chinnakonda <chkarthikeyan95@gmail.com>
Co-authored-by: Phil Freeman <phil@hasura.io>
Co-authored-by: Phil Freeman <paf31@cantab.net>
Co-authored-by: Karthikeyan Chinnakonda <chkarthikeyan95@gmail.com>
* [skip ci] update commit_diff with new commits added in master
* Bugfix to support 0-size HASURA_GRAPHQL_QUERY_PLAN_CACHE_SIZE
Also some minor refactoring of bounded cache module:
- the maxBound check in `trim` was confusing and unnecessary
- consequently trim was unnecessary for lookupPure
Also add some basic tests
* Support only the bounded cache, with default HASURA_GRAPHQL_QUERY_PLAN_CACHE_SIZE of 4000. Closes #5363
* [skip ci] remove merge commit from commit_diff
* server: Fix compiler warning caused by GHC upgrade (#5489)
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* [skip ci] update all non server code from master
* [skip ci] aligned object field error message with master
* [skip ci] fix remaining undefined?
* [skip ci] remove unused import
* [skip ci] revert to previous error message, fix tests
* Move nullableType/nonNullableType to Schema.hs
These are functions on Types, not on Parsers.
* [skip ci] fix setup to fix backend only test
the order in which permission checks are performed on the branch is
slightly different than on master, resulting in a slightly different
error if there are no other mutations the user has access to. By
adding update permissions, we go back to the expected case.
* [skip ci] fix insert geojson tests to reflect new paths
* [skip ci] fix enum test for better error message
* [skip ci] fix header test for better error message
* [skip ci] fix fragment cycle test for better error message
* [skip ci] fix error message for type mismatch
* [skip ci] fix variable path in test
* [skip ci] adjust tests after bug fix
* [skip ci] more tests fixing
* Add hdb_catalog.current_setting abstraction for reading Hasura settings
As the comment in the function’s definition explains, this is needed to
work around an awkward Postgres behavior.
* [skip ci] Update CONTRIBUTING.md to mention Node setup for Python tests
* [skip ci] Add missing Python tests env var to CONTRIBUTING.md
* [skip ci] fix order of result when subscription is run with multiple nodes
* [skip ci] no-op refactor: fix a warning in Internal/Parser.hs
* [skip ci] throw error when a subscription contains remote joins
* [skip ci] Enable easier profiling by hiding AssertNF behind a flag
In order to compile a profiling build, run:
$ cabal new-build -f profiling --enable-profiling
* [skip ci] Fix two warnings
We used to lookup the objects that implement a given interface by filtering all
objects in the schema document. However, one of the tests expects us to
generate a warning if the provided `implements` field of an introspection query
specifies an object not implementing some interface. So we use that field
instead.
* [skip ci] Fix warnings by commenting out query plan caching
* [skip ci] improve masking/commenting query caching related code & few warning fixes
* [skip ci] Fixed compiler warnings in graphql-parser-hs
* Sync non-Haskell assets with master
* [skip ci] add a test inserting invalid GraphQL but valid JSON value in a jsonb column
* [skip ci] Avoid converting to/from Map
* [skip ci] Apply some hlint suggestions
* [skip ci] remove redundant constraints from buildLiveQueryPlan and explainGQLQuery
* [skip ci] add NOTEs about missing Tracing constraints in PDV from master
* Remove -fdefer-typed-holes, fix warnings
* Update cabal.project.freeze
* Limit GHC’s heap size to 8GB in CI to avoid the OOM killer
* Commit package-lock.json for Python tests’ remote schema server
* restrict env variables start with HASURA_GRAPHQL_ for headers configuration in actions, event triggers & remote schemas (#5519)
* restrict env variables start with HASURA_GRAPHQL_ for headers definition in actions & event triggers
* update CHANGELOG.md
* Apply suggestions from code review
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* add test for table_by_pk node when roles doesn't have permission to PK
* [skip ci] fix introspection query if any enum column present in primary key (fix #5200) (#5522)
* [skip ci] test case fix for a6450e126bc2d98bcfd3791501986e4627ce6c6f
* [skip ci] add tests to agg queries when role doesn't have access to any cols
* fix backend test
* Simplify subscription execution
* [skip ci] add test to check if required headers are present while querying
* Suppose, table B is related to table A and to query B certain headers are
necessary, then the test checks that we are throwing error when the header
is not set when B is queried through A
* fix mutations not checking for view mutability
* [skip ci] add variable type checking and corresponding tests
* [skip ci] add test to check if update headers are present while doing an upsert
* [skip ci] add positive counterparts to some of the negative permission tests
* fix args missing their description in introspect
* [skip ci] Remove unused function; insert missing markNotReusable call
* [skip ci] Add a Note about InputValue
* [skip ci] Delete LegacySchema/ 🎉
* [skip ci] Delete GraphQL/{Resolve,Validate}/ 🎉
* [skip ci] Delete top-level Resolve/Validate modules; tidy .cabal file
* [skip ci] Delete LegacySchema top-level module
Somehow I missed this one.
* fix input value to json
* [skip ci] elaborate on JSON objects in GraphQL
* [skip ci] add missing file
* [skip ci] add a test with subscription containing remote joins
* add a test with remote joins in mutation output
* [skip ci] Add some comments to Schema/Mutation.hs
* [skip ci] Remove no longer needed code from RemoteServer.hs
* [skip ci] Use a helper function to generate conflict clause parsers
* [skip ci] fix type checker error in fields with default value
* capitalize the header keys in select_articles_without_required_headers
* Somehow, this was the reason the tests were failing. I have no idea, why!
* [skip ci] Add a long Note about optional fields and nullability
* Improve comments a bit; simplify Schema/Common.hs a bit
* [skip ci] full implementation of 5.8.5 type checking.
* [skip ci] fix validation test teardown
* [skip ci] fix schema stitching test
* fix remote schema ignoring enum nullability
* [skip ci] fix fieldOptional to not discard nullability
* revert nullability of use_spheroid
* fix comment
* add required remote fields with arguments for tests
* [skip ci] add missing docstrings
* [skip ci] fixed description of remote fields
* [skip ci] change docstring for consistency
* fix several schema inconsistencies
* revert behaviour change in function arguments parsing
* fix remaining nullability issues in new schema
* minor no-op refactor; use isListType from graphql-parser-hs
* use nullability of remote schema node, while creating a Remote reln
* fix 'ID' input coercing & action 'ID' type relationship mapping
* include ASTs in MonadExecuteQuery
* needed for PRO code-base
* Delete code for "interfaces implementing ifaces" (draft GraphQL spec)
Previously I started writing some code that adds support for a future GraphQL
feature where interfaces may themselves be sub-types of other interfaces.
However, this code was incomplete, and partially incorrect. So this commit
deletes support for that entirely.
* Ignore a remote schema test during the upgrade/downgrade test
The PDV refactor does a better job at exposing a minimal set of types through
introspection. In particular, not every type that is present in a remote schema
is re-exposed by Hasura. The test
test_schema_stitching.py::TestRemoteSchemaBasic::test_introspection assumed that
all types were re-exposed, which is not required for GraphQL compatibility, in
order to test some aspect of our support for remote schemas.
So while this particular test has been updated on PDV, the PDV branch now does
not pass the old test, which we argue to be incorrect. Hence this test is
disabled while we await a release, after which we can re-enable it.
This also re-enables a test that was previously disabled for similar, though
unrelated, reasons.
* add haddock documentation to the action's field parsers
* Deslecting some tests in server-upgrade
Some tests with current build are failing on server upgrade
which it should not. The response is more accurate than
what it was.
Also the upgrade tests were not throwing errors when the test is
expected to return an error, but succeeds. The test framework is
patched to catch this case.
* [skip ci] Add a long Note about interfaces and object types
* send the response headers back to client after running a query
* Deselect a few more tests during upgrade/downgrade test
* Update commit_diff.txt
* change log kind from db_migrate to catalog_migrate (#5531)
* Show method and complete URI in traced HTTP calls (#5525)
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* restrict env variables start with HASURA_GRAPHQL_ for headers configuration in actions, event triggers & remote schemas (#5519)
* restrict env variables start with HASURA_GRAPHQL_ for headers definition in actions & event triggers
* update CHANGELOG.md
* Apply suggestions from code review
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
* fix introspection query if any enum column present in primary key (fix #5200) (#5522)
* Fix telemetry reporting of transport (websocket was reported as http)
* add log kinds in cli-migrations image (#5529)
* add log kinds in cli-migrations image
* give hint to resolve timeout error
* minor changes and CHANGELOG
* server: set hasura.tracecontext in RQL mutations [#5542] (#5555)
* server: set hasura.tracecontext in RQL mutations [#5542]
* Update test suite
Co-authored-by: Tirumarai Selvan <tiru@hasura.io>
* Add bulldozer auto-merge and -update configuration
We still need to add the github app (as of time of opening this PR)
Afterwards devs should be able to allow bulldozer to automatically
"update" the branch, merging in parent when it changes, as well as
automatically merge when all checks pass.
This is opt-in by adding the `auto-update-auto-merge` label to the PR.
* Remove 'bulldozer' config, try 'kodiak' for auto-merge
see: https://github.com/chdsbd/kodiak
The main issue that bit us was not being able to auto update forked
branches, also:
https://github.com/palantir/bulldozer/issues/66
https://github.com/palantir/bulldozer/issues/145
* Cherry-picked all commits
* [skip ci] Slightly improve formatting
* Revert "fix introspection query if any enum column present in primary key (fix #5200) (#5522)"
This reverts commit 0f9a5afa59a88f6824f4d63d58db246a5ba3fb03.
This undoes a cherry-pick of 34288e1eb5f2c5dad9e6d1e05453dd52397dc970 that was
already done previously in a6450e126bc2d98bcfd3791501986e4627ce6c6f, and
subsequently fixed for PDV in 70e89dc250f8ddc6e2b7930bbe2b3eeaa6dbe1db
* Do a small bit of tidying in Hasura.GraphQL.Parser.Collect
* Fix cherry-picking work
Some previous cherry-picks ended up modifying code that is commented out
* [skip ci] clarified comment regarding insert representation
* [skip ci] removed obsolete todos
* cosmetic change
* fix action error message
* [skip ci] remove obsolete comment
* [skip ci] synchronize stylish haskell extensions list
* use previously defined scalar names in parsers rather than ad-hoc literals
* Apply most syntax hlint hints.
* Clarify comment on update mutation.
* [skip ci] Clarify what fields should be specified for objects
* Update "_inc" description.
* Use record types rather than tuples fo IntrospectionResult and ParsedIntrospection
* Get rid of checkFieldNamesUnique (use Data.List.Extended.duplicates)
* Throw more errors when collecting query root names
* [skip ci] clean column parser comment
* Remove dead code inserted in ab65b39
* avoid converting to non-empty list where not needed
* add note and TODO about the disabled checks in PDV
* minor refactor in remoteField' function
* Unify two getObject methods
* Nitpicks in Remote.hs
* Update CHANGELOG.md
* Revert "Unify two getObject methods"
This reverts commit bd6bb40355b3d189a46c0312eb52225e18be57b3.
We do need two different getObject functions as the corresponding error message is different
* Fix error message in Remote.hs
* Update CHANGELOG.md
Co-authored-by: Auke Booij <auke@tulcod.com>
* Apply suggested Changelog fix.
Co-authored-by: Auke Booij <auke@tulcod.com>
* Fix typo in Changelog.
* [skip ci] Update changelog.
* reuse type names to avoid duplication
* Fix Hashable instance for Definition
The presence of `Maybe Unique`, and an optional description, as part of
`Definition`s, means that `Definition`s that are considered `Eq`ual may get
different hashes. This can happen, for instance, when one object is memoized
but another is not.
* [skip ci] Update commit_diff.txt
* Bump parser version.
* Bump freeze file after changes in parser.
* [skip ci] Incorporate commits from master
* Fix developer flag in server/cabal.project.freeze
Co-authored-by: Auke Booij <auke@tulcod.com>
* Deselect a changed ENUM test for upgrade/downgrade CI
* Deselect test here as well
* [skip ci] remove dead code
* Disable more tests for upgrade/downgrade
* Fix which test gets deselected
* Revert "Add hdb_catalog.current_setting abstraction for reading Hasura settings"
This reverts commit 66e85ab9fbd56cca2c28a80201f6604fbe811b85.
* Remove circular reference in cabal.project.freeze
Co-authored-by: Karthikeyan Chinnakonda <karthikeyan@hasura.io>
Co-authored-by: Auke Booij <auke@hasura.io>
Co-authored-by: Tirumarai Selvan <tiru@hasura.io>
Co-authored-by: Marion Schleifer <marion@hasura.io>
Co-authored-by: Aleksandra Sikora <ola.zxcvbnm@gmail.com>
Co-authored-by: Brandon Simmons <brandon.m.simmons@gmail.com>
Co-authored-by: Vamshi Surabhi <0x777@users.noreply.github.com>
Co-authored-by: Anon Ray <rayanon004@gmail.com>
Co-authored-by: rakeshkky <12475069+rakeshkky@users.noreply.github.com>
Co-authored-by: Anon Ray <ecthiender@users.noreply.github.com>
Co-authored-by: Vamshi Surabhi <vamshi@hasura.io>
Co-authored-by: Antoine Leblanc <antoine@hasura.io>
Co-authored-by: Brandon Simmons <brandon@hasura.io>
Co-authored-by: Phil Freeman <phil@hasura.io>
Co-authored-by: Lyndon Maydwell <lyndon@sordina.net>
Co-authored-by: Phil Freeman <paf31@cantab.net>
Co-authored-by: Naveen Naidu <naveennaidu479@gmail.com>
Co-authored-by: Karthikeyan Chinnakonda <chkarthikeyan95@gmail.com>
Co-authored-by: Nizar Malangadan <nizar-m@users.noreply.github.com>
Co-authored-by: Antoine Leblanc <crucuny@gmail.com>
Co-authored-by: Auke Booij <auke@tulcod.com>
2020-08-21 20:27:01 +03:00
|
|
|
mkSelectWithFromItem = FISelectWith (Lateral False)
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
mkLateralFromItem :: Select -> TableAlias -> FromItem
|
2018-10-05 11:56:47 +03:00
|
|
|
mkLateralFromItem = FISelect (Lateral True)
|
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
instance ToSQL FromItem where
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL (FISimple qualifiedTable tableAlias) =
|
|
|
|
toSQL qualifiedTable <~> maybe "" tableAliasToSqlWithAs tableAlias
|
2020-10-27 13:34:31 +03:00
|
|
|
toSQL (FIIdentifier iden) =
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL iden
|
2019-10-18 11:29:47 +03:00
|
|
|
toSQL (FIFunc funcExp) = toSQL funcExp
|
2019-04-26 11:19:59 +03:00
|
|
|
-- unnest(expressions) alias(columns)
|
2022-07-18 12:44:17 +03:00
|
|
|
toSQL (FIUnnest args tableAlias cols) =
|
|
|
|
"UNNEST"
|
|
|
|
<> parenB (", " <+> args)
|
|
|
|
<~> tableAliasToSqlWithAs tableAlias
|
|
|
|
<> parenB (", " <+> map columnAliasToSqlWithoutAs cols)
|
|
|
|
toSQL (FISelect isLateral select alias) =
|
|
|
|
toSQL isLateral <~> parenB (toSQL select) <~> tableAliasToSqlWithAs alias
|
|
|
|
toSQL (FISelectWith isLateral selectWith alias) =
|
|
|
|
toSQL isLateral <~> parenB (toSQL selectWith) <~> tableAliasToSqlWithAs alias
|
2022-07-22 18:27:42 +03:00
|
|
|
toSQL (FIValues valsExp alias columnAliases) =
|
2022-07-18 12:44:17 +03:00
|
|
|
parenB (toSQL valsExp)
|
|
|
|
<~> tableAliasToSqlWithAs alias
|
2022-07-22 18:27:42 +03:00
|
|
|
<~> case columnAliases of
|
|
|
|
Nothing -> ""
|
|
|
|
Just cols -> parenB (", " <+> map columnAliasToSqlWithoutAs cols)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (FIJoin je) =
|
|
|
|
toSQL je
|
|
|
|
|
|
|
|
newtype Lateral = Lateral Bool
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, Data, NFData, Hashable)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL Lateral where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL (Lateral True) = "LATERAL"
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (Lateral False) = mempty
|
|
|
|
|
|
|
|
data JoinExpr = JoinExpr
|
2022-07-29 17:05:03 +03:00
|
|
|
{ tjeLeft :: FromItem,
|
|
|
|
tjeType :: JoinType,
|
|
|
|
tjeRight :: FromItem,
|
|
|
|
tjeJC :: JoinCond
|
2019-12-13 00:46:33 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData JoinExpr
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable JoinExpr
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL JoinExpr where
|
|
|
|
toSQL je =
|
2018-08-27 17:17:03 +03:00
|
|
|
toSQL (tjeLeft je)
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL (tjeType je)
|
|
|
|
<~> toSQL (tjeRight je)
|
|
|
|
<~> toSQL (tjeJC je)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-10-12 12:28:43 +03:00
|
|
|
data JoinType
|
|
|
|
= Inner
|
|
|
|
| LeftOuter
|
|
|
|
| RightOuter
|
|
|
|
| FullOuter
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Eq, Show, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData JoinType
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable JoinType
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL JoinType where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL Inner = "INNER JOIN"
|
|
|
|
toSQL LeftOuter = "LEFT OUTER JOIN"
|
|
|
|
toSQL RightOuter = "RIGHT OUTER JOIN"
|
|
|
|
toSQL FullOuter = "FULL OUTER JOIN"
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-10-12 12:28:43 +03:00
|
|
|
data JoinCond
|
2022-07-29 17:05:03 +03:00
|
|
|
= JoinOn BoolExp
|
|
|
|
| JoinUsing [Identifier]
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData JoinCond
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable JoinCond
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL JoinCond where
|
|
|
|
toSQL (JoinOn be) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"ON" <~> parenB (toSQL be)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (JoinUsing cols) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"USING" <~> parenB ("," <+> cols)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-10-12 12:28:43 +03:00
|
|
|
data BoolExp
|
2022-07-29 17:05:03 +03:00
|
|
|
= BELit Bool
|
|
|
|
| BEBin BinOp BoolExp BoolExp
|
|
|
|
| BENot BoolExp
|
|
|
|
| BECompare CompareOp SQLExp SQLExp
|
2019-07-10 13:19:58 +03:00
|
|
|
| -- this is because l = (ANY (e)) is not valid
|
|
|
|
-- i.e, (ANY(e)) is not same as ANY(e)
|
2022-07-29 17:05:03 +03:00
|
|
|
BECompareAny CompareOp SQLExp SQLExp
|
|
|
|
| BENull SQLExp
|
|
|
|
| BENotNull SQLExp
|
|
|
|
| BEExists Select
|
|
|
|
| BEIN SQLExp [SQLExp]
|
|
|
|
| BEExp SQLExp
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData BoolExp
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable BoolExp
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-10-05 11:56:47 +03:00
|
|
|
-- removes extraneous 'AND true's
|
|
|
|
simplifyBoolExp :: BoolExp -> BoolExp
|
|
|
|
simplifyBoolExp be = case be of
|
|
|
|
BEBin AndOp e1 e2 ->
|
|
|
|
let e1s = simplifyBoolExp e1
|
|
|
|
e2s = simplifyBoolExp e2
|
|
|
|
in if
|
|
|
|
| e1s == BELit True -> e2s
|
|
|
|
| e2s == BELit True -> e1s
|
2020-10-21 19:35:06 +03:00
|
|
|
| otherwise -> BEBin AndOp e1s e2s
|
2018-10-05 11:56:47 +03:00
|
|
|
BEBin OrOp e1 e2 ->
|
|
|
|
let e1s = simplifyBoolExp e1
|
|
|
|
e2s = simplifyBoolExp e2
|
|
|
|
in if
|
|
|
|
| e1s == BELit False -> e2s
|
|
|
|
| e2s == BELit False -> e1s
|
2020-10-21 19:35:06 +03:00
|
|
|
| otherwise -> BEBin OrOp e1s e2s
|
2018-10-05 11:56:47 +03:00
|
|
|
e -> e
|
|
|
|
|
2018-11-16 15:40:23 +03:00
|
|
|
mkExists :: FromItem -> BoolExp -> BoolExp
|
|
|
|
mkExists fromItem whereFrag =
|
|
|
|
BEExists
|
|
|
|
mkSelect
|
2022-09-22 16:56:50 +03:00
|
|
|
{ selExtr = dummySelectList,
|
2018-11-16 15:40:23 +03:00
|
|
|
selFrom = Just $ FromExp $ pure fromItem,
|
|
|
|
selWhere = Just $ WhereFrag whereFrag
|
2018-06-27 16:11:32 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
instance ToSQL BoolExp where
|
2020-10-21 19:35:06 +03:00
|
|
|
toSQL (BELit True) = TB.text "'true'"
|
|
|
|
toSQL (BELit False) = TB.text "'false'"
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (BEBin bo bel ber) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL bel) <~> toSQL bo <~> parenB (toSQL ber)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (BENot be) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"NOT" <~> parenB (toSQL be)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (BECompare co vl vr) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL vl) <~> toSQL co <~> parenB (toSQL vr)
|
2019-07-10 13:19:58 +03:00
|
|
|
toSQL (BECompareAny co vl vr) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL vl) <~> toSQL co <~> "ANY" <> parenB (toSQL vr)
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (BENull v) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL v) <~> "IS NULL"
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (BENotNull v) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL v) <~> "IS NOT NULL"
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (BEExists sel) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"EXISTS " <~> parenB (toSQL sel)
|
2018-11-26 13:09:55 +03:00
|
|
|
-- special case to handle lhs IN (exp1, exp2)
|
|
|
|
toSQL (BEIN vl exps) =
|
2020-10-21 19:35:06 +03:00
|
|
|
parenB (toSQL vl) <~> toSQL SIN <~> parenB (", " <+> exps)
|
2019-01-17 09:21:38 +03:00
|
|
|
-- Any SQL expression which evaluates to bool value
|
2020-10-21 19:35:06 +03:00
|
|
|
toSQL (BEExp e) = parenB $ toSQL e
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
data BinOp = AndOp | OrOp
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData BinOp
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable BinOp
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL BinOp where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL AndOp = "AND"
|
|
|
|
toSQL OrOp = "OR"
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2018-09-07 15:15:28 +03:00
|
|
|
data CompareOp
|
|
|
|
= SEQ
|
|
|
|
| SGT
|
|
|
|
| SLT
|
|
|
|
| SIN
|
|
|
|
| SNE
|
2020-11-27 13:53:58 +03:00
|
|
|
| SGTE
|
|
|
|
| SLTE
|
|
|
|
| SNIN
|
2018-09-07 15:15:28 +03:00
|
|
|
| SLIKE
|
|
|
|
| SNLIKE
|
|
|
|
| SILIKE
|
|
|
|
| SNILIKE
|
|
|
|
| SSIMILAR
|
|
|
|
| SNSIMILAR
|
2020-11-27 13:53:58 +03:00
|
|
|
| SREGEX
|
|
|
|
| SIREGEX
|
|
|
|
| SNREGEX
|
|
|
|
| SNIREGEX
|
2018-09-07 15:15:28 +03:00
|
|
|
| SContains
|
|
|
|
| SContainedIn
|
|
|
|
| SHasKey
|
|
|
|
| SHasKeysAny
|
|
|
|
| SHasKeysAll
|
2021-02-25 14:05:51 +03:00
|
|
|
| SMatchesFulltext
|
2019-12-13 00:46:33 +03:00
|
|
|
deriving (Eq, Generic, Data)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2019-12-13 00:46:33 +03:00
|
|
|
instance NFData CompareOp
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance Hashable CompareOp
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance Show CompareOp where
|
2018-09-07 15:15:28 +03:00
|
|
|
show = \case
|
2021-02-25 14:05:51 +03:00
|
|
|
SEQ -> "="
|
|
|
|
SGT -> ">"
|
|
|
|
SLT -> "<"
|
|
|
|
SIN -> "IN"
|
|
|
|
SNE -> "<>"
|
|
|
|
SGTE -> ">="
|
|
|
|
SLTE -> "<="
|
|
|
|
SNIN -> "NOT IN"
|
|
|
|
SLIKE -> "LIKE"
|
|
|
|
SNLIKE -> "NOT LIKE"
|
|
|
|
SILIKE -> "ILIKE"
|
|
|
|
SNILIKE -> "NOT ILIKE"
|
|
|
|
SSIMILAR -> "SIMILAR TO"
|
|
|
|
SNSIMILAR -> "NOT SIMILAR TO"
|
|
|
|
SREGEX -> "~"
|
|
|
|
SIREGEX -> "~*"
|
|
|
|
SNREGEX -> "!~"
|
|
|
|
SNIREGEX -> "!~*"
|
|
|
|
SContains -> "@>"
|
|
|
|
SContainedIn -> "<@"
|
|
|
|
SHasKey -> "?"
|
|
|
|
SHasKeysAny -> "?|"
|
|
|
|
SHasKeysAll -> "?&"
|
|
|
|
SMatchesFulltext -> "@"
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL CompareOp where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL = fromString . show
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
data SQLDelete = SQLDelete
|
2022-07-29 17:05:03 +03:00
|
|
|
{ delTable :: QualifiedTable,
|
|
|
|
delUsing :: Maybe UsingExp,
|
|
|
|
delWhere :: Maybe WhereFrag,
|
|
|
|
delRet :: Maybe RetExp
|
2018-06-27 16:11:32 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
data SQLUpdate = SQLUpdate
|
2022-07-18 18:15:34 +03:00
|
|
|
{ upTable :: QualifiedTable,
|
|
|
|
upSet :: SetExp,
|
|
|
|
upFrom :: Maybe FromExp,
|
|
|
|
upWhere :: Maybe WhereFrag,
|
|
|
|
upRet :: Maybe RetExp
|
2018-06-27 16:11:32 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
newtype SetExp = SetExp [SetExpItem]
|
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
newtype SetExpItem = SetExpItem (PGCol, SQLExp)
|
|
|
|
deriving (Show, Eq)
|
|
|
|
|
2019-02-23 13:36:42 +03:00
|
|
|
buildUpsertSetExp ::
|
|
|
|
[PGCol] ->
|
2023-04-26 18:42:13 +03:00
|
|
|
HashMap.HashMap PGCol SQLExp ->
|
2019-02-23 13:36:42 +03:00
|
|
|
SetExp
|
|
|
|
buildUpsertSetExp cols preSet =
|
2023-04-26 18:42:13 +03:00
|
|
|
SetExp $ map SetExpItem $ HashMap.toList setExps
|
2019-02-23 13:36:42 +03:00
|
|
|
where
|
2023-04-26 18:42:13 +03:00
|
|
|
setExps = HashMap.union preSet $
|
|
|
|
HashMap.fromList $
|
2019-02-23 13:36:42 +03:00
|
|
|
flip map cols $ \col ->
|
2020-10-27 13:34:31 +03:00
|
|
|
(col, SEExcluded $ toIdentifier col)
|
2018-08-17 17:44:43 +03:00
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
newtype UsingExp = UsingExp [TableName]
|
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
instance ToSQL UsingExp where
|
|
|
|
toSQL (UsingExp tables) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"USING" <~> "," <+> tables
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
newtype RetExp = RetExp [Extractor]
|
|
|
|
deriving (Show, Eq)
|
|
|
|
|
2018-10-05 18:13:51 +03:00
|
|
|
selectStar :: Extractor
|
2020-01-16 07:53:28 +03:00
|
|
|
selectStar = Extractor (SEStar Nothing) Nothing
|
|
|
|
|
|
|
|
selectStar' :: Qual -> Extractor
|
|
|
|
selectStar' q = Extractor (SEStar (Just q)) Nothing
|
2018-10-05 18:13:51 +03:00
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
returningStar :: RetExp
|
2018-10-05 18:13:51 +03:00
|
|
|
returningStar = RetExp [selectStar]
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL RetExp where
|
|
|
|
toSQL (RetExp []) =
|
|
|
|
mempty
|
|
|
|
toSQL (RetExp exps) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"RETURNING" <~> (", " <+> exps)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL SQLDelete where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL sd =
|
|
|
|
"DELETE FROM"
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL (delTable sd)
|
|
|
|
<~> toSQL (delUsing sd)
|
|
|
|
<~> toSQL (delWhere sd)
|
|
|
|
<~> toSQL (delRet sd)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL SQLUpdate where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL a =
|
|
|
|
"UPDATE"
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL (upTable a)
|
|
|
|
<~> toSQL (upSet a)
|
|
|
|
<~> toSQL (upFrom a)
|
|
|
|
<~> toSQL (upWhere a)
|
|
|
|
<~> toSQL (upRet a)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL SetExp where
|
|
|
|
toSQL (SetExp cvs) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"SET" <~> ("," <+> cvs)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
instance ToSQL SetExpItem where
|
|
|
|
toSQL (SetExpItem (col, val)) =
|
2020-10-21 19:35:06 +03:00
|
|
|
toSQL col <~> "=" <~> toSQL val
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
data SQLConflictTarget
|
2022-07-29 17:05:03 +03:00
|
|
|
= SQLColumn [PGCol]
|
|
|
|
| SQLConstraint ConstraintName
|
2018-06-27 16:11:32 +03:00
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
instance ToSQL SQLConflictTarget where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL (SQLColumn cols) =
|
|
|
|
"("
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> ("," <+> cols)
|
|
|
|
<~> ")"
|
|
|
|
toSQL (SQLConstraint cons) = "ON CONSTRAINT" <~> toSQL cons
|
2018-06-27 16:11:32 +03:00
|
|
|
|
|
|
|
data SQLConflict
|
2022-07-29 17:05:03 +03:00
|
|
|
= DoNothing (Maybe SQLConflictTarget)
|
|
|
|
| Update SQLConflictTarget SetExp (Maybe WhereFrag)
|
2018-06-27 16:11:32 +03:00
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
instance ToSQL SQLConflict where
|
2018-10-19 05:15:28 +03:00
|
|
|
toSQL (DoNothing Nothing) = "ON CONFLICT DO NOTHING"
|
|
|
|
toSQL (DoNothing (Just ct)) =
|
|
|
|
"ON CONFLICT"
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL ct
|
|
|
|
<~> "DO NOTHING"
|
2018-12-15 19:10:29 +03:00
|
|
|
toSQL (Update ct set whr) =
|
|
|
|
"ON CONFLICT"
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL ct
|
|
|
|
<~> "DO UPDATE"
|
|
|
|
<~> toSQL set
|
|
|
|
<~> toSQL whr
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-05-30 15:17:37 +03:00
|
|
|
newtype ValuesExp = ValuesExp {getValuesExp :: [TupleExp]}
|
server: delete the `Cacheable` type class in favor of `Eq`
What is the `Cacheable` type class about?
```haskell
class Eq a => Cacheable a where
unchanged :: Accesses -> a -> a -> Bool
default unchanged :: (Generic a, GCacheable (Rep a)) => Accesses -> a -> a -> Bool
unchanged accesses a b = gunchanged (from a) (from b) accesses
```
Its only method is an alternative to `(==)`. The added value of `unchanged` (and the additional `Accesses` argument) arises _only_ for one type, namely `Dependency`. Indeed, the `Cacheable (Dependency a)` instance is non-trivial, whereas every other `Cacheable` instance is completely boilerplate (and indeed either generated from `Generic`, or simply `unchanged _ = (==)`). The `Cacheable (Dependency a)` instance is the only one where the `Accesses` argument is not just passed onwards.
The only callsite of the `unchanged` method is in the `ArrowCache (Rule m)` method. That is to say that the `Cacheable` type class is used to decide when we can re-use parts of the schema cache between Metadata operations.
So what is the `Cacheable (Dependency a)` instance about? Normally, the output of a `Rule m a b` is re-used when the new input (of type `a`) is equal to the old one. But sometimes, that's too coarse: it might be that a certain `Rule m a b` only depends on a small part of its input of type `a`. A `Dependency` allows us to spell out what parts of `a` are being depended on, and these parts are recorded as values of types `Access a` in the state `Accesses`.
If the input `a` changes, but not in a way that touches the recorded `Accesses`, then the output `b` of that rule can be re-used without recomputing.
So now you understand _why_ we're passing `Accesses` to the `unchanged` method: `unchanged` is an equality check in disguise that just needs some additional context.
But we don't need to pass `Accesses` as a function argument. We can use the `reflection` package to pass it as type-level context. So the core of this PR is that we change the instance declaration from
```haskell
instance (Cacheable a) => Cacheable (Dependency a) where
```
to
```haskell
instance (Given Accesses, Eq a) => Eq (Dependency a) where
```
and use `(==)` instead of `unchanged`.
If you haven't seen `reflection` before: it's like a `MonadReader`, but it doesn't require a `Monad`.
In order to pass the current `Accesses` value, instead of simply passing the `Accesses` as a function argument, we need to instantiate the `Given Accesses` context. We use the `give` method from the `reflection` package for that.
```haskell
give :: forall r. Accesses -> (Given Accesses => r) -> r
unchanged :: (Given Accesses => Eq a) => Accesses -> a -> a -> Bool
unchanged accesses a b = give accesses (a == b)
```
With these three components in place, we can delete the `Cacheable` type class entirely.
The remainder of this PR is just to remove the `Cacheable` type class and its instances.
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/6877
GitOrigin-RevId: 7125f5e11d856e7672ab810a23d5bf5ad176e77f
2022-11-21 19:33:56 +03:00
|
|
|
deriving (Show, Eq, Data, NFData, Hashable)
|
2019-03-22 10:08:42 +03:00
|
|
|
|
|
|
|
instance ToSQL ValuesExp where
|
|
|
|
toSQL (ValuesExp tuples) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"VALUES" <~> (", " <+> tuples)
|
2019-03-22 10:08:42 +03:00
|
|
|
|
2018-06-27 16:11:32 +03:00
|
|
|
data SQLInsert = SQLInsert
|
2022-07-29 17:05:03 +03:00
|
|
|
{ siTable :: QualifiedTable,
|
|
|
|
siCols :: [PGCol],
|
|
|
|
siValues :: ValuesExp,
|
|
|
|
siConflict :: (Maybe SQLConflict),
|
|
|
|
siRet :: (Maybe RetExp)
|
2018-06-27 16:11:32 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
instance ToSQL SQLInsert where
|
|
|
|
toSQL si =
|
2020-01-16 07:53:28 +03:00
|
|
|
"INSERT INTO"
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> toSQL (siTable si)
|
2022-05-11 19:00:10 +03:00
|
|
|
<~> ( if null (siCols si)
|
2022-05-30 15:17:37 +03:00
|
|
|
then
|
|
|
|
"VALUES"
|
|
|
|
<~> ", "
|
|
|
|
<+> map (const ("(DEFAULT)" :: TB.Builder)) (getValuesExp (siValues si))
|
2022-05-11 19:00:10 +03:00
|
|
|
else "(" <~> (", " <+> siCols si) <~> ")" <~> toSQL (siValues si)
|
|
|
|
)
|
2020-10-21 19:35:06 +03:00
|
|
|
<~> maybe "" toSQL (siConflict si)
|
|
|
|
<~> toSQL (siRet si)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | Top-level Common Table Expression statement.
|
|
|
|
--
|
|
|
|
-- A top level CTE can be a query or a mutation statement.
|
|
|
|
--
|
|
|
|
-- Postgres supports mutations only in top-level CTEs.
|
|
|
|
-- See <https://www.postgresql.org/docs/current/queries-with.html#QUERIES-WITH-MODIFYING>
|
|
|
|
data TopLevelCTE
|
2022-07-29 17:05:03 +03:00
|
|
|
= CTESelect Select
|
|
|
|
| CTEInsert SQLInsert
|
|
|
|
| CTEUpdate SQLUpdate
|
|
|
|
| CTEDelete SQLDelete
|
2023-02-03 14:15:08 +03:00
|
|
|
| CTEUnsafeRawSQL (InterpolatedQuery SQLExp)
|
2018-06-27 16:11:32 +03:00
|
|
|
deriving (Show, Eq)
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
instance ToSQL TopLevelCTE where
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL = \case
|
|
|
|
CTESelect q -> toSQL q
|
|
|
|
CTEInsert q -> toSQL q
|
|
|
|
CTEUpdate q -> toSQL q
|
|
|
|
CTEDelete q -> toSQL q
|
2023-02-03 14:15:08 +03:00
|
|
|
CTEUnsafeRawSQL (InterpolatedQuery parts) ->
|
|
|
|
foldMap
|
|
|
|
( \case
|
|
|
|
IIText t -> TB.text t
|
|
|
|
IIVariable v -> toSQL v
|
|
|
|
)
|
|
|
|
parts
|
2023-02-03 19:27:44 +03:00
|
|
|
-- if the user has a comment on the last line, this will make sure it doesn't interrupt the rest of the query
|
|
|
|
<> "\n"
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2023-02-28 14:17:08 +03:00
|
|
|
-- | Represents a common table expresion that can be used in nested selects.
|
|
|
|
data InnerCTE
|
|
|
|
= ICTESelect Select
|
|
|
|
| ICTEUnsafeRawSQL (InterpolatedQuery SQLExp)
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
|
|
|
|
|
|
|
instance NFData InnerCTE
|
|
|
|
|
|
|
|
instance Hashable InnerCTE
|
|
|
|
|
|
|
|
toTopLevelCTE :: InnerCTE -> TopLevelCTE
|
|
|
|
toTopLevelCTE = \case
|
|
|
|
ICTESelect select -> CTESelect select
|
|
|
|
ICTEUnsafeRawSQL query -> CTEUnsafeRawSQL query
|
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | A @SELECT@ statement with Common Table Expressions.
|
|
|
|
-- <https://www.postgresql.org/docs/current/queries-with.html>
|
|
|
|
--
|
|
|
|
-- These CTEs are determined by the @statement@ parameter.
|
|
|
|
-- Currently they are either 'TopLevelCTE', which allow for a query or mutation statement,
|
|
|
|
-- or 'Select', which only allow for querying results.
|
|
|
|
--
|
|
|
|
-- The distinction is required because Postgres only supports mutations in CTEs
|
|
|
|
-- at the top level.
|
|
|
|
-- See <https://www.postgresql.org/docs/current/queries-with.html#QUERIES-WITH-MODIFYING>
|
|
|
|
data SelectWithG statement = SelectWith
|
2022-07-29 17:05:03 +03:00
|
|
|
{ swCTEs :: [(TableAlias, statement)],
|
|
|
|
swSelect :: Select
|
2020-06-08 15:13:01 +03:00
|
|
|
}
|
|
|
|
deriving (Show, Eq, Generic, Data)
|
2018-06-27 16:11:32 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance (NFData v) => NFData (SelectWithG v)
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2020-06-08 15:13:01 +03:00
|
|
|
instance (Hashable v) => Hashable (SelectWithG v)
|
|
|
|
|
|
|
|
instance (ToSQL v) => ToSQL (SelectWithG v) where
|
2023-01-27 17:36:35 +03:00
|
|
|
toSQL (SelectWith [] sel) = toSQL sel
|
2018-06-27 16:11:32 +03:00
|
|
|
toSQL (SelectWith ctes sel) =
|
2020-10-21 19:35:06 +03:00
|
|
|
"WITH " <> (", " <+> map f ctes) <~> toSQL sel
|
2018-06-27 16:11:32 +03:00
|
|
|
where
|
2022-07-18 12:44:17 +03:00
|
|
|
f (al, q) = tableAliasToSqlWithoutAs al <~> "AS" <~> parenB (toSQL q)
|
2020-06-08 15:13:01 +03:00
|
|
|
|
2022-07-18 12:44:17 +03:00
|
|
|
-- | A top-level select with CTEs.
|
|
|
|
type SelectWith = SelectWithG TopLevelCTE
|
2021-01-26 15:22:24 +03:00
|
|
|
|
|
|
|
-- local helpers
|
|
|
|
|
|
|
|
infixr 6 <+>
|
2021-09-24 01:56:37 +03:00
|
|
|
|
2021-01-26 15:22:24 +03:00
|
|
|
(<+>) :: (ToSQL a) => Text -> [a] -> TB.Builder
|
|
|
|
(<+>) _ [] = mempty
|
|
|
|
(<+>) kat (x : xs) =
|
|
|
|
toSQL x <> mconcat [TB.text kat <> toSQL x' | x' <- xs]
|
|
|
|
{-# INLINE (<+>) #-}
|