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.
Flags
Automatic Flags
Name | Description | Default |
---|---|---|
ghc | Enable ghc-specific optimizations (on internal Natural representation) | Enabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- anagrep-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1.0.0 |
---|---|
Dependencies | anagrep, base (<5), bytestring, case-insensitive, containers, deepseq, ghc-prim, integer-gmp, regex-tdfa, vector [details] |
License | BSD-3-Clause |
Copyright | 2020, Dylan Simon |
Author | Dylan Simon |
Maintainer | dylan@dylex.net |
Category | Text |
Source repo | head: git clone git://github.com/dylex/anagrep |
Uploaded | by DylanSimon at 2020-12-10T20:45:28Z |
Distributions | NixOS:0.1.0.0 |
Executables | anagrep |
Downloads | 291 total (3 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2020-12-10 [all 1 reports] |