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

WeakHashMap.poll介绍

暂无

代码示例

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

poll();
if (valuesCollection == null) {
  valuesCollection = new AbstractCollection<V>() {

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

poll();
if (keySet == null) {
  keySet = new AbstractSet<K>() {

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

poll();
return new AbstractSet<Map.Entry<K, V>>() {
  @Override

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

Entry<K, V> getEntry(Object key) {
  poll();
  if (key != null) {
    int index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    Entry<K, V> entry = elementData[index];
    while (entry != null) {
      if (key.equals(entry.get())) {
        return entry;
      }
      entry = entry.next;
    }
    return null;
  }
  Entry<K, V> entry = elementData[0];
  while (entry != null) {
    if (entry.isNull) {
      return entry;
    }
    entry = entry.next;
  }
  return null;
}

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

poll();
if (key != null) {
  int index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;

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

poll();
if (value != null) {
  for (int i = elementData.length; --i >= 0;) {

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

poll();
int index = 0;
Entry<K, V> entry, last = null;

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

poll();
int index = 0;
Entry<K, V> entry;

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

/**
 * Returns the number of elements in this map.
 *
 * @return the number of elements in this map.
 */
@Override
public int size() {
  poll();
  return elementCount;
}

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

Entry<K, V> getEntry(Object key) {
  poll();
  if (key != null) {
    int index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    Entry<K, V> entry = elementData[index];
    while (entry != null) {
      if (key.equals(entry.get())) {
        return entry;
      }
      entry = entry.next;
    }
    return null;
  }
  Entry<K, V> entry = elementData[0];
  while (entry != null) {
    if (entry.isNull) {
      return entry;
    }
    entry = entry.next;
  }
  return null;
}

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

Entry<K, V> getEntry(Object key) {
  poll();
  if (key != null) {
    int index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    Entry<K, V> entry = elementData[index];
    while (entry != null) {
      if (key.equals(entry.get())) {
        return entry;
      }
      entry = entry.next;
    }
    return null;
  }
  Entry<K, V> entry = elementData[0];
  while (entry != null) {
    if (entry.isNull) {
      return entry;
    }
    entry = entry.next;
  }
  return null;
}

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

Entry<K, V> getEntry(Object key) {
  poll();
  if (key != null) {
    int index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    Entry<K, V> entry = elementData[index];
    while (entry != null) {
      if (key.equals(entry.get())) {
        return entry;
      }
      entry = entry.next;
    }
    return null;
  }
  Entry<K, V> entry = elementData[0];
  while (entry != null) {
    if (entry.isNull) {
      return entry;
    }
    entry = entry.next;
  }
  return null;
}

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

Entry<K, V> getEntry(Object key) {
  poll();
  if (key != null) {
    int index = (Collections.secondaryHash(key) & 0x7FFFFFFF) % elementData.length;
    Entry<K, V> entry = elementData[index];
    while (entry != null) {
      if (key.equals(entry.get())) {
        return entry;
      }
      entry = entry.next;
    }
    return null;
  }
  Entry<K, V> entry = elementData[0];
  while (entry != null) {
    if (entry.isNull) {
      return entry;
    }
    entry = entry.next;
  }
  return null;
}