úÎ×#      !"(c) 2015 Athan ClarkBSD-3athan.clark@gmail.com experimentalGHCNone +-03457;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 +-03457;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."Dummy instance for quickcheck !""!  !"#      !"predt_HOVNhkyy04eEF4wYBUPfeJData.Trie.Pred.StepData.Trie.Pred PredSteps unPredStepsPredSteppredTagpredPredpredDatapredSub singletonPred unionPred$fMonoidPredSteps$fTrieNonEmptysPredSteps$fTrieNonEmptysPredStep$fFunctorPredStepRootedPredTrie rootedBase rootedSubPredTriepredLits predPredsemptyPTmatchPT matchesPTemptyRPTmatchRPT matchesRPT$fMonoidRootedPredTrie$fTrie[]sRootedPredTrie$fMonoidPredTrie$fTrieNonEmptysPredTrie$fArbitraryPredTrie$fShowPredTrie