morpheus-graphql-core 0.20.0 → 0.20.1
raw patch · 2 files changed
+4/−7 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Morpheus.Types.Internal.AST: [DataEnum] :: {enumMembers :: DataEnum s} -> CondTypeContent LEAF a s
+ Data.Morpheus.Types.Internal.AST: [DataEnum] :: DataEnum s -> CondTypeContent LEAF a s
- Data.Morpheus.Types.Internal.AST: [DataInputObject] :: {inputObjectFields :: FieldsDefinition IN s} -> CondTypeContent INPUT_OBJECT a s
+ Data.Morpheus.Types.Internal.AST: [DataInputObject] :: FieldsDefinition IN s -> CondTypeContent INPUT_OBJECT a s
- Data.Morpheus.Types.Internal.AST: [DataInputUnion] :: {inputUnionMembers :: UnionTypeDefinition IN s} -> CondTypeContent IN a s
+ Data.Morpheus.Types.Internal.AST: [DataInputUnion] :: UnionTypeDefinition IN s -> CondTypeContent IN a s
- Data.Morpheus.Types.Internal.AST: [DataInterface] :: {interfaceFields :: FieldsDefinition OUT s} -> CondTypeContent IMPLEMENTABLE a s
+ Data.Morpheus.Types.Internal.AST: [DataInterface] :: FieldsDefinition OUT s -> CondTypeContent IMPLEMENTABLE a s
- Data.Morpheus.Types.Internal.AST: [DataObject] :: {objectImplements :: [TypeName], objectFields :: FieldsDefinition OUT s} -> CondTypeContent OBJECT a s
+ Data.Morpheus.Types.Internal.AST: [DataObject] :: [TypeName] -> FieldsDefinition OUT s -> CondTypeContent OBJECT a s
- Data.Morpheus.Types.Internal.AST: [DataScalar] :: {dataScalar :: ScalarDefinition} -> CondTypeContent LEAF a s
+ Data.Morpheus.Types.Internal.AST: [DataScalar] :: ScalarDefinition -> CondTypeContent LEAF a s
- Data.Morpheus.Types.Internal.AST: [DataUnion] :: {unionMembers :: UnionTypeDefinition OUT s} -> CondTypeContent OUT a s
+ Data.Morpheus.Types.Internal.AST: [DataUnion] :: UnionTypeDefinition OUT s -> CondTypeContent OUT a s
- Data.Morpheus.Types.Internal.AST: [DefaultInputValue] :: {defaultInputValue :: Value s} -> FieldContent (IN <=? cat) cat s
+ Data.Morpheus.Types.Internal.AST: [DefaultInputValue] :: Value s -> FieldContent (IN <=? cat) cat s
- Data.Morpheus.Types.Internal.AST: [FieldArgs] :: {fieldArgsDef :: ArgumentsDefinition s} -> FieldContent (OUT <=? cat) cat s
+ Data.Morpheus.Types.Internal.AST: [FieldArgs] :: ArgumentsDefinition s -> FieldContent (OUT <=? cat) cat s
- Data.Morpheus.Types.Internal.AST: [Selection] :: {selectionPosition :: Position, selectionAlias :: Maybe FieldName, selectionName :: FieldName, selectionArguments :: Arguments s, selectionDirectives :: Directives s, selectionContent :: SelectionContent s} -> Selection s
+ Data.Morpheus.Types.Internal.AST: [Selection] :: Position -> Maybe FieldName -> FieldName -> Arguments s -> Directives s -> SelectionContent s -> Selection s
- Data.Morpheus.Types.Internal.AST: [UnionSelection] :: {defaultSelection :: SelectionSet VALID, conditionalSelections :: UnionSelection VALID} -> SelectionContent VALID
+ Data.Morpheus.Types.Internal.AST: [UnionSelection] :: SelectionSet VALID -> UnionSelection VALID -> SelectionContent VALID
- Data.Morpheus.Types.Internal.AST: [ValidVariableValue] :: {validVarContent :: ValidValue} -> VariableContent VALID
+ Data.Morpheus.Types.Internal.AST: [ValidVariableValue] :: ValidValue -> VariableContent VALID
Files
morpheus-graphql-core.cabal view
@@ -5,7 +5,7 @@ -- see: https://github.com/sol/hpack name: morpheus-graphql-core-version: 0.20.0+version: 0.20.1 synopsis: Morpheus GraphQL Core description: Build GraphQL APIs with your favorite functional language! category: web, graphql
src/Data/Morpheus/Internal/Graph.hs view
@@ -22,7 +22,7 @@ type Graph name = [Edges name] cycleChecking ::- (Applicative m, Eq name) =>+ (Eq name, Monad m) => (NonEmpty (Ref name) -> m ()) -> Graph name -> m ()@@ -31,16 +31,13 @@ checkNode (node, _) = cycleCheckingWith graph node [node] fail' cycleCheckingWith ::- (Applicative m, Eq name) =>+ (Eq name, Monad m) => Graph name -> Ref name -> [Ref name] -> (NonEmpty (Ref name) -> m ()) -> m ()-cycleCheckingWith graph parentNode history fail' =- case lookup parentNode graph of- Just node -> traverse_ checkNode node- Nothing -> pure ()+cycleCheckingWith graph parentNode history fail' = forM_ (lookup parentNode graph) (traverse_ checkNode) where checkNode node | node `elem` history =