frequency.set(0);
    }
    backingMap.clear();
    size = 0L;
  }

  @Override
  int distinctElements() {
    return backingMap.size();
  }

  // Optimizations - Query Operations

  @Override
  public int size() {
    return Ints.saturatedCast(size);
  }

  @Override
  public Iterator<E> iterator() {
    return new MapBasedMultisetIterator();

   * them until they are needed.  When there is no contention, all
   * updates are made to the base field.  Upon first contention (a
   * failed CAS on base update), the table is initialized to size 2.
   * The table size is doubled upon further contention until
   * reaching the nearest power of two greater than or equal to the
   * number of CPUS. Table slots remain empty (null) until they are
   * needed.
   *

        super();
    }

    // `size` is an alias of `num`.
    // `size` is prepared to be compatible with other Admin APIs
    /** Number of search results to retrieve (alias for num) */
    @ValidateTypeFailure
    public Integer size;

    @Override
    public void initialize() {
        if (size != null) {
            num = num == null || num < size ? size : num;
        }
        super.initialize();
    }

        assertEquals(3, events.size());
        assertEquals("chunk:test content:false", events.get(2));

        callback.onChunk("final content", true);
        assertEquals(4, events.size());
        assertEquals("chunk:final content:true", events.get(3));

        // Test onError
        callback.onError(ChatPhaseCallback.PHASE_SEARCH, "Search failed");
        assertEquals(5, events.size());

        assertTrue(result.isHasRelevantResults());
        assertEquals(1, result.getRelevantDocIds().size());
        assertEquals("doc1", result.getRelevantDocIds().get(0));
        assertEquals(1, result.getRelevantIndexes().size());
        assertEquals(Integer.valueOf(1), result.getRelevantIndexes().get(0));
    }

    @Test
    public void test_withRelevantDocs_emptyLists() {

            return channel.map(mode, 0, channel.size());
        } catch (final IOException e) {
            throw new IORuntimeException(e);
        }
    }

    /**
     * Returns the size of the file.
     *
     * @param channel
     *            The file channel. Must not be {@literal null}.
     * @return The size of the file.
     */
    public static long size(final FileChannel channel) {

        BoolQueryBuilder boolResult = (BoolQueryBuilder) result;
        assertTrue(boolResult.hasClauses());
        assertEquals(1, boolResult.must().size());
        assertEquals(1, boolResult.should().size());
        assertEquals(1, boolResult.mustNot().size());
    }

    // Test convertBooleanQuery with empty BooleanQuery
    @Test
    public void test_convertBooleanQuery_withEmptyQuery() {

   * size() as a hint only.
   *
   * @param delta the difference between the true size of the collection and the values returned by
   *     the size method
   */
  public static <T extends @Nullable Object> Collection<T> misleadingSizeCollection(int delta) {
    // It would be nice to be able to return a real concurrent
    // collection like ConcurrentLinkedQueue, so that e.g. concurrent

  }

  private static <K, V> ImmutableMap<K, V> fromEntryList(
      boolean throwIfDuplicateKeys, Collection<? extends Entry<? extends K, ? extends V>> entries) {
    int size = entries.size();
    switch (size) {
      case 0:
        return of();
      case 1:
        Entry<? extends K, ? extends V> entry = getOnlyElement(entries);
        return of((K) entry.getKey(), (V) entry.getValue());

    return asList().iterator();
  }

  @Override
  public Spliterator<E> spliterator() {
    return CollectSpliterators.indexed(size(), SPLITERATOR_CHARACTERISTICS, this::get);
  }

  @Override
  public void forEach(Consumer<? super E> consumer) {
    checkNotNull(consumer);
    int n = size();
    for (int i = 0; i < n; i++) {
      consumer.accept(get(i));
    }
  }

  @Override
  @GwtIncompatible