rust
regex
rust | regex | |
---|---|---|
7 | 91 | |
711 | 3,355 | |
1.1% | 1.4% | |
0.0 | 8.9 | |
3 days ago | 12 days ago | |
Rust | Rust | |
GNU General Public License v3.0 or later | Apache License 2.0 |
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.
rust
-
ESP32 example project
The esp-template issue might be this one: https://github.com/esp-rs/rust/issues/158. Try with --release or updating to 1.68.0 with espup update. I'll take a look at the log as soon as I can, atm Im on the phone and is not that easy to scroll through :(
-
Are there any Rust forks out there?
Sure. Espressif maintains a fork which adds support for their microcontrollers.
-
Would it be possible to compile openssl-sys for esp32
I am trying to make a vaccine passport validation for my country using the ESP32 for my micro controller. I have gotten the std rust library to compile using (esp-rs)[https://github.com/esp-rs/rust], but the actual validation library that I use needs openssl which refuses to compile.
-
Are there situations where it's better to use C++?
Xtensa. They've got a fork of LLVM that supports it that they're working toward getting upstreamed. The community has a fork of rustc that uses it (and a quickstart crate) while we wait for it to get upstreamed.
- Rust-Xtensa: Rust for Xtensa Processors. Built in Targets for the ESP32/ESP8266
-
Multi-use kernel written in Rust
It only works if you have an Xtensa compiler which takes hours to compile, here: Rust Xtensa (if you don't have it). The network driver is just a function that sets the name of the driver so the Esp32 does something other that blinking.
- Could IOTA transaction be started solely from the IoT capable device (like esp32)?
regex
-
Zed is now open source
The homepage has a benchmark that compares Zed's "insertion latency" to other editors, and this is the description:
> Open input.rs at the end of line 21 in rust-lang/regex. Type z 10 times, measure how long it takes for each z to display since hitting the z key.
Could someone clarify what that means? My interpretation of that was to go to https://github.com/rust-lang/regex/blob/master/regex-cli/arg... and start typing 'z' at the end of line 21, but that doesn't seem to make any sense. I guess that repo got refactored and those instructions are out of date?
-
CryptoFlow: Building a secure and scalable system with Axum and SvelteKit - Part 3
We also used the avenue to sluggify the question title. We used regex to fish out and replace all occurrences of punctuation and symbol characters with an empty string and using the itertools crate, we joined the words back together into a single string, where each word is separated by a hyphen ("-").
-
Command Line Rust is a great book
Command-Line Rust taught me how to use crates like clap, assert_cmd, and regex. I felt lost before because I didn't know about Rust's ecosystem--which is arguably as important as the language itself. Also, looking up and comparing libraries is a tiring task! blessed.rs is nice but Command-Line Rust really saved me from analysis paralysis.
-
Common Rust Lifetime Misconceptions
burntsushi actually regrets making regex replace return a Cow: https://github.com/rust-lang/regex/issues/676#issuecomment-6.... I’m glad it does, and wish it took an impl Into> there, for the reasons discussed in the issue, but burntsushi has a lot more experience of the practical outcomes of this. Just something more to think about.
-
Advent of Code 2023 is nigh
I'm not familiar with the AoC problem. You might be able to. But RegexSet doesn't give you match offsets.
You can drop down to regex-automata, which does let you do multi-regex search and it will tell you which patterns match[1]. The docs have an example of a simple lexer[2]. But... that will only give you non-overlapping matches.
You can drop down to an even lower level of abstraction and get multi-pattern overlapping matches[3], but it's awkward. The comment there explains that I had initially tried to provide a higher level API for it, but was unsure of what the semantics should be. Getting the starting position in particular is a bit of a wrinkle.
[1]: https://docs.rs/regex-automata/latest/regex_automata/meta/in...
[2]: https://docs.rs/regex-automata/latest/regex_automata/meta/st...
[3]: https://github.com/rust-lang/regex/blob/837fd85e79fac2a4ea64...
-
Text Showdown: Gap Buffers vs. Ropes
It’s not quite that simple, but folks are working on it.
https://github.com/rust-lang/regex/issues/425#issuecomment-1...
https://github.com/helix-editor/helix/pull/211#issuecomment-...
- Please ask questions (rust-lang/regex)
-
ScripterC - Rust-lang set
Dependencies used: - regex - unicode_reader - rust decimal - tokio
-
Regex Engine Internals as a Library
https://www.cs.princeton.edu/courses/archive/fall19/cos226/l... and https://kean.blog/post/lets-build-regex are excellent introductions to implementing a (very) simplified regex engine: construct a nondetermistic finite state automaton for the regex, then perform a graph search on the resulting digraph; if the vertex corresponding to your end state is reachable, you have a match.
I think this exercise is valuable for anyone writing regexes to not only understand that there's less magic than one might think, but also to visualize a bunch of balls bouncing along an NFA - that bug you inevitably hit in production due to catastrophic backtracking now takes on a physical meaning!
Separately re: the OP, https://github.com/rust-lang/regex/issues/822 (and specifically BurntSushi's comment at the very end of the issue) adds really useful context to the paragraph in the OP about niche APIs: https://blog.burntsushi.net/regex-internals/#problem-request... - searching with multiple regexes simultaneously against a text is both incredibly complex and incredibly useful, and I can't wait to see what the community comes up with for this pattern!
What are some alternatives?
zig - General-purpose programming language and toolchain for maintaining robust, optimal, and reusable software.
re2 - modern regular expression syntax everywhere with a painless upgrade path [Moved to: https://github.com/SonOfLilit/kleenexp]
Elixir - Elixir is a dynamic, functional language for building scalable and maintainable applications
node-re2 - node.js bindings for RE2: fast, safe alternative to backtracking regular expression engines.
Nim - Nim is a statically typed compiled systems programming language. It combines successful concepts from mature languages like Python, Ada and Modula. Its design focuses on efficiency, expressiveness, and elegance (in that order of priority).
scala - Scala 2 compiler and standard library. Bugs at https://github.com/scala/bug; Scala 3 at https://github.com/scala/scala3
ngrams - (Read-only) Generate n-grams
odbc-api - ODBC (Open Database Connectivity) bindings for Rust.
regex-benchmark - It's just a simple regex benchmark of different programming languages.
tonic - A native gRPC client & server implementation with async/await support.
whatlang-rs - Natural language detection library for Rust. Try demo online: https://whatlang.org/