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

MinMaxPriorityQueue.offer介绍

[英]Adds the given element to this queue. If this queue has a maximum size, after adding element the queue will automatically evict its greatest element (according to its comparator), which may be element itself.
[中]

代码示例

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

@CanIgnoreReturnValue
@Override
public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

代码示例来源：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.
 *
 * @return {@code true} always
 */
@CanIgnoreReturnValue
@Override
public boolean add(E element) {
 offer(element);
 return true;
}

代码示例来源：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.
 *
 * @return {@code true} always
 */
@CanIgnoreReturnValue
@Override
public boolean add(E element) {
 offer(element);
 return true;
}

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

@CanIgnoreReturnValue
@Override
public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

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

/**
 * Builds a new min-max priority queue using the previously specified options, and having the
 * given initial elements.
 */
public <T extends B> MinMaxPriorityQueue<T> create(Iterable<? extends T> initialContents) {
 MinMaxPriorityQueue<T> queue =
   new MinMaxPriorityQueue<T>(
     this, initialQueueSize(expectedSize, maximumSize, initialContents));
 for (T element : initialContents) {
  queue.offer(element);
 }
 return queue;
}

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

@CanIgnoreReturnValue
@Override
public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

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

private static void insertRandomly(
  ArrayList<Integer> elements, MinMaxPriorityQueue<Integer> q, Random random) {
 while (!elements.isEmpty()) {
  int selectedIndex = random.nextInt(elements.size());
  q.offer(elements.remove(selectedIndex));
 }
}

代码示例来源：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.
 *
 * @return {@code true} always
 */
@CanIgnoreReturnValue
@Override
public boolean add(E element) {
 offer(element);
 return true;
}

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

/**
 * Builds a new min-max priority queue using the previously specified options, and having the
 * given initial elements.
 */
public <T extends B> MinMaxPriorityQueue<T> create(Iterable<? extends T> initialContents) {
 MinMaxPriorityQueue<T> queue =
   new MinMaxPriorityQueue<T>(
     this, initialQueueSize(expectedSize, maximumSize, initialContents));
 for (T element : initialContents) {
  queue.offer(element);
 }
 return queue;
}

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

/**
 * Builds a new min-max priority queue using the previously specified options, and having the
 * given initial elements.
 */
public <T extends B> MinMaxPriorityQueue<T> create(Iterable<? extends T> initialContents) {
 MinMaxPriorityQueue<T> queue =
   new MinMaxPriorityQueue<T>(
     this, initialQueueSize(expectedSize, maximumSize, initialContents));
 for (T element : initialContents) {
  queue.offer(element);
 }
 return queue;
}

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

for (int i = 0; i < heapSize; i++) {
 int randomInt = random.nextInt();
 mmHeap.offer(randomInt);
 insertIntoReplica(replica, randomInt);
  mmHeap.offer(randomInt);
  insertIntoReplica(replica, randomInt);
  currentHeapSize++;

代码示例来源：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.
 *
 * @return {@code true} always
 */
@Override public boolean add(E element) {
 offer(element);
 return true;
}

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

@Override public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

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

@Override public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

代码示例来源：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.
 *
 * @return {@code true} always
 */
@Override public boolean add(E element) {
 offer(element);
 return true;
}

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

@Override public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

代码示例来源：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.
 *
 * @return {@code true} always
 */
@Override public boolean add(E element) {
 offer(element);
 return true;
}

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

@CanIgnoreReturnValue
@Override
public boolean addAll(Collection<? extends E> newElements) {
 boolean modified = false;
 for (E element : newElements) {
  offer(element);
  modified = true;
 }
 return modified;
}

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

/**
 * Builds a new min-max priority queue using the previously specified
 * options, and having the given initial elements.
 */
public <T extends B> MinMaxPriorityQueue<T> create(Iterable<? extends T> initialContents) {
  MinMaxPriorityQueue<T> queue = new MinMaxPriorityQueue<T>(
      this, initialQueueSize(expectedSize, maximumSize, initialContents));
  for (T element : initialContents) {
    queue.offer(element);
  }
  return queue;
}

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

private static void insertRandomly(
  ArrayList<Integer> elements, MinMaxPriorityQueue<Integer> q, Random random) {
 while (!elements.isEmpty()) {
  int selectedIndex = random.nextInt(elements.size());
  q.offer(elements.remove(selectedIndex));
 }
}