Examples of org.hibernate.search.util.WeakIdentityHashMap

org.hibernate.search.util.WeakIdentityHashMap

A hashtable-based Map implementation with weak keys and using reference-equality in place of object-equality when comparing keys (and values). In an WeakIdentityHashMap, two keys k1 and k2 are considered equal if and only if (k1==k2). An entry in a WeakIdentityHashMap will automatically be removed when its key is no longer in ordinary use. More precisely, the presence of a mapping for a given key will not prevent the key from being discarded by the garbage collector, that is, made finalizable, finalized, and then reclaimed. When a key has been discarded its entry is effectively removed from the map.

Based on java.util.WeakHashMap

Based on org.jboss.common.collection.WeakIdentityHashMap

@author Dawid Kurzyniec @author Kabir Khan @author Emmanuel Bernard @see java.util.IdentityHashMap @see java.util.WeakHashMap


  public void initialize(Configuration cfg) {
    if ( initialized ) return;
    //yuk
    reflectionManager = ( (AnnotationConfiguration) cfg ).createExtendedMappings().getReflectionManager();
    queuePerTransaction = new WeakIdentityHashMap();


    Class analyzerClass;
    String analyzerClassName = cfg.getProperty( Environment.ANALYZER_CLASS );
    if ( analyzerClassName != null ) {
      try {

Examples of org.hibernate.search.util.WeakIdentityHashMap

Related Classes of org.hibernate.search.util.WeakIdentityHashMap