Examples of org.apache.beehive.netui.util.internal.concurrent.InternalConcurrentHashMap

Package org.apache.beehive.netui.util.internal.concurrent

Examples of org.apache.beehive.netui.util.internal.concurrent.InternalConcurrentHashMap

org.apache.beehive.netui.util.internal.concurrent.InternalConcurrentHashMap
A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates. This class obeys the same functional specification as {@link java.util.Hashtable}, and includes versions of methods corresponding to each method of Hashtable. However, even though all operations are thread-safe, retrieval operations do not entail locking, and there is not any support for locking the entire table in a way that prevents all access. This class is fully interoperable with Hashtable in programs that rely on its thread safety but not on its synchronization details.
Retrieval operations (including get) generally do not block, so may overlap with update operations (including put and remove). Retrievals reflect the results of the most recently completed update operations holding upon their onset. For aggregate operations such as putAll and clear, concurrent retrievals may reflect insertion or removal of only some entries. Similarly, Iterators and Enumerations return elements reflecting the state of the hash table at some point at or since the creation of the iterator/enumeration. They do not throw {@link ConcurrentModificationException}. However, iterators are designed to be used by only one thread at a time.
The allowed concurrency among update operations is guided by the optional concurrencyLevel constructor argument (default 16), which is used as a hint for internal sizing. The table is internally partitioned to try to permit the indicated number of concurrent updates without contention. Because placement in hash tables is essentially random, the actual concurrency will vary. Ideally, you should choose a value to accommodate as many threads as will ever concurrently modify the table. Using a significantly higher value than you need can waste space and time, and a significantly lower value can lead to thread contention. But overestimates and underestimates within an order of magnitude do not usually have much noticeable impact. A value of one is appropriate when it is known that only one thread will modify and all others will only read. Also, resizing this or any other kind of hash table is a relatively slow operation, so, when possible, it is a good idea to provide estimates of expected table sizes in constructors.
This class and its views and iterators implement all of the optional methods of the {@link Map} and {@link Iterator}interfaces.
Like {@link java.util.Hashtable} but unlike {@link java.util.HashMap}, this class does NOT allow null to be used as a key or value.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea

    private final InternalConcurrentHashMap _fieldCache;
    private final InternalConcurrentHashMap _declaredFieldCache;


    public FieldCache()
    {
        _fieldCache = new InternalConcurrentHashMap();
        _declaredFieldCache = new InternalConcurrentHashMap();
    }

View Full Code Here


    private ProcessedAnnotations _annotations;


    public static AnnotationReader getAnnotationReader( Class type, ServletContext servletContext )
    {
        InternalConcurrentHashMap cache = ( InternalConcurrentHashMap ) servletContext.getAttribute( CACHE_ATTR );


        if ( cache == null )
        {
            cache = new InternalConcurrentHashMap();
            servletContext.setAttribute( CACHE_ATTR, cache );
        }


        AnnotationReader reader = ( AnnotationReader ) cache.get( type );


        if ( reader == null )
        {
            reader = new AnnotationReader( type, servletContext );
            cache.put( type, reader );
        }


        return reader;
    }

View Full Code Here

    private static final Logger LOGGER = Logger.getInstance(PropertyCache.class);


    private final InternalConcurrentHashMap _classCache;


    public PropertyCache() {
        _classCache = new InternalConcurrentHashMap();
    }

View Full Code Here


    /**
     *
     */
    public MethodCache() {
        _methodCache = new InternalConcurrentHashMap();
    }

View Full Code Here

    private final InternalConcurrentHashMap _fieldCache;
    private final InternalConcurrentHashMap _declaredFieldCache;


    public FieldCache()
    {
        _fieldCache = new InternalConcurrentHashMap();
        _declaredFieldCache = new InternalConcurrentHashMap();
    }

View Full Code Here


    protected ClassLevelCache() {
    }


    public Object get(String majorKey, String minorKey) {
        InternalConcurrentHashMap cache = (InternalConcurrentHashMap)_caches.get(majorKey);
        return cache != null ? cache.get(minorKey) : null;
    }

View Full Code Here

    public Map getCacheMap(String cacheID) {
        return getCacheMap(cacheID, true);
    }


    public Map getCacheMap(String cacheID, boolean createIfMissing) {
        InternalConcurrentHashMap cache = (InternalConcurrentHashMap)_caches.get(cacheID);


        if(cache == null && createIfMissing) {
            cache = new InternalConcurrentHashMap();
            _caches.put(cacheID, cache);
        }


        return cache;
    }

