Examples of java.util.IdentityHashMap

java.util.IdentityHashMap
This class implements the Map interface with a hash table, using reference-equality in place of object-equality when comparing keys (and values). In other words, in an IdentityHashMap, two keys k1 and k2 are considered equal if and only if (k1==k2). (In normal Map implementations (like HashMap) two keys k1 and k2 are considered equal if and only if (k1==null ? k2==null : k1.equals(k2)).)
This class is not a general-purpose Map implementation! While this class implements the Map interface, it intentionally violates Map's general contract, which mandates the use of the equals method when comparing objects. This class is designed for use only in the rare cases wherein reference-equality semantics are required.
A typical use of this class is topology-preserving object graph transformations, such as serialization or deep-copying. To perform such a transformation, a program must maintain a "node table" that keeps track of all the object references that have already been processed. The node table must not equate distinct objects even if they happen to be equal. Another typical use of this class is to maintain proxy objects. For example, a debugging facility might wish to maintain a proxy object for each object in the program being debugged.
This class provides all of the optional map operations, and permits null values and the null key. This class makes no guarantees as to the order of the map; in particular, it does not guarantee that the order will remain constant over time.
This class provides constant-time performance for the basic operations (get and put), assuming the system identity hash function ( {@link System#identityHashCode(Object)}) disperses elements properly among the buckets.
This class has one tuning parameter (which affects performance but not semantics): expected maximum size. This parameter is the maximum number of key-value mappings that the map is expected to hold. Internally, this parameter is used to determine the number of buckets initially comprising the hash table. The precise relationship between the expected maximum size and the number of buckets is unspecified.
If the size of the map (the number of key-value mappings) sufficiently exceeds the expected maximum size, the number of buckets is increased Increasing the number of buckets ("rehashing") may be fairly expensive, so it pays to create identity hash maps with a sufficiently large expected maximum size. On the other hand, iteration over collection views requires time proportional to the number of buckets in the hash table, so it pays not to set the expected maximum size too high if you are especially concerned with iteration performance or memory usage.
Note that this implementation is not synchronized. If multiple threads access an identity hash map concurrently, and at least one of the threads modifies the map structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more mappings; merely changing the value associated with a key that an instance already contains is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the map. If no such object exists, the map should be "wrapped" using the {@link Collections#synchronizedMap Collections.synchronizedMap}method. This is best done at creation time, to prevent accidental unsynchronized access to the map:
```
 Map m = Collections.synchronizedMap(new IdentityHashMap(...));
```
The iterators returned by the iterator method of the collections returned by all of this class's "collection view methods" are fail-fast: if the map is structurally modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will throw a {@link ConcurrentModificationException}. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: fail-fast iterators should be used only to detect bugs.
Implementation note: This is a simple linear-probe hash table, as described for example in texts by Sedgewick and Knuth. The array alternates holding keys and values. (This has better locality for large tables than does using separate arrays.) For many JRE implementations and operation mixes, this class will yield better performance than {@link HashMap} (which uses chaining rather than linear-probing).
This class is a member of the Java Collections Framework. @see System#identityHashCode(Object) @see Object#hashCode() @see Collection @see Map @see HashMap @see TreeMap @author Doug Lea and Josh Bloch @since 1.4


            Do not call this method on the static instances.
        */
        public Map getData ()
        {
            IdentityHashMap data = new IdentityHashMap(3);
            if (_statsByType != null) {
                data.put(ColumnEventDetail, _statsByType);
            }
            return data;
        }

View Full Code Here

  protected void implementInterfacesOnObject(Object delegate) {
    this.publishedInterfaces.addAll(ClassUtils.getAllInterfacesAsSet(delegate));
  }


  private Map createRememberedMethodMap() {
    return new IdentityHashMap(32);
  }

View Full Code Here


    private static Object recursionCheck = new Object();


    public CopyState(TypeRepository rep) {
        this.rep = rep;
        this.copied = new IdentityHashMap();
        this.recursionResolverMap = new IdentityHashMap();
    }

View Full Code Here

     */
    final void setMapForField(final Class<?> classe, final String name) {
        try {
            final Field field = classe.getDeclaredField(name);
            field.setAccessible(true);
            field.set(this, new IdentityHashMap());
        } catch (Exception e) { // (ReflectiveOperationException) on JDK7 branch.
            throw new AssertionError(e); // Should never happen (tested by MetadataStandardTest).
        }
    }

View Full Code Here


    /** listener notified of validation constraint violations. */
    private T listener;


    public BeanValidationContext(T listener) {
        this(listener, new IdentityHashMap());
    }

View Full Code Here

        }
        return super.retainAll(c);
    }


    public synchronized boolean containsAll(Collection<?> c) {
        IdentityHashMap map = new IdentityHashMap();
        for (Object e : this) {
            map.put(e, Boolean.TRUE);
        }
        return map.keySet().containsAll(c);
    }

View Full Code Here

            return false;
        }
        
        Object hthr = _threadHash.get(Thread.currentThread());
        if (hthr == null) {
            _threadHash.put(Thread.currentThread(), hthr = new IdentityHashMap());
            ((IdentityHashMap) hthr).put(beingHashed, beingHashed); 
            return false; // first call. no cycle detected
        }
        Object objhandle = ((IdentityHashMap) hthr).get(beingHashed);
        if (objhandle == null) {

View Full Code Here

         * 1. SCXML elemnt (top) should reach count exactly 1. We essentially
         * summarize up the hierarchy tree starting with a given set of
         * states = active configuration.
         */
        boolean legalConfig = true; // let's be optimists
        Map counts = new IdentityHashMap();
        Set scxmlCount = new HashSet();
        for (Iterator i = states.iterator(); i.hasNext();) {
            TransitionTarget tt = (TransitionTarget) i.next();
            TransitionTarget parent = null;
            while ((parent = tt.getParent()) != null) {
                HashSet cnt = (HashSet) counts.get(parent);
                if (cnt == null) {
                    cnt = new HashSet();
                    counts.put(parent, cnt);
                }
                cnt.add(tt);
                tt = parent;
            }
            //top-level contribution
            scxmlCount.add(tt);
        }
        //Validate counts:
        for (Iterator i = counts.entrySet().iterator(); i.hasNext();) {
            Map.Entry entry = (Map.Entry) i.next();
            TransitionTarget tt = (TransitionTarget) entry.getKey();
            Set count = (Set) entry.getValue();
            if (tt instanceof Parallel) {
                Parallel p = (Parallel) tt;
                if (count.size() < p.getStates().size()) {
                    errRep.onError(ErrorConstants.ILLEGAL_CONFIG,
                        "Not all AND states active for parallel "
                        + p.getId(), entry);
                    legalConfig = false;
                }
            } else {
                if (count.size() > 1) {
                    errRep.onError(ErrorConstants.ILLEGAL_CONFIG,
                        "Multiple OR states active for state "
                        + tt.getId(), entry);
                    legalConfig = false;
                }
            }
            count.clear(); //cleanup
        }
        if (scxmlCount.size() > 1) {
            errRep.onError(ErrorConstants.ILLEGAL_CONFIG,
                    "Multiple top-level OR states active!", scxmlCount);
        }
        //cleanup
        scxmlCount.clear();
        counts.clear();
        return legalConfig;
    }

