Repository: groovy
Updated Branches:
  refs/heads/master 0eb785509 -> 1873534a8


Refine `ConcurrentLinkedHashMapTest` to sort keys of cache


Project: http://git-wip-us.apache.org/repos/asf/groovy/repo
Commit: http://git-wip-us.apache.org/repos/asf/groovy/commit/1873534a
Tree: http://git-wip-us.apache.org/repos/asf/groovy/tree/1873534a
Diff: http://git-wip-us.apache.org/repos/asf/groovy/diff/1873534a

Branch: refs/heads/master
Commit: 1873534a85bf92fcecd1942dc5e35d95f433740d
Parents: 0eb7855
Author: sunlan <[email protected]>
Authored: Wed Jan 24 07:54:57 2018 +0800
Committer: sunlan <[email protected]>
Committed: Wed Jan 24 07:54:57 2018 +0800

----------------------------------------------------------------------
 .../util/concurrentlinkedhashmap/ConcurrentLinkedHashMapTest.java | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/groovy/blob/1873534a/src/test/java/org/apache/groovy/util/concurrentlinkedhashmap/ConcurrentLinkedHashMapTest.java
----------------------------------------------------------------------
diff --git 
a/src/test/java/org/apache/groovy/util/concurrentlinkedhashmap/ConcurrentLinkedHashMapTest.java
 
b/src/test/java/org/apache/groovy/util/concurrentlinkedhashmap/ConcurrentLinkedHashMapTest.java
index a961df4..28e0641 100644
--- 
a/src/test/java/org/apache/groovy/util/concurrentlinkedhashmap/ConcurrentLinkedHashMapTest.java
+++ 
b/src/test/java/org/apache/groovy/util/concurrentlinkedhashmap/ConcurrentLinkedHashMapTest.java
@@ -21,6 +21,7 @@ package org.apache.groovy.util.concurrentlinkedhashmap;
 
 import org.junit.Test;
 
+import java.util.TreeSet;
 import java.util.concurrent.CountDownLatch;
 
 import static org.junit.Assert.assertArrayEquals;
@@ -78,7 +79,7 @@ public class ConcurrentLinkedHashMapTest {
 
         m.computeIfAbsent(0, k -> 16);
 
-        assertArrayEquals(new Integer[] {0, 1, 2}, m.keySet().toArray(new 
Integer[0]));
+        assertArrayEquals(new Integer[] {0, 1, 2}, new 
TreeSet(m.keySet()).toArray(new Integer[0]));
 
         assertNotEquals(16, m.get(0));
         assertEquals(0, (Integer) m.get(0) % 3);

Reply via email to