mirror of
https://github.com/hasura/graphql-engine.git
synced 2024-12-17 12:31:52 +03:00
47dcae1614
When using self referential relationships in boolean expressions, the exists clause incorrectly uses the table names to qualify columns which will be the same for parent table and the child table. This is now fixed by generating unique aliases as we traverse down the relationships.
28 lines
1.4 KiB
Haskell
28 lines
1.4 KiB
Haskell
module Hasura.Prelude
|
|
( module M
|
|
) where
|
|
|
|
import Control.Applicative as M ((<|>))
|
|
import Control.Monad as M (void, when)
|
|
import Control.Monad.Except as M
|
|
import Control.Monad.Fail as M (MonadFail)
|
|
import Control.Monad.Identity as M
|
|
import Control.Monad.Reader as M
|
|
import Control.Monad.State as M
|
|
import Data.Bool as M (bool)
|
|
import Data.Either as M (lefts, partitionEithers, rights)
|
|
import Data.Foldable as M (toList)
|
|
import Data.Hashable as M (Hashable)
|
|
import Data.List as M (find, foldl', group, sort, sortBy)
|
|
import Data.Maybe as M (catMaybes, fromMaybe, isJust,
|
|
isNothing, listToMaybe, mapMaybe,
|
|
maybeToList)
|
|
import Data.Ord as M (comparing)
|
|
import Data.Semigroup as M (Semigroup (..))
|
|
import Data.String as M (IsString)
|
|
import Data.Text as M (Text)
|
|
import Data.Word as M (Word64)
|
|
import GHC.Generics as M (Generic)
|
|
import Prelude as M hiding (fail, init, lookup)
|
|
import Text.Read as M (readEither, readMaybe)
|