}
  }

  private void recurse(int level) {
    // We're going to reuse the stimuli array 3^steps times by overwriting it
    // in a recursive loop.  Sneaky.
    if (level == stimuli.length) {
      // We've filled the array.
      compareResultsForThisListOfStimuli();
    } else {
      // Keep recursing to fill the array.
      for (Stimulus<E, ? super I> stimulus : getStimulusValues()) {
        stimuli[level] = stimulus;

  }

  /**
   * Each instance of MinMaxPriorityQueue encapsulates two instances of Heap: a min-heap and a
   * max-heap. Conceptually, these might each have their own array for storage, but for efficiency's
   * sake they are stored interleaved on alternate heap levels in the same array (MMPQ.queue).
   */
  @WeakOuter
  private final class Heap {
    final Ordering<E> ordering;

    void resolveSids_invalidInputs() throws Exception {
        SIDCacheImpl cache = new SIDCacheImpl(mock(CIFSContext.class));
        CIFSContext ctx = mock(CIFSContext.class);

        // Null sids array -> NPE
        assertThrows(NullPointerException.class, () -> cache.resolveSids(ctx, "server", null, 0, 1));

        // Bad offset/length leads to ArrayIndexOutOfBoundsException

        this.maxReceiveSize = RdmaCapabilities.DEFAULT_MAX_RECEIVE_SIZE;
        this.maxFragmentedSize = RdmaCapabilities.DEFAULT_MAX_FRAGMENTED_SIZE;
    }

    /**
     * Decode from byte array
     *
     * @param data source data
     * @param offset starting offset
     * @return decoded response
     */
    public static SmbDirectNegotiateResponse decode(byte[] data, int offset) {

// Execute the operation defined by 'op' and return handles to computed
// tensors in `retvals`.
//
// 'retvals' must point to a pre-allocated array of TFE_TensorHandle* and
// '*num_retvals' should be set to the size of this array. It is an error if
// the size of 'retvals' is less than the number of outputs. This call sets
// *num_retvals to the number of outputs.
//

        this.ptype = 0;
        this.flags = DCERPC_FIRST_FRAG | DCERPC_LAST_FRAG;
    }

    /**
     * Returns the DFS root entries retrieved from the enumeration.
     *
     * @return an array of FileEntry objects representing the DFS roots
     */
    public FileEntry[] getEntries() {
        final netdfs.DfsEnumArray200 a200 = (netdfs.DfsEnumArray200) this.info.e;

        // Expected size: 24 (fixed) + 2 * 1
        assertEquals(26, request.size());
    }

    @Test
    @DisplayName("Test size calculation with empty dialects array")
    void testSizeWithEmptyDialects() {
        int[] emptyDialects = new int[0];
        ValidateNegotiateInfoRequest request =

   * unknown.
   */
  abstract fun contentLength(): Long

  fun byteStream(): InputStream = source().inputStream()

  abstract fun source(): BufferedSource

  /**
   * Returns the response as a byte array.
   *
   * This method loads entire response body into memory. If the response body is very large this
   * may trigger an [OutOfMemoryError]. Prefer to stream the response body if this is a
   * possibility for your response.

        assertTrue(result.contains("dataLength=1024"));
        assertTrue(result.contains("dataOffset=54"));
    }

    // Helper method to write a 2-byte integer to a byte array
    private void writeInt2(int val, byte[] dst, int dstIndex) {
        dst[dstIndex] = (byte) val;
        dst[dstIndex + 1] = (byte) (val >> 8);
    }

  static <T extends @Nullable Object> T[] toArray(Iterable<? extends T> iterable, T[] array) {
    Collection<? extends T> collection = castOrCopyToCollection(iterable);
    return collection.toArray(array);
  }

  /**
   * Copies an iterable's elements into an array.
   *
   * @param iterable the iterable to copy
   * @return a newly-allocated array into which all the elements of the iterable have been copied
   */