An algorithm that allows searching for members of a known set of strings appearing as substrings of a larger string in time linear to both the size of the string and the size of the set

Required Ruby Version

>= 0

Authors

Tim Cowlishaw

Versions

  1. 0.1.0 October 02, 2014 (5.5 KB)
  2. 0.0.2 November 18, 2011 (6.5 KB)
  3. 0.0.1 October 25, 2011 (6 KB)

SHA 256 checksum