Home
last modified time | relevance | path

Searched refs:six (Results 1 – 12 of 12) sorted by relevance

/libcore/jsr166-tests/src/test/java/jsr166/
DConcurrentSkipListMapTest.java349 map.putIfAbsent(six, "Z");
350 assertTrue(map.containsKey(six));
366 assertNull(map.replace(six, "Z"));
367 assertFalse(map.containsKey(six));
432 Map.Entry e2 = map.lowerEntry(six);
456 Map.Entry e4 = map.higherEntry(six);
468 Map.Entry e2 = map.floorEntry(six);
492 Map.Entry e4 = map.ceilingEntry(six);
536 Object e2 = q.lowerKey(six);
560 Object e4 = q.higherKey(six);
[all …]
DConcurrentSkipListSubMapTest.java264 map.putIfAbsent(six, "Z");
265 assertTrue(map.containsKey(six));
281 assertNull(map.replace(six, "Z"));
282 assertFalse(map.containsKey(six));
347 Map.Entry e2 = map.lowerEntry(six);
371 Map.Entry e4 = map.higherEntry(six);
383 Map.Entry e2 = map.floorEntry(six);
407 Map.Entry e4 = map.ceilingEntry(six);
938 map.putIfAbsent(six, "Z");
939 assertTrue(map.containsKey(six));
[all …]
DTreeMapTest.java345 Map.Entry e2 = map.lowerEntry(six);
369 Map.Entry e4 = map.higherEntry(six);
381 Map.Entry e2 = map.floorEntry(six);
405 Map.Entry e4 = map.ceilingEntry(six);
417 Object e2 = q.lowerKey(six);
441 Object e4 = q.higherKey(six);
453 Object e2 = q.floorKey(six);
477 Object e4 = q.ceilingKey(six);
DConcurrentHashMapTest.java349 map.putIfAbsent(six, "Z"); in testPutIfAbsent()
350 assertTrue(map.containsKey(six)); in testPutIfAbsent()
366 assertNull(map.replace(six, "Z")); in testReplace()
367 assertFalse(map.containsKey(six)); in testReplace()
DConcurrentSkipListSubSetTest.java149 assertTrue(q.add(six)); in testAdd()
157 assertTrue(q.add(six)); in testAddDup()
158 assertFalse(q.add(six)); in testAddDup()
342 Object e2 = q.lower(six); in testLower()
366 Object e4 = q.higher(six); in testHigher()
378 Object e2 = q.floor(six); in testFloor()
402 Object e4 = q.ceiling(six); in testCeiling()
DTreeSubSetTest.java141 assertTrue(q.add(six)); in testAdd()
149 assertTrue(q.add(six)); in testAddDup()
150 assertFalse(q.add(six)); in testAddDup()
334 Object e2 = q.lower(six); in testLower()
358 Object e4 = q.higher(six); in testHigher()
370 Object e2 = q.floor(six); in testFloor()
394 Object e4 = q.ceiling(six); in testCeiling()
DTreeSetTest.java384 Object e2 = q.lower(six); in testLower()
408 Object e4 = q.higher(six); in testHigher()
420 Object e2 = q.floor(six); in testFloor()
444 Object e4 = q.ceiling(six); in testCeiling()
DConcurrentSkipListSetTest.java380 Object e2 = q.lower(six); in testLower()
404 Object e4 = q.higher(six); in testHigher()
416 Object e2 = q.floor(six); in testFloor()
440 Object e4 = q.ceiling(six); in testCeiling()
DCopyOnWriteArrayListTest.java195 v.add(six); in testContainsAll()
300 assertEquals(-1, full.lastIndexOf(six)); in testLastIndexOf1()
DTreeSubMapTest.java233 Map.Entry e2 = map.lowerEntry(six);
257 Map.Entry e4 = map.higherEntry(six);
269 Map.Entry e2 = map.floorEntry(six);
293 Map.Entry e4 = map.ceilingEntry(six);
DCopyOnWriteArraySetTest.java154 v.add(six); in testContainsAll()
DJSR166TestCase.java490 public static final Integer six = new Integer(6); field in JSR166TestCase