Here’s an example demonstrating how to use lazy_static to initialize a global logger with thread-safe access in Rust. The code is structured to illustrate safe concurrency and the advantages of lazy initialization while remaining simple enough for a beginner to grasp. lazy_static: Mutex for Thread Safety: Global Logger: Future Expansion:

using the criterion crate This is a very very basic demo I made to learn how to benchmark my own function. I made a new project, added a lib.rs and then made a function inside lib.rs called “cycler” This is a tiny function so won’t really make full use of the benchmarks but I wanted […]

Let’s look at how each pixel’s colour is stored in a single 32-bit integer using the RGBA format 1D Array Representation The buffer is a 1D array that stores the pixel colors for each pixel in the window. The array’s length is width * height, and each entry in the array is a 32-bit integer […]

flatten v flat_map – what’s the difference? In Rust, flat_map and flatten are both methods used for transforming and simplifying nested structures, but they serve slightly different purposes and apply to different contexts. 1. flat_map Example: Explanation: 2. flatten Example: Explanation: Key Differences flatten v flat_map – Summary Table Method When to Use Produces Example […]

https://www.codewars.com/kata/52de553ebb55d1fca3000371/train/rust Try the challenge on CodeWars first – and then have a look at my solution which is mainly based on this challenge. What did I learn from this? Well, I worked out that using a HashMap was a neat way to identify the gap that was different to the others. What else? Starting from […]

Let’s consider a more real-world example. Imagine you have a system that represents different types of data sources, like Database and File, each implementing a DataSource trait. The DataSource trait has a method get_backup_source that returns a backup data source as a trait object. This could be useful if your application needs to switch to […]

Use ? in functions where you want to propagate errors up to the caller. This allows the function to remain clean and focused on its main task while delegating error handling to the caller.

when implementing the Iterator trait in Rust, your struct usually needs some form of state to keep track of the iteration’s progress. Often, this is achieved by including a counter or index field in your struct. https://doc.rust-lang.org/stable/book/ch13-02-iterators.html?highlight=iterator%20trait#the-iterator-trait-and-the-next-method Also, check out : https://doc.rust-lang.org/stable/book/ch19-03-advanced-traits.html#specifying-placeholder-types-in-trait-definitions-with-associated-types impl Iterator for Here’s a basic example of how to implement an iterator […]

“The Rust Implementation of the libp2p networking stack.” https://github.com/libp2p/rust-libp2p/blob/master/libp2p/src/tutorials/ping.rs Peer-to-peer networking library libp2p is an open source networking library used by the world’s most important distributed systems What is a swarm? A swarm in libp2p represents a group of peers that can communicate over a P2P network. It provides the necessary abstractions for connection management, message […]