On Sun, 5 Jan 2025 02:57:37 GMT, j3graham wrote:
>> Shaojin Wen has updated the pull request incrementally with 11 additional
>> commits since the last revision:
>>
>> - emptyInput -> nullInput
>> - use CharacterDataLatin1.instance::isDigit
>> - add comments
>> - reduce codeSize
>> - bug f
On Sun, 5 Jan 2025 07:07:15 GMT, Shaojin Wen wrote:
>> This is an optimization for decimal Integer.parseInt and Long.parseLong,
>> which improves performance by about 10%. The optimization includes:
>> 1. Improve performance by parsing 2 numbers at a time, which has performance
>> improvements
On Sun, 5 Jan 2025 02:50:34 GMT, j3graham wrote:
> > 2. The leading zero scenario is not common, and there is no need to
> > optimize this scenario.
>
> Another approach would be to limit the “fast” path to the case where the
> overall string length is 9 or less. That would allow overflow-free
On Sun, 5 Jan 2025 00:12:03 GMT, Shaojin Wen wrote:
> 2. The leading zero scenario is not common, and there is no need to optimize
> this scenario.
Another approach would be to limit the “fast” path to the case where the
overall string length is 9 or less. That would allow overflow-free calcu
On Sat, 4 Jan 2025 18:18:47 GMT, j3graham wrote:
> Some other thoughts that might help here; except for leading zeros, 9 (or 18
> for a long) or fewer digits cannot overflow. So something like this might
> work:
>
> * read first char and check if it is a sign character.
> * skip leading zeros
On Sat, 4 Jan 2025 12:09:04 GMT, Shaojin Wen wrote:
>> This is an optimization for decimal Integer.parseInt and Long.parseLong,
>> which improves performance by about 10%. The optimization includes:
>> 1. Improve performance by parsing 2 numbers at a time, which has performance
>> improvements
> This is an optimization for decimal Integer.parseInt and Long.parseLong,
> which improves performance by about 10%. The optimization includes:
> 1. Improve performance by parsing 2 numbers at a time, which has performance
> improvements for numbers with length >= 3.
> 2. It uses charAt(0) for t
There exist a dedicated page for this kind of information, please go through
it: https://openjdk.org/guide/#contributing-to-an-openjdk-project
Moreover you can’t create issue, instead you can describe the issue here and
someone will open a bug on JBS for you, for which you can raise the PR (refe
https://github.com/openjdk/jdk I would like to contribute to the git.
I went to the address https://mail.openjdk.org/pipermail/core-libs-dev/ and
completed the subscription.
How should I write about the issue and commit contents and proceed?
Thank you.
On Sat, 4 Jan 2025 12:09:04 GMT, Shaojin Wen wrote:
>> This is an optimization for decimal Integer.parseInt and Long.parseLong,
>> which improves performance by about 10%. The optimization includes:
>> 1. Improve performance by parsing 2 numbers at a time, which has performance
>> improvements
> This is an optimization for decimal Integer.parseInt and Long.parseLong,
> which improves performance by about 10%. The optimization includes:
> 1. Improve performance by parsing 2 numbers at a time, which has performance
> improvements for numbers with length >= 3.
> 2. It uses charAt(0) for t
> This is an optimization for decimal Integer.parseInt and Long.parseLong,
> which improves performance by about 10%. The optimization includes:
> 1. Improve performance by parsing 2 numbers at a time, which has performance
> improvements for numbers with length >= 3.
> 2. It uses charAt(0) for t
This is an optimization for decimal Integer.parseInt and Long.parseLong, which
improves performance by about 10%. The optimization includes:
1. Improve performance by parsing 2 numbers at a time, which has performance
improvements for numbers with length >= 3.
2. It uses charAt(0) for the first n
Welcome to OpenJDK!
Your next step should be reading this document:
https://openjdk.org/guide/ :-)
Regards
-Markus
Am 04.01.2025 um 07:23 schrieb 임민수:
hello.
In order to contribute to openJDK, I had to subscribe to the email.
Can I know what happens after that?
I would like to partic
14 matches
Mail list logo
