assertThat(mmHeap.peek()).isNull();
    assertThat(mmHeap.poll()).isNull();
  }

  public void testRemove() {
    MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.create();
    mmHeap.addAll(Lists.newArrayList(1, 2, 3, 4, 47, 1, 5, 3, 0));
    assertTrue("Heap is not intact initially", mmHeap.isIntact());
    assertEquals(9, mmHeap.size());
    mmHeap.remove(5);
    assertEquals(8, mmHeap.size());

              @Override
              public Collection<String> create(String[] elements) {
                List<String> unfiltered = new ArrayList<>();
                unfiltered.add("yyy");
                Collections.addAll(unfiltered, elements);
                unfiltered.add("zzz");
                return Collections2.filter(unfiltered, NOT_YYY_ZZZ);
              }
            })
        .named("Collections2.filter")

        final Set<String> candidateFields = new java.util.TreeSet<>();
        candidateFields.addAll(arrayFieldSet);
        candidateFields.addAll(dateFieldSet);
        candidateFields.addAll(integerFieldSet);
        candidateFields.addAll(longFieldSet);
        candidateFields.addAll(floatFieldSet);
        candidateFields.addAll(doubleFieldSet);
        final Map<String, Object> doc = currentForm != null ? currentForm.doc : null;

  static final Iterable<Long> ALL_LONG_CANDIDATES;

  static {
    ImmutableSet.Builder<Long> longValues = ImmutableSet.builder();
    // First add all the integer candidate values.
    longValues.addAll(Iterables.transform(POSITIVE_INTEGER_CANDIDATES, Long::valueOf));
    // Add boundary values manually to avoid over/under flow (this covers 2^N for 31 and 63).

                    fessConfig.getIndexFieldLang());
            // Initialize Set for O(1) lookup performance
            searchFieldSet = new HashSet<>();
            Collections.addAll(searchFieldSet, searchFields);
        }
        if (facetFields == null) {
            facetFields = fessConfig.getQueryAdditionalFacetFields(//
                    fessConfig.getIndexFieldUrl(), //

        ImmutableSortedMultiset.<String>naturalOrder().addAll(a).addAll(b).build();
    assertEquals(HashMultiset.create(asList("a", "b", "b", "b", "c")), multiset);
  }

  public void testBuilderAddAllIterator() {
    Iterator<String> iterator = asList("a", "b", "a", "c").iterator();
    ImmutableSortedMultiset<String> multiset =
        ImmutableSortedMultiset.<String>naturalOrder().addAll(iterator).build();

    for (Range<C> range : ranges) {
      if (!encloses(range)) {
        return false;
      }
    }
    return true;
  }

  @Override
  public void addAll(RangeSet<C> other) {
    addAll(other.asRanges());
  }

  @Override
  public void addAll(Iterable<Range<C>> ranges) {
    for (Range<C> range : ranges) {
      add(range);
    }
  }

  @Override
  public void removeAll(RangeSet<C> other) {

   * Builder#addAll(Iterable)}, with all the performance implications associated with that.
   */
  public static ImmutableDoubleArray copyOf(Iterable<Double> values) {
    if (values instanceof Collection) {
      return copyOf((Collection<Double>) values);
    }
    return builder().addAll(values).build();
  }

  /**

   * Builder#addAll(Iterable)}, with all the performance implications associated with that.
   */
  public static ImmutableIntArray copyOf(Iterable<Integer> values) {
    if (values instanceof Collection) {
      return copyOf((Collection<Integer>) values);
    }
    return builder().addAll(values).build();
  }

  /**

            stageTriggers.triggers.forEach(::buildType)
            subProject(stageProject)

            prevStage = stage
            previousPerformanceTestPasses.addAll(stageProject.performanceTests)
            previousCrossVersionTests.addAll(stageProject.crossVersionTests)
        }

        buildType(GitHubMergeQueueCheckPass(model))

        buildTypesOrder = buildTypes
        subProjectsOrder = subProjects