Examples of java.util.concurrent.ConcurrentSkipListMap

java.util.concurrent.ConcurrentSkipListMap
kipedia.org/wiki/Skip_list" target="_top">SkipLists providing expected average log(n) time cost for the {@code containsKey}, {@code get}, {@code put} and{@code remove} operations and their variants. Insertion, removal,update, and access operations safely execute concurrently by multiple threads.
Iterators and spliterators are weakly consistent.
Ascending key ordered views and their iterators are faster than descending ones.
All {@code Map.Entry} pairs returned by methods in this classand its views represent snapshots of mappings at the time they were produced. They do not support the {@code Entry.setValue}method. (Note however that it is possible to change mappings in the associated map using {@code put}, {@code putIfAbsent}, or {@code replace}, depending on exactly which effect you need.)
Beware that, unlike in most collections, the {@code size}method is not a constant-time operation. Because of the asynchronous nature of these maps, determining the current number of elements requires a traversal of the elements, and so may report inaccurate results if this collection is modified during traversal. Additionally, the bulk operations {@code putAll}, {@code equals}, {@code toArray}, {@code containsValue}, and {@code clear} arenot guaranteed to be performed atomically. For example, an iterator operating concurrently with a {@code putAll} operationmight view only some of the added elements.
This class and its views and iterators implement all of the optional methods of the {@link Map} and {@link Iterator}interfaces. Like most other concurrent collections, this class does not permit the use of {@code null} keys or values because somenull return values cannot be reliably distinguished from the absence of elements.
This class is a member of the Java Collections Framework. @author Doug Lea @param < K> the type of keys maintained by this map @param < V> the type of mapped values @since 1.6

      else if (clazz.isAssignableFrom(SortedMap.class))
        return new TreeMap();
      else if (clazz.isAssignableFrom(NavigableMap.class))
        return new TreeMap();
      else if (clazz.isAssignableFrom(ConcurrentNavigableMap.class))
        return new ConcurrentSkipListMap();
      else
        return null;
    } else {
      Map map = null;
      try {

View Full Code Here

      else if (clazz.isAssignableFrom(SortedMap.class))
        return new TreeMap();
      else if (clazz.isAssignableFrom(NavigableMap.class))
        return new TreeMap();
      else if (clazz.isAssignableFrom(ConcurrentNavigableMap.class))
        return new ConcurrentSkipListMap();
      else
        return null;
    } else {
      Map map = null;
      try {

View Full Code Here

      final NamedCache cache = CacheFactory.getCache("objects");
//      final Map map = cache;
//      final Map map = new ContinuousQueryCache(cache, new ClassFilter(DomainObject.class), true);
//      final Map map = new ConcurrentHashMap();
//      final Map map = new HashMap();
      final Map map = new ConcurrentSkipListMap();
//      final Map map = Collections.synchronizedMap(new HashMap());
      final ObjectGenerator<?, ?> generator = new SimpleDomainObjGenerator();
    
//      cache.addIndex(new ReflectionExtractor("getA0"), false, null);
//      cache.addIndex(new ReflectionExtractor("getAs"), false, null);      
      
//      long objectCount = 1000000;
      long objectCount = 100000;
      
      long rangeStart = 0;
      long rangeFinish = objectCount;
      
      println("Loading " + objectCount + " objects ...");
      for(long i = rangeStart;  i < rangeFinish; i += 100) {
          if (i % 100000 == 0) {
              println("Done " + (i - rangeStart));
          }
          long j = Math.min(rangeFinish, i + 100);
          map.putAll(generator.generate(i, j));
      }      
      
      println("Loaded " + cache.size() + " objects");
      System.gc();
      println("Mem. usage " + ManagementFactory.getMemoryMXBean().getHeapMemoryUsage());


//      checkAccess(cache, new EqualsFilter("getA0", new DomainObjAttrib("?")));
//      checkAccess(cache, new EqualsFilter("getAs", Collections.EMPTY_LIST));
//      checkAccess(cache, new ContainsAnyFilter("getAs", Collections.singleton(new DomainObjAttrib("?"))));
      
//      ContinuousQueryCache view = new ContinuousQueryCache(cache, new EqualsFilter("getHashSegment", 0));
//      System.out.println("View size " + view.size());
      
//      view.addIndex(new ReflectionExtractor("getA0"), false, null);
//            checkAccess(view, new EqualsFilter("getA0", new DomainObjAttrib("?")));
//            checkAccess(view, new EqualsFilter("getA1", new DomainObjAttrib("?")));
      
      if (map instanceof NearCache) {


          println("Warming up near cache");
          for(long i = rangeFinish-1; i >= rangeStart; --i) {
              map.get(new DomainObjKey(i));
          }
      }
      
      println("Starting access threads");

View Full Code Here

        } else if (WeakHashMap.class == cl) {
            return new WeakHashMap();
        } else if (ConcurrentHashMap.class == cl) {
            result = new ConcurrentHashMap();
        } else if (ConcurrentSkipListMap.class == cl) {
            result = new ConcurrentSkipListMap();
        } else {
            try {
                result = cl.newInstance();
            } catch (Exception e) { /* ignore */ }

View Full Code Here

    public void testCollections() {
        assertEquals(144, deepSizeOf(new ArrayList()));
        assertEquals(216, deepSizeOf(new HashMap()));
        assertEquals(296, deepSizeOf(new LinkedHashMap()));
        assertEquals(176, deepSizeOf(new ReentrantReadWriteLock()));
        assertEquals(192, deepSizeOf(new ConcurrentSkipListMap()));
    }

View Full Code Here

        } else if (WeakHashMap.class == cl) {
            return new WeakHashMap();
        } else if (ConcurrentHashMap.class == cl) {
            result = new ConcurrentHashMap();
        } else if (ConcurrentSkipListMap.class == cl) {
            result = new ConcurrentSkipListMap();
        } else {
            try {
                result = cl.newInstance();
            } catch (Exception e) { /* ignore */ }

View Full Code Here

TOP

Related Classes of java.util.concurrent.ConcurrentSkipListMap

com.alibaba.dubbo.common.utils.PojoUtils

com.firefly.utils.ConvertUtils

com.griddynamics.gridkit.coherence.benchmark.capacity.SimpleConcurrencyBenchMark

net.sourceforge.sizeof.TestSizeOf

org.mule.util.store.InMemoryObjectStore

java.util.NoSuchElementException

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.