List of subMap() Examples

Examples of subMap()

edu.stanford.ppl.concurrent.SnapTreeMap.subMap()
java.util.NavigableMap.subMap()
Returns a view of the portion of this map whose keys range from {@code fromKey} to {@code toKey}. If {@code fromKey} and{@code toKey} are equal, the returned map is empty unless{@code fromExclusive} and {@code toExclusive} are both true. Thereturned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.
The returned map will throw an {@code IllegalArgumentException}on an attempt to insert a key outside of its range, or to construct a submap either of whose endpoints lie outside its range. @param fromKey low endpoint of the keys in the returned map @param fromInclusive {@code true} if the low endpointis to be included in the returned view @param toKey high endpoint of the keys in the returned map @param toInclusive {@code true} if the high endpointis to be included in the returned view @return a view of the portion of this map whose keys range from{@code fromKey} to {@code toKey} @throws ClassCastException if {@code fromKey} and {@code toKey}cannot be compared to one another using this map's comparator (or, if the map has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if {@code fromKey} or {@code toKey}cannot be compared to keys currently in the map. @throws NullPointerException if {@code fromKey} or {@code toKey}is null and this map does not permit null keys @throws IllegalArgumentException if {@code fromKey} is greater than{@code toKey}; or if this map itself has a restricted range, and {@code fromKey} or {@code toKey} liesoutside the bounds of the range
java.util.SortedMap.subMap()
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive. (If fromKey and toKey are equal, the returned map is empty.) The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.
The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range. @param fromKey low endpoint (inclusive) of the keys in the returned map @param toKey high endpoint (exclusive) of the keys in the returned map @return a view of the portion of this map whose keys range fromfromKey, inclusive, to toKey, exclusive @throws ClassCastException if fromKey and toKeycannot be compared to one another using this map's comparator (or, if the map has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if fromKey or toKey cannot be compared to keys currently in the map. @throws NullPointerException if fromKey or toKeyis null and this map does not permit null keys @throws IllegalArgumentException if fromKey is greater thantoKey; or if this map itself has a restricted range, and fromKey or toKey lies outside the bounds of the range
java.util.TreeMap.subMap()
@throws ClassCastException {@inheritDoc} @throws NullPointerException if fromKey or toKey isnull and this map uses natural ordering, or its comparator does not permit null keys @throws IllegalArgumentException {@inheritDoc} @since 1.6
java.util.concurrent.ConcurrentNavigableMap.subMap()
@throws ClassCastException {@inheritDoc} @throws NullPointerException {@inheritDoc} @throws IllegalArgumentException {@inheritDoc}
org.apache.commons.collections.SortedBidiMap.subMap()
org.apache.commons.collections15.SortedBidiMap.subMap()
Return a view of the portion of this map whose keys are in the range fromKey (inclusive) to toKey (exclusive). @param fromKey Lower limit of keys for the returned map @param toKey Upper limit of keys for the returned map @return a sub map

Examples of java.util.TreeMap.subMap()

        SortedMap<String, String> sub = map.subMap("1", "3"); //$NON-NLS-1$ //$NON-NLS-2$
        assertEquals("2", sub.lastKey()); //$NON-NLS-1$
        
        TreeMap t = new TreeMap();
        try {
      SortedMap th = t.subMap(null,new Object());
      fail("Should throw a NullPointerException");
        } catch( NullPointerException npe) {
          // expected
        }
    }

View Full Code Here

Examples of java.util.TreeMap.subMap()

        TreeMap myTreeMap = new TreeMap();
        for (int i = 0; i < 1000; i++) {
            myTreeMap.put(i, objArray[i]);
        }
        // Test for method values() in subMaps
        Collection vals = myTreeMap.subMap(200, 400).values();
        assertTrue("Returned collection of incorrect size", vals.size() == 200);
        for (int i = 200; i < 400; i++) {
            assertTrue("Collection contains incorrect elements" + i, vals
                    .contains(objArray[i]));
        }

