int indexOf(Object key, int hash) {
    final int N = mSize;

    // Important fast case: if nothing is in here, nothing to look for.
    //數(shù)組為空，直接返回
    if (N == 0) {
      return ~0;
    }

    //二分查找，不細(xì)說了
    int index = ContainerHelpers.binarySearch(mHashes, N, hash);

    // If the hash code wasn't found, then we have no entry for this key.
    //沒找到hashCode，返回index，一個(gè)負(fù)數(shù)
    if (index < 0) {
      return index;
    }

    // If the key at the returned index matches, that's what we want.
    //對(duì)比key值，相同則返回index
    if (key.equals(mArray[index<<1])) {
      return index;
    }

    // Search for a matching key after the index.
    //如果返回的index對(duì)應(yīng)的key值，與傳入的key值不等，則可能對(duì)應(yīng)的key在index后面
    int end;
    for (end = index + 1; end < N && mHashes[end] == hash; end++) {
      if (key.equals(mArray[end << 1])) return end;
    }

    // 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.
    //毛都沒找到，那肯定是沒有了，返回個(gè)負(fù)數(shù)
    return ~end;
  }

public V put(K key, V value) {
    final int hash;
    int index;
    //key是空，則通過indexOfNull查找對(duì)應(yīng)的index；如果不為空，通過indexOf查找對(duì)應(yīng)的index
    if (key == null) {
      hash = 0;
      index = indexOfNull();
    } else {
      hash = key.hashCode();
      index = indexOf(key, hash);
    }
    
    //index大于或等于0，一定是之前put過相同的key，直接替換對(duì)應(yīng)的value。因?yàn)閙Array中不只保存了value，還保存了key。
    //其結(jié)構(gòu)為[key1,value1,key2,value2,key3,value3,......]
    //所以，需要將index乘2對(duì)應(yīng)key，index乘2再加1對(duì)應(yīng)value
    if (index >= 0) {
      index = (index<<1) + 1;
      final V old = (V)mArray[index];
      mArray[index] = value;
      return old;
    }

    //取正數(shù)
    index = ~index;
    //mSize的大小，即已經(jīng)保存的數(shù)據(jù)量與mHashes的長度相同了，需要擴(kuò)容啦
    if (mSize >= mHashes.length) {
      //擴(kuò)容后的大小，有以下幾個(gè)檔位，BASE_SIZE（4），BASE_SIZE的2倍（8），mSize+(mSize>>1)（比之前的數(shù)據(jù)量擴(kuò)容1/2）
      final int n = mSize >= (BASE_SIZE*2) ? (mSize+(mSize>>1))
          : (mSize >= BASE_SIZE ? (BASE_SIZE*2) : BASE_SIZE);

      if (DEBUG) Log.d(TAG, "put: grow from " + mHashes.length + " to " + n);

      final int[] ohashes = mHashes;
      final Object[] oarray = mArray;
      //擴(kuò)容方法的實(shí)現(xiàn)
      allocArrays(n);

      //擴(kuò)容后，需要把原來的數(shù)據(jù)拷貝到新數(shù)組中
      if (mHashes.length > 0) {
        if (DEBUG) Log.d(TAG, "put: copy 0-" + mSize + " to 0");
        System.arraycopy(ohashes, 0, mHashes, 0, ohashes.length);
        System.arraycopy(oarray, 0, mArray, 0, oarray.length);
      }

      //看看被廢棄的數(shù)組是否還有利用價(jià)值
      //如果被廢棄的數(shù)組的數(shù)據(jù)量為4或8，說明可能利用價(jià)值，以后用到的時(shí)候可以直接用。
      //如果被廢棄的數(shù)據(jù)量太大，扔了算了，要不太占內(nèi)存。如果浪費(fèi)內(nèi)存了，還費(fèi)這么大勁，加了類干啥。
      freeArrays(ohashes, oarray, mSize);
    }

    //這次put的key對(duì)應(yīng)的hashcode排序沒有排在最后（index沒有指示到數(shù)組結(jié)尾），因此需要移動(dòng)index后面的數(shù)據(jù)
    if (index < mSize) {
      if (DEBUG) Log.d(TAG, "put: move " + index + "-" + (mSize-index)
          + " to " + (index+1));
      System.arraycopy(mHashes, index, mHashes, index + 1, mSize - index);
      System.arraycopy(mArray, index << 1, mArray, (index + 1) << 1, (mSize - index) << 1);
    }

    //把數(shù)據(jù)保存到數(shù)組中?？吹搅税桑琸ey和value都在mArray中；hashCode放到mHashes
    mHashes[index] = hash;
    mArray[index<<1] = key;
    mArray[(index<<1)+1] = value;
    mSize++;
    return null;
  }

 /**
   * Remove the key/value mapping at the given index.
   * @param index The desired index, must be between 0 and {@link #size()}-1.
   * @return Returns the value that was stored at this index.
   */
  public V removeAt(int index) {
    final Object old = mArray[(index << 1) + 1];
    //如果數(shù)據(jù)量小于等于1，說明刪除該元素后，沒有數(shù)組為空，清空兩個(gè)數(shù)組。
    if (mSize <= 1) {
      // Now empty.
      if (DEBUG) Log.d(TAG, "remove: shrink from " + mHashes.length + " to 0");
      //put中已有說明
      freeArrays(mHashes, mArray, mSize);
      mHashes = EmptyArray.INT;
      mArray = EmptyArray.OBJECT;
      mSize = 0;
    } else {
      //如果當(dāng)初申請(qǐng)的數(shù)組最大容納數(shù)據(jù)個(gè)數(shù)大于BASE_SIZE的2倍（8），并且現(xiàn)在存儲(chǔ)的數(shù)據(jù)量只用了申請(qǐng)數(shù)量的1/3，
      //則需要重新分配空間，已減少對(duì)內(nèi)存的占用
      if (mHashes.length > (BASE_SIZE*2) && mSize < mHashes.length/3) {
        // Shrunk enough to reduce size of arrays. We don't allow it to
        // shrink smaller than (BASE_SIZE*2) to avoid flapping between
        // that and BASE_SIZE.
        //新數(shù)組的大小
        final int n = mSize > (BASE_SIZE*2) ? (mSize + (mSize>>1)) : (BASE_SIZE*2);

        if (DEBUG) Log.d(TAG, "remove: shrink from " + mHashes.length + " to " + n);

        final int[] ohashes = mHashes;
        final Object[] oarray = mArray;
        allocArrays(n);

        mSize--;
        //index之前的數(shù)據(jù)拷貝到新數(shù)組中
        if (index > 0) {
          if (DEBUG) Log.d(TAG, "remove: copy from 0-" + index + " to 0");
          System.arraycopy(ohashes, 0, mHashes, 0, index);
          System.arraycopy(oarray, 0, mArray, 0, index << 1);
        }
        //將index之后的數(shù)據(jù)拷貝到新數(shù)組中，和（index>0）的分支結(jié)合，就將index位置的數(shù)據(jù)刪除了
        if (index < mSize) {
          if (DEBUG) Log.d(TAG, "remove: copy from " + (index+1) + "-" + mSize
              + " to " + index);
          System.arraycopy(ohashes, index + 1, mHashes, index, mSize - index);
          System.arraycopy(oarray, (index + 1) << 1, mArray, index << 1,
              (mSize - index) << 1);
        }
      } else {
        mSize--;
        //將index后的數(shù)據(jù)向前移位
        if (index < mSize) {
          if (DEBUG) Log.d(TAG, "remove: move " + (index+1) + "-" + mSize
              + " to " + index);
          System.arraycopy(mHashes, index + 1, mHashes, index, mSize - index);
          System.arraycopy(mArray, (index + 1) << 1, mArray, index << 1,
              (mSize - index) << 1);
        }
        //移位后最后一個(gè)數(shù)據(jù)清空
        mArray[mSize << 1] = null;
        mArray[(mSize << 1) + 1] = null;
      }
    }
    return (V)old;
  }

