} catch (CIFSException e) {
                    throw new RuntimeException(e);
                }
            });
        }

        long endTime = System.currentTimeMillis();
        long duration = endTime - startTime;

        // Then - should complete quickly (this is more of a performance indicator)

 * when the specified user does not exist in the system.
 */
public class FessUserNotFoundException extends FessSystemException {

    /** Serial version UID for serialization compatibility */
    private static final long serialVersionUID = 1L;

    /**
     * Constructs a new FessUserNotFoundException with the specified username.
     *
     * @param username the username that was not found
     */

 */
package org.codelibs.fess.exception;

/**
 * An exception thrown when an LDAP operation fails.
 */
public class LdapOperationException extends FessSystemException {

    private static final long serialVersionUID = 1L;

    /**
     * Constructs a new LDAP operation exception with the specified detail message and cause.
     *
     * @param message The detail message.
     * @param cause The cause.
     */

package org.codelibs.core.exception;

/**
 * Exception that wraps {@link IllegalStateException}.
 *
 * @author wyukawa
 */
public class ClIllegalStateException extends IllegalStateException {

    private static final long serialVersionUID = -2154525994315946504L;

    /**
     * Creates a {@link ClIllegalStateException}.
     */
    public ClIllegalStateException() {
        super();
    }

    /**

/**
 * Exception that wraps {@link InvocationTargetException}.
 *
 * @author higa
 */
public class InvocationTargetRuntimeException extends ClRuntimeException {

    private static final long serialVersionUID = 7760491787158046906L;

    /**
     * The target class.
     */
    private final Class<?> targetClass;

    /**
     * Creates a {@link InvocationTargetRuntimeException}.
     *

   * Returns a hash function implementing the <a href="https://131002.net/siphash/">64-bit
   * SipHash-2-4 algorithm</a> using the given seed.
   *
   * @since 15.0
   */
  public static HashFunction sipHash24(long k0, long k1) {
    return new SipHashFunction(2, 4, k0, k1);
  }

  /**
   * Returns a hash function implementing the MD5 hash algorithm (128 hash bits).
   *

    assertThat(dim1 * dim2).isAtLeast(0);
    testConcatOverflow(dim1, dim2);
  }

  private static void testConcatOverflow(int arraysDim1, int arraysDim2) {
    assertThat((long) arraysDim1 * arraysDim2).isNotEqualTo((long) (arraysDim1 * arraysDim2));

    byte[][] arrays = new byte[arraysDim1][];
    // it's shared to avoid using too much memory in tests
    byte[] sharedArray = new byte[arraysDim2];

      return columnKey;
    }

    @Override
    @ParametricNullness
    public V getValue() {
      return value;
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  abstract static class AbstractCell<
          R extends @Nullable Object, C extends @Nullable Object, V extends @Nullable Object>
      implements Cell<R, C, V> {

    }

    public void test_exceptionWithLongMessage() {
        // Test with very long message
        int statusCode = 413;
        StringBuilder longMessage = new StringBuilder();
        for (int i = 0; i < 1000; i++) {
            longMessage.append("Very long error message content. ");
        }
        String message = longMessage.toString();

   * This implementation requires O(|N|) time. Classes extending this one may manually keep track of
   * the number of edges as the graph is updated, and override this method for better performance.
   */
  protected long edgeCount() {
    long degreeSum = 0L;
    for (N node : nodes()) {
      degreeSum += degree(node);
    }
    // According to the degree sum formula, this is equal to twice the number of edges.
    checkState((degreeSum & 1) == 0);