本文整理了Java中java.util.WeakHashMap.removeEntry()方法的一些代码示例，展示了WeakHashMap.removeEntry()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。WeakHashMap.removeEntry()方法的具体详情如下：
包路径：java.util.WeakHashMap
类名称：WeakHashMap
方法名：removeEntry

WeakHashMap.removeEntry介绍

暂无

代码示例

代码示例来源：origin: robovm/robovm

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: robovm/robovm

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: MobiVM/robovm

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: com.jtransc/jtransc-rt

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: FlexoVM/flexovm

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: ibinti/bugvm

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: com.bugvm/bugvm-rt

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: com.gluonhq/robovm-rt

@SuppressWarnings("unchecked")
void poll() {
  Entry<K, V> toRemove;
  while ((toRemove = (Entry<K, V>) referenceQueue.poll()) != null) {
    removeEntry(toRemove);
  }
}

代码示例来源：origin: MobiVM/robovm

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: ibinti/bugvm

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: FlexoVM/flexovm

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Removes the mapping with the specified key from this map.
 *
 * @param key
 *            the key of the mapping to remove.
 * @return the value of the removed mapping or {@code null} if no mapping
 *         for the specified key was found.
 */
@Override
public V remove(Object key) {
  poll();
  int index = 0;
  Entry<K, V> entry, last = null;
  if (key != null) {
    index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    entry = elementData[index];
    while (entry != null && !key.equals(entry.get())) {
      last = entry;
      entry = entry.next;
    }
  } else {
    entry = elementData[0];
    while (entry != null && !entry.isNull) {
      last = entry;
      entry = entry.next;
    }
  }
  if (entry != null) {
    modCount++;
    if (last == null) {