transient Entry[] table = (Entry<K,V>[]) EMPTY_TABLE;

public V put(K key, V value) {
    if (table == EMPTY_TABLE) {
        inflateTable(threshold);
    }
    if (key == null)
        return putForNullKey(value);
    int hash = hash(key);
    int i = indexFor(hash, table.length);
    for (Entry<K, V> e = table[i]; e != null; e = e.next) {
        Object k;
        if (e.hash == hash && ((k = e.key) == key || key.equals(k))) {
            V oldValue = e.value;
            e.value = value;
            e.recordAccess(this);
            return oldValue;
        }
    }
    modCount++;	
    addEntry(hash, key, value, i);
    return null;
}

final int hash(Object k) {
        int h = hashSeed;
        if (0 != h && k instanceof String) {
            return sun.misc.Hashing.stringHash32((String) k);
        }
        h ^= k.hashCode();
        h ^= (h >>> 20) ^ (h >>> 12);
        return h ^ (h >>> 7) ^ (h >>> 4);
    }

    static int indexFor(int h, int length) {
        return h & (length-1);
    }

void addEntry(int hash, K key, V value, int bucketIndex) {
    	//sizi大于閾值 2倍擴(kuò)容	
        if ((size >= threshold) && (null != table[bucketIndex])) {
            resize(2 * table.length);
            hash = (null != key) ? hash(key) : 0;
            bucketIndex = indexFor(hash, table.length);
        }
        createEntry(hash, key, value, bucketIndex);
    }

void createEntry(int hash, K key, V value, int bucketIndex) {  
        Entry<K,V> e = table[bucketIndex]; 
        table[bucketIndex] = new Entry<>(hash, key, value, e);
        size++;
    }  

public V get(Object key) {   
    if (key == null)   
        return getForNullKey();   
    int hash = hash(key.hashCode());   
    for (Entry<K,V> e = table[indexFor(hash, table.length)];   
        e != null;   
        e = e.next) {   
        Object k;   
        if (e.hash == hash && ((k = e.key) == key || key.equals(k)))   
            return e.value;   
    }   
    return null;   
}

void resize(int newCapacity) {
    Entry[] oldTable = table;
    int oldCapacity = oldTable.length;
    if (oldCapacity == MAXIMUM_CAPACITY) {
        threshold = Integer.MAX_VALUE;
        return;
    }
    Entry[] newTable = new Entry[newCapacity];
    transfer(newTable);//用來將原先table的元素全部移到newTable里面
    table = newTable;  //再將newTable賦值給table
    threshold = (int)(newCapacity * loadFactor);//重新計(jì)算臨界值
}

void transfer(Entry[] newTable, boolean rehash) {
        int newCapacity = newTable.length;
        //遍歷舊表
        for (Entry<K,V> e : table) {
            //將所有的節(jié)點(diǎn)進(jìn)行hash運(yùn)算
            while(null != e) {
                Entry<K,V> next = e.next;
                if (rehash) {
                    e.hash = null == e.key ? 0 : hash(e.key);
                }
                int i = indexFor(e.hash, newCapacity);
                e.next = newTable[i];
                newTable[i] = e;
                e = next;
            }
        }
    }

private void inflateTable(int toSize) {
    // Find a power of 2 >= toSize
    int capacity = roundUpToPowerOf2(toSize);
    threshold = (int) Math.min(capacity * loadFactor, MAXIMUM_CAPACITY + 1);
    table = new Entry[capacity];
    initHashSeedAsNeeded(capacity);//初始化hashSeed變量
}
private static int roundUpToPowerOf2(int number) {
    // assert number >= 0 : "number must be non-negative";
    return number >= MAXIMUM_CAPACITY
        ? MAXIMUM_CAPACITY
        : (number > 1) ? Integer.highestOneBit((number - 1) << 1) : 1;
}

