Peter Levart writes:
> I see that (given Function f, g), f.compose(g) means: f⨟g, rather than
> f∘g. Would mathematicians complain?
For what it's worth, Scala has "andThen" for "f;g" and "compose" for "f∘g".
Best,
Ismael
Joe Darcy writes:
> One of my long-term goals is to finish the
> small matter of programming [2] to port FDLIBM from C to Java, which
> would immunize the JDK from this class of problem.
In case people are not aware, FastMath from Apache commons-math is a
pure Java implementation:
http://svn.a
Ismael Juma writes:
> Also see (filed more than a year ago):
>
> https://bugs.openjdk.java.net/show_bug.cgi?id=100119
Oops, some of the newer messages were not visible on my reader for some reason.
Sorry for the noise.
Ismael
Andrew Haley writes:
> The post on
> http://www.exploringbinary.com/java-hangs-when-converting-2-2250738585072012e-
308/
Also see (filed more than a year ago):
https://bugs.openjdk.java.net/show_bug.cgi?id=100119
Best,
Ismael
Hey all,
The approach used for Arrays in Scala was changed in 2.8 and initially
java.lang.reflect.Array.get/set was used in certain cases. That was changed at
the end of last year[1] after it was pointed out that the performance of those
methods was less than desirable[2].
The interesting conc
Hi Paulo,
Paulo Levi writes:
> http://www.mail-archive.com/core-libs-dev-0nJqbsLSQw0FDOXUYO6UHQ
public.gmane.org/msg02147.html
>From the email you mention:
"I'm not convinced that they are enough better to commit."
To me that sounds like it's not going in at all.
Ismael
Hey Vladimir,
Vladimir Yaroslavskiy writes:
> You are right, the arrays were different: int array was 2'000'000
> and Integer array was 200'000 (and test was run 50 times) - if I
> remember correctly.
Great, that makes sense.
> Now I've run test on the same length 2'000'000 arrays 50 times,
>
Hi Vladimir,
Vladimir Yaroslavskiy writes:
>random 01 random 01
> dpq: 1431 dpq: 8017
> tim: 11495 tim: 2717
> jdk: 1552 jdk: 8547
Is the size of the int array different than the size of the j.l.Integer array? I
ask because I would be surprised if timso
Joe Darcy writes:
> A static hashCode method returning 0 for null and the value of
> arg.hashCode() has also been suggested.
>
> A set of
>
> static int compareTo(int, int)
> static int compareTo(long, long)
>
>
> methods probably belongs somewhere in the platform too.
Althou
Hi Doug,
Doug Lea writes:
> On further evaluating it (among other possible HashMap replacements),
> I'm not convinced that they are enough better to commit.
That's a shame. What about that idea of having a factory method that would take
a Class object and return an appropriate Map implementation
Hi Doug,
In a previous message you said:
"There are a few remaining things to consider
before taking this too seriously as a replacement.
I'll be out for 10 days starting tomorrow so probably
won't get a chance to do so soon."
I now understand the secret behind your productivity levels... someho
Hi Doug,
Doug Lea writes:
> While open-addressing is used in
> IdentityHashMap (and in a very specialized form in
> ThreadLocal), you cannot live with linear-probed
> versions otherwise: Many user-defined hashCodes
> (and some JDK-defined ones too!) are not very good.
Out of curiosity, do you kn
Martin Buchholz <[EMAIL PROTECTED]> writes:
> I was surprised to discover a discussion of
> HashMap optimization at the JavaOne talk
> http://developers.sun.com/learning/javaoneonline/2008/pdf/TS-6434.pdf
>
> Did I miss an announcement of that?
I noticed a commit related to that a few weeks ago[1
13 matches
Mail list logo
