Îõ³h$ ù ]     None9ÇÒanagreplist of all set bits in a valueanagrepvalue with all lower n bits setNone#$2>ÀÎ% anagrep*The parsed characters from a regex patternanagreprequried charsanagrepoptional chars (x?)anagrepextra chars (x*)anagrepMatch for a single character.anagrepliteral single characteranagrepone of a set "[a-z]"anagrepnot one of a set "[^a-z]"anagrepÉA permuted string: a bag of characters mapping character to repeat count.anagrep/We use Int for all Chars, mainly to use IntSet.anagreprun-length encoded listanagrep3run-length encoding element (item and repeat count) !"#$%&'()*+,NoneÑ_-./0123456789:;<=>None#$q?anagrep§A parsed intermediate representation of regular expression pattern to match anagrams. This is exposed mainly to make case-insensitive matches more efficient, so that @ can be performed on the ?Õ to avoid unnecessary compilation. Represented as an (expanded) list of alternative .AanagrepÈParse a string as a regular expression for matching anagrams, returning B> error for invalid or unsupported regular expressions. (Uses C.)?DANone#$ýanagrepëA compiled regular expression pattern to match anagrams. Represented as an (expanded) list of alternative Es.EanagrepCompiled matching patternFanagrep*original, uncompiled pattern (only for CI)Ganagrepminimum lengthHanagrepmaximum lengthIanagrepCompile an already-parsed ? into an .anagrepÊBuild a regular expression for matching anagrams from a string, returning B> error for invalid or unsupported regular expressions. (Uses Ë.) This works by first expanding out a list of alternative patterns (like  "a|(b(c|d))" into ["a","bc","bd"]>) and then creating optimized pattern represenations for each.JanagrepðUsed to create a case-insensitive version of a pattern. Note that this involves a re-compilation of the parsed ?. You can avoid this by using  . KELFMNGHI None#$>ÀÎÑ ©anagrepëCheck if any permutations of a string matches a parsed regular expression. Always matches the full string.None OanagrepÌBuild a case-insensitive version of a pattern. This is more efficient than OÏ since it avoids the complication of the case-sensitive version as well. Uses P so the Q version is also case-folded.anagrepÞTest a case-insensitive pattern against a case-insensitive string. You can also directly use  , on both the pattern and the string to test.Ò    !"#$%&'()*++,-.-/0)1*23456789:;<=>?@ABCDEFGHI JKLMNGOPQRSTOUVHIWHIXHIYÚ&anagrep-0.1.0.0-2znqaAHlSqT1Z2qQqW6VZXText.Regex.Anagram.BitsText.Regex.AnagramText.Regex.Anagram.TypesText.Regex.Anagram.UtilText.Regex.Anagram.ParseText.Regex.Anagram.CompileText.Regex.TDFA.ReadRegex parseRegex makeAnagrexCIText.Regex.Anagram.TestData.CaseInsensitivefoldCaseFindBitsfindBitsallBits$fFindBitsNatural$fFindBitsWord64$fFindBitsWord32$fFindBitsWord16$fFindBitsWord8$fFindBitsWord$fFindBitsInt64$fFindBitsInt32$fFindBitsInt16$fFindBitsInt8 $fFindBitsIntAnagrex makeAnagrex testAnagrex testAnagrexCI PatCharsOfpatReqspatOptspatStarPatCharPatChrPatSetPatNotChrStrChrRLERLPatCharsChrSetInfFinRLEVRLEofunRLErlunRL foldCaseChrguard'foldMapM concatMapMwithRLE rleLengthrlerleVsortRLE filterRLEchrStr chrStrRLEnullCharnotCharintersectChrStrallChrs intersectChr differenceChr intersectChar AnaPattern/case-insensitive-1.2.1.0-GSBaCzsowBN7qVX9nBr8GgData.CaseInsensitive.InternalparseAnaPatternbase Data.EitherLeft)regex-tdfa-1.3.1.0-FpSHp7JyERvEeY2R0ZyRbtAnaPat patUncompiledpatMinpatMaxcompileAnagrex$fFoldCaseAnagrexpatCharspatSetsmkunsafeMkoriginal