Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning Rust

You're reading from   Learning Rust A comprehensive guide to writing Rust applications

Arrow left icon
Product type Paperback
Published in Nov 2017
Publisher Packt
ISBN-13 9781785884306
Length 308 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Vesa Kaihlavirta Vesa Kaihlavirta
Author Profile Icon Vesa Kaihlavirta
Vesa Kaihlavirta
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Introducing and Installing Rust FREE CHAPTER 2. Variables 3. Input and Output 4. Conditions, Recursion, and Loops 5. Remember, Remember 6. Creating Your Own Rust Applications 7. Matching and Structures 8. The Rust Application Lifetime 9. Introducing Generics, Impl, and Traits 10. Creating Your Own Crate 11. Concurrency in Rust 12. Now It's Your Turn! 13. The Standard Library 14. Foreign Function Interfaces

Project 4 – memory


In this project, you are to perform the following:

  1. Reserve a 1024-byte block of memory.
  2. Fill that block of memory with random characters.
  3. Create an array, which is also 1,024 bytes in size.
  4. Copy the contents of the memory block into the array.
  5. Create a string that is limited to 1,024 bytes and is set using the capacity function.
  6. Copy the contents of the memory block into the string.

At this point, you may be wondering why we have three identical blocks of memory. The simple reason is that you will now create a piece of code that will rotate each member in turn 3 times using a simple left-bit rotation and then 3 times to the right.

Bitwise rotation

Bitwise rotation is performed in Rust using the << and >> operators.

For example, if we have a variable called x that is rotated 3 to the left, we will write x << 3 with 3 to the right being x >> 3.

Say we have x = 01101001, x << 3 will be 01001000 and x >> 3 will be 00001101.

Rotation caveat

While we can...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image