Efficient Collection Management in Rust for Software Development
Explore the efficient and safe handling of collections in Rust for system software development, including the move and borrow semantics used extensively, safety assurances provided by Rust collections, and the organization and usage of various collections. Dive into the details of different container types, ordering and hashing in maps, and methods for optimal functionality. Studio sessions allow for hands-on practice with collection initialization and data management techniques to enhance your skills for exam preparation.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
E81 CSE 542S: Concurrency and Memory Safe System Software Development Collections Department of Computer Science & Engineering Chris Gill cdgill@wustl.edu 1
Collections I Rust collections and their methods use move and borrow semantics extensively E.g., push into a vector is by value, and moves the value into the collection This increases efficiency in many cases E.g., moving saves the cost of deep copies This promotes safety in all cases E.g., borrow checking to avoid dangling references, using Option instead of null 2 CSE 542S Concurrency and Memory Safe System Software Development
Collections II Rust provides similar kinds of collections to those in the C++ Standard Library But again, with stronger safety assurances E.g., single- and double-ended vectors I.e., Vec<T> and VecDequeue<T> respectively E.g., doubly linked lists I.e., LinkedList<T> (which is rarely used) Those above are unordered containers 3 CSE 542S Concurrency and Memory Safe System Software Development
Collections III Rust provides ordered containers with parameterized types implementing Ord BinaryHeap<T>, BTreeMap<K,V>, BTreeSet<T> Rust also provides hashed containers with parameterized types implementing Eq + Hash HashMap<K,V> and HashSet<T> Ordering and hashing in the maps is based on the traits implemented by key parameter K Ordering and hashing in the sets and heap is based on traits implemented by T 4 CSE 542S Concurrency and Memory Safe System Software Development
Collections IV Which methods and operators each container provides relates directly to efficiency as well as functionality E.g., both Vec and VecDeque provide [] E.g., Vec can only push and pop at one end Hashing may add further complications E.g., derive both Hash and PartialEq or hand-implement both Hash and PartialEq E.g., can create custom hash algorithms 5 CSE 542S Concurrency and Memory Safe System Software Development
Studio 15 Examine how various collections are organized Explore and practice how different collections can be initialized and used to manage data Studios 12 through 20 are due by 11:59pm on the night before Exam 2 Submit as soon as each is done so you get feedback and can resubmit any that may be marked incomplete 6 CSE 542S Concurrency and Memory Safe System Software Development
