I thought I saw something a while ago about making strstr O(n + m) instead of O(nm). In looking at the source, it still looks O(nm). If they have been fixed, can someone point me to the commit? Is there interest in doing one of the fast string search algorithms like Boyer Moore or KMP?
Kyle
