New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
significant slowdown calculating complements #1394
Comments
I suppose it should be possible to optimise for the case of unions and enums and final classes. For example, I suppose Similarly, adding |
@jvasileff are you saying that this was faster before, and has recently got slower? |
@jvasileff if this is a problem that only occurs in recent builds, would you please try changing the impl of |
@gavinking, no, sorry, I see how that was misleading. I suspect I've been impacted by this for a while, but haven't had such an extreme case. In fact, I now see that it is gotten faster since May 15th (arbitrarily chosen date.) I tried the May 15th Test
Current
|
FWIW, testing for |
Narrowing operations involving several cases can be quite slow. Using the test program:
I'm getting the following timings on my laptop:
slownessx(String|Node)
(as shown above)slownessx(String|Enum)
slownessx(String|Foo)
And with the
slownessx
functions commented out:The text was updated successfully, but these errors were encountered: