úÎ(0"ÚQ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOP(c) 2015 Athan ClarkBSD-3athan.clark@gmail.com experimentalGHCNone  13;<=>?CV ÅAdjacent stepsAThe predicate, existentially quantified in the successful result r5The result function, capturing the quantified result r- and turning it into a top-level variable a.Any sub-trie must have all< results preceeded in arity with the result at this step. overwrite on the right HLookup and delete only - can't arbitrarilly construct a predicated trie.HLookup and delete only - can't arbitrarilly construct a predicated trie.    (c) 2015 Athan ClarkBSD-3athan.clark@gmail.com experimentalGHCNone 13;<=>?CNVzThe "root" node - the path at []The actual predicative triea literal stepa  predicative step€Find the nearest parent node of the requested query, while returning the split of the string that was matched, and what wasn't. $#"!&% (c) 2015 Athan Clark BSD-styleathan.clark@gmail.com experimentalGHCNone &'+-;<=>?AFQSTV+#Container when defining route paths,2Constrained to AttoParsec, Regex-Compat and T.Text-XA simple proof showing that the list version and function version are interchangable.. "FoldR Extend start chunks ~ result0Turn a list of tries (Rooted!) into a node with those children25Creates a string of nodes - a trie with a width of 1.4-Convenience type-level function for removing Qs from a type list.5Match a literal key66Match with a predicate against the url chunk directly.7(The cons-cell for building a query path.8The basis, equivalent to []9&Use raw strings instead of prepending l:Existentially quantified case; Literal case+,-./0123456782301./-45678,++RS,TUVWX./012379 (c) 2015 Athan Clark BSD-styleathan.clark@gmail.com experimentalGHCNone 3<>?FKT!V+,5678@ABCDEFGHIJ@ABCDEF5678GIJH+,@ABNone"++,5678@ABCDEFGHIJSafe"³YZ[\]^_`a       !"#$%&'()*+,-./0123456789:;<=>?@ABCCDEFGHIJKLMNOPQRSTUVWXYZ[ \]^_`abcd%pred-trie-0.6.0-1IeWOLGzF1YHIUncIYwVMData.Trie.Pred.Base.StepData.Trie.Pred.BaseData.Trie.Pred.Interface.TypesData.Trie.Pred.InterfaceData.Trie.PredPaths_pred_triePredStep unPredStepsPredpredPredpredDatapredSub singletonPred unionPred$fTrieNonEmptysPred $fNFDataPred $fFunctorPred $fShowPred$fMonoidPredStep$fTrieNonEmptysPredStep$fNFDataPredStep$fShowPredStep$fFunctorPredStepRootedPredTrie rootedBase rootedSubPredTriepredLits predPredsemptyPTmatchPT matchesPTemptyRPTmatchRPT matchesRPT$fMonoidPredTrie$fTrieNonEmptykPredTrie$fArbitraryPredTrie$fNFDataPredTrie$fMonoidRootedPredTrie$fTrie[]kRootedPredTrie$fShowPredTrie$fFunctorPredTrie$fShowRootedPredTrie$fFunctorRootedPredTrie PathChunks PathChunkExtrudeSoundlyExtrudeextrudeExtendextend Singleton singleton CatMaybesonlypred./nil$fIsStringPathChunk-$fExtendPathChunkRootedPredTrieRootedPredTrie.$fExtendPathChunkRootedPredTrieRootedPredTrie0$fExtrudePathChunkstrie0trie2/$fExtrudePathChunksRootedPredTrieRootedPredTrie$fSingletonPathChunksnewtrie1$$fSingletonPathChunksaRootedPredTrie PTBuilderT runPTBuilderTexecPTBuilderTinsert insertHereprefixlookupdeletematchmatches%$fMonadWriterRootedPredTriePTBuilderT$fFunctorPTBuilderT$fApplicativePTBuilderT$fMonadPTBuilderT$fMonadTransPTBuilderT$fMonadStatePTBuilderTbaseGHC.BaseNothingConsNilLitPred'litChunkpredTagversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName