Arrays.sort(entries, DecreasingCount.INSTANCE);
    return ImmutableMultiset.copyFromEntries(asList(entries));
  }

  private static final class DecreasingCount implements Comparator<Entry<?>> {
    static final Comparator<Entry<?>> INSTANCE = new DecreasingCount();

    @Override
    public int compare(Entry<?> entry1, Entry<?> entry2) {

            return backoffMultiplier;
        }

        public boolean isExponentialBackoff() {
            return exponentialBackoff;
        }
    }

    // Instance fields
    private final ErrorCode errorCode;
    private final RetryPolicy retryPolicy;
    private final Map<String, Object> context;
    private final long operationStartTime;
    private final String operationName;

        // Verify we can change the subcommand
        response.setSubCommand((byte) 0xFF);
        assertEquals((byte) 0xFF, response.getSubCommand());

        // But creating a new instance should have the correct subcommand
        Trans2SetFileInformationResponse newResponse = new Trans2SetFileInformationResponse(config);
        assertEquals(SmbComTransaction.TRANS2_SET_FILE_INFORMATION, newResponse.getSubCommand());

    return CollectCollectors.toImmutableRangeMap(keyFunction, valueFunction);
  }

  /**
   * Returns an empty immutable range map.
   *
   * <p><b>Performance note:</b> the instance returned is a singleton.
   */
  @SuppressWarnings("unchecked")
  public static <K extends Comparable<?>, V> ImmutableRangeMap<K, V> of() {
    return (ImmutableRangeMap<K, V>) EMPTY;
  }

 * This class provides functionality to start, stop, and manage external processes
 * such as crawler processes, with proper resource cleanup and lifecycle management.
 */
public class ProcessHelper {
    /** Logger instance for this class */
    private static final Logger logger = LogManager.getLogger(ProcessHelper.class);

    /** Map of running processes indexed by session ID */

  /**
   * 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
   * + 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.
   *

import jakarta.servlet.ServletContext;
import jakarta.servlet.ServletException;
import jakarta.servlet.http.HttpServletRequest;

/**
 * The handler of multipart request (fileupload request). <br>
 * This instance is created per one multipart request.
 * @author modified by jflute (originated in Seasar)
 */
public class FessMultipartRequestHandler implements MultipartRequestHandler {

@ExtendWith(MockitoExtension.class)
class SmbEnumerationUtilTest {

    @Mock
    SmbFilenameFilter fnf;

    @Mock
    SmbFileFilter ff;

    // Utility to create a private inner class instance reflectively
    private static Object newPrivateInner(String simpleName, Class<?>[] paramTypes, Object... args) {
        try {
            Class<?> cls = Class.forName("jcifs.smb.SmbEnumerationUtil$" + simpleName);

  }

  private static void assertFreshInstance(Class<?> type, int instances) {
    assertFreshInstance(TypeToken.of(type), instances);
  }

  private static void assertFreshInstance(TypeToken<?> type, int instances) {
    FreshValueGenerator generator = new FreshValueGenerator();
    EqualsTester tester = new EqualsTester();
    for (int i = 0; i < instances; i++) {
      tester.addEqualityGroup(generator.generateFresh(type));

   * Arrays::compareUnsigned}.
   */
  public static Comparator<long[]> lexicographicalComparator() {
    return LexicographicalComparator.INSTANCE;
  }

  enum LexicographicalComparator implements Comparator<long[]> {
    INSTANCE;

    @Override
    public int compare(long[] left, long[] right) {
      int minLength = Math.min(left.length, right.length);