Hi. I would like to take a look into the substring match implementation because of the comment there.
http://git.haproxy.org/?p=haproxy.git;a=blob;f=src/pattern.c;h=8729769e5e549bcd4043ae9220ceea440445332a;hb=HEAD#l767 "NB: Suboptimal, should be rewritten using a Boyer-Moore method." Now before I take a deeper look into the different algorithms about sub-string match I would like to know which pattern and length is a "common" use case for the user here? There are so many different algorithms which are mostly implemented in the Smart Tool ( https://github.com/smart-tool/smart ) therefore it would be interesting to know some metrics about the use cases. Thanks for sharing. Best regards Aleks
