Examples of java.util.LinkedHashMap.keySet()

java.util.LinkedHashMap.keySet()
Answers a Set of the keys contained in this HashMap. The set is backed by this HashMap so changes to one are reflected by the other. The set does not support adding. @return a Set of the keys

          .contains(objArray[i].toString()));


    LinkedHashMap m = new LinkedHashMap();
    m.put(null, "test");
    assertTrue("Failed with null key", m.keySet().contains(null));
    assertNull("Failed with null key", m.keySet().iterator().next());


    Map map = new LinkedHashMap(101);
    map.put(new Integer(1), "1");
    map.put(new Integer(102), "102");
    map.put(new Integer(203), "203");

View Full Code Here


    Map map = new LinkedHashMap(101);
    map.put(new Integer(1), "1");
    map.put(new Integer(102), "102");
    map.put(new Integer(203), "203");
    Iterator it = map.keySet().iterator();
    Integer remove1 = (Integer) it.next();
    it.hasNext();
    it.remove();
    Integer remove2 = (Integer) it.next();
    it.remove();

View Full Code Here

        new Integer(1), new Integer(102), new Integer(203) }));
    list.remove(remove1);
    list.remove(remove2);
    assertTrue("Wrong result", it.next().equals(list.get(0)));
    assertEquals("Wrong size", 1, map.size());
    assertTrue("Wrong contents", map.keySet().iterator().next().equals(
        list.get(0)));


    Map map2 = new LinkedHashMap(101);
    map2.put(new Integer(1), "1");
    map2.put(new Integer(4), "4");

View Full Code Here

        list.get(0)));


    Map map2 = new LinkedHashMap(101);
    map2.put(new Integer(1), "1");
    map2.put(new Integer(4), "4");
    Iterator it2 = map2.keySet().iterator();
    Integer remove3 = (Integer) it2.next();
    Integer next;
    if (remove3.intValue() == 1)
      next = new Integer(4);
    else

View Full Code Here

      next = new Integer(1);
    it2.hasNext();
    it2.remove();
    assertTrue("Wrong result 2", it2.next().equals(next));
    assertEquals("Wrong size 2", 1, map2.size());
    assertTrue("Wrong contents 2", map2.keySet().iterator().next().equals(
        next));
  }


  /**
   * @tests java.util.LinkedHashMap#values()

View Full Code Here

          .get(objArray2[counter]) == hm2.get(objArray2[counter]));


    LinkedHashMap map = new LinkedHashMap();
    map.put("key", "value");
    // get the keySet() and values() on the original Map
    Set keys = map.keySet();
    Collection values = map.values();
    assertEquals("values() does not work", 
        "value", values.iterator().next());
    assertEquals("keySet() does not work", 
        "key", keys.iterator().next());

View Full Code Here

    for (i = 0; i < sz; i++) {
      Integer ii = new Integer(i);
      lhm.put(ii, ii.toString());
    }


    Set s1 = lhm.keySet();
    Iterator it1 = s1.iterator();
    assertTrue("Returned set of incorrect size", lhm.size() == s1.size());
    for (i = 0; it1.hasNext(); i++) {
      Integer jj = (Integer) it1.next();
      assertTrue("Returned incorrect entry set", jj.intValue() == i);

View Full Code Here


    AbstractMap map4 = new IdentityHashMap(1);
    assertSame("IdentityHashMap", map4.keySet(), map4.keySet());


    AbstractMap map5 = new LinkedHashMap(122);
    assertSame("LinkedHashMap", map5.keySet(), map5.keySet());


    AbstractMap map6 = new TreeMap();
    assertSame("TreeMap", map6.keySet(), map6.keySet());


    AbstractMap map7 = new WeakHashMap();

View Full Code Here


    AbstractMap map4 = new IdentityHashMap(1);
    assertSame("IdentityHashMap", map4.keySet(), map4.keySet());


    AbstractMap map5 = new LinkedHashMap(122);
    assertSame("LinkedHashMap", map5.keySet(), map5.keySet());


    AbstractMap map6 = new TreeMap();
    assertSame("TreeMap", map6.keySet(), map6.keySet());


    AbstractMap map7 = new WeakHashMap();

View Full Code Here


    AbstractMap map4 = new IdentityHashMap(1);
    assertSame("IdentityHashMap", map4.keySet(), map4.keySet());


    AbstractMap map5 = new LinkedHashMap(122);
    assertSame("LinkedHashMap", map5.keySet(), map5.keySet());


    AbstractMap map6 = new TreeMap();
    assertSame("TreeMap", map6.keySet(), map6.keySet());


    AbstractMap map7 = new WeakHashMap();

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.