On Thu, Jul 22, 2021 at 1:14 AM Sven Voigt email@example.com wrote:
I agree that the mapping to a flat data structure might have limited use cases. However, like you said it is only one example. What I am proposing is a nested iteration tool that can map both keys and values to new keys and new values. It only considers nesting in dictionaries, lists, and tuples by default, but allows users to pass another function to continue searching for pointers in other types.
This sounds like the sort of thing that's best coded up specifically to your purposes. There'll be myriad small variants of this kind of traversal, so it's easiest to just write the thing you want, rather than try to get the standard library to support every variant.