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

MinMaxPriorityQueue.growIfNeeded介绍

暂无

代码示例

代码示例来源：origin: google/guava

/**
 * Adds the given element to this queue. If this queue has a maximum size, after adding {@code
 * element} the queue will automatically evict its greatest element (according to its comparator),
 * which may be {@code element} itself.
 */
@CanIgnoreReturnValue
@Override
public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: google/j2objc

/**
 * Adds the given element to this queue. If this queue has a maximum size, after adding {@code
 * element} the queue will automatically evict its greatest element (according to its comparator),
 * which may be {@code element} itself.
 */
@CanIgnoreReturnValue
@Override
public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

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

/**
 * Adds the given element to this queue. If this queue has a maximum size, after adding {@code
 * element} the queue will automatically evict its greatest element (according to its comparator),
 * which may be {@code element} itself.
 */
@CanIgnoreReturnValue
@Override
public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: org.sonatype.sisu/sisu-guava

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: at.bestsolution.efxclipse.eclipse/com.google.guava

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: com.ning.billing/killbill-osgi-bundles-jruby

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: org.hudsonci.lib.guava/guava

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: org.kill-bill.billing/killbill-osgi-bundles-jruby

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: Nextdoor/bender

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: com.google.guava/guava-jdk5

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: com.diffplug.guava/guava-collect

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override
public boolean offer(E element) {
  checkNotNull(element);
  modCount++;
  int insertIndex = size++;
  growIfNeeded();
  // Adds the element to the end of the heap and bubbles it up to the correct
  // position.
  heapForIndex(insertIndex).bubbleUp(insertIndex, element);
  return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: com.atlassian.bundles/guava

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: com.ning.billing/killbill-osgi-bundles-analytics

/**
 * Adds the given element to this queue. If this queue has a maximum size,
 * after adding {@code element} the queue will automatically evict its
 * greatest element (according to its comparator), which may be {@code
 * element} itself.
 */
@Override public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: org.kill-bill.billing/killbill-platform-osgi-bundles-logger

/**
 * Adds the given element to this queue. If this queue has a maximum size, after adding {@code
 * element} the queue will automatically evict its greatest element (according to its comparator),
 * which may be {@code element} itself.
 */
@CanIgnoreReturnValue
@Override
public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}

代码示例来源：origin: org.jboss.eap/wildfly-client-all

/**
 * Adds the given element to this queue. If this queue has a maximum size, after adding {@code
 * element} the queue will automatically evict its greatest element (according to its comparator),
 * which may be {@code element} itself.
 */
@CanIgnoreReturnValue
@Override
public boolean offer(E element) {
 checkNotNull(element);
 modCount++;
 int insertIndex = size++;
 growIfNeeded();
 // Adds the element to the end of the heap and bubbles it up to the correct
 // position.
 heapForIndex(insertIndex).bubbleUp(insertIndex, element);
 return size <= maximumSize || pollLast() != element;
}