Rust programing language®
430 subscribers
14 photos
150 links
rust programing channel
Download Telegram
🦀 #RustChallenge 🦀
#rust #rustlang #programing #dev #EZ


// CODE No1
fn main(){
let x = 2;
assert_eq!(x,2_i8);
println!("{}",x.pow(6));
}
// CODE No2
fn main(){
let x = 2;
println!("{}",x.pow(6));
}

What will be the outcome?

1. Both runs and gives the output

2. CODE No2 gives output and A gives overflow error

3. CODE No2 gives output and B gives error

4. Both gives error

vote in channele and DONT FORGET TO JOIN OUR FAMELY
WHAT IS the right anser
Final Results
15%
1
46%
2
31%
3
8%
4
Learning Rust Part 1: A kitten's guide to Options and Results

https://cherrykitten.dev/blog/rust-1-options-results/
#RustChallenge 🦀🦀

What is the result?

A. Prints 1 (explain how)
B. Prints 2 (explain how)
C. Error (explain why)

vote in channele and don't forget to join our rust family❤️
What is the result?
Final Results
48%
A
21%
B
31%
c
🦀 #RustChallenge

Will it print "Yes"?

A. Yes
B. No
C. It will give error

#rustlang #rust
WHAT IS YOUR ANSWER ??
Final Results
42%
A
38%
B
20%
C
🦀 #RustChallenge #ez😋
ANSWER IN CHANNEL AND JOIN FOR MORE FUN😜😜

WHAT WILL PRINT??

A. RUST
B. js
C. RUSTjspython
D. ERROR 404
GIVE ME YOUR ANSWER 🤖🤖
Final Results
51%
A
8%
B
22%
C
19%
D
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.
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.