assertThrows(IllegalArgumentException.class, () -> ImmutableBiMap.copyOf(map));
    assertThat(expected).hasMessageThat().containsMatch("1|2");
  }

  // TODO(b/172823566): Use mainline testToImmutableBiMap once CollectorTester is usable to java7.
  public void testToImmutableBiMap_java7_combine() {
    ImmutableBiMap.Builder<String, Integer> zis =
        ImmutableBiMap.<String, Integer>builder().put("one", 1);

import java.util.Queue;
import java.util.concurrent.Executor;
import java.util.logging.Level;

/**
 * A list of listeners for implementing a concurrency friendly observable object.
 *
 * <p>Listeners are registered once via {@link #addListener} and then may be invoked by {@linkplain
 * #enqueue enqueueing} and then {@linkplain #dispatch dispatching} events.
 *
 * <p>The API of this class is designed to make it easy to achieve the following properties

        assertEquals(customTree, typedResult, "Should maintain type safety");
    }

    /**
     * Test for close() idempotency.
     * Verifies that calling close multiple times has the same effect as calling it once.
     */
    @Test
    void testClose_idempotency() {
        // Mock a tree that tracks close state
        SmbTree idempotentTree = mock(SmbTree.class);
        doNothing().when(idempotentTree).close();

	doneCh := make(chan error, 1)
	defer xioutil.SafeClose(doneCh)

	// Save rebalance.bin periodically.
	go func() {
		// Update rebalance.bin periodically once every 5-10s, chosen randomly
		// to avoid multiple pool leaders herding to update around the same
		// time.
		r := rand.New(rand.NewSource(time.Now().UnixNano()))
		randSleepFor := func() time.Duration {

   * may not occur at all. However, despite these limitations,
   * observed contention rates are typically low in these cases.
   *
   * It is possible for a Cell to become unused when threads that
   * once hashed to it terminate, as well as in the case where
   * doubling the table causes no thread to hash to it under
   * expanded mask.  We do not try to detect or remove such cells,

   * @return a long of a concatenated 8 bytes
   */
  static long load64Safely(byte[] input, int offset, int length) {
    long result = 0;
    // Due to the way we shift, we can stop iterating once we've run out of data, the rest
    // of the result already being filled with zeros.

    // This loop is critical to performance, so please check HashBenchmark if altering it.
    int limit = min(length, 8);

    void testHasMoreElements() {
        // Initially should have more elements if error code is 0
        assertTrue(response.hasMoreElements());

        // After calling nextElement once, isPrimary becomes false but hasMore is still true initially
        response.nextElement();

        // Can still have more elements
        assertTrue(response.hasMoreElements());
    }

    @Test

	modTimes = bootModtimes(len(partsMetadata))
	for index, metadata := range partsMetadata {
		if errs[index] != nil {
			continue
		}
		// Once the file is found, save the uuid saved on disk.
		modTimes[index] = metadata.ModTime
	}
	return modTimes
}

func filterOnlineDisksInplace(fi FileInfo, partsMetadata []FileInfo, onlineDisks []StorageAPI) {

        assertEquals("keep1/", it.next().getName());
        assertTrue(it.hasNext());
        assertEquals("keep2/", it.next().getName());
        assertFalse(it.hasNext());

        // Verify filter called once per entry
        verify(filter, times(3)).accept(any());
    }

    @Test
    @DisplayName("Filter throws CIFSException: entry is skipped and iteration continues")

        when(cfg.getBufferCacheSize()).thenReturn(2);
        when(cfg.getMaximumBufferSize()).thenReturn(5);

        BufferCacheImpl impl = new BufferCacheImpl(cfg);

        // Verify interactions happen exactly once during construction
        verify(cfg, times(1)).getBufferCacheSize();
        verify(cfg, times(1)).getMaximumBufferSize();
        verifyNoMoreInteractions(cfg);