The tests:

## Code snippets { #code-snippets }

//// tab | Test

   *     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(boolean[] 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;

   *     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(byte[] 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;

import org.apache.maven.model.Site;
import org.codehaus.plexus.util.StringUtils;

/**
 * The domain-specific model merger for the Maven POM, overriding generic code from parent class when necessary with
 * more adapted algorithms.
 *
 * @deprecated use {@code org.apache.maven.impl.model.MavenModelMerger} instead
 */
@Deprecated(since = "4.0.0")
public class MavenModelMerger extends ModelMerger {

    /**

   *     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(char[] 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;

   *     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(short[] 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;

   *     {@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;

   *     {@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;

   *     {@code toIndex > fromIndex}
   * @since 32.0.0
   */
  public static void rotate(long[] 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;

pkg crypto/x509/pkix, method (Name) ToRDNSequence() RDNSequence
pkg crypto/x509/pkix, type AlgorithmIdentifier struct
pkg crypto/x509/pkix, type AlgorithmIdentifier struct, Algorithm asn1.ObjectIdentifier
pkg crypto/x509/pkix, type AlgorithmIdentifier struct, Parameters asn1.RawValue
pkg crypto/x509/pkix, type AttributeTypeAndValue struct