authenticationManager.addChain(chain1);
        authenticationManager.addChain(chain2);
        authenticationManager.addChain(chain3);

        // Verify all chains were added by testing their effect
        User user = createTestUser("testuser");
        authenticationManager.insert(user);

        assertEquals(1, chain1.updateCallCount);
        assertEquals(1, chain2.updateCallCount);

  }

  @Test fun ipv6AddressMalformed() {
    val cookie = parse("http://[::1]/".toHttpUrl(), "a=b; domain=::2::2")
    assertThat(cookie!!.domain).isEqualTo("::1")
  }

  /**
   * These public suffixes were selected by inspecting the publicsuffix.org list. It's possible they
   * may change in the future. If this test begins to fail, please double check they are still
   * present in the public suffix list.
   */

 *
 * Web sockets may fail due to HTTP upgrade problems, connectivity problems, or if either peer
 * chooses to short-circuit the graceful shutdown process:
 *
 *  * **Canceled:** the web socket connection failed. Messages that were successfully enqueued by
 *    either peer may not have been transmitted to the other.
 *
 * Note that the state progression is independent for each peer. Arriving at a gracefully-closed

 *
 * <p><b>Warning:</b> Chunks of data that are put into the {@link Hasher} are not delimited. The
 * resulting {@link HashCode} is dependent only on the bytes inserted, and the order in which they
 * were inserted, not how those bytes were chunked into discrete put() operations. For example, the
 * following three expressions all generate colliding hash codes:
 *
 * {@snippet :
 * newHasher().putByte(b1).putByte(b2).putByte(b3).hash()

     * @throws IllegalArgumentException if duplicate keys or values were added
     */
    @Override
    public ImmutableBiMap<K, V> build() {
      return buildOrThrow();
    }

    /**
     * Returns a newly-created immutable bimap, or throws an exception if any key or value was added
     * more than once. The iteration order of the returned bimap is the order in which entries were

      value.updateTimestamp();
      return value.getValue();
    } else {
      statsCounter.recordEviction();
      statsCounter.recordMisses(1);
      // `key` was in the cache, so it's a K.
      // (Or it's a weird case like a LinkedList in a Cache<ArrayList, ...>, but *shrug*.)
      @SuppressWarnings("unchecked")
      K castKey = (K) key;
      alertListenerIfPresent(castKey, value.getValue(), RemovalCause.EXPIRED);

        PhraseQuery.Builder builder = new PhraseQuery.Builder();
        String[] words = { "this", "is", "a", "very", "long", "phrase", "query" };
        for (String word : words) {
            builder.add(new Term(Constants.DEFAULT_FIELD, word));
        }
        PhraseQuery phraseQuery = builder.build();

        QueryContext context = new QueryContext("test", false);

@GwtCompatible
final class AllEqualOrdering extends Ordering<@Nullable Object> implements Serializable {
  static final AllEqualOrdering INSTANCE = new AllEqualOrdering();

  @Override
  @SuppressWarnings("UnusedVariable") // intentionally weird Comparator
  public int compare(@Nullable Object left, @Nullable Object right) {
    return 0;
  }

  @Override
  public <E extends @Nullable Object> List<E> sortedCopy(Iterable<E> iterable) {

     */
    @Required
    public String dictId;

    /**
     * The multipart file containing the Kuromoji user dictionary to be uploaded.
     * This file should be in the Kuromoji user dictionary format containing custom word definitions.
     */
    @Required
    public MultipartFormFile kuromojiFile;

    /**
     * Default constructor for UploadForm.
     * Creates a new instance with default values.
     */

    }

    /** Dictionary identifier */
    @Required
    public String dictId;

    /** CRUD operation mode (CREATE, EDIT, etc.) */
    @ValidateTypeFailure
    public Integer crudMode;

    /** Word or phrase to be protected from analysis */
    @Required
    @Size(max = 1000)
    public String input;

    /**
     * Initializes the form with default values for creating a new protected words entry.
     */