public class SparseArray<E> implements Cloneable {
    private static final Object DELETED = new Object();
    private boolean mGarbage = false;
    private int[] mKeys;
    private Object[] mValues;
    private int mSize;

public void put(int key, E value) {
    int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
    //原來已經(jīng)有key，可能是remove后，value存放著DELETED，也可能是存放舊值，那么就替換
    if (i >= 0) {
        mValues[i] = value;
    } else {
        //沒有找到，對i取反，得到i= lo（ContainerHelpers.binarySearch）
        i = ~i;
        //如果i小于數(shù)組長度，且mValues==DELETED(i對應(yīng)的Key被延遲刪除了)
        if (i < mSize && mValues[i] == DELETED) {
            //直接取代，實(shí)現(xiàn)真實(shí)刪除原鍵值對
            mKeys[i] = key;
            mValues[i] = value;
            return;
        }
        //數(shù)組中可能存在延遲刪除元素且當(dāng)前數(shù)組長度滿，無法添加
        if (mGarbage && mSize >= mKeys.length) {
            //真實(shí)刪除，將所有延遲刪除的元素從數(shù)組中清除；
            gc();
            //清除后重新確定當(dāng)前key在數(shù)組中的目標(biāo)位置；
            // Search again because indices may have changed.
            i = ~ContainerHelpers.binarySearch(mKeys, mSize, key);
        }
        //不存在垃圾或者當(dāng)前數(shù)組仍然可以繼續(xù)添加元素，不需要擴(kuò)容，則將i之后的元素全部后移，數(shù)組中仍然存在被DELETED的垃圾key；
        mKeys = GrowingArrayUtils.insert(mKeys, mSize, i, key);
        mValues = GrowingArrayUtils.insert(mValues, mSize, i, value);
        //新元素添加成功，潛在可用元素數(shù)量+1
        mSize++;
    }
}

// This is Arrays.binarySearch(), but doesn't do any argument validation.
//第一個參數(shù)array為keys的數(shù)組，第二個為數(shù)組中元素個數(shù)（與keys的length不一定相等），第三個value為目標(biāo)的key
static int binarySearch(int[] array, int size, int value) {
    //lo為二分查找的左邊界
    int lo = 0;
    //hi為二分查找的右邊界
    int hi = size - 1;
    //還沒找到，繼續(xù)查找
    while (lo <= hi) {
        //左邊界+右邊界處以2，獲取到mid 的index
        final int mid = (lo + hi) >>> 1;
        //獲取中間元素
        final int midVal = array[mid];
        // 目標(biāo)key在右部分  。。。。感覺這部分太簡單了
        if (midVal < value) {
            lo = mid + 1;
        } else if (midVal > value) {
            hi = mid - 1;
        } else {
            //相等，找到了，返回key對應(yīng)在array的下標(biāo)；
            return mid;  // value found
        }
    }
    //沒有找到該元素，對lo取反?。。。?！很重要
    return ~lo;  // value not present
}

public void delete(int key) {
    //查找對應(yīng)key在數(shù)組中的下標(biāo)，如果存在，返回下標(biāo)，不存在，返回下標(biāo)的取反；
    int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
    //key存在于mKeys數(shù)組中，將元素刪除，用DELETED替換原value，起標(biāo)記作用；
    if (i >= 0) {
        if (mValues[i] != DELETED) {
            mValues[i] = DELETED;
            mGarbage = true;
        }
    }
}
/**
 * @hide
 * Removes the mapping from the specified key, if there was any, returning the old value.
 */
public E removeReturnOld(int key) {
    int i = ContainerHelpers.binarySearch(mKeys, mSize, key);
 
    if (i >= 0) {
        if (mValues[i] != DELETED) {
            final E old = (E) mValues[i];
            mValues[i] = DELETED;
            mGarbage = true;
            return old;
        }
    }
    return null;
}
/**
 * Alias for {@link #delete(int)}.
 */
public void remove(int key) {
    delete(key);
}

@Override
    public V put(K key, V value) {
        //當(dāng)前容量
        final int osize = mSize;
        //key的散列值
        final int hash;
        //key的hash所在的下標(biāo)
        int index;
        if (key == null) {
            //key為空hash值為0
            hash = 0;
            //找到key的hash值的下標(biāo)
            index = indexOfNull();
        } else {
            //key的hash值
            hash = mIdentityHashCode ? System.identityHashCode(key) : key.hashCode();
            // 找到key的hash值的下標(biāo)
            index = indexOf(key, hash);
        }
        if (index >= 0) {
            //當(dāng)前要添加的元素已經(jīng)存在，則直接進(jìn)行替換操作
            index = (index<<1) + 1;
            final V old = (V)mArray[index];
            mArray[index] = value;
            return old;
        }
        //取反得到要添加元素的位置
        index = ~index;
        if (osize >= mHashes.length) {
            //擴(kuò)容新的容量
            final int n = osize >= (BASE_SIZE*2) ? (osize+(osize>>1))
                    : (osize >= BASE_SIZE ? (BASE_SIZE*2) : BASE_SIZE);
            if (DEBUG) Log.d(TAG, "put: grow from " + mHashes.length + " to " + n);
            //原h(huán)ash數(shù)組
            final int[] ohashes = mHashes;
            //原散列表
            final Object[] oarray = mArray;
            //擴(kuò)容操作
            allocArrays(n);
            if (CONCURRENT_MODIFICATION_EXCEPTIONS && osize != mSize) {
                throw new ConcurrentModificationException();
            }
            if (mHashes.length > 0) {
                if (DEBUG) Log.d(TAG, "put: copy 0-" + osize + " to 0");
                //將原數(shù)組中的拷貝回新數(shù)組中
                System.arraycopy(ohashes, 0, mHashes, 0, ohashes.length);
                System.arraycopy(oarray, 0, mArray, 0, oarray.length);
            }
            //回收釋放操作
            freeArrays(ohashes, oarray, osize);
        }
        if (index < osize) {
            if (DEBUG) Log.d(TAG, "put: move " + index + "-" + (osize-index)
                    + " to " + (index+1));
            //將index處（含index）及其之后的數(shù)據(jù)往后移
            System.arraycopy(mHashes, index, mHashes, index + 1, osize - index);
            System.arraycopy(mArray, index << 1, mArray, (index + 1) << 1, (mSize - index) << 1);
        }
        if (CONCURRENT_MODIFICATION_EXCEPTIONS) {
            if (osize != mSize || index >= mHashes.length) {
                throw new ConcurrentModificationException();
            }
        }
        //將數(shù)據(jù)添加到index處
        mHashes[index] = hash;
        mArray[index<<1] = key;
        mArray[(index<<1)+1] = value;
        mSize++;
        return null;
    }
private void allocArrays(final int size) {
        if (mHashes == EMPTY_IMMUTABLE_INTS) {
            //擴(kuò)容時如果mHashes 是不可變的，則拋出異常
            throw new UnsupportedOperationException("ArrayMap is immutable");
        }
        if (size == (BASE_SIZE*2)) {
            //如果擴(kuò)容容量為8（BASE_SIZE=4）
            synchronized (ArrayMap.class) {
                if (mTwiceBaseCache != null) {
                    /**
                      如果當(dāng)前有容量為8的int緩存可復(fù)用數(shù)組和容量為16的object緩存可復(fù)用數(shù)組，則復(fù)用這些數(shù)組，而不重新new
                     */
                    final Object[] array = mTwiceBaseCache;
                    mArray = array;
                    mTwiceBaseCache = (Object[])array[0];
                    mHashes = (int[])array[1];
                    array[0] = array[1] = null;
                    mTwiceBaseCacheSize--;
                    if (DEBUG) Log.d(TAG, "Retrieving 2x cache " + mHashes
                            + " now have " + mTwiceBaseCacheSize + " entries");
                    return;
                }
            }
        } else if (size == BASE_SIZE) {
             //如果擴(kuò)容容量為4（BASE_SIZE=4）
            synchronized (ArrayMap.class) {
                if (mBaseCache != null) {
                    /**
                      如果當(dāng)前有容量為4的int緩存可復(fù)用數(shù)組和容量為8的object緩存可復(fù)用數(shù)組，則復(fù)用這些數(shù)組，而不重新new
                     */
                    final Object[] array = mBaseCache;
                    mArray = array;
                    mBaseCache = (Object[])array[0];
                    mHashes = (int[])array[1];
                    array[0] = array[1] = null;
                    mBaseCacheSize--;
                    if (DEBUG) Log.d(TAG, "Retrieving 1x cache " + mHashes
                            + " now have " + mBaseCacheSize + " entries");
                    return;
                }
            }
        }
        mHashes = new int[size];
        mArray = new Object[size<<1];
    }
    private static void freeArrays(final int[] hashes, final Object[] array, final int size) {
        if (hashes.length == (BASE_SIZE*2)) {
            //如果當(dāng)前容量為8（BASE_SIZE=4）
            synchronized (ArrayMap.class) {
                if (mTwiceBaseCacheSize < CACHE_SIZE) {
                    //緩存當(dāng)前數(shù)組，并將數(shù)組下標(biāo)為2之后的數(shù)據(jù)設(shè)置為null
                    array[0] = mTwiceBaseCache;
                    array[1] = hashes;
                    for (int i=(size<<1)-1; i>=2; i--) {
                        array[i] = null;
                    }
                    mTwiceBaseCache = array;
                    mTwiceBaseCacheSize++;
                    if (DEBUG) Log.d(TAG, "Storing 2x cache " + array
                            + " now have " + mTwiceBaseCacheSize + " entries");
                }
            }
        } else if (hashes.length == BASE_SIZE) {
            //如果當(dāng)前容量為4（BASE_SIZE=4）
            synchronized (ArrayMap.class) {
                //緩存當(dāng)前數(shù)組，并將數(shù)組下標(biāo)為2之后的數(shù)據(jù)設(shè)置為null
                if (mBaseCacheSize < CACHE_SIZE) {
                    array[0] = mBaseCache;
                    array[1] = hashes;
                    for (int i=(size<<1)-1; i>=2; i--) {
                        array[i] = null;
                    }
                    mBaseCache = array;
                    mBaseCacheSize++;
                    if (DEBUG) Log.d(TAG, "Storing 1x cache " + array
                            + " now have " + mBaseCacheSize + " entries");
                }
            }
        }
    }

