* Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}.
   *
   * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
   * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code
   * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable}
   * is empty.
   *

    assertThat(callCount.get()).isEqualTo(1);
    for (int i = 0; i < count; i++) {
      assertThat(result.get(i)).isInstanceOf(InvalidCacheLoadException.class);
    }

    // subsequent calls should call the loader again, not get the old exception
    assertThrows(InvalidCacheLoadException.class, () -> cache.getUnchecked("bar"));
    assertThat(callCount.get()).isEqualTo(2);
  }

  /**

                 * be cached and cause other types to fail even though they may
                 * not be the authority for the name. For example, if a WINS lookup
                 * for FOO fails and caches unknownAddress for FOO, a subsequent
                 * lookup for FOO using BCAST should not fail because of that
                 * name cached from WINS.
                 *
                 * So, here we apply the source addresses hashCode to each name to

            assertEquals(1000L * 4 * 1024, fileFsSizeInfo.getFree());
            assertEquals(1000L * 4 * 1024, fileFsSizeInfo.getFree());
        }

        @Test
        @DisplayName("Should update state on subsequent decode calls")
        void shouldUpdateStateOnSubsequentDecodeCalls() throws SMBProtocolDecodingException {
            // Given - first decode
            ByteBuffer buffer1 = ByteBuffer.allocate(24);

   *     by startup time.
   * @since 33.4.0 (but since 31.0 in the JRE flavor)
   */
  @J2ObjCIncompatible
  // If users use this when they shouldn't, we hope that NewApi will catch subsequent Duration calls
  @IgnoreJRERequirement
  public ImmutableMap<Service, Duration> startupDurations() {
    return ImmutableMap.copyOf(

    assertThat(callCount.get()).isEqualTo(1);
    for (int i = 0; i < count; i++) {
      assertThat(result.get(i)).isInstanceOf(InvalidCacheLoadException.class);
    }

    // subsequent calls should call the loader again, not get the old exception
    assertThrows(InvalidCacheLoadException.class, () -> cache.getUnchecked("bar"));
    assertThat(callCount.get()).isEqualTo(2);
  }

  /**

        }
    }

    @Nested
    @DisplayName("Multiple Read Operations Tests")
    class MultipleReadOperationsTests {

        @Test
        @DisplayName("Should update fields correctly on subsequent reads")
        void testMultipleReads() throws SMBProtocolDecodingException {
            // First read
            byte[] buffer1 = new byte[60];
            SMBUtil.writeInt2(60, buffer1, 0);

  /**
   * Gets a {@code Throwable} cause chain as a list. The first entry in the list will be {@code
   * throwable} followed by its cause hierarchy. Note that this is a snapshot of the cause chain and
   * will not reflect any subsequent changes to the cause chain.
   *
   * <p>Here's an example of how it can be used to find specific types of exceptions in the cause
   * chain:
   *
   * <pre>

   * "libcore.io.DiskLruCache", the disk cache's version, the application's version, the value
   * count, and a blank line.
   *
   * Each of the subsequent lines in the file is a record of the state of a cache entry. Each line
   * contains space-separated values: a state, a key, and optional state-specific values.
   *

     *
     * <ul>
     *   <li>If this field's value == currentThread, we know that it's up to date, because write
     *       operations in a thread always happen-before subsequent read operations in the same
     *       thread
     *   <li>If this field's value == null because of unsafe publication, we know that it isn't the