testing
We can search about 40 MB of text in 1 second. That's roughly equivalent to the regex for one pattern. However, with multiple patterns, regex is slower. If we can get the Rabin-Karp to handle multiple patterns, then in theory it will be faster because it's O(N+M)
- Ignore Case Option
- Word Boundary Option
- Multiple Patterns
- Streaming
- Write PASS/FAIL tests.
- local test file.
- skip value == NULL in get / set / length
- separate
list_init()
?
- grow table dynamically