First of all the obligatory "I am new to Rust": Which I am :smiley:. So I have the following problem: I have two(or more) structs of data, that all implement some common behaviour in addition their own behaviour. I have a list of these structs (or rather: of the 'supertype'), I need to access some…

First of all, checking the concrete type behind an interface or a base class is an anti-pattern even in classic OO languages that do allow for inheritance. (Which might be old, but I certainly wouldn't call it "plain" either – however, that's a whole different discussion.) The proper solution inste…

It might be an anti-pattern, but it does beat cluttering the common trait with functions for the individual types, doesn't it? I mean each function that is only used by a subset of the trait implementors has to be in the super trait.. That can get out of hand pretty quickly, even in real situations. …

Again, because the code is a toy example, I'm not sure what your actual use case is. If you tell us what you are trying to do , rather than the purported "how", we might be able to offer higher-level guidance. I would not like to speculate too much further as to what a more or less elegant solution i…

[image] jokrey: It might be an anti-pattern, but it does beat cluttering the common trait with functions for the individual types, doesn't it? I think of this claim as dubious because "there's more than one way to bake a cake." I would strongly argue for clean code architecture that doesn't …

My use case(which I very much hope is minimal, while illustrating my issue) is the following: I have a trait 'Item' that has a name (by getter). trait Item { fn get_name() -> String; } One implementor of Item is the ItemList, a struct that contains a name and a vector of other Items. struct …

[image] jokrey: Now from the root ItemList I want to recursively traverse this tree, query all results from queryable items and put them in a vector. You can implement a data tree with a common interface trait: trait Node { fn name(&self) -> &str; fn children(&self) -> &[&dyn Node]; fn qu…

I think the first example here is why a lot of OOP design gets into a mess. Classifying things is hard. In the real world classes can be very nebulous and even change in definition. Things can get reclassified. A famous recent case: Is Pluto a planet? Once you have created a class hierarchy in your…

Alright, so you have a tree and you want to traverse it. And that indeed changes the picture a lot. Usually, since node types in a tree form a closed set of possible nodes, this is a good fit for using an enum. And then, incidentally, the common properties such as the name can be factored out into…

Thanks a lot! I guess I'll do it this (the first, enum) way. struct Node { name: String, item: Item, } enum Item { ItemList { items: Vec<Node>, }, QueryableItem { value: i32 }, ExecutableItem {} } impl Node { fn new_root(name: &str, items: Vec<Node>)…

How do I mimic/design this specific inheritance behaviour in rust?

help

TomP May 29, 2020, 3:43am 9

Perahps its time to trot out the second Rust koan.

Topic		Replies	Views
Suggestion for making Rust's trait system more usable for generics community	74	5642	January 14, 2020
With composition over inheritance in Rust, how does one implement shared state to go with shared behaviour? help	22	18172	September 14, 2020
How to implement inheritance-like feature for Rust? community	21	72560	August 11, 2019
How to think without field inheritance? help	19	3277	July 14, 2022
Extend a type from 3rd party	75	4830	December 29, 2021

How do I mimic/design this specific inheritance behaviour in rust?

Related topics