摘要：序是一款對(duì)并發(fā)數(shù)據(jù)結(jié)構(gòu)進(jìn)行增強(qiáng)的并發(fā)工具，主要提供了以及的增強(qiáng)數(shù)據(jù)結(jié)構(gòu)。只有幾個(gè)方法對(duì)比主要是操作之后沒(méi)有立即返回是對(duì)的增強(qiáng)，對(duì)多的支持以及高并發(fā)更新提供更好的性能。是對(duì)的簡(jiǎn)單包裝以支持的接口。

JCTools是一款對(duì)jdk并發(fā)數(shù)據(jù)結(jié)構(gòu)進(jìn)行增強(qiáng)的并發(fā)工具，主要提供了map以及queue的增強(qiáng)數(shù)據(jù)結(jié)構(gòu)。原來(lái)netty還是自己寫(xiě)的MpscLinkedQueueNode，后來(lái)新版本就換成使用JCTools的并發(fā)隊(duì)列了。

ConcurrentAutoTable(后面幾個(gè)map/set結(jié)構(gòu)的基礎(chǔ))

NonBlockingHashMap

NonBlockingHashMapLong

NonBlockingHashSet

NonBlockingIdentityHashMap

NonBlockingSetInt

SPSC - Single Producer Single Consumer (Wait Free, bounded and unbounded)

MPSC - Multi Producer Single Consumer (Lock less, bounded and unbounded)

SPMC - Single Producer Multi Consumer (Lock less, bounded)

MPMC - Multi Producer Multi Consumer (Lock less, bounded)

        
            org.jctools
            jctools-core
            2.1.0
        

替代AtomicLong，專門為高性能的counter設(shè)計(jì)的。只有幾個(gè)方法

public void add( long x );
public void decrement();
public void increment();
public void set( long x );
public long get();
public int  intValue();
public long longValue();
public long estimate_get();

對(duì)比AtomicLong主要是操作之后沒(méi)有立即返回

public final long incrementAndGet();
public final long decrementAndGet()

NonBlockingHashMap是對(duì)ConcurrentHashMap的增強(qiáng)，對(duì)多CPU的支持以及高并發(fā)更新提供更好的性能。
NonBlockingHashMapLong是key為L(zhǎng)ong型的NonBlockingHashMap。
NonBlockingHashSet是對(duì)NonBlockingHashMap的簡(jiǎn)單包裝以支持set的接口。
NonBlockingIdentityHashMap是從NonBlockingHashMap改造來(lái)的，使用System.identityHashCode()來(lái)計(jì)算哈希
NonBlockingSetInt是一個(gè)使用CAS的簡(jiǎn)單的bit-vector

原來(lái)是

// --- hash ----------------------------------------------------------------
  // Helper function to spread lousy hashCodes.  Throws NPE for null Key, on
  // purpose - as the first place to conveniently toss the required NPE for a
  // null Key.
  private static final int hash(final Object key) {
    int h = key.hashCode();     // The real hashCode call
    h ^= (h>>>20) ^ (h>>>12);
    h ^= (h>>> 7) ^ (h>>> 4);
    h += h<<7; // smear low bits up high, for hashcodes that only differ by 1
    return h;
  }

改為

// --- hash ----------------------------------------------------------------
  // Helper function to spread lousy hashCodes
  private static final int hash(final Object key) {
    int h = System.identityHashCode(key); // The real hashCode call
    // I assume that System.identityHashCode is well implemented with a good
    // spreader, and a second bit-spreader is redundant.
    //h ^= (h>>>20) ^ (h>>>12);
    //h ^= (h>>> 7) ^ (h>>> 4);
    return h;
  }

JCTools

Java Concurrent Counters By Numbers

Lock Free Queues Index

135 Million messages a second between processes in pure Java