View Full Code Here

Examples of java.util.TreeMap.subMap()

        master.put("null", null);
        Object[] entry = master.entrySet().toArray();
        assertFalse("Empty map should not contain the null-valued entry",
                    test_map.entrySet().contains(entry[0]));


        Map<String, String> submap = test_map.subMap("a","z");
        entry = master.entrySet().toArray();
        assertFalse("Empty submap should not contain the null-valued entry",
                    submap.entrySet().contains(entry[0]));


        test_map.put("null", null);

View Full Code Here

Examples of java.util.concurrent.ConcurrentNavigableMap.subMap()

    /**
     * subMap returns map with keys in requested range
     */
    public void testSubMapContents() {
        ConcurrentNavigableMap map = map5();
        SortedMap sm = map.subMap(two, four);
        assertEquals(two, sm.firstKey());
        assertEquals(three, sm.lastKey());
        assertEquals(2, sm.size());
        assertFalse(sm.containsKey(one));
        assertTrue(sm.containsKey(two));

View Full Code Here

Examples of java.util.concurrent.ConcurrentNavigableMap.subMap()

        assertEquals(3, map.size());
    }


    public void testSubMapContents2() {
        ConcurrentNavigableMap map = map5();
        SortedMap sm = map.subMap(two, three);
        assertEquals(1, sm.size());
        assertEquals(two, sm.firstKey());
        assertEquals(two, sm.lastKey());
        assertFalse(sm.containsKey(one));
        assertTrue(sm.containsKey(two));

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.subMap()

        Object firstValue = sm.get(first);
        Object fromKeyValue = sm.get(fromKey);
        Object secondValue = sm.get(second);
        Object thirdValue = sm.get(third);
        
        SortedMap sub = sm.subMap(fromKey, toKey);
        assertEquals(2, sub.size());
        assertEquals(true, sm.containsKey(first));
        assertEquals(false, sub.containsKey(first));
        assertEquals(true, sm.containsValue(firstValue));
        assertEquals(false, sub.containsValue(firstValue));

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.subMap()

        Object fromKeyValue = sm.get(fromKey);
        Object firstValue = sm.get(first);
        Object secondValue = sm.get(second);
        Object toKeyValue = sm.get(toKey);
        
        SortedMap sub = sm.subMap(fromKey, toKey);
        int size = sm.size();
        assertEquals(3, sub.size());
        sub.clear();
        assertEquals(0, sub.size());
        assertEquals(size - 3, sm.size());

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.subMap()

        Object first = it.next();
        Object second = it.next();
        Object toKey = it.next();
        
        int size = sm.size();
        SortedMap sub = sm.subMap(fromKey, toKey);
        assertEquals(true, sm.containsKey(first));
        assertEquals(true, sub.containsKey(first));
        assertEquals(true, sm.containsKey(second));
        assertEquals(true, sub.containsKey(second));

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.subMap()

        Object first = it.next();
        Object second = it.next();
        Object toKey = it.next();
        
        int size = sm.size();
        SortedMap sub = sm.subMap(fromKey, toKey);
        Set set = sub.entrySet();
        assertEquals(3, set.size());
        Iterator it2 = set.iterator();
        Object fromEntry = it2.next();
        Map.Entry firstEntry = cloneMapEntry((Map.Entry) it2.next());

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.subMap()

        Object firstValue = sm.get(first);
        Object fromKeyValue = sm.get(fromKey);
        Object secondValue = sm.get(second);
        Object thirdValue = sm.get(third);
        
        SortedMap sub = sm.subMap(fromKey, toKey);
        assertEquals(2, sub.size());
        assertEquals(true, sm.containsKey(first));
        assertEquals(false, sub.containsKey(first));
        assertEquals(true, sm.containsValue(firstValue));
        assertEquals(false, sub.containsValue(firstValue));

View Full Code Here

0 1 2 3 4 5

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.