Project: A `grep`-like Tool (Part 1)
We've learned a lot about building CLI applications in Rust. Now, it's time to put it all together in a Project: A grep-like Tool (Part 1).
We've learned a lot about building CLI applications in Rust. Now, it's time to put it all together in a Project: A grep-like Tool (Part 1).
We've started building our grep-like tool. Now, let's finish it in Project: A grep-like Tool (Part 2).
We've learned a lot about working with databases in Rust. Now, it's time to put it all together in a Project: A CLI for a To-Do List App with a Database.
We've come a long way in our journey through Rust's concurrency features. Now, it's time to put it all together in a Project: A Multi-threaded Web Server (Part 1).
Let's start our new series by building a Project: A Simple "Hello, World!" Web App.
We've learned a lot about building web APIs with Actix Web. Now, it's time to put it all together in a Project: A Simple Blog API (Part 1).
We've started building our blog API. Now, let's finish it in Project: A Simple Blog API (Part 2).
We've learned a lot about Actix Web. Now, it's time to put it all together in a Project: A Simple To-Do List Web App (Part 1).
We've started building our to-do list app. Now, let's finish it in Project: A Simple To-Do List Web App (Part 2).
We've learned a lot about FFI. Now, it's time to put it all together in a Project: A Simple Wrapper around a C Library.
It's time to put everything you've learned in this series into practice. We've covered variables, operators, and handling user input. Now, we'll combine all of these concepts to build a complete, interactive program: a simple command-line calculator.
This series has covered a wide range of smart pointers and memory management techniques. Now it's time to put that knowledge into practice with a classic computer science data structure: the singly linked list. This project will demonstrate why Box is essential for recursive data structures and how to handle ownership and memory management correctly.
In our last project, we built a simple calculator. Now, we're going to start a new, slightly more complex project that we will build over the next few articles: a classic guessing game.
In Part 1 of our Guessing Game project, we set up the project and generated a random secret number. Now, it's time to add the core logic of the game: getting the user's guess and comparing it to the secret number.
Welcome to the final part of our Guessing Game project! In Part 2, we added the core logic for comparing the user's guess to the secret number. In this article, we'll add the final polish to our game by handling invalid input gracefully and improving the looping mechanism.
It's time to put everything we've learned about structs into practice. In this project, we will model a user account for a web application. This will involve defining a User struct, creating instances of it, and defining methods to interact with the user data.
To solidify our understanding of structs, let's build a simple program that calculates the area of a rectangle. This project will be broken into two parts. In this first part, we will focus on defining the Rectangle struct and creating a simple main function to work with it.
In Part 1 of this project, we wrote a program that calculates the area of a rectangle using a standalone function. This works, but we can make the code clearer and more organized. The area function is directly related to the Rectangle struct, so it should be a method of the struct.
To wrap up our series on collections, we're going to build one more project: a simple command-line to-do list application. This project will primarily use a Vec to store the to-do items and will allow the user to add items, list items, and mark items as complete.
It's time to put everything we've learned about collections into practice. In this project, we will build a program that counts the occurrences of each word in a given text. This is a classic programming exercise that is a perfect way to use the HashMap to solve a real-world problem.