< prev index next >

test/jdk/java/util/concurrent/ConcurrentHashMap/MapLoops.java

Print this page
rev 51731 : imported patch 8210732

@@ -39,11 +39,11 @@
  * though elements of "key" array. On each iteration, it checks if
  * table includes key.  If absent, with probability pinsert it
  * inserts it, and if present, with probability premove it removes
  * it.  (pinsert and premove are expressed as percentages to simplify
  * parsing from command line.)
- * @library /lib/testlibrary/
+ * @library /test/lib
  * @run main/timeout=1600 MapLoops
  */
 
 import static java.util.concurrent.TimeUnit.MILLISECONDS;
 

@@ -52,11 +52,11 @@
 import java.util.SplittableRandom;
 import java.util.concurrent.CopyOnWriteArrayList;
 import java.util.concurrent.CyclicBarrier;
 import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
-import jdk.testlibrary.Utils;
+import jdk.test.lib.Utils;
 
 public class MapLoops {
     static final long LONG_DELAY_MS = Utils.adjustTimeout(10_000);
     static int nkeys       = 1000; // 10_000
     static int pinsert     = 60;
< prev index next >