7ac892c8bd
This requires introducing proper bounds on all leaf types, so that intersection between bitsets and these types can be accurately represented. Extending a union also becomes more involved. (On the upside, the modified union/intersect algorithm would now allow support for proper variance for function types.) Not sure if it is worth landing this. Distributivity isn't really a crucial property for our use cases. It seems fine if intersection is slightly lossy. R=bmeurer@chromium.org, jarin@chromium.org BUG= Review URL: https://codereview.chromium.org/251753005 git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@21528 ce2b1a6d-e550-0410-aec6-3dcde31c8c00 |
||
---|---|---|
.. | ||
benchmarks | ||
cctest | ||
fuzz-natives | ||
intl | ||
message | ||
mjsunit | ||
mozilla | ||
preparser | ||
promises-aplus | ||
test262 | ||
webkit |