index-list
too-many-lists
index-list | too-many-lists | |
---|---|---|
3 | 219 | |
4 | 3,038 | |
- | 1.3% | |
4.6 | 0.0 | |
about 2 months ago | about 1 month ago | |
Rust | Rust | |
GNU Lesser General Public License v3.0 only | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
index-list
-
Things you can’t do in Rust (and what to do instead)
If you switch pointers for indirect indexes, then you can quite easily make a purely safe doubly-linked list in Rust. I did that as a learning exercise and called it index_list (github), where all elements and nodes are stored in a vector (for improved locality). In my very short and non-general tests it performed better than the standard LinkedList implementation. It also provide you with an alternative way to iterate over the list with mutable access to its elements. It probably is not at the same level of quality as standard library things, as I'm quite new to Rust in general, but thought the design would be worth consideration in this context.
-
custom index for Vec<T> (eg 32bit indices in 64 bit)
I implemented a doubly-linked list in safe Rust, where I use Option as an Index type. This gives me an optional u32 in 4 bytes. You can find my lib.rs code on GitHub and it starts with the Index struct. It also implements From for u32, u64 and usize. Maybe you can take inspiration from there. In that code the user isn't supposed to create the Indexes themselves m but get them from the list as they traverse them. That is why most methods are private.
-
A doubly-linked list implemented in safe Rust, using vector indexes
The source code is available on: * GitHub: https://github.com/Fairglow/index-list * Crates.io: https://crates.io/crates/index_list
too-many-lists
-
Towards memory safety with ownership checks for C
You seem to have a preset opinion, and I'm not sure you are interested in re-evaluating it. So this is not written to change your mind.
I've developed production code in C, C++, Rust, and several other languages. And while like pretty much everything, there are situations where it's not a good fit, I find that the solutions tend to be the most robust and require the least post release debugging in Rust. That's my personal experience. It's not hard data. And yes occasionally it's annoying to please the compiler, and if there were no trait constraints or borrow rules, those instances would be easier. But way more often in my experience the compiler complained because my initial solution had problems I didn't realize before. So for me, these situations have been about going from building it the way I wanted to -> compiler tells me I didn't consider an edge case -> changing the implementation and or design to account for that edge case. Also using one example, where is Rust is notoriously hard and or un-ergonomic to use, and dismissing the entire language seems premature to me. For those that insist on learning Rust by implementing a linked list there is https://rust-unofficial.github.io/too-many-lists/.
-
Command Line Rust is a great book
Advent of Code was okay until I encounterd a problem that required a graph, tree or linked list to solve, where I hit a wall. Most coding exercises are similar--those requiring arrays and hashmaps and sets are okay, but complex data structures are a PITA. (There is an online course dedicated to linked lists in Rust but I couldn't grok it either). IMO you should simply skip problems that you can't solve with your current knowledge level and move on.
-
[Media] I'm comparing writing a double-linked list in C++ vs with Rust. The Rust implementation looks substantially more complex. Is this a bad example? (URL in the caption)
I feel obligated to point to the original cannon literature: https://rust-unofficial.github.io/too-many-lists/
-
Need review on my `remove()` implementation for singly linked lists
I started learning Rust and like how the compiler is fussy about things. My plan was to implement the data structures I knew, but I got stuck at the singly linked list's remove() method. I've read the book as well, but I have no clue how to simplify this further:
-
Factor is faster than Zig
My impression from the article is that Zig provides several different hashtables and not all of them are broken in this way.
This reminds me of Aria's comment in her Rust tutorial https://rust-unofficial.github.io/too-many-lists/ about failing to kill LinkedList. One philosophy (and the one Rust chose) for a stdlib is that this is only where things should live when they're so commonly needed that essentially everybody needs them either directly or to talk about. So, HashTable is needed by so much otherwise unrelated software that qualifies, BloomFilter, while it's real useful for some people, not so much. Aria cleaned out Rust's set of standard library containers before Rust 1.0, trying to keep only those most people would need. LinkedList isn't a good general purpose data structure, but, it was too popular and Aria was not able to remove it.
Having multiple hash tables feels like a win (they're optimized for different purposes) but may cost too much in terms of the necessary testing to ensure they all hit the quality you want.
-
Was Rust Worth It?
> Cyclic references can be dealt with runtime safety checks too - like Rc and Weak.
Indeed. Starting out with code sprinkled with Rc, Weak, RefCell, etc is perfectly fine and performance will probably not be worse than in any other safe languages. And if you do this, Rust is pretty close to those languages in ease of use for what are otherwise complex topics in Rust.
A good reference for different approaches is Learn Rust With Entirely Too Many Linked Lists https://rust-unofficial.github.io/too-many-lists/
- What are some of projects to start with for a beginner in rust but experienced in programming (ex: C++, Go, python) ?
-
How to start learning a systems language
Second, once you've finished something introductory like The Book, read Learning Rust With Entirely Too Many Linked Lists. It really helped me to understand what ownership and borrowing actually mean in practical terms. If you don't mind paying for learning materials, a lot of people recommend Programming Rust, Second Edition by Blandy, Orendorff, and Tindall as either a complement, follow-up, or alternative to The Book.
- My team might work with Rust! But I need good article recommendations
-
Conversion?
Learning Rust With Entirely Too Many Linked Lists which highlights a lot of the differences with how you need to structure your code in Rust compared to other languages.
What are some alternatives?
rfcs - RFCs for changes to Rust
rust - Empowering everyone to build reliable and efficient software.
not-yet-awesome-embedded-rust - A collection of items that are not yet awesome in Embedded Rust
Rustlings - :crab: Small exercises to get you used to reading and writing Rust code!
rental - Rust macro to generate self-referential structs
book - The Rust Programming Language
cons-list - Singly-linked list implementation in Rust
CppCoreGuidelines - The C++ Core Guidelines are a set of tried-and-true guidelines, rules, and best practices about coding in C++
easy_rust - Rust explained using easy English
x11rb - X11 bindings for the rust programming language, similar to xcb being the X11 C bindings
patterns - A catalogue of Rust design patterns, anti-patterns and idioms
miri - An interpreter for Rust's mid-level intermediate representation