jaq
aho-corasick
jaq | aho-corasick | |
---|---|---|
24 | 21 | |
2,497 | 953 | |
- | - | |
9.6 | 7.2 | |
1 day ago | about 1 month ago | |
Rust | 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.
jaq
- Jaq
-
Jaq – A jq clone focused on correctness, speed, and simplicity
https://github.com/01mf02/jaq/blob/main/Cargo.lock
That's a lot of dependencies..
-
Interactive Examples for Learning Jq
Thanks for the jqjq shoutout! :) i'm quite sure jq is turing complete, jq (and jqjq!) can implement brainfuck https://github.com/01mf02/jaq/blob/main/examples/bf.jq
-
This is a very old theme, solved by Pike and Kernigan since 1984, in section 5.5 (Replacing a file: overwrite), page 155 in the book
/uj Because of this post, I have learned I could have been using jaq instead of jq.
-
A new major version of jql has been released
There's also jaq which is written in Rust, aims for compatibility with jq (except some specific features), and boasts better performance.
-
Fx - a lightweight jq alternative
jaq is closer to that
-
can't swp layout
if [[ $(hyprctl -j getoption general:layout | jaq -r '.str') = "master" ]]; then hyprctl keyword general:layout "dwindle" else hyprctl keyword general:layout "master" fi you'll need https://github.com/01mf02/jaq
-
launcher script scratchpad special ws
You will need https://github.com/01mf02/jaq
-
Miller: Like Awk, sed, cut, join, and sort for CSV, TSV, and tabular JSON
I've been getting a lot of mileage out of https://github.com/itchyny/gojq#readme recently due to two things: its vastly superior error messages and the (regrettably verbose) `--yaml-input` option
I also have https://github.com/01mf02/jaq#readme installed but just haven't needed it
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?
jql - A JSON Query Language CLI tool
ripgrep - ripgrep recursively searches directories for a regex pattern while respecting your gitignore
partiql-lang-rust - PartiQL libraries and tools in Rust.
uwu - fastest text uwuifier in the west
jq - Command-line JSON processor
perf-book - The Rust Performance Book
gojq - Pure Go implementation of jq
bat - A cat(1) clone with wings.
jqp - A TUI playground to experiment with jq
fzf - :cherry_blossom: A command-line fuzzy finder
utt - utt is the universal text transformer
fd - A simple, fast and user-friendly alternative to 'find'