View Full Code Here




    public List/*< Interceptor >*/ getActionInterceptors()
    {
        ServletContext servletContext = getServletContext();
        InternalConcurrentHashMap/*< String, HashMap< String, ArrayList< Interceptor > > >*/ cache =
                ( InternalConcurrentHashMap ) servletContext.getAttribute( CACHE_ATTR );


        if ( cache == null )
        {
            //
            // Don't have to synchronize here.  If by some chance two initial requests come in at the same time,
            // one of the caches will get overwritten in the ServletContext, but it will just get recreated the
            // next time.
            //
            cache = new InternalConcurrentHashMap/*< String, HashMap< String, ArrayList< Interceptor > > >*/();
            servletContext.setAttribute( CACHE_ATTR, cache );
        }


        String modulePath = getPageFlow().getModulePath();
        String actionName = getActionName();
        HashMap/*< String, ArrayList< Interceptor > >*/ cacheByPageFlow = ( HashMap ) cache.get( modulePath );
        if ( cacheByPageFlow != null )
        {
            List/*< Interceptor >*/ interceptors = ( List ) cacheByPageFlow.get( actionName );
            if ( interceptors != null ) return interceptors;
        }


        //
        // We didn't find it in the cache -- build it.
        //
        if ( cacheByPageFlow == null ) cacheByPageFlow = new HashMap/*< String, ArrayList< Interceptor > >*/();
        PageFlowActionInterceptorsConfig config = ConfigUtil.getConfig().getPageFlowActionInterceptors();
        ArrayList/*< Interceptor >*/ interceptorsList = new ArrayList/*< Interceptor >*/();


        if ( config == null )
        {
            cacheByPageFlow.put( actionName, interceptorsList );
            cache.put( modulePath, cacheByPageFlow );
            return interceptorsList;
        }


        //
        // Global interceptors.
        //
        GlobalPageFlowActionInterceptorConfig globalInterceptors = config.getGlobalPageFlowActionInterceptors();


        if ( globalInterceptors != null )
        {
            addInterceptors( globalInterceptors.getActionInterceptors(), interceptorsList, ActionInterceptor.class );
            addSimpleInterceptors( globalInterceptors.getSimpleActionInterceptors(), interceptorsList );
        }


        //
        // Per-pageflow and per-action interceptors.
        //
        String pageFlowURI = getPageFlow().getURI();
        PerPageFlowActionInterceptorConfig[] perPageFlowInterceptorsConfig = config.getPerPageFlowActionInterceptors();


        if ( perPageFlowInterceptorsConfig != null )
        {
            for ( int i = 0; i < perPageFlowInterceptorsConfig.length; i++ )
            {
                PerPageFlowActionInterceptorConfig ppfi = perPageFlowInterceptorsConfig[i];


                if ( ppfi != null && pageFlowURI.equals( ppfi.getPageFlowUri() ) )
                {
                    //
                    // This is a matching page flow -- add per-pageflow interceptors.
                    //
                    addInterceptors( perPageFlowInterceptorsConfig[i].getActionInterceptors(), interceptorsList,
                                     ActionInterceptor.class );
                    addSimpleInterceptors( perPageFlowInterceptorsConfig[i].getSimpleActionInterceptors(),
                                           interceptorsList );


                    PerActionInterceptorConfig[] perActionConfigs =
                            perPageFlowInterceptorsConfig[i].getPerActionInterceptors();


                    if ( perActionConfigs != null )
                    {
                        for ( int j = 0; j < perActionConfigs.length; j++ )
                        {
                            PerActionInterceptorConfig perActionConfig = perActionConfigs[j];


                            if ( perActionConfig != null && actionName.equals( perActionConfig.getActionName() ) )
                            {
                                //
                                // This is a matching action -- add per-action interceptors.
                                //
                                addInterceptors( perActionConfig.getActionInterceptors(), interceptorsList,
                                                 ActionInterceptor.class );
                                addSimpleInterceptors( perActionConfig.getSimpleActionInterceptors(),
                                                       interceptorsList );
                            }
                        }
                    }
                }
            }
        }


        cacheByPageFlow.put( actionName, interceptorsList );
        cache.put( modulePath, cacheByPageFlow );
        return interceptorsList;
    }

View Full Code Here

0 1

TOP

Related Classes of org.apache.beehive.netui.util.internal.concurrent.InternalConcurrentHashMap

org.apache.beehive.netui.pageflow.interceptor.action.ActionInterceptorContext

org.apache.beehive.netui.pageflow.internal.AnnotationReader

org.apache.beehive.netui.util.internal.cache.ClassLevelCache

org.apache.beehive.netui.util.internal.cache.FieldCache

org.apache.beehive.netui.util.internal.cache.MethodCache

org.apache.beehive.netui.util.internal.cache.PropertyCache

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.