cs
aho-corasick
cs | aho-corasick | |
---|---|---|
9 | 21 | |
502 | 950 | |
- | - | |
7.5 | 7.2 | |
3 months ago | about 1 month ago | |
Go | Rust | |
MIT License | The Unlicense |
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.
cs
-
Ripgrep is faster than {grep, ag, Git grep, ucg, pt, sift}
That’s one of the reasons I made this actually https://github.com/boyter/cs
I wanted and boolean syntax mixed with fzf instant search. It’s not as fast as ripgrep of course but it’s not solving the same problem.
- Sourcegraph is no longer Open Source
- codespelunker
- cs: command line codespelunker or code search written in Go
- codespelunker (cs) A command line search tool. Allows you to search over code or text files in the current directory either on the console, via a TUI or HTTP server, using some boolean queries or regular expressions.
- Show HN: Codespelunker a command line search tool
-
Lmgrep: Lucene-based grep-like utility
Neat. This is similar to a tool I have been working on (but need to finish off) as I saw the same issue.
Except rather than build an index I brute forced the search each time. For most repositories it’s fast enough even with ranking.
https://github.com/boyter/cs For those interested it’s still very WIP with noticeable issues in TUI mode.
-
Ask HN: What Are You Working On?
A few things.
An implementation of bitfunnel search in Go which I plan to put into searchcode.com at some point once I get all the issues resolved and if performance is acceptable
A command line search tool which brute forces with search ranking https://github.com/boyter/cs/ mostly for code but works pretty well for other things as well
Atlassian Confluence Cloud plugins. Mostly out of personal interest and because there appears to be a good marketplace to produce mostly passive income there.
aho-corasick
- Aho-Corasick Algorithm
-
Identifying Rust's collect:<Vec<_>>() memory leak footgun
You can't build the contiguous variant directly from a sequence of patterns. You need some kind of intermediate data structure to incrementally build a trie in memory. The contiguous NFA needs to know the complete picture of each state in order to compress it into memory. It makes decisions like, "if the number of transitions of this state is less than N, then use this representation" or "use the most significant N bits of the state pointer to indicate its representation." It is difficult to do this in an online fashion, and likely impossible to do without some sort of compromise. For example, you don't know how many transitions each state has until you've completed construction of the trie. But how do you build the trie if the state representation needs to know the number of transitions?
Note that the conversion from a non-contiguous NFA to a contiguous NFA is, relatively speaking, pretty cheap. The only real reason to not use a contiguous NFA is that it can't represent as many patterns as a non-contiguous NFA. (Because of the compression tricks it uses.)
The interesting bits start here: https://github.com/BurntSushi/aho-corasick/blob/f227162f7c56...
-
Ask HN: What's the fastest programming language with a large standard library?
Right. I pointed it out because it isn't just about having portable SIMD that makes SIMD optimizations possible. Therefore, the lack of one in Rust doesn't have much explanatory power for why Rust's standard library doesn't contain SIMD. (It does have some.) It's good enough for things like memchr (well, kinda, NEON doesn't have `movemask`[1,2]), but not for things like Teddy that do multi-substring search. When you do want to write SIMD across platforms, it's not too hard to define your own bespoke portable API[3].
I'm basically just pointing out that a portable API is somewhat oversold, because it's not uncommon to need to abandon it, especially for string related ops that make creative use of ISA extensions. And additionally, that Rust unfortunately has other reasons for why std doesn't make as much use of SIMD as it probably should (the core/alloc/std split).
[1]: https://github.com/BurntSushi/memchr/blob/c6b885b870b6f1b9bf...
[2]: https://github.com/BurntSushi/memchr/blob/c6b885b870b6f1b9bf...
[3]: https://github.com/BurntSushi/aho-corasick/blob/f227162f7c56...
-
Ripgrep is faster than {grep, ag, Git grep, ucg, pt, sift}
Oh I see. Yes, that's what is commonly used in academic publications. But I've yet to see it used in the wild.
I mentioned exactly that paper (I believe) in my write-up on Teddy: https://github.com/BurntSushi/aho-corasick/tree/master/src/p...
-
how to get the index of substring in source string, support unicode in rust.
The byte offset (or equivalently in this case, the UTF-8 code unit offset) is almost certainly what you want. See: https://github.com/BurntSushi/aho-corasick/issues/72
-
Aho Corasick Algorithm For Efficient String Matching (Python & Golang Code Examples)
This is an implementation of the algorithm in Rust as well if someone is curious. Though this code is written for production and not teaching.
-
When counting lines in Ruby randomly failed our deployments
A similar fix for the aho-corasick Rust crate was made in response
-
Aho-corasick (and the regex crate) now uses SIMD on aarch64
Teddy is a SIMD accelerated multiple substring matching algorithm. There's a nice description of Teddy here: https://github.com/BurntSushi/aho-corasick/tree/f9d633f970bb...
It's used in the aho-corasick and regex crates. It now supports SIMD acceleration on aarch64 (including Apple's M1 and M2). There are some nice benchmarks included in the PR demonstrating 2-10x speedups for some searches!
- Stringzilla: Fastest string sort, search, split, and shuffle using SIMD
-
ripgrep is faster than {grep, ag, git grep, ucg, pt, sift}
Even putting aside all of that, it might be really hard to add some of the improvements ripgrep has to their engine. The single substring search is probably the lowest hanging fruit, because you can probably isolate that code path pretty well. The multi-substring search is next, but the algorithm is very complicated and not formally described anywhere. The best description of it, Teddy, is probably my own. (I did not invent it.)
What are some alternatives?
git-peek - git repo to local editor instantly
uwu - fastest text uwuifier in the west
dcs - Debian Code Search (codesearch.debian.net) is a search engine that searches through all the 130 GB of open source software that is included in Debian. Supports regular expressions!
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
hound - Lightning fast code searching made easy
perf-book - The Rust Performance Book
ctoc - Count Tokens of Code (forked from gocloc)
fzf - :cherry_blossom: A command-line fuzzy finder
lucene-grep - Grep-like utility based on Lucene Monitor compiled with GraalVM native-image
bat - A cat(1) clone with wings.
livegrep - Interactively grep source code. Source for http://livegrep.com/
fd - A simple, fast and user-friendly alternative to 'find'