Home
last modified time | relevance | path

Searched refs:mapSize (Results 1 – 13 of 13) sorted by relevance

/libcore/ojluni/src/test/java/util/LinkedHashMap/
DBasic.java57 int mapSize = 500; in testBasic() local
64 for (int j=0; j<mapSize; j++) { in testBasic()
72 Assert.assertEquals(m.size(), mapSize); in testBasic() local
90 Assert.assertEquals(j, mapSize); in testBasic()
94 for (int i=0; i<mapSize; i++) in testBasic()
96 for (int i=0; i<2*mapSize; i++) in testBasic()
133 List<Integer> l = new ArrayList(mapSize); in testBasic()
134 for (int i=0; i<mapSize; i++) { in testBasic()
140 for (int i=mapSize-1; i>=0; i--) { in testBasic()
146 for (int i=mapSize-1; i>=0; i--) { in testBasic()
[all …]
/libcore/ojluni/src/test/java/util/Map/
DCollisions.java51 int mapSize = map.size(); in testIntegerIteration() local
53 BitSet all = new BitSet(mapSize); in testIntegerIteration()
59 all.flip(0, mapSize); in testIntegerIteration()
67 all.flip(0, mapSize); in testIntegerIteration()
82 int mapSize = map.size(); in testStringIteration() local
84 BitSet all = new BitSet(mapSize); in testStringIteration()
88 int index = key.hashCode() + (longKey ? mapSize / 2 : 0); in testStringIteration()
93 all.flip(0, mapSize); in testStringIteration()
98 int index = each.hashCode() + (longKey ? mapSize / 2 : 0); in testStringIteration()
103 all.flip(0, mapSize); in testStringIteration()
[all …]
/libcore/ojluni/src/test/java/util/Collections/
DCheckedMapBash.java56 static final int mapSize = 100; field in CheckedMapBash
63 for (int j=0; j<mapSize; j++) { in testCheckedMap()
71 if (m.size() != mapSize) in testCheckedMap()
108 if (j != mapSize) in testCheckedMap()
115 for (int i=0; i<mapSize; i++) in testCheckedMap2()
118 for (int i=0; i<2*mapSize; i++) in testCheckedMap2()
/libcore/ojluni/src/test/java/util/EnumMap/
DEnumMapBash.java63 int mapSize = universe.length * 7 / 8; in bash() local
72 for (int j = 0; j < mapSize; j++) in bash()
74 T nil = (T)perm[mapSize]; in bash()
76 if (m.size() != mapSize) in bash()
108 if (j != mapSize) in bash()
113 int mapSize = 0; in bash() local
117 mapSize++; in bash()
/libcore/ojluni/src/test/java/util/concurrent/tck/
DTreeMapTest.java814 int mapSize = expensiveTests ? 1000 : 100;
817 bs = new BitSet(mapSize);
819 populate(map, mapSize);
820 check(map, 0, mapSize - 1, true);
821 check(map.descendingMap(), 0, mapSize - 1, false);
823 mutateMap(map, 0, mapSize - 1);
824 check(map, 0, mapSize - 1, true);
825 check(map.descendingMap(), 0, mapSize - 1, false);
827 bashSubMap(map.subMap(0, true, mapSize, false),
828 0, mapSize - 1, true);
DConcurrentSkipListMapTest.java1009 int mapSize = expensiveTests ? 1000 : 100;
1012 bs = new BitSet(mapSize);
1014 populate(map, mapSize);
1015 check(map, 0, mapSize - 1, true);
1016 check(map.descendingMap(), 0, mapSize - 1, false);
1018 mutateMap(map, 0, mapSize - 1);
1019 check(map, 0, mapSize - 1, true);
1020 check(map.descendingMap(), 0, mapSize - 1, false);
1022 bashSubMap(map.subMap(0, true, mapSize, false),
1023 0, mapSize - 1, true);
DConcurrentHashMapTest.java856 final int mapSize = expensiveTests ? 1_000_000 : 100; in testRemoveAll_performance() local
859 for (int i = 0; i < mapSize; i++) in testRemoveAll_performance()
865 assertEquals(mapSize, map.size()); in testRemoveAll_performance()
DConcurrentHashMap8Test.java1127 final int mapSize = 20; in testcomputeIfAbsent_performance() local
1128 final int iterations = expensiveTests ? (1 << 23) : mapSize * 2; in testcomputeIfAbsent_performance()
1131 for (int i = 0; i < mapSize; i++) in testcomputeIfAbsent_performance()
1139 result += map.computeIfAbsent(i % mapSize, k -> k + k); in testcomputeIfAbsent_performance()
/libcore/jsr166-tests/src/test/java/jsr166/
DTreeMapTest.java791 int mapSize = expensiveTests ? 1000 : 100;
794 bs = new BitSet(mapSize);
796 populate(map, mapSize);
797 check(map, 0, mapSize - 1, true);
798 check(map.descendingMap(), 0, mapSize - 1, false);
800 mutateMap(map, 0, mapSize - 1);
801 check(map, 0, mapSize - 1, true);
802 check(map.descendingMap(), 0, mapSize - 1, false);
804 bashSubMap(map.subMap(0, true, mapSize, false),
805 0, mapSize - 1, true);
DConcurrentSkipListMapTest.java986 int mapSize = expensiveTests ? 1000 : 100;
989 bs = new BitSet(mapSize);
991 populate(map, mapSize);
992 check(map, 0, mapSize - 1, true);
993 check(map.descendingMap(), 0, mapSize - 1, false);
995 mutateMap(map, 0, mapSize - 1);
996 check(map, 0, mapSize - 1, true);
997 check(map.descendingMap(), 0, mapSize - 1, false);
999 bashSubMap(map.subMap(0, true, mapSize, false),
1000 0, mapSize - 1, true);
/libcore/ojluni/src/main/java/sun/nio/ch/
DFileChannelImpl.java977 long mapSize = size + pagePosition; in map() local
982 addr = map0(imode, mapPosition, mapSize); in map()
993 addr = map0(imode, mapPosition, mapSize); in map()
1006 unmap0(addr, mapSize); in map()
1013 Unmapper um = new Unmapper(addr, mapSize, isize, mfd); in map()
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DCollectionsTest.java164 int mapSize; field in CollectionsTest.SynchMapChecker
181 mapSize - 1)); in run()
183 .get(Integer.valueOf(mapSize)); in run()
185 2 * mapSize - 1)); in run()
212 mapSize = m.size(); in SynchMapChecker()
213 normalCountingMap = new HashMap(mapSize); in SynchMapChecker()
214 offsetCountingMap = new HashMap(mapSize); in SynchMapChecker()
215 for (int i = 0; i < mapSize; i++) { in SynchMapChecker()
219 for (int i = 0; i < mapSize; i++) { in SynchMapChecker()
220 myInt = Integer.valueOf(i + mapSize); in SynchMapChecker()
/libcore/ojluni/src/main/java/java/util/
DTreeMap.java350 int mapSize = map.size(); in putAll() local
351 if (size==0 && mapSize!=0 && map instanceof SortedMap) { in putAll()
355 buildFromSorted(mapSize, map.entrySet().iterator(), in putAll()