强撸ConcurrentHashMap

 

不知道是不是被逼无奈，还是突发感想，反正出自何种目的已无从考究，今天就要撸他，对，撸起来，起初的想法很简单，就是把ConcurrentHashMap这类从头到尾撸完

先从翻译开始

 * A hash table supporting full concurrency of retrievals and
 * high 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
 * {@code Hashtable}. However, even though all operations are
 * thread-safe, retrieval operations do <em>not</em> entail locking,
 * and there is <em>not</em> any support for locking the entire table
 * in a way that prevents all access.  This class is fully
 * interoperable with {@code Hashtable} in programs that rely on its
 * thread safety but not on its synchronization details.
一个哈希表支持高并发检索和超高预期的更新，这个类遵循着和【java.util.Hashtable】一样的方法准则，
并且包含了方法的版本和Hashtable一样的，然而，即所有的操作都是线程安全的，检索操作需要锁起来，
同时，也不支持一种堵塞所有访问的方式来锁住整个表，这个类和Hashtable在synchronization细节上不一样，
但是在编程上的操作和Hashtable一样，都依赖于线程安全。

<p>Retrieval operations (including {@code get}) generally do not
 * block, so may overlap with update operations (including {@code put}
 * and {@code remove}). Retrievals reflect the results of the most
 * recently <em>completed</em> update operations holding upon their
 * onset. (More formally, an update operation for a given key bears a
 * <em>happens-before</em> relation with any (non-null) retrieval for
 * that key reporting the updated value.)  For aggregate operations
 * suc