From the course: Rust for Data Engineering
Unlock this course with a free trial
Join today to access over 24,900 courses taught by industry experts.
Demo: LinkedIn list fruit salad - Rust Tutorial
From the course: Rust for Data Engineering
Demo: LinkedIn list fruit salad
- [Instructor] Here we have a linked list example here, and one of the nice things about a linked list is that it has some really key elements of efficiency with things like insertion or deletion from a list if you don't care about accessing the elements, or in this particular example here, if you want to insert or remove elements from the middle of the list. But it's actually a much more rare data structure to use, and it has a higher memory overhead and worse cache locality than either Vec or VecDeque. Let's go ahead and take a look at how we would use it though. So again, I make this very similar to a previous VecDeque example here, except for a used linked list. At the very beginning here I go ahead and I push these elements into the back of the linked list. Now here I do something a little bit unusual, is that I convert it back to a Vec here, just to keep it similar to the previous VecDeque example here.…
Contents
-
-
-
Introducing Rust sequences and maps2m 26s
-
(Locked)
Demo: Print Rust data structures2m 26s
-
(Locked)
Demo: Vector fruit salad3m 25s
-
(Locked)
Demo: VecDeque fruit salad2m 38s
-
(Locked)
Demo: LinkedIn list fruit salad1m 35s
-
(Locked)
Demo: Fruit salad CLI3m 52s
-
(Locked)
Demo: HashMap frequency counter3m 3s
-
(Locked)
HashMap language comparison2m 45s
-
-
-
-
-
-
-
-
-
-
-