}

    /**
     * Set the key rotation bytes limit
     *
     * @param limit number of bytes to encrypt before rotating keys
     */
    public void setKeyRotationBytesLimit(long limit) {
        this.keyRotationBytesLimit = limit;
    }

    /**
     * Set the key rotation time limit
     *
     * @param limit time in milliseconds before rotating keys
     */

        assertNotNull(encrypted2);

        // Verify rotation occurred by checking metrics
        assertTrue(context.getKeyRotationCount() > 0, "Key rotation should have occurred");

        // Can still encrypt after rotation
        byte[] plaintext3 = "Message after rotation".getBytes();
        byte[] encrypted3 = assertDoesNotThrow(() -> context.encryptMessage(plaintext3, 3L));

                Thread t = new Thread(r, "SecureKeyManager-Rotation");
                t.setDaemon(true);
                return t;
            });
    private java.util.concurrent.ScheduledFuture<?> rotationTask;

    /**
     * Configure key rotation interval
     *
     * @param intervalMillis rotation interval in milliseconds
     */
    public void configureKeyRotation(long intervalMillis) {

    }

    @Test
    public void testMultipleKeyRotations() throws GeneralSecurityException {
        String sessionId = "multi-rotation";
        keyManager.storeSessionKey(sessionId, testKey, "AES");

        // Perform multiple rotations
        for (int i = 1; i <= 5; i++) {
            int version = keyManager.rotateSessionKey(sessionId);
            assertEquals(i, version, "Version should be " + i);

//go:generate msgp -file $GOFILE -unexported

// BatchKeyRotationType defines key rotation type
type BatchKeyRotationType string

const (
	sses3  BatchKeyRotationType = "sse-s3"
	ssekms BatchKeyRotationType = "sse-kms"
)

// BatchJobKeyRotateEncryption defines key rotation encryption options passed
type BatchJobKeyRotateEncryption struct {
	Type       BatchKeyRotationType `yaml:"type" json:"type"`

    for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) {
      char tmp = array[i];
      array[i] = array[j];
      array[j] = tmp;
    }
  }

  /**
   * Performs a right rotation of {@code array} of "distance" places, so that the first element is
   * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance

    for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) {
      short tmp = array[i];
      array[i] = array[j];
      array[j] = tmp;
    }
  }

  /**
   * Performs a right rotation of {@code array} of "distance" places, so that the first element is
   * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance

    for (int i = fromIndex, j = toIndex - 1; i < j; i++, j--) {
      short tmp = array[i];
      array[i] = array[j];
      array[j] = tmp;
    }
  }

  /**
   * Performs a right rotation of {@code array} of "distance" places, so that the first element is
   * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance

    // There are several well-known algorithms for rotating part of an array (or, equivalently,
    // exchanging two blocks of memory). This classic text by Gries and Mills mentions several:
    // https://ecommons.cornell.edu/bitstream/handle/1813/6292/81-452.pdf.
    // (1) "Reversal", the one we have here.
    // (2) "Dolphin". If we're rotating an array a of size n by a distance of d, then element a[0]

    }

    /**
     * Enables garbage collection logging for this job execution.
     * Configures JVM options for comprehensive GC logging with rotation.
     *
     * @return this ExecJob instance for method chaining
     */
    public ExecJob gcLogging() {
        final StringBuilder buf = new StringBuilder(100);