Package EDU.oswego.cs.dl.util.concurrent

Examples of EDU.oswego.cs.dl.util.concurrent.ConcurrentReaderHashMap$Entry


   {
      if (children == null)
      {
         if (getFqn().isRoot())
         {
            children = new ConcurrentReaderHashMap(64);
         }
         else
         {
            children = new ConcurrentReaderHashMap(4);
         }
      }
      return children;
   }
View Full Code Here


        {
            optimisticChildNodeMap = Collections.EMPTY_MAP;
        }
        else
        {
            optimisticChildNodeMap = new ConcurrentReaderHashMap(node.getChildren());
        }
        this.version = ((OptimisticTreeNode) node).getVersion();
    }
View Full Code Here

        // if not we need to create it
        if (child == null)
        {
            child = NodeFactory.getInstance().createNodeOfType(parent, child_name, fqn, parent, null, cache, version);
            if (optimisticChildNodeMap == Collections.EMPTY_MAP)
                optimisticChildNodeMap = new ConcurrentReaderHashMap();
            optimisticChildNodeMap.put(child_name, child);
           if (trace) log.trace("Adding child " + child_name);
           childrenAdded.add(child);
           childrenRemoved.remove(child);
        }
View Full Code Here

   public ServerPeer() throws Exception
   {
      // Some wired components need to be started here
      version = Version.instance();

      sessions = new ConcurrentReaderHashMap();

      started = false;
   }
View Full Code Here

        }
        return retval;
    }

    private static Map createSenders(int size) {
        return new ConcurrentReaderHashMap(size);
    }
View Full Code Here

        }
        return hdr;
    }

    private static Map createHeaders(int size) {
        return size > 0? new ConcurrentReaderHashMap(size) : new ConcurrentReaderHashMap();
    }
View Full Code Here

        return size > 0? new ConcurrentReaderHashMap(size) : new ConcurrentReaderHashMap();
    }


    private static Map createHeaders(Map m) {
        return new ConcurrentReaderHashMap(m);
    }
View Full Code Here

        // use the improved node type cache
        // (replace with: entCache = new EffectiveNodeTypeCacheImpl();
        // for the old one)
        entCache = new BitSetENTCacheImpl();
        registeredNTDefs = new ConcurrentReaderHashMap();

        // setup definition of root node
        rootNodeDef = createRootNodeDef();

        // load and register pre-defined (i.e. built-in) node types
View Full Code Here

        // use the improved node type cache
        // (replace with: entCache = new EffectiveNodeTypeCacheImpl();
        // for the old one)
        entCache = new BitsetENTCacheImpl();
        registeredNTDefs = new ConcurrentReaderHashMap();
        propDefs = new ConcurrentReaderHashMap();
        nodeDefs = new ConcurrentReaderHashMap();

        // setup definition of root node
        rootNodeDef = createRootNodeDef();
        nodeDefs.put(new NodeDefId(rootNodeDef), rootNodeDef);
View Full Code Here

      }
   }

   public InvocationStatistics()
   {
      methodStats = new ConcurrentReaderHashMap();
   }
View Full Code Here

TOP

Related Classes of EDU.oswego.cs.dl.util.concurrent.ConcurrentReaderHashMap$Entry

Copyright © 2018 www.massapicom. All rights reserved.
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.