View Full Code Here

        while (bestFragments.size() > 0) {
            FragmentInfo fi = (FragmentInfo) bestFragments.pop();
            infos.add(0, fi);
        }


        Map offsetInfos = new IdentityHashMap();
        // remove overlapping fragment infos
        Iterator it = infos.iterator();
        while (it.hasNext()) {
            FragmentInfo fi = (FragmentInfo) it.next();
            boolean overlap = false;
            Iterator fit = fi.iterator();
            while (fit.hasNext() && !overlap) {
                TermVectorOffsetInfo oi = (TermVectorOffsetInfo) fit.next();
                if (offsetInfos.containsKey(oi)) {
                    overlap = true;
                }
            }
            if (overlap) {
                it.remove();
            } else {
                Iterator oit = fi.iterator();
                while (oit.hasNext()) {
                    offsetInfos.put(oit.next(), null);
                }
            }
        }


        // create excerpts

View Full Code Here

   * @return the new Map instance
   * @deprecated as of Spring 2.5, for usage on JDK 1.4 or higher
   */
  @Deprecated
  public static Map createIdentityMapIfPossible(int initialCapacity) {
    return new IdentityHashMap(initialCapacity);
  }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.IdentityHashMap

ariba.ui.aribaweb.util.AWJarWalker

com.alibaba.citrus.hessian.io.HessianOutput

com.alibaba.dubbo.common.utils.PojoUtils

com.alibaba.fastjson.parser.deserializer.DefaultObjectDeserializer

com.alibaba.fastjson.parser.deserializer.MapDeserializer

com.alibaba.json.bvt.parser.deser.ConcurrentHashMapDeserializerTest

com.alibaba.otter.shared.common.utils.sizeof.ObjectProfiler

com.bubble.serializer.SerializationContext

com.caucho.burlap.io.BurlapOutput

com.caucho.hessian.io.HessianOutput

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.