h*       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[1.2.5 Safe-Inferred%&     Safe-Inferred%&\]^_`abc+(c) Bryan O'Sullivan 2007, JP Bernardy 2010 BSD-stylenobody experimentalportable Safe-Inferred%& - imbibThe suffix tree type. The implementation is exposed to ease the development of custom traversal functions. Note that ( a,   a b)# pairs are not stored in any order.imbibAn edge in the suffix tree.imbib%The prefix string associated with an . Use & to create a value of this type, and  to deconstruct one.imbibThe list of symbols that  constructWith can possibly see in its input.dimbibThe length of a prefix list. This type is formulated to do cheap work eagerly (to avoid constructing a pile of deferred thunks), while deferring potentially expensive work (computing the length of a list).imbibO(1). Construct a  value.imbibO(n). Obtain the list stored in a .eimbib"Increments the length of a prefix.imbibO(n). Returns all non-empty suffixes of the argument, longest first. Behaves as follows: suffixes xs == init (tails xs)imbibO(n). Indicates whether the suffix tree contains the given sublist. Performance is linear in the length n of the sublist.imbibO(n). Finds the given subsequence in the suffix tree. On failure, returns f. On success, returns the  in the suffix tree at which the subsequence ends, along with the number of elements to drop from the prefix of the % to get the "real" remaining prefix.Here is an example: > find "ssip" (construct "mississippi") Just ((mkPrefix "ppi",Leaf),1)This indicates that the edge ( "ppi",Leaf)> matches, and that we must strip 1 character from the string "ppi"% to get the remaining prefix string "pi".$Performance is linear in the length n of the query list.imbibO(n). Finds the subtree rooted at the end of the given query sequence. On failure, returns f.$Performance is linear in the length n of the query list.imbibO(n). Returns the path from the  in the suffix tree at which the given subsequence ends, up to the root of the tree. If the subsequence is not found, returns the empty list.6Performance is linear in the length of the query list.   Safe-Inferred%& (imbib name, type7imbib(When searching ignore special characters8imbib)Does a node contain a string (for search),$*)('&%+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO,$*)('&%+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO Safe-Inferred%& STUVSTUV Safe-Inferred%& WXYZ[WXYZ[      !"#$%&'()*++,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmn"imbib-1.2.5-Jy7iAv0jKOgEBtvlS4i1dpConfigSuffixTreeCluster TypedBibDataBibDB BibAttachimbib Paths_imbibInitFileattachmentsRootdownloadsDirectorybibfile runViewer runEditor rightOrDieconfigFileNamegetConfigurationdfltloadConfiguration runProcess'STreeNodeEdgePrefixAlphabetmkPrefixprefixsuffixes constructelemfindEdgefindTreefindPathselect commonStrings printTree$fFunctorPrefix $fShowPrefix $fOrdPrefix $fEqPrefix$fFunctorSTree $fShowSTree $fShowLengthEntrykindauthorsfilesseeAlso otherFields renderTex sanitizeIdentparseBibtestpAuthLastFirstpAuthFirstLast pAuthLastOnlypAuthpAuthors pAuthName pAuthNamePart pAuthBlockprojectcontains matchSearch findCiteAuthfindYear findTitle findFieldeqField findField'findFirstAuthorfindCite findNiceKey findFullTextaddFile partitions entryToTree treeToEntry fileToTree authorsToTree seeAlsoToTree?? bibToForest formatEntry isSeeAlso areRelated $fShowEntry $fEqEntry $fOrdEntryloadBibliographyloadBibliographyFrom formatBibsaveBibliographysanitizesaveFilefindAttachNameguessTypeByName guessTypeversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDirgetDataFileName getSysconfDirLengthincbase GHC.MaybeNothing