　　private static void freeArrays(final int[] hashes, final Object[] array, final int size) {
    //已經(jīng)廢棄的數(shù)組個(gè)數(shù)為BASE_SIZE的2倍（8），則用mTwiceBaseCache保存廢棄的數(shù)組；
    //如果個(gè)數(shù)為BASE_SIZE（4），則用mBaseCache保存廢棄的數(shù)組
    if (hashes.length == (BASE_SIZE*2)) {
      synchronized (ArrayMap.class) {
        if (mTwiceBaseCacheSize < CACHE_SIZE) {
          //array為剛剛廢棄的數(shù)組，mTwiceBaseCache如果有內(nèi)容，則放入array[0]位置，
          //在allocArrays中會(huì)從array[0]取出，放回mTwiceBaseCache
          array[0] = mTwiceBaseCache;
          //array[1]存放hash數(shù)組。因?yàn)閍rray中每個(gè)元素都是Object對(duì)象，所以每個(gè)元素都可以存放數(shù)組
          array[1] = hashes;
          //清除index為2和之后的數(shù)據(jù)
          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) {
      synchronized (ArrayMap.class) {
        if (mBaseCacheSize < CACHE_SIZE) {
          //代碼的注釋可以參考上面，不重復(fù)說明了
          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");
        }
      }
    }
  }