https://github.com/benburkert/randexp

generate random data from a Regular Expression
https://github.com/benburkert/randexp

Last synced: 12 days ago
JSON representation

generate random data from a Regular Expression

• Host: GitHub
• URL: https://github.com/benburkert/randexp
• Owner: benburkert
• License: mit
• Created: 2008-07-03T05:37:51.000Z (over 16 years ago)
• Default Branch: master
• Last Pushed: 2013-04-11T18:32:57.000Z (over 11 years ago)
• Last Synced: 2024-04-13T22:31:29.789Z (7 months ago)
• Language: Ruby
• Homepage:
• Size: 1.07 MB
• Stars: 283
• Watchers: 9
• Forks: 43
• Open Issues: 10
• Metadata Files:
  • Readme: README
  • Changelog: CHANGELOG
  • License: LICENSE

Awesome Lists containing this project

README

        
Randexp

    by Ben Burkert

    http://github.com/benburkert/randexp

== DESCRIPTION:

andexp makes it easy to generate random string from most regular expressions.

== REQUIREMENTS:

 

* none!

 

== INSTALL:

 

  $ sudo gem install randexp

== USAGE:

Randexp adds the #generate (or #gen, for short) method to the Regexp class,

which generates a 'random' string that will match your regular expression.

  /abc|def/.gen

    # => "def"

== Valid Regexp's

Randexp can only generate matching string from simple regular expression.

Except for a few circumstances, wildcards are generally not allowed in the

regular expression.  is pretty domain specific, so trying to guess when to

terminate a random pattern would produce unhelpful data:

  >> /Aa{3}h*!/.gen

      # => RuntimeError: Sorry, "h*" is too vague, try setting a range: "h{0,3}"

  >> /Aa{3}h{3,15}!/.gen

      => "Aaaahhhhh!"

  >> /(never gonna (give you up|let you down), )*/.gen

      => RuntimeError: Sorry, "(...)*" is too vague, try setting a range: "(...){0, 3}"

  >> /(never gonna (give you up|let you down), ){3,5}/.gen

      => "never gonna give you up, never gonna let you down, never gonna give you up, never gonna give you up, "

The exception being word characters (\w), which generate a random word from the Dictionary class.

  >> /\w+/.gen

      => "groveling"

= Primitives & Complex matches

The single character matchers supported are words(\w), whitespace(\s), and digits(\d).

  >> /\d{50}/.gen

      => "50315410741096763188525493528315906035878741451037"

When a multiplicity constraint is placed on a word character, a word with the valid length is generated.

  >> /\w{10}/.gen  # a word with 10 letters

      => "Chaucerism"

  >> /\w{5,15}/.gen

      => "cabalistic"

Complex matchers use the [:...:] syntax within the regular expression.

  >> /[:sentence:]/.gen

      => "Nonhearer demetricize toppiece filicic possessedness rhodizite zoomagnetism earwigginess steady"

Complex matchers can also be added by extending the Randgen class.

  class Randgen

    def self.serial_number(options = {})

      /XX\d{4}-\w-\d{5}/.gen

    end

  end

  >> /[:serial_number:]/.gen

      => "XX3770-M-33114"

= Dictionary

The Dictionary loads the local users' words file, allowing randomly generated words to be chosen from

thousands of entries to the words file.  Words are mapped by their length to allow words to be randomly

chosen based on size.