*
 * <p><a id="iteration"></a>
 *
 * <p><b>Key-grouped iteration.</b> All view collections follow the same iteration order. In all
 * current implementations, the iteration order always keeps multiple entries with the same key
 * together. Any creation method that would customarily respect insertion order (such as {@link
 * #copyOf(Multimap)}) instead preserves key-grouped order by inserting entries for an existing key

    failover.handleFailure(channel, error);
    
    // Verify channel marked as failed
    assertEquals(ChannelState.FAILED, channel.getState());
    
    // Verify recovery attempted
    Thread.sleep(2000);
    assertTrue(channel.getState() == ChannelState.ESTABLISHED 
        || manager.getChannels().isEmpty());
}
```

### 7.2 Integration Tests
```java
@Test

 *
 * <p><a id="iteration"></a>
 *
 * <p><b>Key-grouped iteration.</b> All view collections follow the same iteration order. In all
 * current implementations, the iteration order always keeps multiple entries with the same key
 * together. Any creation method that would customarily respect insertion order (such as {@link
 * #copyOf(Multimap)}) instead preserves key-grouped order by inserting entries for an existing key

        log.info("Connection lost, waiting for witness notification before retry");
        
        // Wait briefly for witness notification before retrying
        try {
            Thread.sleep(2000);  // 2 second grace period
        } catch (InterruptedException e) {
            Thread.currentThread().interrupt();
        }
    }
    
    // Proceed with normal error handling/retry

        if (effect.shutdownInput) socket.shutdownInput()
        if (effect.shutdownOutput) socket.shutdownOutput()
        if (effect.closeSocket) socket.close()
      }

      Stall -> {
        // Sleep until the socket is closed.
        socket.sleepWhileOpen(TimeUnit.MINUTES.toNanos(60))
        error("expected timeout")
      }
    }

    return true
  }

  @Throws(IOException::class)

    `HandshakeCertificates` holds the TLS certificates required for a TLS handshake. On the server
    it keeps your `HeldCertificate` and its chain. On the client it keeps the root certificates
    that are trusted to sign a server's certificate chain. `HandshakeCertificates` also works with
    mutual TLS where these roles are reversed.

      Object oldValue = ref.get();
      if (oldValue == null) {
        expectedComputations++;
      }
      ref = new WeakReference<>(cache.getUnchecked(1));
      oldValue = null;
      Thread.sleep(i);
      System.gc();
    }
    assertThat(countingLoader.getCount()).isEqualTo(expectedComputations);

    for (int i = 0; i < iterations; i++) {

     * exactly matching hash codes, which would cause construction to take O(n^2), but can't detect
     * e.g. hash codes adversarially designed to go into ascending table locations, which keeps
     * construction O(n) (as desired) but then can have O(n) queries later.
     *
     * <p>If this returns false, then no query can take more than O(log n).
     *

      Object oldValue = ref.get();
      if (oldValue == null) {
        expectedComputations++;
      }
      ref = new WeakReference<>(cache.getUnchecked(1));
      oldValue = null;
      Thread.sleep(i);
      System.gc();
    }
    assertThat(countingLoader.getCount()).isEqualTo(expectedComputations);

    for (int i = 0; i < iterations; i++) {

   * values.length) are all {@code null}.
   */
  @VisibleForTesting transient @Nullable Object @Nullable [] values;

  /**
   * Keeps track of metadata like the number of hash table bits and modifications of this data
   * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note