fastsearch
Implements a search algorithm I invented decades ago in 64 bit pascal (by mikewarot)
fast_strstr
A fast substitution to the stdlib's strstr() sub-string search function. (by RaphaelJ)
| fastsearch | fast_strstr | |
|---|---|---|
| 1 | 1 | |
| 0 | 114 | |
| - | - | |
| 0.0 | 0.0 | |
| about 3 years ago | about 9 years ago | |
| Pascal | C | |
| - | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
fastsearch
Posts with mentions or reviews of fastsearch.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-04-23.
-
The Boyer-Moore Fast String Searching Algorithm
I went through the work, and re-implemented it as an assembly language routine inside a 64bit free pascal program.
It searches about 1 gigabyte of text in 2 seconds.
https://github.com/mikewarot/fastsearch/blob/master/fastsear...
fast_strstr
Posts with mentions or reviews of fast_strstr.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-04-23.
-
The Boyer-Moore Fast String Searching Algorithm
https://github.com/RaphaelJ/fast_strstr/tree/master/benchmar...
While the algorithm is time linear (Boyer-Moore is sub linear), it ends up being significantly faster on textual content as the per character operations are significantly simplier.
What are some alternatives?
When comparing fastsearch and fast_strstr you can also consider the following projects:
rust-memchr - Optimized string search routines for Rust.
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
boyermoore - Implementation of Boyer-Moore fast string search algorithm in Go
smart - String Matching Algorithms Research Tool
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.