hg: jdk7/tl/jdk: 6881442: (reflect) Race condition in Class.getName()

2009-09-12 Thread martinrb
Changeset: 020a0fed38c9 Author:martin Date: 2009-09-12 15:30 -0700 URL: http://hg.openjdk.java.net/jdk7/tl/jdk/rev/020a0fed38c9 6881442: (reflect) Race condition in Class.getName() Summary: only read "name" field racily once Reviewed-by: darcy ! src/share/classes/java/lang/Class.ja

Re: 4206909 - adding Z_SYNC_FLUSH support to deflaters

2009-09-12 Thread Martin Buchholz
On Fri, Sep 11, 2009 at 16:13, Xueming Shen wrote: > > I'm definitely open for any better choice, I'm not in hurry to close this > one up. Sure, I hope we can > reach a consensus before I go on vacation this weekend:-) > > So here is the planB alan is proposing, no API doc added yet, but you should

Re: Replacement of Quicksort in java.util.Arrays with new Dual-Pivot Quicksort

2009-09-12 Thread Joshua Bloch
To amplify my previous statement, I think this is a great piece of work! Vladimir is to be commended. I also think that it may well get substantially faster as Vladimir continues to make minor algorithmic modifications. Jon Bentley has made many fine suggestions that Vladimir will try out.There ar

Re: Re[2]: Replacement of Quicksort in java.util.Arrays with new Dual-Pivot

2009-09-12 Thread Goktug Gokdogan
In fact, at first I intentionally skipped the warming-up code, thinking that use of non-jvm optimized code could give some idea if more fine-tuning required in the implementation. Then I realized that results also includes the class loading times :(. So I added code that will just load classes by s

Re: Replacement of Quicksort in java.util.Arrays with new Dual-Pivot Quicksort

2009-09-12 Thread Goktug Gokdogan
Sorry :( . Please ignore previous post. Warming-up yield to better results in dual-pivot's favor. On Sat, Sep 12, 2009 at 2:43 PM, Goktug Gokdogan wrote: > My absolutely non-scientific preliminary tests indicate Arrays.sort > performs better with the same input (5000 items) in nearly all runs >

Re: Replacement of Quicksort in java.util.Arrays with new Dual-Pivot Quicksort

2009-09-12 Thread Goktug Gokdogan
My absolutely non-scientific preliminary tests indicate Arrays.sort performs better with the same input (5000 items) in nearly all runs (-client). public static void main(String[] args) { final int n = 5000; int[] array = new int[n]; int[] array2 = new int[n]; Random random = new Random(); for (int

Re: What methods should go into a java.util.Objects class in JDK 7?

2009-09-12 Thread Goktug Gokdogan
Similarly, I've previously written reflection-based #clone, #equals, and #fillRandomData methods working on POJOs. They were useful especially in testing the data binding codes, ie. X original = new X();, fillRandomData(original); mapper.toGUI( clone(original) ); //Clone object so original dat