assertThat(i.next()).isEqualTo(urlA.toString())
    assertThat(i.hasNext()).isTrue()
    assertThat(i.next()).isEqualTo(urlB.toString())
    assertThat(i.hasNext()).isTrue()
    assertThat(i.next()).isEqualTo(urlC.toString())

    // ... and nothing else.
    assertThat(i.hasNext()).isFalse()
    assertFailsWith<NoSuchElementException> {
      i.next()
    }
  }

  @Test

     * @return true if retry should be attempted
     */
    public boolean shouldRetry(int attemptNumber) {
        return retryPolicy.shouldRetry(this, attemptNumber);
    }

    /**
     * Get the delay before next retry
     *
     * @param attemptNumber the current attempt number
     * @return delay in milliseconds
     */
    public long getRetryDelayMs(int attemptNumber) {

     * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
     * array has a smaller element at one index, and then the second array has a smaller element at
     * the next.
     */
    byte[] a0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 99, 15, 16, 17};
    byte[] b0 = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 99, 14, 15, 16, 17};

         * response will not read a batched command and therefore
         * the 'received' member of the response object will not
         * be set to true indicating the send and sendTransaction
         * methods that the next part should be sent. This is a
         * very indirect and simple batching control mechanism.
         */

        if (andx == null || !USE_BATCHING || batchLevel >= getBatchLimit(andx.command)) {

        return closed(set.first(), set.last());
      }
    }
    Iterator<C> valueIterator = values.iterator();
    C min = checkNotNull(valueIterator.next());
    C max = min;
    while (valueIterator.hasNext()) {
      C value = checkNotNull(valueIterator.next());
      min = Ordering.<C>natural().min(min, value);
      max = Ordering.<C>natural().max(max, value);
    }
    return closed(min, max);
  }

    if (map.containsKey(key)) {
      // When a collision happens, the colliding entry is the first entry
      // of the tail map.
      Entry<K, V> previousEntry = map.tailMap(key).entrySet().iterator().next();
      throw new IllegalArgumentException(
          "Duplicate keys in mappings "
              + previousEntry.getKey()
              + "="
              + previousEntry.getValue()
              + " and "

    filtered.put("a", 2);
    filtered.put("b", 4);
    assertEquals(ImmutableMap.of("a", 2, "b", 4), filtered);

    Entry<String, Integer> entry = filtered.entrySet().iterator().next();
    assertThrows(IllegalArgumentException.class, () -> entry.setValue(5));

    assertEquals(ImmutableMap.of("a", 2, "b", 4), filtered);
  }

  public void testFilteredValuesClear() {

    void testGetService() {
        // When
        String service = response.getService();

        // Then
        assertNull(service);
    }

    @Test
    @DisplayName("Should prepare next request correctly when received")
    void testPrepareWhenReceived() throws Exception {
        // Given
        ServerMessageBlock2Request mockNext = mock(ServerMessageBlock2Request.class);

   * ...
   * synchronized (queue) {  // Must synchronize on queue!
   *   Iterator<E> i = queue.iterator(); // Must be in synchronized block
   *   while (i.hasNext()) {
   *     foo(i.next());
   *   }
   * }
   * }
   *
   * <p>Failure to follow this advice may result in non-deterministic behavior.
   *
   * <p>The returned queue will be serializable if the specified queue is serializable.

        // Initial update - should mark as changed
        entry.updateChild(childName, 1024L, 1000L, false, 0x20, 500L, 800L);
        assertTrue(entry.hasChanges());

        // Clear changes to test next scenario
        entry.markComplete();
        assertFalse(entry.hasChanges());

        // Update with same values - should not mark as changed (no actual change)