Suggestion: option to search for keys that have string in them about nested-lookup

[russellballestrini]

Interesting idea. Another option is creating a new function like multi_nested_lookup that changes key to keys and does an if k in keys. In this case we would recurse once and collect values for any number of deeply nested keys in one go. The returned result would have to be a dictionary of lists, instead of a list I think.

[russellballestrini]

On second thought, I think your way is easier to implement and keeps the existing return behavior. I'll see what I can come up with today.

[russellballestrini]

@blark let me know if this works for you and I'll cut a release on pypi:

https://github.com/russellballestrini/nested-lookup#wild

[blark]

Wow, you're quick ;) I'll give it a shot! Thanks.

[blark]

Works great. Thanks again.