Changes for version 1.05 - 2012-12-28

  • new Aho-Corasick matching algorithm; asymptotic time complexity now O(n) rather than O(nm)
  • several subtle speed enhancements
  • adaptive memory reduction, to help performance even further; memory use for cases small enough to be processed by a 32-bit CPU is no bigger when you use a 64-bit Perl, and can now be 4 bytes per key character (or lower) in some cases
  • performance and memory-usage improvements during trie construction
  • bug fix: magical values now correctly supported
  • Perl 5.6 no longer supported


efficient search for many strings