mirror of
https://github.com/konsoletyper/teavm.git
synced 2024-11-21 01:00:54 +08:00
a2a9dbcbe3
The former implementation suffered from class inference. The reason was in many nodes having too many possible classes in them. The new implementation does not handle full set of classes in each node. Instead, it introduces concept of 'overflow', i.e. node having more types than the given upper limit. These nodes behave as if there were all possible classes in them, which allows to apply certain optimization for these nodes and omit heavy computations of large type sets. |
||
|---|---|---|
| .. | ||
| src/test | ||
| compile-c-unix-fast.sh | ||
| compile-c-unix.sh | ||
| pom.xml | ||