List of pollFirstEntry() Examples

Examples of pollFirstEntry()

edu.stanford.ppl.concurrent.SnapTreeMap.pollFirstEntry()
java.util.NavigableMap.pollFirstEntry()
Removes and returns a key-value mapping associated with the least key in this map, or {@code null} if the map is empty. @return the removed first entry of this map,or {@code null} if this map is empty
java.util.TreeMap.pollFirstEntry()
@since 1.6
java.util.concurrent.ConcurrentNavigableMap.pollFirstEntry()

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

    /**
     * pollFirstEntry returns entries in order
     */
    public void testPollFirstEntry() {
        SnapTreeMap map = map5();
        Map.Entry e = map.pollFirstEntry();
        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());
        e = map.pollFirstEntry();
        assertEquals(two, e.getKey());
        map.put(one, "A");

View Full Code Here

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

    public void testPollFirstEntry() {
        SnapTreeMap map = map5();
        Map.Entry e = map.pollFirstEntry();
        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());
        e = map.pollFirstEntry();
        assertEquals(two, e.getKey());
        map.put(one, "A");
        e = map.pollFirstEntry();
        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());

View Full Code Here

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

        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());
        e = map.pollFirstEntry();
        assertEquals(two, e.getKey());
        map.put(one, "A");
        e = map.pollFirstEntry();
        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());
        e = map.pollFirstEntry();
        assertEquals(three, e.getKey());
        map.remove(four);

View Full Code Here

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

        assertEquals(two, e.getKey());
        map.put(one, "A");
        e = map.pollFirstEntry();
        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());
        e = map.pollFirstEntry();
        assertEquals(three, e.getKey());
        map.remove(four);
        e = map.pollFirstEntry();
        assertEquals(five, e.getKey());
        try {

View Full Code Here

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

        assertEquals(one, e.getKey());
        assertEquals("A", e.getValue());
        e = map.pollFirstEntry();
        assertEquals(three, e.getKey());
        map.remove(four);
        e = map.pollFirstEntry();
        assertEquals(five, e.getKey());
        try {
            e.setValue("A");
            shouldThrow();
        } catch (UnsupportedOperationException success) {}

View Full Code Here

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

        assertEquals(five, e.getKey());
        try {
            e.setValue("A");
            shouldThrow();
        } catch (UnsupportedOperationException success) {}
        e = map.pollFirstEntry();
        assertNull(e);
    }


    /**
     * pollLastEntry returns entries in order

View Full Code Here

Examples of java.util.NavigableMap.pollFirstEntry()

        assertNull(entry);
    }


    public void test_DescendingSubMap_pollFirstEntry() {
        NavigableMap decendingMap = tm.descendingMap();
        assertEquals(999, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startExcluded_endExcluded.descendingMap();
        assertEquals(108, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startExcluded_endIncluded.descendingMap();

View Full Code Here

Examples of java.util.NavigableMap.pollFirstEntry()

    public void test_DescendingSubMap_pollFirstEntry() {
        NavigableMap decendingMap = tm.descendingMap();
        assertEquals(999, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startExcluded_endExcluded.descendingMap();
        assertEquals(108, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startExcluded_endIncluded.descendingMap();
        assertEquals(109, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startIncluded_endExcluded.descendingMap();

View Full Code Here

Examples of java.util.NavigableMap.pollFirstEntry()


        decendingMap = navigableMap_startExcluded_endExcluded.descendingMap();
        assertEquals(108, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startExcluded_endIncluded.descendingMap();
        assertEquals(109, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startIncluded_endExcluded.descendingMap();
        assertEquals(107, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startIncluded_endIncluded.descendingMap();

View Full Code Here

Examples of java.util.NavigableMap.pollFirstEntry()


        decendingMap = navigableMap_startExcluded_endIncluded.descendingMap();
        assertEquals(109, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startIncluded_endExcluded.descendingMap();
        assertEquals(107, decendingMap.pollFirstEntry().getValue());


        decendingMap = navigableMap_startIncluded_endIncluded.descendingMap();
        assertEquals(106, decendingMap.pollFirstEntry().getValue());
    }

View Full Code Here

0 1 2 3 4

TOP

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.