Kurt Rose

was just blowing the dust off perf stuff; I think this is mergable. We may even be able to go a step further -- once T is a "normal" object...

Reading this discussion with great interest. It's very nice and intuitive to handle structured data entering and exiting the system with dataclasses. For example, ORMs, network servers and clients, loading...

The easiest way to do that would be as a custom Mode -- maybe `Trim`? ~ 15 LOC I can whip something up real quick

Hmm... I guess delete is an in-place mutation rather than returning a copy. I think this would be easier to do as a follow-on step rather than mixing it into...

Let me see if this reasoning makes sense: Recursive deleting "along a path" is probably not so much what is intended as recursive deletion of a subtree. That is, you...

A switch would almost work -- except this requires post-evaluation not pre-evaluation. `Switch({bool: T}, default=SKIP)` or maybe `And(bool, T, default=SKIP)`. Then wrap it with a `Ref`. The hard part is...

`Traverse()` was going to be the more general `**`, maybe this is a test use-case? Of course, plain python recursion would have better performance than bouncing each item through glom.

Oops I just ran into this exact same issue and opened another PR. I guess the original author is no longer interested in maintaining.

The other 4 PRs are fixing that exact same line. :-) Unfortunately, I think the original author has left. Hope they are okay!

I've used this in 5 places now, I think there's definitely a handy primitive here, although I'm not sure if I got the name quite right: ```python def dict_zip(*dicts): for...