Helps you find ranges of IDs, like when you're scraping a website and you need to guess IDs. You tell it what a valid ID is and it looks for ranges of consecutive valid IDs. It assumes that each probe is expensive.

Required Ruby Version

None

Authors

Seamus Abshere

Versions

  1. 0.0.4

    1. source

      1. 0.0.4 source January 13, 2014 (8.5 KB)
  2. 0.0.3

    1. source

      1. 0.0.3 source January 13, 2014 (8.5 KB)
  3. 0.0.2

    1. source

      1. 0.0.2 source January 11, 2014 (8.5 KB)
  4. 0.0.1

    1. source

      1. 0.0.1 source January 11, 2014 (8.5 KB)

SHA 256 checksum

← Previous version