Book Image

Rust Quick Start Guide

By : Daniel Arbuckle
Book Image

Rust Quick Start Guide

By: Daniel Arbuckle

Overview of this book

Rust is an emerging programming language applicable to areas such as embedded programming, network programming, system programming, and web development. This book will take you from the basics of Rust to a point where your code compiles and does what you intend it to do! This book starts with an introduction to Rust and how to get set for programming, including the rustup and cargo tools for managing a Rust installation and development work?ow. Then you'll learn about the fundamentals of structuring a Rust program, such as functions, mutability, data structures, implementing behavior for types, and many more. You will also learn about concepts that Rust handles differently from most other languages. After understanding the Basics of Rust programming, you will learn about the core ideas, such as variable ownership, scope, lifetime, and borrowing. After these key ideas, you will explore making decisions in Rust based on data types by learning about match and if let expressions. After that, you'll work with different data types in Rust, and learn about memory management and smart pointers.
Table of Contents (10 chapters)

Limiting what types can be used for type parameters

Sometimes, we need our type to have generic type parameters, but we don't want them to be totally generic. For example, we might need the type that's substituted for the parameter to be able to be moved between threads, or to support transformation into String, or any number of other things. Fortunately, Rust provides a way for us to do that.

We limit the domain of a generic type parameter by requiring it to have one or more traits. This is called a trait bound. Let's look at a basic binary tree data structure as an example.

A binary tree is made up of nodes. Each node has a key, an associated value, and two sub-trees: one for nodes with keys that are less than the current node's key, and one for nodes with keys that are greater. Finding a node with a particular key in the tree is just a matter of comparing...