Comment on Given a list of regexes, generate all possible strings that matches all of themparentComments−audreyt15yYes. The list is generated lazily and ordered from shortest to longest, though, so piping the output to "|head -n 100" will terminate rather quickly.The ([String] -> IO [String]) API also generated a lazy list: http://hackage.haskell.org/packages/archive/regex-genex/0.2.0/doc/html/Regex-Genex.html so one can take only part of the output like this: Regex.Genex> fmap (take 5) (genex ["([abc]+)\\1"]) ["bb","cc","aa","bbbb","cccc"]
Comments
Yes. The list is generated lazily and ordered from shortest to longest, though, so piping the output to "|head -n 100" will terminate rather quickly.
The ([String] -> IO [String]) API also generated a lazy list:
so one can take only part of the output like this: