*
     * @param b the buffer into which the data is read
     * @param off the start offset in the array b at which the data is written
     * @param len the maximum number of bytes to read
     * @return the total number of bytes read into the buffer, or -1 if there is no more data
     * @throws IOException if an I/O error occurs
     */
    public int readDirect(final byte[] b, final int off, int len) throws IOException {

        offset += 2;

        // 4. MaxDataCount (2 bytes)
        int maxDataCount = SMBUtil.readInt2(dst, offset);
        assertTrue(maxDataCount > 0);
        offset += 2;

        // Verify total bytes written
        assertEquals(offset, bytesWritten);
    }

    // Helper methods

    private Object getFieldValue(Object obj, String fieldName) {
        try {

        buffer[bufferIndex + 36] = 0x00; // reserved

        int bytesRead = response.readParameterWordsWireFormat(buffer, bufferIndex);

        // Verify the correct number of bytes were read (37 bytes total)
        assertEquals(37, bytesRead);

        // Verify values through reflection
        Field totalParamField = response.getClass().getSuperclass().getSuperclass().getDeclaredField("totalParameterCount");

        long time = finish - session.getRequest().getStartTime().getTime();

        String wallClock = session.getRequest().getDegreeOfConcurrency() > 1 ? " (Wall Clock)" : "";

        logger.info("Total time:  {}{}", formatDuration(time), wallClock);

        logger.info("Finished at: {}", formatTimestamp(finish));
    }

    @Override
    public void projectSkipped(ExecutionEvent event) {

 * elements. A multiset is also sometimes called a <i>bag</i>.
 *
 * <p>Elements of a multiset that are equal to one another are referred to as <i>occurrences</i> of
 * the same single element. The total number of occurrences of an element in a multiset is called
 * the <i>count</i> of that element (the terms "frequency" and "multiplicity" are equivalent, but

   *
   * @param arrays zero or more {@code int} arrays
   * @return a single array containing all the values from the source arrays, in order
   * @throws IllegalArgumentException if the total number of elements in {@code arrays} does not fit
   *     in an {@code int}
   */
  public static int[] concat(int[]... arrays) {
    long length = 0;
    for (int[] array : arrays) {
      length += array.length;

            assertTrue(successCount.get() > 0, "Some requests should succeed");
            assertEquals(5, rejectedCount.get() + successCount.get(), "Total should be 5");

        } finally {
            backpressureCircuitBreaker.close();
        }
    }

    @Test
    public void testResponseTimeTracking() throws Exception {

			return nil
		}

		disks = disks[:len(disks)-healing] // healing drives are always at the end of the list

		if len(disks) < er.setDriveCount/2 {
			return fmt.Errorf("not enough drives (found=%d, healing=%d, total=%d) are available to heal `%s`", len(disks), healing, er.setDriveCount, tracker.disk.String())
		}

		rand.Shuffle(len(disks), func(i, j int) {
			disks[i], disks[j] = disks[j], disks[i]
		})

    assertThat(inputStream!!.read()).isEqualTo('B'.code)
  }

  /**
   * Throttle the request body by sleeping 500ms after every 3 bytes. With a 6-byte request, this
   * should yield one sleep for a total delay of 500ms.
   */
  @Test
  fun throttleRequest() {
    assumeNotWindows()
    server.enqueue(
      MockResponse
        .Builder()
        .throttleBody(3, 500, TimeUnit.MILLISECONDS)

        final Suggester suggester = Suggester.builder().build(client, "switch-test");
        suggester.createIndexIfNothing();
        Thread.sleep(100);

        // Create additional update index (making 2 total)
        final String updateAlias = suggester.getIndex() + ".update";
        final String extraIndexName = suggester.getIndex() + ".extra";