return x.negate();
        }
      };

  /*
   * This list contains values that attempt to provoke overflow in integer operations. It contains
   * positive values on or near 2^N for N near multiples of 8 (near byte boundaries).
   */
  static final ImmutableSet<Integer> POSITIVE_INTEGER_CANDIDATES;

  static final Iterable<Integer> NEGATIVE_INTEGER_CANDIDATES;

      case 2:
        return nums.get(start).multiply(nums.get(start + 1));
      case 3:
        return nums.get(start).multiply(nums.get(start + 1)).multiply(nums.get(start + 2));
      default:
        // Otherwise, split the list in half and recursively do this.
        int m = (end + start) >>> 1;
        return listProduct(nums, start, m).multiply(listProduct(nums, m, end));
    }
  }

  /**

   *
   * <p>This is guaranteed to return zero if the dataset contains only exactly one finite value. It
   * is not guaranteed to return zero when the dataset consists of the same value multiple times,
   * due to numerical errors. However, it is guaranteed never to return a negative result.
   *
   * <h3>Non-finite values</h3>
   *

   *
   * <p>This is guaranteed to return zero if the dataset contains only exactly one finite value. It
   * is not guaranteed to return zero when the dataset consists of the same value multiple times,
   * due to numerical errors. However, it is guaranteed never to return a negative result.
   *
   * <h3>Non-finite values</h3>
   *

        String[] permissions = fessUserBean.getPermissions();
        assertEquals(1, permissions.length);
        assertEquals("read", permissions[0]);

        // Test with multiple permissions
        testUser.setPermissions(new String[] { "read", "write", "delete" });
        permissions = fessUserBean.getPermissions();
        assertEquals(3, permissions.length);

   *         .addAll(SINGLE_DIGIT_PRIMES)
   *         .add(42)
   *         .build();
   * }
   *
   * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build
   * multiple sets in series. Each set is a superset of the set created before it.
   *
   * @since 2.0
   */
  public static final class Builder<E> extends ImmutableSet.Builder<E> {

        assertEquals(1000, result.length());
    }

    public void test_getDetectText_whitespaceNormalization() {
        String text = "Text   with\tmultiple\n\r  spaces";
        String result = languageHelper.getDetectText(text);
        assertEquals("Text with multiple spaces", result);
    }

    public void test_getSupportedLanguage_supported() {
        assertEquals("ja", languageHelper.getSupportedLanguage("ja"));

            assertSame(invertibleCryptographer, invertibles[i]);
            assertSame(oneWayCryptographer, oneWays[i]);
        }
    }

    // Test with multiple providers
    public void test_multipleProviders() {
        // Test that multiple providers can coexist independently
        InvertibleCryptographer inver1 = InvertibleCryptographer.createAesCipher("key1key1key1key1");

        authenticationManager.insert(user);

        assertEquals(1, chain.updateCallCount);
        assertEquals(user, chain.lastUpdatedUser);
    }

    // Test insert with multiple chains
    public void test_insert_multipleChains() {
        User user = createTestUser("testuser");
        TestAuthenticationChain chain1 = new TestAuthenticationChain();

              // It's definitely safe to multiply into numerator and denominator.
              numerator *= n;
              denominator *= i;
              numeratorBits += nBits;
            } else {
              // It might not be safe to multiply into numerator and denominator,
              // so multiply (numerator / denominator) into result.