Sorry, it feels like I already used up your patience with me in my previous posts. So, you just dismissed this one without reading it. That’s fine, focus on improving pathlib instead of wasting your time with my ideas.
- Unlike some other suggestions for improving comprehensions, I’m proposing a faster alternative to constructs which are widely used.
- The notation is natural, corresponding to logical expressions:
- \forall x \in A: x >= 0
- \exists x \in A: x < 0.
- There isn’t an obvious way to write these checks that’s both fast and concise, this proposal tries to address that.