Complexity reduction when choosing the best inference leaf to be solved

[B. Blaser]

On 5 October 2017 at 16:28, Vicente Romero <vicente.romero at oracle.com> wrote:
>
>
> On 10/05/2017 04:32 AM, Maurizio Cimadamore wrote:
>>
>> Please, send me a patch with all your fixed, including the new version of
>> (3) and I'll take a look/run some tests.
>
>
> +1 yes please share the last full version

Here it is, in attachment.

Note that there's another possibility for pt (2), using "return
noPath" instead of "throw", but I think this would probably be slower.

I did only some quick tests with this last full version, so please let
me know if you encounter any problem with it.

I think the example I gave previously is really faster with (1) and
(3); we pick immediately, in O(1), 'X' then 'Y' and finally 'Z'.

Please let me know about the test results.

Cheers,
Bernard

>> Cheers
>> Maurizio
>
>
> Vicente
-------------- next part --------------
A non-text attachment was scrubbed...
Name: InferenceGraph_throw.patch
Type: text/x-patch
Size: 7960 bytes
Desc: not available
URL: <http://mail.openjdk.java.net/pipermail/compiler-dev/attachments/20171005/d6414521/InferenceGraph_throw.patch>