smart
boyermoore
| smart | boyermoore | |
|---|---|---|
| 6 | 2 | |
| 94 | 55 | |
| - | - | |
| 0.0 | 0.0 | |
| about 2 months ago | almost 2 years ago | |
| JavaScript | Go | |
| GNU General Public License v3.0 only | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
smart
-
Faster IndexOf for Substrings in .NET
You can of course browse the source on GitHub: https://github.com/smart-tool/smart/tree/master/source
The tarballs are just a feature of GitHub, not something they specifically release.
-
linear-time, constant-space, fast substring-searching
Or just use one the fast strstr implementations. The current leader is EPSM https://smart-tool.github.io/smart/
-
The Boyer-Moore Fast String Searching Algorithm
In the libc's not, indeed. They are still in the stoneage of string search.
But the fastest is currently EPSM, by S. Faro and O. M. Kulekci. See https://smart-tool.github.io/smart/
"Exact Packed String Matching" optimized for SIMD SSE4.2/AVX (x86_64 and aarch64). It performs stable and best on all sizes.
The site I linked to compares 199 fast string search algorithms, with the usual ones (BM, KMP, BMH) being pretty slow. EPSM outperforms all the others being mentioned here on these platforms. It's also the latest.
-
Made a search algorithm, send help.
At the moment the numbers for average and worst case show the time increasing from ~4 miliseconds to ~8 as the query increases size from 8 characters to 4000+ over these texts. In the best case it matches or exceeds all other algorithms I've tested it against.
boyermoore
-
Boyer-Moore Algorithm is up to 10 times faster than strings.Index for long search terms.
If you want you can check it out at (https://github.com/sarpdag/boyermoore) I made a basic implementation, I hope all works.
-
The Boyer-Moore Fast String Searching Algorithm
I implemented it in Go for fun. I expected Go's standard lib will beat it but it perform around 10 times faster than `strings.Index`.
https://github.com/sarpdag/boyermoore
Go's strings package depends on the substring size tries different approaches like Rabin Karp algorithm, (https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm)
What are some alternatives?
fast_strstr - A fast substitution to the stdlib's strstr() sub-string search function.
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
rust-memchr - Optimized string search routines for Rust.
fastsearch - Implements a search algorithm I invented decades ago in 64 bit pascal