nextInBucketKToV[src] = ABSENT;

    // update pointers in hashTableVToK
    int valueHash = smearedHash(value);
    int valueBucket = bucket(valueHash);
    if (hashTableVToK[valueBucket] == src) {
      hashTableVToK[valueBucket] = dest;
    } else {
      int prevInBucket = hashTableVToK[valueBucket];
      for (int entryInBucket = nextInBucketVToK[prevInBucket];

    }

    int valueBucket = node.valueHash & mask;
    prevBucketNode = null;
    for (Node<K, V> bucketNode = hashTableVToK[valueBucket];
        true;
        bucketNode = bucketNode.nextInVToKBucket) {
      if (bucketNode == node) {
        if (prevBucketNode == null) {
          hashTableVToK[valueBucket] = node.nextInVToKBucket;
        } else {
          prevBucketNode.nextInVToKBucket = node.nextInVToKBucket;