How to use

preModify

method

in

java.util.HashMap

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

private V putValueForNullKey(V value) {
  HashMapEntry<K, V> entry = entryForNullKey;
  if (entry == null) {
    addNewEntryForNullKey(value);
    size++;
    modCount++;
    return null;
  } else {
    preModify(entry);
    V oldValue = entry.value;
    entry.value = value;
    return oldValue;
  }
}

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;

for (HashMapEntry<K, V> e = tab[index]; e != null; e = e.next) {
  if (e.hash == hash && key.equals(e.key)) {
    preModify(e);
    V oldValue = e.value;
    e.value = value;