Use a TreeMap in ListOrderedMap unit test for deterministic entry order.
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1352264 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
07d84c5eba
commit
13c8e44e6a
|
@ -20,6 +20,7 @@ import java.util.ArrayList;
|
|||
import java.util.HashMap;
|
||||
import java.util.List;
|
||||
import java.util.Map;
|
||||
import java.util.TreeMap;
|
||||
|
||||
import junit.framework.Test;
|
||||
|
||||
|
@ -342,9 +343,9 @@ public class TestListOrderedMap<K, V> extends AbstractTestOrderedMap<K, V> {
|
|||
lom.put((K) Integer.valueOf(i), (V) Boolean.valueOf(true));
|
||||
}
|
||||
|
||||
HashMap<K, V> map = new HashMap<K, V>();
|
||||
Map<K, V> map = new TreeMap<K, V>();
|
||||
for (int i = 0; i < size; i++) {
|
||||
map.put((K) Integer.valueOf(i), (V) Boolean.valueOf(true));
|
||||
map.put((K) Integer.valueOf(i), (V) Boolean.valueOf(false));
|
||||
}
|
||||
|
||||
lom.putAll(3, map);
|
||||
|
|
Loading…
Reference in New Issue