*     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(float[] array, int distance, int fromIndex, int toIndex) {
    // See Ints.rotate for more details about possible algorithms here.
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    if (array.length <= 1) {
      return;
    }

    int length = toIndex - fromIndex;

    if (this[i] in delimiters) return i
  }
  return endIndex
}

/**
 * Returns the index of the first character in this string that is [delimiter]. Returns [endIndex]
 * if there is no such character.
 */
fun String.delimiterOffset(
  delimiter: Char,
  startIndex: Int = 0,
  endIndex: Int = length,
): Int {
  for (i in startIndex until endIndex) {
    if (this[i] == delimiter) return i

   *     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(double[] array, int distance, int fromIndex, int toIndex) {
    // See Ints.rotate for more details about possible algorithms here.
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    if (array.length <= 1) {
      return;
    }

    int length = toIndex - fromIndex;

¨Versions‘‚¤Type ¥V2ObjÞ ¢IDÄ ¤DDirÄ ÔLã°ê8EÒŸˆ”Ù Sé6¦EcAlgo £EcM £EcN §EcBSizeÒ §EcIndex ¦EcDistš ¨CSumAlgo ¨PartNums‘ ©PartETags‘ ©PartSizes‘Ò 'ªPartASizes‘Ò '¤SizeÒ 'Â¥MTimeÓ ¿W '’žÉ§MetaSys ¼X-Minio-Internal-actual-sizeÄ 141250§MetaUsr‚¤etagÙ"51fe09d68bacc8c5a68a-1¬content-type¸application/octet-streamÎöa‰ 10/xl.meta XL2 Æ b ¨Versions‘‚¤Type ¥V2ObjÞ ¢IDÄ ¤DDirÄ ÔLã°ê8EÒŸˆ”Ù Sé6¦EcAlgo £EcM £EcN §EcBSizeÒ §EcIndex ¦EcDistš ¨CSumAlgo ¨PartNums‘ ©PartETags‘ ©PartSizes‘Ò 'ªPartASizes‘Ò '¤SizeÒ...

      val toIndex = minOf(source.buffer.size, maxByteCount) + 1L
      val boundaryIndex =
        source.indexOf(
          bytes = crlfDashDashBoundary,
          fromIndex = 0L,
          toIndex = toIndex,
        )
      return when {
        boundaryIndex != -1L -> boundaryIndex // We found the boundary.

   * exclusive. This is equivalent to {@code
   * Collections.reverse(Booleans.asList(array).subList(fromIndex, toIndex))}, but is likely to be
   * more efficient.
   *
   * @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
   *     {@code toIndex > fromIndex}
   * @since 23.1
   */

   * exclusive. This is equivalent to {@code
   * Collections.reverse(Booleans.asList(array).subList(fromIndex, toIndex))}, but is likely to be
   * more efficient.
   *
   * @throws IndexOutOfBoundsException if {@code fromIndex < 0}, {@code toIndex > array.length}, or
   *     {@code toIndex > fromIndex}
   * @since 23.1
   */

   * exclusive in descending order.
   *
   * @since 23.1
   */
  public static void sortDescending(char[] array, int fromIndex, int toIndex) {
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    Arrays.sort(array, fromIndex, toIndex);
    reverse(array, fromIndex, toIndex);
  }

  /**

   * exclusive in descending order.
   *
   * @since 23.1
   */
  public static void sortDescending(short[] array, int fromIndex, int toIndex) {
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    Arrays.sort(array, fromIndex, toIndex);
    reverse(array, fromIndex, toIndex);
  }

  /**

   * exclusive in descending order.
   *
   * @since 23.1
   */
  public static void sortDescending(short[] array, int fromIndex, int toIndex) {
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    Arrays.sort(array, fromIndex, toIndex);
    reverse(array, fromIndex, toIndex);
  }

  /**