*/
@ExtendWith(MockitoExtension.class)
public class SmbResourceLocatorTest {

    /**
     * A very small concrete implementation used only by the tests. It parses
     * the URL string and performs minimal validation – just enough to make the
     * happy-path expectations deterministic.
     */
    private static class DummySmbResourceLocator implements SmbResourceLocator {
        private final String urlStr;

        return getCharMappingFile(dictId).map(file -> file.get(id).get());
    }

    /**
     * Stores a character mapping item in the specified dictionary.
     * <p>
     * This method performs either an insert operation (for new items with ID 0)
     * or an update operation (for existing items with non-zero ID) depending on
     * the item's current state.
     * </p>
     *

        resourceManager.registerResource(resource);

        assertFalse(resource.isClosed());

        // Wait for automatic cleanup to kick in
        Thread.sleep(300);

        // Perform cleanup
        resourceManager.performCleanup();

        // Old resource should be auto-closed
        assertTrue(resource.isClosed());
    }

    @Test
    @DisplayName("Test resource statistics")

    void verifyInteractionOrder() throws Exception {
        // Arrange: stub simple returns
        when(handle.hasCapability(anyInt())).thenReturn(true);

        // Act: perform a series of calls to verify order
        handle.ensureDFSResolved();
        handle.hasCapability(7);
        handle.release();

        // Assert: verify they happened in order

    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

    public static final int ERROR_INSUFFICIENT_BUFFER = 0x0000007A;
    /** Operation is not supported */
    public static final int ERROR_NOT_SUPPORTED = 0x00000032;
    /** Access denied to perform the operation */
    public static final int ERROR_ACCESS_DENIED = 0x00000005;
    /** Invalid state for the operation */
    public static final int ERROR_INVALID_STATE = 0x0000139F;

/**
 * SSO (Single Sign-On) action controller.
 *
 * This action handles SSO authentication flows including login, logout, and metadata
 * operations. It coordinates with the SsoManager to perform authentication using
 * configured SSO providers and handles various authentication scenarios including
 * successful login, authentication failures, and redirects.
 */
public class SsoAction extends FessLoginAction {

        }
        if (array[from + 1] > array[to]) {
          swap(array, from + 1, to);
        }
        if (array[from] > array[from + 1]) {
          swap(array, from, from + 1);
        }

        // Perform a partition with the selected median.
        int low = from + 1, high = to; // Indexes for partitioning.
        double partition = array[from + 1]; // Choose partitioning element.
        while (true) {