parasyte:
it became apparent that you can create BTreeSet<Box<dyn EqHashObj>>
You can create any BTreeSet<T> with BTreeSet::new() as it has no requirement on T other than Sized. Any meaningful method however will require Ord however. parasyte:
And I don't know if it's possible to create this trait and the necessary impl macros. This crate is a funny workaround for a big problem, though.
Such trait would be very similar to EqObj. Like EqObj the "hard" part is handling the case where you're comparing two different types. with EqObj the answer is just making them different, but with OrdObj you have to give a total order, so you must make one smaller than the other. A simple solution would be comparing their TypeId first. Something like this for example Rust Playground
I think this is becoming a discussion more fit for users.rust-lang.org at this point, wouldn't it be better to more there or in the original discussion (also there)?