h&      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefgh i j k l m n o p q r s t u v w x y z { |  Safe-Inferred/1 graphula3A class that provides backwards compatibility with persistent-2.14If you are using that version or above, then this is a class alias for }%. Otherwise, it is an identity alias.    Safe-Inferred graphulaRun a generatorThis is akin to  , but utilizing graphula's generation. The size passed to the generator is always 30; if you want another size then you should explicitly use  .   Safe-Inferred/1_   Safe-Inferred )*/012? Safe-Inferred ")*/01?#graphula/Run the graph while logging to a temporary file$graphula#, but to the specified file%graphula#+, but using the custom action to accumulate"#$%"#$% Safe-Inferred// Safe-Inferred )*/0189:; x `dependsOn` d `dependsOn` d) = dependsOn The default, -based implementation will assign values by the order of the fields in the model's type.123456789:;<=>?@ABCDEFGHIEFGHBCDI>?@A9783456<=:;21 Safe-Inferred %&)*/012;?Xgraphula,Could not satisfy constraints defined using \Ygraphula*Could not satisfy database constraints on graphulaLike Endo but uses Kliesli compositionZgraphula)Options for generating an individual nodeZ: can be created and combined with the Monoidal operations  and . a1 <- node @A () mempty a2 <- node @A () $ edit $ \a -> a { someField = True } a3 <- node @A () $ ensure $ (== True) . someField[graphula)Modify the node after it's been generated 5a <- node @A () $ edit $ \a -> a { someField = True }\graphula1Require a node to satisfy the specified predicate 0a <- node @A () $ ensure $ (== True) . someFieldN.B. ensuring a condition that is infrequently met can be innefficient.]graphulaGenerate a node with a default (Arbitrary or database-provided) key a <- node @A () mempty^graphula+Generate a node with an explictly-given key let someKey = UUID.fromString "..." a <- nodeKeyed @A someKey () memptyWXYZ[\]^]^Z[\WXY  Safe-Inferred ")*/012?jgraphula%A constraint over lists of nodes for , and h.7Helpful for defining utility functions over many nodes. mkABC :: (GraphulaContext m '[A, B, C]) => m (Node m C) mkABC = do a <- node A () mempty b <- node B (only a) mempty node @C (a, b) $ edit $ n -> n { cc = "spanish" } kgraphula Optional seedgraphulaDatabase runner("#$/2>?@ABCDEFGHIWXYZ[\]^hijk(EFGHBCDI][\ikWXY>?@A^"#$jhZ2/  Safe-Inferred 1yugraphula"Type-class for turning a tuple of  into a tuple of For example, given:  instance HasDependencies Course where type Dependencies Course = (SchoolId, TeacherId) You would have to do,  course <- node6 @Course (entityKey school, entityKey teacher) mempty !This type-class allows you to do:  course <- node @Course (v (school, teacher)) mempty 4The type class instances currently scale up 4-tuple  Dependencies.wgraphulaEquivalent to B . vuwwvu Safe-Inferred  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHHIIJKLMNNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqr s t u v w x y z { | } ~         'graphula-2.1.0.0-Fs2W3DcwjfEHLHGrmODeECGraphula.ClassGraphula.ArbitraryGraphula.Dependencies.GenericGraphula.IdempotentGraphula.LoggedGraphula.NoConstraintGraphula.Dependencies Graphula.NodeGraphula Graphula.KeyTest.QuickCheckgenerateresizePaths_graphulaMonadGraphulaBackendLoggingaskGenlogNodeMonadGraphulaFrontendinsert insertKeyedremove MonadGraphulaGraphulaSafeToInsert$fGraphulaSafeToInsertaGHasDependenciesgenericDependsOn$$fGHasDependenciesProxyProxynodeVoid($fGHasDependenciesProxyProxyEitherEither)$fGHasDependenciesProxyProxyEitherEither0)$fGHasDependenciesProxyProxyEitherEither1&$fGHasDependenciesProxyProxyVoidEither'$fGHasDependenciesProxyProxyVoidEither0$$fGHasDependenciesRecursiveProxy()()'$fGHasDependenciesRecursiveProxy(,)deps&$fGHasDependenciesRecursiveProxy(,)(,))$fGHasDependenciesProxyProxyEitherEither2GraphulaIdempotentTrunGraphulaIdempotentT*$fMonadGraphulaFrontendGraphulaIdempotentT$fMonadTransGraphulaIdempotentT"$fMonadUnliftIOGraphulaIdempotentT$fFunctorGraphulaIdempotentT $fApplicativeGraphulaIdempotentT$fMonadGraphulaIdempotentT$fMonadIOGraphulaIdempotentT%$fMonadReaderIORefGraphulaIdempotentTGraphulaLoggedTrunGraphulaLoggedTrunGraphulaLoggedWithFileTrunGraphulaLoggedUsingT&$fMonadGraphulaFrontendGraphulaLoggedT%$fMonadGraphulaBackendGraphulaLoggedT$fMonadTransGraphulaLoggedT$fMonadUnliftIOGraphulaLoggedT$fFunctorGraphulaLoggedT$fApplicativeGraphulaLoggedT$fMonadGraphulaLoggedT$fMonadIOGraphulaLoggedT!$fMonadReaderIORefGraphulaLoggedT NoConstraint$fNoConstrainta generateKey GenerateKeyInsertWithPossiblyRequiredKeyInsertConstraintinsertWithPossiblyRequiredKeyjustKey KeyForInsertKeyRequirementForInsertKeySourceTypeMOptionalRequired KeySourceType SourceDefaultSourceArbitrarySourceExternalOnlyfromOnlyHasDependencies Dependencies KeySource dependsOnonly'$fInsertWithPossiblyRequiredKeyRequired'$fInsertWithPossiblyRequiredKeyOptional%$fGenerateKeyInternalSourceArbitrarya#$fGenerateKeyInternalSourceDefaulta$fGenerateKeya$$fGenerateKeyInternalSourceExternala$fEqOnly $fShowOnly $fOrdOnly $fGenericOnly $fFunctorOnly$fFoldableOnly$fTraversableOnlyGenerationFailure'GenerationFailureMaxAttemptsToConstrain$GenerationFailureMaxAttemptsToInsert NodeOptionseditensurenode nodeKeyed $fMonoidKendo$fSemigroupKendo$fMonoidNodeOptions$fSemigroupNodeOptions$fExceptionGenerationFailure$fShowGenerationFailure$fEqGenerationFailure$fGenericNodeOptions$fGenericKendo GraphulaNode GraphulaTGraphulaContext runGraphulaT $fMonadGraphulaFrontendGraphulaT$fMonadGraphulaBackendGraphulaT$fMonadUnliftIOGraphulaT$fMonadTransGraphulaT$fFunctorGraphulaT$fApplicativeGraphulaT$fMonadGraphulaT$fMonadIOGraphulaT$fMonadReaderArgsGraphulaTKeyskeysonlyKey$fEntityKeys(,,,)$fEntityKeys(,,)$fEntityKeys(,)$fEntityKeysOnly$fEntityKeysEntity)persistent-2.14.6.0-MwxHRJmapKL0rPNtlgHxp$Database.Persist.Class.PersistEntity SafeToInsertKeySourceTypeInternalM(QuickCheck-2.14.3-K5ff1uztwzGAuZfNkBXfznTest.QuickCheck.Arbitrary ArbitraryKeybase GHC.GenericsGenericKendoGHC.Base<>memptyEntity entityKeyversiongetDataFileName getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDir