Examples of java.util.SortedMap.keySet()

java.util.SortedMap.keySet()
Returns a {@link Set} view of the keys contained in this map.The set's iterator returns the keys in ascending order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations. @return a set view of the keys contained in this map, sorted inascending order

    setFontFamilies(fontFamilies);


    SortedMap map = Charset.availableCharsets();
    String[] charSets = new String[map.size()];
    int i = 0;
    for (Iterator iter = map.keySet().iterator(); iter.hasNext(); i++) {
      charSets[i] = (String)iter.next();
    }
    setCharSets(charSets);


    setDefaultFontSizes(DEFAULT_FONT_SIZES);

View Full Code Here

    int keys = 0;


    // 2. Calculate and Assign Canonical Huffman Codes -------------
    int codeLength = 0, codeValue = -1; // first Canonical is always 0
    codes = new TreeMap<Byte, HuffmanBitCode>();
    Set keySet = codebook.keySet();
    for (Object key : keySet) { // Iterate over code lengths
      int iKey = Integer.parseInt(key.toString());
      codeLentghSorted[keys++] = iKey;


      TreeSet<Byte> get = (TreeSet<Byte>) codebook.get(key);

View Full Code Here

    int keys = 0;


    // 2. Calculate and Assign Canonical Huffman Codes -------------
    int codeLength = 0, codeValue = -1; // first Canonical is always 0
    codes = new TreeMap<Integer, HuffmanBitCode>();
    Set keySet = codebook.keySet();
    for (Object key : keySet) { // Iterate over code lengths
      int iKey = Integer.parseInt(key.toString());
      codeLentghSorted[keys++] = iKey;


      TreeSet<Integer> get = (TreeSet<Integer>) codebook.get(key);

View Full Code Here

        assertFalse(subMap_startIncluded_endIncluded.keySet().isEmpty());


        String startKey = new Integer(0).toString();
        String endKey = startKey;
        SortedMap subMap = tm.subMap(startKey, endKey);
        assertTrue(subMap.keySet().isEmpty());


        startKey = new Integer(999).toString();
        endKey = startKey;
        subMap = tm.subMap(startKey, endKey);
        assertTrue(subMap.keySet().isEmpty());

View Full Code Here

        assertTrue(subMap.keySet().isEmpty());


        startKey = new Integer(999).toString();
        endKey = startKey;
        subMap = tm.subMap(startKey, endKey);
        assertTrue(subMap.keySet().isEmpty());


        startKey = new Integer(-1).toString();
        endKey = new Integer(1).toString();
        subMap = tm.subMap(startKey, endKey);
        assertFalse(subMap.keySet().isEmpty());

View Full Code Here

        assertTrue(subMap.keySet().isEmpty());


        startKey = new Integer(-1).toString();
        endKey = new Integer(1).toString();
        subMap = tm.subMap(startKey, endKey);
        assertFalse(subMap.keySet().isEmpty());


        endKey = new Integer(0).toString();
        subMap = tm.subMap(startKey, endKey);
        assertTrue(subMap.keySet().isEmpty());
    }

View Full Code Here

        subMap = tm.subMap(startKey, endKey);
        assertFalse(subMap.keySet().isEmpty());


        endKey = new Integer(0).toString();
        subMap = tm.subMap(startKey, endKey);
        assertTrue(subMap.keySet().isEmpty());
    }


    public void test_SubMapKeySet_contains() {
        Set keySet = subMap_default.keySet();
        try {

View Full Code Here

        assertEquals(10, subMap_startIncluded_endIncluded.keySet().size());


        String startKey = new Integer(0).toString();
        String endKey = new Integer(2).toString();
        SortedMap subMap = tm.subMap(startKey, endKey);
        assertEquals(112, subMap.keySet().size());


        startKey = new Integer(0).toString();
        endKey = startKey;
        subMap = tm.subMap(startKey, endKey);
        assertEquals(0, subMap.keySet().size());

View Full Code Here

        assertEquals(112, subMap.keySet().size());


        startKey = new Integer(0).toString();
        endKey = startKey;
        subMap = tm.subMap(startKey, endKey);
        assertEquals(0, subMap.keySet().size());


        startKey = new Integer(-1).toString();
        endKey = startKey;
        subMap = tm.subMap(startKey, endKey);
        assertEquals(0, subMap.keySet().size());

View Full Code Here

        assertEquals(0, subMap.keySet().size());


        startKey = new Integer(-1).toString();
        endKey = startKey;
        subMap = tm.subMap(startKey, endKey);
        assertEquals(0, subMap.keySet().size());


        endKey = new Integer(1).toString();
        subMap = tm.subMap(startKey, endKey);
        assertEquals(1, subMap.keySet().size());

View Full Code Here

0 1 2 3 4 5 6 7

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.