*
         * @param circuitBreaker the circuit breaker
         * @param fromState previous state
         * @param toState new state
         */
        void onStateChange(SmbCircuitBreaker circuitBreaker, State fromState, State toState);

        /**
         * Called when a request succeeds
         *
         * @param circuitBreaker the circuit breaker
         */

     *
     * @param src
     *            The source object to convert.
     * @return The converted {@link Date}.
     */
    public static Date toDate(final Object src) {
        return toDate(src, null, LocaleUtil.getDefault());
    }

    /**
     * Converts the given object to a {@link Date}.
     *
     * @param src
     *            The source object to convert.

     *
     * @param src
     *            The source object to convert.
     * @return The converted {@link Date}.
     */
    public static Date toDate(final Object src) {
        return toDate(src, null, LocaleUtil.getDefault());
    }

    /**
     * Converts the given object to a {@link Date}.
     *
     * @param src
     *            The source object to convert.

     */
    public static Date toDate(final Object src) {
        return toDate(src, null, LocaleUtil.getDefault());
    }

    /**
     * Converts an object to {@link Date}.
     *
     * @param src the source object
     * @param pattern the pattern string
     * @return the converted {@link Date}
     */
    public static Date toDate(final Object src, final String pattern) {

                }
            }
        }

        // Rotate expired keys
        for (String sessionId : sessionsToRotate) {
            try {
                rotateSessionKey(sessionId);
            } catch (Exception e) {
                log.warn("Failed to auto-rotate key for session: {}", sessionId, e);
            }
        }

        if (!sessionsToRotate.isEmpty()) {

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Longs.asList(array),
   * distance)}, but is considerably faster and avoids allocation and garbage collection.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(long[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array),
   * distance)}, but is somewhat faster.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(boolean[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array),
   * distance)}, but is somewhat faster.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(boolean[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array),
   * distance)}, but is considerably faster and avoids allocation and garbage collection.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(short[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Chars.asList(array),
   * distance)}, but is considerably faster and avoids allocation and garbage collection.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(char[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**