News for hackers. Stuff that matters.
Re:Choosing Nim out of a crowded market for systems programm... by pie_flavor on Saturday November 26, 2022 @03:22AM (#33750938)
The easy pattern of graph structures is handled by the easy implementation of adjacency lists, which is how you should have been implementing it in other languages too. The specific incompatibility is with the naïve hand-implementations of these structures; the specific thing Rust does not optimize for is toy code.
Re:Choosing Nim out of a crowded market for systems programm... by moldavi on Saturday November 26, 2022 @03:41AM (#33751053)
You know nothing of what I'm programming. You don't know when, whether, or how my program accesses or deletes data.

And yet, you proclaim that your solution is always the best in any language, in any situation.

It's particularly amusing because if we apply your solution everywhere, it reduces our entire program's state into basically a bunch of relational tables, which can be pretty awful for encapsulation, extensibility, and modularity in a lot of situations.

Re:Choosing Nim out of a crowded market for systems programm... by sph on Saturday November 26, 2022 @04:20AM (#33751240)
No need to take it personal. I don't think the "you" OP used referred to you specifically.
Re:Choosing Nim out of a crowded market for systems programm... by mumblemumble on Saturday November 26, 2022 @12:28PM (#33754671)
I agree with the sibling commenter that the parent poster was likely using the impersonal you. It is true that we don't know anything about you. You haven't volunteered any specifics, so we're kind of forced to guess if we want to try and respond in a productive manner.

To that end, I think that they chose a very good example. Abstractly, doubly linked lists are a special case of undirected graphs. So pointing out that a naive graph implementation is generally sup-optimal, and that usually one can more effectively model them using different data structures that Rust (and functional languages, and databases, and files, etc.) can handle just fine, neatly addresses problems that one might solve using a doubly linked list, as well as a whole host of other cases, in a single stroke.