🦀 #RustChallenge #ez😋
ANSWER IN CHANNEL AND JOIN FOR MORE FUN😜😜
WHAT WILL PRINT??
A. RUST
B. js
C. RUSTjspython
D. ERROR 404
ANSWER IN CHANNEL AND JOIN FOR MORE FUN😜😜
WHAT WILL PRINT??
A. RUST
B. js
C. RUSTjspython
D. ERROR 404
https://diff.rs/
View the differences between Rust crate versions. Enter a crate name such as serde in the search field in the top-right corner to get started.
This is an experimental WASM-based web application written in Rust with Yew that uses the crates.io API to fetch crate metadata, fetch and parse the crate source, unpack it in-memory and render a diff in the browser.
Source code for this application is available at github.com/xfbs/diff.rs.
View the differences between Rust crate versions. Enter a crate name such as serde in the search field in the top-right corner to get started.
This is an experimental WASM-based web application written in Rust with Yew that uses the crates.io API to fetch crate metadata, fetch and parse the crate source, unpack it in-memory and render a diff in the browser.
Source code for this application is available at github.com/xfbs/diff.rs.
GitHub
GitHub - xfbs/diff.rs: Web application to render a diff between Rust crate versions. Implemented in Yew, runs fully in the browser…
Web application to render a diff between Rust crate versions. Implemented in Yew, runs fully in the browser as WebAssembly. - xfbs/diff.rs
https://tavianator.com/2023/irregex.html
Regular expressions are fascinating to me. On one hand, they can be extremely succinct, expressive, and efficient. On the other hand, they can be basically write-only. They come with a simple but powerful theory that leads to efficient implementations. Sadly, many implementations ignore the theory in order to offer additional features, at the cost of worst-case exponential complexity.
It is possible, however, to implement some of those additional features, and still operate in worst-case linear time. The implementation (~400 lines of Rust) even fits in a single blog post! The full code is on GitHub, and the commit history lines up with the blog post if you want to follow along.
Regular expressions are fascinating to me. On one hand, they can be extremely succinct, expressive, and efficient. On the other hand, they can be basically write-only. They come with a simple but powerful theory that leads to efficient implementations. Sadly, many implementations ignore the theory in order to offer additional features, at the cost of worst-case exponential complexity.
It is possible, however, to implement some of those additional features, and still operate in worst-case linear time. The implementation (~400 lines of Rust) even fits in a single blog post! The full code is on GitHub, and the commit history lines up with the blog post if you want to follow along.
Bevy is a refreshingly simple data-driven game engine built in Rust
https://bevyengine.org/news/bevy-0-10/
https://bevyengine.org/news/bevy-0-10/
bevy.org
Bevy 0.10
Bevy is a refreshingly simple data-driven game engine built in Rust. It is free and open-source forever!
#RustChallenge:
What is the output?
A. It will print kernel
B. It will give a compilation error (explain why)
C. It will give a runtime error (explain why)
#rustlang #rust
What is the output?
A. It will print kernel
B. It will give a compilation error (explain why)
C. It will give a runtime error (explain why)
#rustlang #rust
git-dive is for better understanding why a change was made. Frequently, we work on code bases we didn't start which have too little documentation. Even worse if the original authors are not around. git-blame is an invaluable tool for this but it requires a lot of ceremony to get the information you need.
https://crates.io/crates/git-dive
https://crates.io/crates/git-dive
crates.io
crates.io: Rust Package Registry
crates.io serves as a central registry for sharing crates, which are packages or libraries written in Rust that you can use to enhance your projects