ugrep
aho-corasick
ugrep | aho-corasick | |
---|---|---|
24 | 21 | |
2,435 | 950 | |
1.2% | - | |
9.1 | 7.2 | |
10 days ago | about 1 month ago | |
C++ | Rust | |
BSD 3-clause "New" or "Revised" 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.
ugrep
- Ugrep – a more powerful, ultra fast, user-friendly, compatible grep
- The ugrep file pattern searcher
-
Ripgrep is faster than {grep, ag, Git grep, ucg, pt, sift}
I switched from from ripgrep to ugrep and never looked back. It's just as fast, but also comes with fuzzy matching (which is super useful), a TUI (useful for code reviews), and can also search in PDFs, archives, etc.
The optional Google search syntax also very convenient.
https://ugrep.com
-
ugrep 4.3.2 with updated TUI
Installation and user guide: ugrep.com (no ads, no cookies, just plain HTML in a GitHub page)
- New Ugrep 4.0
-
ugrep 4.0 released + performance benchmarks
Not heard of ugrep? Read the wiki on GitHub.
-
ripgrep is faster than {grep, ag, git grep, ucg, pt, sift}
These ripgrep announcements are getting a bit old, don't you think? Ripgrep hasn't improved or added new features since 2016. There are other fast alternatives with a lot more features, like ugrep and qgrep for example. Ugrep has fuzzy regex pattern search, archive search (even nested archives!), Boolean search queries like Google, interactive query TUI, hexdumps, and is compatible with GNU grep (ripgrep is not).
-
ugrep vs. grep – What are the differences?
It's the first time I hear about the ugrep. Would be nice to compare it with ripgrep, since both provide benchmark tables listing their tool at the top :D. For my everyday use speed doesn't matter much, as well as interactive mode seems useless (YMMV). So I'm staying with ripgrep for now.
- ugrep 3.10 - yet another grep for you - this one is fast and has a ton of cool features: now outputs directory trees for your viewing pleasure
-
Programming languages endorsed for server-side use at Meta
ugrep has full SSE/AVX support
https://github.com/Genivia/ugrep/blob/a3acf863803a755ff8da8c...
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?
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
uwu - fastest text uwuifier in the west
blink - GUI of live indexed grep for source code. Fuzzy suggestion in auto complete. Files locator, search and replace. Index management for multiple projects.
website - The source code for the beyondgrep.com website
perf-book - The Rust Performance Book
so_stupid_search - It's my honor to drive you fucking fire faster, to have more time with your Family and Sunshine.This tool is for those who often want to search for a string Deeply into a directory in Recursive mode, but not with the great tools: grep, ack, ripgrep .........every thing should be Small, Thin, Fast, Lazy....without Think and Remember too much ...一个工具最大的价值不是它有多少功能,而是它能够让你以多快的速度达成所愿......
fzf - :cherry_blossom: A command-line fuzzy finder
netctl - Profile based systemd network management
bat - A cat(1) clone with wings.
altbox - Website for altbox.dev, the alternative toolbox for developers
fd - A simple, fast and user-friendly alternative to 'find'