return 1;
      case 1:
        return n;
      default:
        if (n < factorials.length) {
          return factorials[n] / (factorials[k] * factorials[n - k]);
        } else if (k >= biggestBinomials.length || n > biggestBinomials[k]) {
          return Long.MAX_VALUE;
        } else if (k < biggestSimpleBinomials.length && n <= biggestSimpleBinomials[k]) {
          // guaranteed not to overflow
          long result = n--;

    @Test
    public void testThreadSafety() throws InterruptedException {
        // Test concurrent updates from multiple threads
        Thread[] threads = new Thread[10];

        for (int i = 0; i < threads.length; i++) {
            final int index = i;
            threads[i] = new Thread(() -> {
                for (int j = 0; j < 100; j++) {
                    String name = "file" + index + "_" + j + ".txt";

                // No-op
            }
        };

        // Create multiple threads to store documents
        Thread[] threads = new Thread[10];
        for (int i = 0; i < threads.length; i++) {
            threads[i] = new Thread(() -> {
                for (int j = 0; j < 100; j++) {
                    callback.store(new DataStoreParams(), new HashMap<>());
                }
            });

  @SuppressWarnings({"CollectionSizeTruth", "CollectionContainsTruth"})
  private static void containsExactlySanityCheck(Collection<?> collection, Object... varargs) {
    assertThat(collection.size()).isEqualTo(varargs.length);
    for (Object obj : varargs) {
      assertThat(collection.contains(obj)).isTrue();
    }
    assertThat(ImmutableList.copyOf(collection.iterator())).containsExactlyElementsIn(varargs);
  }

   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
   * all "null" (UNSET).
   *
   * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
   * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
   */

  @SuppressWarnings({"CollectionSizeTruth", "CollectionContainsTruth"})
  private static void containsExactlySanityCheck(Collection<?> collection, Object... varargs) {
    assertThat(collection.size()).isEqualTo(varargs.length);
    for (Object obj : varargs) {
      assertThat(collection.contains(obj)).isTrue();
    }
    assertThat(ImmutableList.copyOf(collection.iterator())).containsExactlyElementsIn(varargs);
  }

                passed = true;
            } else if (passed) {
                if (phase.startsWith(org.apache.maven.api.Lifecycle.AFTER)) {
                    String realPhase = phase.substring(org.apache.maven.api.Lifecycle.AFTER.length());
                    include = mappings.containsKey(org.apache.maven.api.Lifecycle.BEFORE + realPhase);
                } else {
                    include = false;
                }
            }

        }
    }

    private static void validateSynonymString(final FessBaseAction action, final String[] values, final String propertyName,
            final VaErrorHook hook) {
        if (values.length == 0) {
            return;
        }
        for (final String value : values) {
            if (value.indexOf(',') >= 0) {
                action.throwValidationError(messages -> {

        InvalidAccessTokenException exception = new InvalidAccessTokenException("JWT", "Invalid signature");

        StackTraceElement[] stackTrace = exception.getStackTrace();
        assertTrue(stackTrace.length > 0);

        // First element should be from this test method
        StackTraceElement firstElement = stackTrace[0];
        assertEquals(this.getClass().getName(), firstElement.getClassName());

constraints.EAN.message = {item} jest nieprawidłowym kodem kreskowym {type}.
constraints.Email.message = {item} nie jest prawidłowym adresem e-mail.
constraints.Length.message = Długość {item} musi być w zakresie od {min} do {max}.
constraints.LuhnCheck.message = Suma kontrolna Luhn Modulo 11 dla {value} jest nieprawidłowa.