}

            length = (length << 8) + octet;
        } while (++octetsPos < octetsCount);

        if (length >= limit && !isParsing) // after all we must have read at least 1 byte
        {
            throw new IOException("corrupted stream - out of bounds length found: " + length + " >= " + limit);
        }

        return length;
    }

   * with linear probing in its implementation. The returned size is the smallest power of two that
   * can hold setSize elements with the desired load factor. Always returns at least setSize + 2.
   */
  // TODO(cpovirk): Move to Hashing or something, since it's used elsewhere in the Android version.
  static int chooseTableSize(int setSize) {
    setSize = max(setSize, 2);

          include a readable copy of the attribution notices contained
          within such NOTICE file, excluding those notices that do not
          pertain to any part of the Derivative Works, in at least one
          of the following places: within a NOTICE text file distributed
          as part of the Derivative Works; within the Source form or
          documentation, if provided along with the Derivative Works; or,

 * therefore every method of the listener will be called at most once. N.B. The {@link State#FAILED}
 * and {@link State#TERMINATED} states are terminal states, once a service enters either of these
 * states it cannot ever leave them.
 *
 * <p>Implementors of this interface are strongly encouraged to extend one of the abstract classes
 * in this package which implement this interface and make the threading and state management
 * easier.
 *

        // Byte count (2 bytes)
        buffer[53] = 0x00;
        buffer[54] = 0x00;

        // Test decode
        int bytesDecoded = response.decode(buffer, 0);

        // Should decode at least the header
        assertTrue(bytesDecoded > 0);

        // Verify the command was decoded correctly
        assertEquals(ServerMessageBlock.SMB_COM_TRANSACTION2, response.getCommand());
    }

    @Test

// listOnlineDisks - returns
// - a slice of disks where disk having 'older' xl.meta (or nothing)
// are set to nil.
// - latest (in time) of the maximally occurring modTime(s), which has at least quorum occurrences.
func listOnlineDisks(disks []StorageAPI, partsMetadata []FileInfo, errs []error, quorum int) (onlineDisks []StorageAPI, modTime time.Time, etag string) {
	onlineDisks = make([]StorageAPI, len(disks))

                // Exponential backoff with overflow protection
                if (retryDelayMs > 0) {
                    try {
                        // Safe calculation: ensure retryCount is at least 1 for proper exponential backoff
                        int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(1, retryCount));
                        long multiplier = 1L << safeShift;

        return destroyProcess(sessionId, jobProcess);
    }

    /**
     * Checks if any processes are currently running.
     *
     * @return true if at least one process is running, false otherwise
     */
    public boolean isProcessRunning() {
        return !runningProcessMap.isEmpty();
    }

    /**

  fun onePartRequired() {
    assertFailsWith<IllegalStateException> {
      MultipartBody.Builder().build()
    }.also { expected ->
      assertThat(expected.message)
        .isEqualTo("Multipart body must have at least one part.")
    }
  }

  @Test
  fun singlePart() {
    val expected =
      """
      |--123
      |
      |Hello, World!
      |--123--
      |
      """.trimMargin().replace("\n", "\r\n")

      this.elements = elements;
      this.duplicate = duplicate;
    }
  }

  /**
   * @return an array of the proper size with a duplicate element. The size must be at least three.
   */
  protected ArrayWithDuplicate<E> createArrayWithDuplicateElement() {
    E[] elements = createSamplesArray();
    E duplicate = elements[(elements.length / 2) - 1];