 @Override
  public V get(Object key) {
        //取得key的hashcode所在mHashes的下標(biāo),
        final int index = indexOfKey(key);
        /**
        根據(jù)mArray的數(shù)據(jù)存儲結(jié)構(gòu)，得知mHashes的 下標(biāo)*2  (index << 1)便得到其對應(yīng)元素在mArray的起始下標(biāo)，第一個是key，第二個是value
        */
        return index >= 0 ? (V)mArray[(index<<1)+1] : null;
  }
public int indexOfKey(Object key) {
        return key == null ? indexOfNull()
                : indexOf(key, mIdentityHashCode ? System.identityHashCode(key) : key.hashCode());
}
int indexOf(Object key, int hash) {
        final int N = mSize;
        // Important fast case: if nothing is in here, nothing to look for.
        if (N == 0) {
            return ~0;
        }
        //二分法找到hash所在的下標(biāo)
        int index = binarySearchHashes(mHashes, N, hash);
        // If the hash code wasn't found, then we have no entry for this key.
        if (index < 0) {
            //沒找到，直接返回
            return index;
        }
        // If the key at the returned index matches, that's what we want.
        if (key.equals(mArray[index<<1])) {
            //如果hash下標(biāo)對應(yīng)mArray中的key與要找的key相等，直接返回當(dāng)前下標(biāo)
            return index;
        }
        //出現(xiàn)沖突處理方案
        //遍歷當(dāng)前index之后元素，找到匹配的key所在的下標(biāo)
        // Search for a matching key after the index.
        int end;
        for (end = index + 1; end < N && mHashes[end] == hash; end++) {
            if (key.equals(mArray[end << 1])) return end;
        }
        //遍歷當(dāng)前index之前元素，找到匹配的key所在的下標(biāo)
        // Search for a matching key before the index.
        for (int i = index - 1; i >= 0 && mHashes[i] == hash; i--) {
            if (key.equals(mArray[i << 1])) return i;
        }
        // Key not found -- return negative value indicating where a
        // new entry for this key should go.  We use the end of the
        // hash chain to reduce the number of array entries that will
        // need to be copied when inserting.
        return ~end;
}