// Add defensive null/blank checks
        if (StringUtil.isBlank(username) || StringUtil.isBlank(password)) {
            logger.warn("Cannot change password: username or password is blank");
            return false;
        }

        if (!fessConfig.isLdapAdminEnabled(username)) {
            if (logger.isDebugEnabled()) {

    (
        new RuntimePermission("modifyThread"),
        new RuntimePermission("getClassLoader"),
        new RuntimePermission("setContextClassLoader"),
        // Permissions needed to change permissions!
        new SecurityPermission("getPolicy"),
        new SecurityPermission("setPolicy"),
        new RuntimePermission("setSecurityManager"),
        // Permissions needed by the junit test harness

    successor(a, b);
    successor(b, c);
  }

  /*
   * TODO(jlevy): Decide whether entrySet() should return entries with an equals() method that
   * calls the comparator to compare the two keys. If that change is made,
   * AbstractMultiset.equals() can simply check whether two multisets have equal entry sets.
   */

  /**
   * @serialData the comparator, the number of distinct elements, the first element, its count, the

    return (Queue) DISCARDING_QUEUE;
  }

  /*
   * Note: All of this duplicate code sucks, but it saves a lot of memory. If only Java had mixins!
   * To maintain this code, make a change for the strong reference type. Then, cut and paste, and
   * replace "Strong" with "Soft" or "Weak" within the pasted text. The primary difference is that

    protected String directoryCacheScope = "IMMEDIATE_CHILDREN";
    /**
     * Directory cache timeout in milliseconds
     */
    protected long directoryCacheTimeout = 30000L;
    /**
     * Whether directory change notifications are enabled for cache invalidation
     */
    protected boolean directoryNotificationsEnabled = true;
    /**
     * Maximum number of cached directory entries
     */

 *
 * Disclaimer: Part of the reason that callers are so well adapted to `Function<A, B>` may be that
 * that is how the signature looked even prior to this comment! So naturally any change can break
 * existing users, but it can't *fix* existing users because any users who needed
 * `Function<@Nullable A, @Nullable B>` already had to find a workaround. Still, there is a *ton* of

    Builder<String, Integer> builder =
        new Builder<String, Integer>()
            .put("one", 1)
            .put("one", 1); // throwing on this line might be better but it's too late to change

    assertThrows(IllegalArgumentException.class, () -> builder.buildOrThrow());
  }

  public void testBuildKeepingLast_allowsOverwrite() {
    Builder<Integer, String> builder =

      strategyOrdinal = din.readByte();
      numHashFunctions = toUnsignedInt(din.readByte());
      dataLength = din.readInt();

      /*
       * We document in BloomFilterStrategies that we must not change the ordering, and we have a
       * test that verifies that we don't do so.
       */
      @SuppressWarnings("EnumOrdinal")
      Strategy strategy = BloomFilterStrategies.values()[strategyOrdinal];

   * {@code iterator()} call into a call on {@code listIterator(int)}. This is fine because the
   * behavior is clearly documented so it's not expected to change.
   */
  public void testTransformedSequentialIterationUsesBackingListIterationOnly() {
    List<Integer> randomAccessList = new ArrayList<>(SOME_SEQUENTIAL_LIST);

    successor(a, b);
    successor(b, c);
  }

  /*
   * TODO(jlevy): Decide whether entrySet() should return entries with an equals() method that
   * calls the comparator to compare the two keys. If that change is made,
   * AbstractMultiset.equals() can simply check whether two multisets have equal entry sets.
   */

  /**
   * @serialData the comparator, the number of distinct elements, the first element, its count, the