úÎ'Þ#ú<      !"#$%&'()*+,-./0123456789:;(c) 2015 Athan ClarkBSD-3athan.clark@gmail.com experimentalGHCNone+-3457;NAdjacent steps:Unique identifier for the predicate - used for combinationAThe 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. Last-style instance 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 +-3457;FNThe "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!"&(34579>IKLN##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 ~ result(Turn a list of tries (Rooted!) into a node with those children*5Creates a string of nodes - a trie with a width of 1.,-Convenience type-level function for removing <s from a type list.-Match a literal key.6Match with a predicate against the url chunk directly./(The cons-cell for building a query path.0The basis, equivalent to []=&Use raw strings instead of prepending l>Existentially quantified case? Literal case#@A$BCDEF%&'()*+,-./0=GH>?IJ#$%&'()*+,-./0*+()&'%,-./0$##@A$BDCEF%&'()*+,-./0=GH>?IJ/ (c) 2015 Athan Clark BSD-styleathan.clark@gmail.com experimentalGHCNone -47>CL 123456789:;K#$-./0123456789:;1234567-./08:;9#$ 123456789:;KNone#$-./0123456789:;L      !"#$%&'()*+,-./01233456789:;<=>?@ABCDEFG  HIJKLMpredt_GxQCg66XsT2L4YLjbyahiIData.Trie.Pred.Base.StepData.Trie.Pred.BaseData.Trie.Pred.Interface.TypesData.Trie.Pred.InterfaceData.Trie.Pred PredSteps unPredStepsPredSteppredTagpredPredpredDatapredSub singletonPred unionPred$fMonoidPredSteps$fTrieNonEmptysPredSteps$fTrieNonEmptysPredStep$fFunctorPredStep$fShowPredStepRootedPredTrie rootedBase rootedSubPredTriepredLits predPredsemptyPTmatchPT matchesPTemptyRPTmatchRPT matchesRPT$fMonoidRootedPredTrie$fTrie[]kRootedPredTrie$fMonoidPredTrie$fTrieNonEmptykPredTrie$fArbitraryPredTrie PathChunks PathChunkExtrudeSoundlyExtrudeextrudeExtendextend Singleton singleton CatMaybesonlypred./nil PTBuilderT runPTBuilderTexecPTBuilderTinsert insertHereprefixlookupdeletematchmatchesbaseGHC.BaseNothing$fIsStringPathChunk-$fExtendPathChunkRootedPredTrieRootedPredTrie.$fExtendPathChunkRootedPredTrieRootedPredTrie0ConsNilLitlitChunkPred$fExtrudePathChunkstrie0trie2/$fExtrudePathChunksRootedPredTrieRootedPredTrie$fSingletonPathChunksnewtrie1$$fSingletonPathChunksaRootedPredTrie%$fMonadWriterRootedPredTriePTBuilderT