keys[dest] = key;
    values[dest] = value;

    // update pointers in hashTableKToV
    int keyHash = smearedHash(key);
    int keyBucket = bucket(keyHash);
    if (hashTableKToV[keyBucket] == src) {
      hashTableKToV[keyBucket] = dest;
    } else {
      int prevInBucket = hashTableKToV[keyBucket];
      for (int entryInBucket = nextInBucketKToV[prevInBucket];

    int keyBucket = node.keyHash & mask;
    Node<K, V> prevBucketNode = null;
    for (Node<K, V> bucketNode = hashTableKToV[keyBucket];
        true;
        bucketNode = bucketNode.nextInKToVBucket) {
      if (bucketNode == node) {
        if (prevBucketNode == null) {
          hashTableKToV[keyBucket] = node.nextInKToVBucket;
        } else {
          prevBucketNode.nextInKToVBucket = node.nextInKToVBucket;