h&_      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ [ \ ] ^ _ ` a b c d e f g h i j k l m n  Safe-Inferred/1graphula3A class that provides backwards compatibility with persistent-2.14If you are using that version or above, then this is a class alias for o%. 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?q Safe-Inferred ")*/01?i"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, r-based implementation will assign values by the order of the fields in the model's type.0123456789:;<=9:;<678=234510 Safe-Inferred %&)*/012;?Jgraphula,Could not satisfy constraints defined using NKgraphula*Could not satisfy database constraints on sgraphulaLike Endo but uses Kliesli compositionLgraphula)Options for generating an individual nodeL: can be created and combined with the Monoidal operations t and u. a1 <- node @A () mempty a2 <- node @A () $ edit $ \a -> a { someField = True } a3 <- node @A () $ ensure $ (== True) . someFieldMgraphula)Modify the node after it's been generated 5a <- node @A () $ edit $ \a -> a { someField = True }Ngraphula1Require a node to satisfy the specified predicate 0a <- node @A () $ ensure $ (== True) . someFieldN.B. ensuring a condition that is infrequently met can be innefficient.Ographula6Generate a node with a default (Database-provided) key a <- node @A () memptyPgraphula+Generate a node with an explictly-given key let someKey = UUID.fromString "..." a <- nodeKeyed @A someKey () memptyIJKLMNOPOPLMNIJK  Safe-Inferred ")*/012?\graphula%A constraint over lists of nodes for , and Z.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" } ]graphula Optional seedgraphulaDatabase runner'!"#.123456789:;<=IJKLMNOPZ[\]'9:;<678=OMN[]IJK2345P!"#\ZL1.  Safe-Inferred 1ggraphula"Type-class for turning a tuple of v into a tuple of qFor 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 (h (school, teacher)) mempty 4The type class instances currently scale up 4-tuple  Dependencies.igraphulaEquivalent to 6 . whgiihg Safe-Inferredxyz{|}~  !"#$%&'()*+,-./0123456789:;<=>?@ABCDDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef g h i j k l m n o p q r s t u v w x y z {|}~|}|}|}'graphula-2.0.2.2-KaQe6t09vpIEjDjoM12z1NGraphula.ClassGraphula.ArbitraryGraphula.Dependencies.GenericGraphula.IdempotentGraphula.LoggedGraphula.NoConstraintGraphula.Dependencies Graphula.NodeGraphula Graphula.KeyTest.QuickCheckgenerateresizePaths_graphulaMonadGraphulaBackendLoggingaskGenlogNodeMonadGraphulaFrontendinsertremove 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 GenerateKey KeySourceType SourceDefaultSourceArbitrarySourceExternalOnlyfromOnlyHasDependencies Dependencies KeySource dependsOnonly%$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.3.0-BjSojJAz4uEEHUMi8j1VnJ$Database.Persist.Class.PersistEntity SafeToInsert(QuickCheck-2.14.2-9EAFA6afNUqGbN355JryFuTest.QuickCheck.Arbitrary ArbitraryKeybase GHC.GenericsGenericKendoGHC.Base<>memptyEntity entityKeyversiongetDataFileName getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDir