-
Notifications
You must be signed in to change notification settings - Fork 60
Open
Description
The most common case for deep recursion is when handling deeply nested recursive types, where SomeType
has a Box<SomeType>
(or some other container) internally that can be nested really deeply, and then any standard operations that need to walk entire type, fail.
Suggestion: would it be worth providing a Stacker<T>
newtype that automatically handles Deref
, DerefMut
, PartialEq
, PartialOrd
, Hash
, Debug
and so on and all other standard traits, but automatically checks and grows the stack before recursing?
It seems that such type would magically handle most common cases without user having to write any stack-growing code.
Metadata
Metadata
Assignees
Labels
No labels