anagrep: Find strings with permutations (anagrams) that match a regular expression
Given a regular expression, determine if it matches any permutation of a given string. For example,
"lt[aeiou]*" would match all strings with one 'l', one 't', and vowels (like "elate", "tail", "tl", etc.).
Regular expression parsing is based on regex-tdfa and generally follows those semantics, but not all regular expression features are supported. For example, repeat modifiers cannot be applied to groups (such as "(abc)*").
The goal is for matching to be fairly efficient in most cases, given that this problem is NP-complete.
Enable ghc-specific optimizations (on internal Natural representation)
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
|Dependencies||anagrep, base (<5), bytestring, case-insensitive, containers, deepseq, ghc-prim, integer-gmp, regex-tdfa, vector [details]|
|Copyright||2020, Dylan Simon|
|Source repo||head: git clone git://github.com/dylex/anagrep|
|Uploaded||by DylanSimon at 2020-12-10T20:45:28Z|
|Downloads||162 total (4 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2020-12-10 [all 1 reports]