Hi all,
This pull request contains a backport of commit
[72ca7baf](https://github.com/openjdk/jdk/commit/72ca7bafcd49a98c1fe09da72e4e47683f052e9d)
from the [openjdk/jdk](https://git.openjdk.org/jdk) repository.
The commit being backported was authored by Hannes Greule on 22 Jun 2024 and
was re
On Sat, 22 Jun 2024 21:12:36 GMT, fabioromano1 wrote:
>> I have implemented the Zimmermann's square root algorithm, available in
>> works [here](https://inria.hal.science/inria-00072854/en/) and
>> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>>
>> The
On Tue, 18 Jun 2024 15:34:16 GMT, fabioromano1 wrote:
>> fabioromano1 has updated the pull request incrementally with one additional
>> commit since the last revision:
>>
>> Removed unused import
>
> src/java.base/share/classes/java/math/MutableBigInteger.java line 293:
>
>> 291: */
>>
On Sat, 22 Jun 2024 08:07:54 GMT, SendaoYan wrote:
> Hi all,
>
> This pull request contains a backport of commit
> [8e1d2b09](https://github.com/openjdk/jdk/commit/8e1d2b091c9a311d98a0b886a803fb18d4405d8a)
> from the [openjdk/jdk](https://git.openjdk.org/jdk) repository.
>
> The commit being
> I have implemented the Zimmermann's square root algorithm, available in works
> [here](https://inria.hal.science/inria-00072854/en/) and
> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>
> The algorithm is proved to be asymptotically faster than the New
> I have implemented the Zimmermann's square root algorithm, available in works
> [here](https://inria.hal.science/inria-00072854/en/) and
> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>
> The algorithm is proved to be asymptotically faster than the New
> I have implemented the Zimmermann's square root algorithm, available in works
> [here](https://inria.hal.science/inria-00072854/en/) and
> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>
> The algorithm is proved to be asymptotically faster than the New
On Sun, 10 Mar 2024 16:11:12 GMT, Shaojin Wen wrote:
> The current BigDecimal(String) constructor calls String#toCharArray, which
> has a memory allocation.
>
>
> public BigDecimal(String val) {
> this(val.toCharArray(), 0, val.length()); // allocate char[]
> }
>
>
> When the length is g
On Wed, 3 Apr 2024 16:17:57 GMT, ExE Boss wrote:
>> Jan Lahoda has updated the pull request with a new target base due to a
>> merge or a rebase. The pull request now contains six commits:
>>
>> - Reflecting review feedback.
>> - Merge branch 'master' into JDK-8291966
>> - Adding comments
>>
On Sat, 22 Jun 2024 08:07:54 GMT, SendaoYan wrote:
> Hi all,
>
> This pull request contains a backport of commit
> [8e1d2b09](https://github.com/openjdk/jdk/commit/8e1d2b091c9a311d98a0b886a803fb18d4405d8a)
> from the [openjdk/jdk](https://git.openjdk.org/jdk) repository.
>
> The commit being
On Mon, 29 May 2023 07:25:26 GMT, Jan Lahoda wrote:
>> The pattern matching switches are using a bootstrap method
>> `SwitchBootstrap.typeSwitch` to implement the jumps in the switch.
>> Basically, for a switch like:
>>
>> switch (obj) {
>> case String s when s.isEmpty() -> {}
>> case
> An indify tool in j.l.i tests (also in vmTestBase) convert some source-code
> private static methods with MT_ MH_, and INDY_ prefixes into MethodHandle,
> MethodType, and CallSite constants.
> It currently uses ad-hoc code to process class files and intends to migrate
> to ASM; but since we ha
> An indify tool in j.l.i tests (also in vmTestBase) convert some source-code
> private static methods with MT_ MH_, and INDY_ prefixes into MethodHandle,
> MethodType, and CallSite constants.
> It currently uses ad-hoc code to process class files and intends to migrate
> to ASM; but since we ha
> An indify tool in j.l.i tests (also in vmTestBase) convert some source-code
> private static methods with MT_ MH_, and INDY_ prefixes into MethodHandle,
> MethodType, and CallSite constants.
> It currently uses ad-hoc code to process class files and intends to migrate
> to ASM; but since we ha
On Sat, 22 Jun 2024 09:39:46 GMT, Oussama Louati wrote:
>> An indify tool in j.l.i tests (also in vmTestBase) convert some source-code
>> private static methods with MT_ MH_, and INDY_ prefixes into MethodHandle,
>> MethodType, and CallSite constants.
>> It currently uses ad-hoc code to process
On Fri, 21 Jun 2024 07:40:31 GMT, Hannes Greule wrote:
> Addresses two simple problems regarding javadocs in the FFM API.
This pull request has now been integrated.
Changeset: 72ca7baf
Author:Hannes Greule
Committer: Chen Liang
URL:
https://git.openjdk.org/jdk/commit/72ca7bafcd49a9
On Mon, 17 Jun 2024 08:33:17 GMT, Adam Sotona wrote:
>> We need a boolean value to determine if we should proceed after replacing
>> the appropriate "pop" instruction with an "invokedynamic" instruction.
>> However, instead of using just a boolean field, we use a stack. The reason
>> for this
> An indify tool in j.l.i tests (also in vmTestBase) convert some source-code
> private static methods with MT_ MH_, and INDY_ prefixes into MethodHandle,
> MethodType, and CallSite constants.
> It currently uses ad-hoc code to process class files and intends to migrate
> to ASM; but since we ha
> An indify tool in j.l.i tests (also in vmTestBase) convert some source-code
> private static methods with MT_ MH_, and INDY_ prefixes into MethodHandle,
> MethodType, and CallSite constants.
> It currently uses ad-hoc code to process class files and intends to migrate
> to ASM; but since we ha
> I have implemented the Zimmermann's square root algorithm, available in works
> [here](https://inria.hal.science/inria-00072854/en/) and
> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>
> The algorithm is proved to be asymptotically faster than the New
On Thu, 13 Jun 2024 18:31:33 GMT, fabioromano1 wrote:
> I have implemented the Zimmermann's square root algorithm, available in works
> [here](https://inria.hal.science/inria-00072854/en/) and
> [here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
>
> The algo
I have implemented the Zimmermann's square root algorithm, available in works
[here](https://inria.hal.science/inria-00072854/en/) and
[here](https://www.researchgate.net/publication/220532560_A_proof_of_GMP_square_root).
The algorithm is proved to be asymptotically faster than the Newton's Meth
Hi all,
This pull request contains a backport of commit
[8e1d2b09](https://github.com/openjdk/jdk/commit/8e1d2b091c9a311d98a0b886a803fb18d4405d8a)
from the [openjdk/jdk](https://git.openjdk.org/jdk) repository.
The commit being backported was authored by Rajan Halade on 21 Jun 2024 and was
rev
23 matches
Mail list logo
