aho-corasick
fzf.vim
aho-corasick | fzf.vim | |
---|---|---|
21 | 157 | |
950 | 9,418 | |
- | - | |
7.2 | 6.6 | |
about 1 month ago | 5 days ago | |
Rust | Vim Script | |
The Unlicense | 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.
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.)
fzf.vim
-
What are some plugins that you can't live without?
Fuzzy Finder: fzf.vim (for its speed) along with telescope.nvim (for its ecosystem)
-
Ripgrep is faster than {grep, ag, Git grep, ucg, pt, sift}
https://github.com/junegunn/fzf.vim
And added my keyboard shortcuts.
-
A Practical Guide to fzf: Vim Integration
There are two plugins allowing us to use fzf in Vim: the native fzf plugin directly installed with fzf, and fzf.vim. The second plugin is built on the first one.
-
LazyVim
You might be interested in installing the fzf-vim plugin [0]. It has a user-defined command :Maps which can be used to search through all keybindings (you can also do this with just :nmap in vim, but the fzf interface is much nicer). It also provides :Commands. This behaves remarkably like VSCode's command palette.
[0] https://github.com/junegunn/fzf.vim
-
Manual page in vim with fuzzy search with preview, documentation with cherry on top.
You'll also need https://github.com/junegunn/fzf.vim (which is imo the only vim plugin that's a must).
-
I use the default file browser in vim (netrw). I know there are plugins that a lot of people like. Should I switch?
I do all my file operations from the command line. But to open and search files I use fzf
-
How to use popup and fuzzy in vim9
Regarding plugins , I am using https://github.com/Donaldttt/fuzzyy because it works in windows, unlike https://github.com/junegunn/fzf.vim
-
Alternative to harpoon for vim to quickly navigate few files/buffers
There's a :Buffers command in fzf.vim that I use extensively. It opens a fuzzy-find window with all open buffers in a MRU list.
-
fzfx.vim: E(x)tended fzf commands missing in fzf.vim
Thanks to fzf.vim and fzf-lua, everything I learned and copied is from them.
-
jfind: over 130x faster than telescope + telescope-fzf-native
they're likely referring to fzf.vim, the vimscript plugin from the original fzf author that wraps around fzf. there's also fzf-lua nowadays.
What are some alternatives?
uwu - fastest text uwuifier in the west
telescope.nvim - Find, Filter, Preview, Pick. All lua, all the time.
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
ctrlp.vim - Fuzzy file, buffer, mru, tag, etc finder.
perf-book - The Rust Performance Book
nerdtree - A tree explorer plugin for vim.
fzf - :cherry_blossom: A command-line fuzzy finder
fzf-lua - Improved fzf.vim written in lua
bat - A cat(1) clone with wings.
harpoon
fd - A simple, fast and user-friendly alternative to 'find'
nvim-tree.lua - A file explorer tree for neovim written in lua