Rust Programming Exercises: LRU Cache

Web Reference: Rust is blazingly fast and memory-efficient: with no runtime or garbage collector, it can power performance-critical services, run on embedded devices, and easily integrate with other languages. The only aim in Rust is to survive. Everything wants you to die - the island’s wildlife, other inhabitants, the environment, and other survivors. Do whatever it takes to last another night. The only aim in Rust is to survive. Everything wants you to die - the island’s wildlife and other inhabitants, the environment, other survivors. Do whatever it takes to last another night.

YouTube Excerpt: In this video we implement an LRU Cache (Least Recently Used) in Rust with a double linked list along side a HashMap. We make use of Smart Pointers (Weak and Reference Counters) to maintain references between nodes and the HashMap. For the LRU cache, we also add the ability to set a capacity and pop least recently used items off of the list. **Note**: Because we make use of weak pointers we do not necessarily have to clean up our HashMap when the cache is being used up but it is something should try and implement later by storing the key alongside the node in order to do this. Try updating our implementation to store the key as well and clean up the HashMap whenever the LRU reaches its capacity. ↠ Other Videos to Watch Double Linked List: https://www.youtube.com/watch?v=k0cL6K28SL0 Tree Traversals with Reference Counting and Interior Mutability (in Rust): https://www.youtube.com/watch?v=xPtBPtuNVA0 Handling Reference Cycles (in Rust): https://www.youtube.com/watch?v=VXlYOZgrjg0&t=0s ↠ References: LRU Cache: https://leetcode.com/problems/lru-cache/ HashMap: https://doc.rust-lang.org/std/collections/struct.HashMap.html Double Linked List: https://en.wikipedia.org/wiki/Doubly_linked_list alloc::rc::Weak: https://doc.rust-lang.org/nightly/alloc/rc/struct.Weak.html Reference Cycles: https://doc.rust-lang.org/book/ch15-06-reference-cycles.html Interior Mutability: https://doc.rust-lang.org/nightly/std/cell/index.html#introducing-mutability-inside-of-something-immutable Reference Counters: https://doc.rust-lang.org/nightly/src/alloc/rc.rs.html#309-312 Drop Trait: https://doc.rust-lang.org/std/ops/trait.Drop.html std::cell: https://doc.rust-lang.org/src/core/cell.rs.html#610-619 Borrow Trait: https://doc.rust-lang.org/std/borrow/trait.Borrow.html Pointers: https://manishearth.github.io/blog/2015/05/27/wrapper-types-in-rust-choosing-your-guarantees/ ↠ Patreon: https://www.patreon.com/nyxtom?fan_landing=true ↠ Dotfiles: https://github.com/nyxtom/dotfiles ↠ Twitter: @nyxtom https://twitter.com/nyxtom ↠ Channel: https://www.youtube.com/c/nyxtom Cheers! 🍻 🦀 #rust #rustlang #rustprogramming #exercises #programming

In this video we implement an LRU Cache (Least Recently Used) in Rust with a double linked list along side a HashMap. We make use of Smart Pointers...

Read Full Article 🔍

Curious about Rust Programming Exercises: LRU Cache's Color? Explore detailed estimates, salary breakdowns, and financial insights that reveal the full picture of their profile.

Source ID: EfjN80PyMoM

Category: color style guide