Examples of java.util.IdentityHashMap.containsKey()

java.util.IdentityHashMap.containsKey()
Tests whether the specified object reference is a key in this identity hash map. @param key possible key @return true if the specified object reference is a keyin this map @see #containsValue(Object)

        .containsKey(new Integer(23).toString()));
    assertTrue("Returned true for invalid key", !hm.containsKey("KKDKDKD"));


    IdentityHashMap m = new IdentityHashMap();
    m.put(null, "test");
    assertTrue("Failed with null key", m.containsKey(null));
    assertTrue("Failed with missing key matching null hash", !m
        .containsKey(new Integer(0)));
  }


  /**

View Full Code Here

    assertTrue("Returned true for invalid key", !hm.containsKey("KKDKDKD"));


    IdentityHashMap m = new IdentityHashMap();
    m.put(null, "test");
    assertTrue("Failed with null key", m.containsKey(null));
    assertTrue("Failed with missing key matching null hash", !m
        .containsKey(new Integer(0)));
  }


  /**
   * @tests java.util.IdentityHashMap#containsValue(java.lang.Object)

View Full Code Here

                            if (oldIndex < index) {
                                ++offset;    
                            } else {
                                for (int i = oldIndex - 1; i >= index; i--) {
                                    Object oldObject = oldListIndexValue.get(new Integer(i));
                                    if (newListValueIndex.containsKey(oldObject)) {
                                        ++movedObjects;
                                    } else {
                                        ++deletedObjects;
                                    }
                                }

View Full Code Here

                                } else {
                                    // Assume we moved down unless the object that was
                                    // here before is directly beside us.
                                    Object oldObject = oldListIndexValue.get(new Integer(index));
                                
                                    if (newListValueIndex.containsKey(oldObject)) {
                                        if ((((Integer) newListValueIndex.get(oldObject)).intValue() - index) > 1) {
                                            moved = false; // Assume the old object moved up.
                                            --offset; 
                                        }
                                    }

View Full Code Here

                            if (oldIndex < index) {
                                ++offset;    
                            } else {
                                for (int i = oldIndex - 1; i >= index; i--) {
                                    Object oldObject = oldListIndexValue.get(Integer.valueOf(i));
                                    if (newListValueIndex.containsKey(oldObject)) {
                                        ++movedObjects;
                                    } else {
                                        ++deletedObjects;
                                    }
                                }

View Full Code Here

                                } else {
                                    // Assume we moved down unless the object that was
                                    // here before is directly beside us.
                                    Object oldObject = oldListIndexValue.get(Integer.valueOf(index));
                                
                                    if (newListValueIndex.containsKey(oldObject)) {
                                        if ((((Integer) newListValueIndex.get(oldObject)).intValue() - index) > 1) {
                                            moved = false; // Assume the old object moved up.
                                            --offset; 
                                        }
                                    }

View Full Code Here

                            if (oldIndex < index) {
                                ++offset;    
                            } else {
                                for (int i = oldIndex - 1; i >= index; i--) {
                                    Object oldObject = oldListIndexValue.get(new Integer(i));
                                    if (newListValueIndex.containsKey(oldObject)) {
                                        ++movedObjects;
                                    } else {
                                        ++deletedObjects;
                                    }
                                }

View Full Code Here

                                } else {
                                    // Assume we moved down unless the object that was
                                    // here before is directly beside us.
                                    Object oldObject = oldListIndexValue.get(new Integer(index));
                                
                                    if (newListValueIndex.containsKey(oldObject)) {
                                        if ((((Integer) newListValueIndex.get(oldObject)).intValue() - index) > 1) {
                                            moved = false; // Assume the old object moved up.
                                            --offset; 
                                        }
                                    }

View Full Code Here


  if (next instanceof ForwardingMBeanServerInterceptor) {
      IdentityHashMap seen = new IdentityHashMap();
      MBeanServerInterceptor mbsi = next;
      while (mbsi instanceof ForwardingMBeanServerInterceptor) {
    if (seen.containsKey(mbsi))
        throw new InterceptorCycleException("Would make cycle");
    seen.put(mbsi, mbsi);
    ForwardingMBeanServerInterceptor f =
         (ForwardingMBeanServerInterceptor) mbsi;
    mbsi = f.getNextInterceptor();

View Full Code Here

       one could arise in unusual circumstances, for instance
       after deleting an interceptor in the chain that was
       not a ForwardingMBeanServerInterceptor.  The spec
       doesn't say we have to check this, but not doing so
       puts us in an infinite loop, which is not very helpful.  */
    if (seen.containsKey(inter))
        throw new InterceptorCycleException("Existing cycle!");
    seen.put(inter, inter);
    finter = (ForwardingMBeanServerInterceptor) inter;
      }

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.