*       hunt through classes like {@link Arrays} and {@link Ints} for them.
 *   <li>Supports a copy-free {@link #subArray} view, so methods that accept this type don't need to
 *       add overloads that accept start and end indexes.
 *   <li>Can be streamed without "breaking the chain": {@code foo.getBarInts().stream()...}.
 *   <li>Access to all collection-based utilities via {@link #asList} (though at the cost of

        return crawlingConfigMap.get(sessionCountId);
    }

    /**
     * Retrieves all available web crawling configurations.
     * This is a convenience method that calls the overloaded version with default parameters
     * (withLabelType=true, withRoleType=true, available=true, idList=null).
     *
     * @return a list of all available WebConfig objects
     */

    assertThat(expected).hasMessageThat().contains("connected");

    // adjacent below
    assertEquals(Range.closedOpen(4, 4), range.intersection(Range.closedOpen(2, 4)));

    // overlap below
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(2, 6)));

    // enclosed with same start
    assertEquals(Range.closed(4, 6), range.intersection(Range.closed(4, 6)));

// HardLimitReader returns a Reader that reads from r
// but returns an error if the source provides more data than allowed.
// This means the source *will* be overread unless EOF is returned prior.
// The underlying implementation is a *HardLimitedReader.
// This will ensure that at most n bytes are returned and EOF is reached.

    private final List<EventSpy> eventSpies;

    @Inject
    public EventSpyDispatcher(List<EventSpy> eventSpies) {
        // make copy to get rid of needless overhead for dynamic lookups
        this.eventSpies = new ArrayList<>(eventSpies);
    }

    public ExecutionListener chainListener(ExecutionListener listener) {
        if (eventSpies.isEmpty()) {
            return listener;

                    Set.of() // errors
                    );

            UpgradeResult result2 = new UpgradeResult(
                    Set.of(pom1), // processed (overlap)
                    Set.of(pom1, pom2), // modified (overlap + new)
                    Set.of() // errors
                    );

            UpgradeResult merged = result1.merge(result2);

 *
 * @author David Richter
 */
@NullUnmarked
public class IteratorBenchmark {
  @Param({"0", "1", "16", "256", "4096", "65536"})
  int size;

  // use concrete classes to remove any possible polymorphic overhead?
  Object[] array;
  ArrayList<Object> arrayList;
  LinkedList<Object> linkedList;

  @BeforeExperiment
  void setUp() {
    array = new Object[size];
    arrayList = Lists.newArrayListWithCapacity(size);

   * intended to be used as a metric: smaller headers are more efficient to encode and transmit.
   */
  fun byteCount(): Long {
    // Each header name has 2 bytes of overhead for ': ' and every header value has 2 bytes of
    // overhead for '\r\n'.
    var result = (namesAndValues.size * 2).toLong()

    for (i in 0 until namesAndValues.size) {
      result += namesAndValues[i].length.toLong()
    }

        assertTrue(response instanceof ServerMessageBlock2);
    }

    @Test
    @DisplayName("Test OVERHEAD constant value")
    void testOverheadConstant() {
        assertEquals(72, Smb2QueryDirectoryResponse.OVERHEAD);
        assertEquals(Smb2Constants.SMB2_HEADER_LENGTH + 8, Smb2QueryDirectoryResponse.OVERHEAD);
    }

    @Test
    @DisplayName("Test readBytesWireFormat with buffer boundary conditions")

import com.google.common.base.Function;
import java.util.ListIterator;
import org.jspecify.annotations.Nullable;

/**
 * An iterator that transforms a backing list iterator; for internal use. This avoids the object
 * overhead of constructing a {@link Function} for internal methods.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
abstract class TransformedListIterator<F extends @Nullable Object, T extends @Nullable Object>