Package edu.stanford.ppl.concurrent

Examples of edu.stanford.ppl.concurrent.SnapTreeMap.containsKey()

73
74
75
76
77
78
79
80
81
82
83
    /**
     *  containsKey returns true for contained key
     */
    public void testContainsKey() {
        SnapTreeMap map = map5();
        assertTrue(map.containsKey(one));
        assertFalse(map.containsKey(zero));
    }

    /**
     *  containsValue returns true for held values
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
     *  containsKey returns true for contained key
     */
    public void testContainsKey() {
        SnapTreeMap map = map5();
        assertTrue(map.containsKey(one));
        assertFalse(map.containsKey(zero));
    }

    /**
     *  containsValue returns true for held values
     */
 
View Full Code Here
317
318
319
320
321
322
323
324
325
326
327
        SnapTreeMap map = map5();
        Set s = map.entrySet();
        Object[] ar = s.toArray();
        assertEquals(5, ar.length);
        for (int i = 0; i < 5; ++i) {
            assertTrue(map.containsKey(((Map.Entry)(ar[i])).getKey()));
            assertTrue(map.containsValue(((Map.Entry)(ar[i])).getValue()));
        }
    }

    /**
 
View Full Code Here
331
332
333
334
335
336
337
338
339
340
341
        SnapTreeMap map = map5();
        Set s = map.descendingMap().entrySet();
        Object[] ar = s.toArray();
        assertEquals(5, ar.length);
        for (int i = 0; i < 5; ++i) {
            assertTrue(map.containsKey(((Map.Entry)(ar[i])).getKey()));
            assertTrue(map.containsValue(((Map.Entry)(ar[i])).getValue()));
        }
    }

    /**
 
View Full Code Here
357
358
359
360
361
362
363
364
365
366
367
     *   putIfAbsent works when the given key is not present
     */
    public void testPutIfAbsent() {
        SnapTreeMap map = map5();
        map.putIfAbsent(six, "Z");
        assertTrue(map.containsKey(six));
    }

    /**
     *   putIfAbsent does not add the pair if the key is already present
     */
 
View Full Code Here
374
375
376
377
378
379
380
381
382
383
384
     *   replace fails when the given key is not present
     */
    public void testReplace() {
        SnapTreeMap map = map5();
        assertNull(map.replace(six, "Z"));
        assertFalse(map.containsKey(six));
    }

    /**
     *   replace succeeds if the key is already present
     */
 
View Full Code Here
415
416
417
418
419
420
421
422
423
424
425
     */
    public void testRemove() {
        SnapTreeMap map = map5();
        map.remove(five);
        assertEquals(4, map.size());
        assertFalse(map.containsKey(five));
    }

    /**
     * remove(key,value) removes only if pair present
     */
 
View Full Code Here
423
424
425
426
427
428
429
430
431
432
433
    /**
     * remove(key,value) removes only if pair present
     */
    public void testRemove2() {
        SnapTreeMap map = map5();
        assertTrue(map.containsKey(five));
        assertEquals("E", map.get(five));
        map.remove(five, "E");
        assertEquals(4, map.size());
        assertFalse(map.containsKey(five));
        map.remove(four, "A");
View Full Code Here
427
428
429
430
431
432
433
434
435
436
437
        SnapTreeMap map = map5();
        assertTrue(map.containsKey(five));
        assertEquals("E", map.get(five));
        map.remove(five, "E");
        assertEquals(4, map.size());
        assertFalse(map.containsKey(five));
        map.remove(four, "A");
        assertEquals(4, map.size());
        assertTrue(map.containsKey(four));
    }
View Full Code Here
430
431
432
433
434
435
436
437
438
439
440
        map.remove(five, "E");
        assertEquals(4, map.size());
        assertFalse(map.containsKey(five));
        map.remove(four, "A");
        assertEquals(4, map.size());
        assertTrue(map.containsKey(four));
    }

    /**
     * lowerEntry returns preceding entry.
     */
 
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.