*/
  private static final int MAX_HASH_BUCKET_LENGTH = 9;

  // See CompactHashMap for a detailed description of how the following fields work. That
  // description talks about `keys`, `values`, and `entries`; here the `keys` and `values` arrays
  // are replaced by a single `elements` array but everything else works similarly.

  /**
   * The hashtable object. This can be either:
   *
   * <ul>

    Object key = new Object();
    Object value = new Object();
    LoadingCache<Object, Object> cache =
        builder.build(CacheLoader.from(Suppliers.ofInstance(value)));
    assertThat(cache.getUnchecked(key)).isSameInstanceAs(value);
    assertThat(cache.size()).isEqualTo(0);
    assertThat(cache.asMap().containsKey(key)).isFalse();
  }

     * .
     */
    @Test
    public void testIsNotEmptyMapOfQQ() {
        final HashMap<String, String> map = new HashMap<String, String>();
        map.put("key", "value");
        assertThat(CollectionsUtil.isNotEmpty(map), is(true));
    }

        return doGetConditionQuery();
    }

    // ===================================================================================
    //                                                                         Primary Key
    //                                                                         ===========
    public ScheduledJobCB acceptPK(String id) {
        assertObjectNotNull("id", id);
        BsScheduledJobCB cb = this;

        return doGetConditionQuery();
    }

    // ===================================================================================
    //                                                                         Primary Key
    //                                                                         ===========
    public WebAuthenticationCB acceptPK(String id) {
        assertObjectNotNull("id", id);
        BsWebAuthenticationCB cb = this;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import org.jspecify.annotations.Nullable;

/**
 * Multiset implementation that uses hashing for key and entry access.
 *
 * @author Kevin Bourrillion
 * @author Jared Levy
 * @since 2.0
 */
@GwtCompatible
public final class HashMultiset<E extends @Nullable Object> extends AbstractMapBasedMultiset<E> {

      for (Object o : entries) {
        @SuppressWarnings("unchecked")
        Multiset.Entry<E> entry = (Entry<E>) o;
        checkArgument(
            elements.add(entry.getElement()), "Duplicate keys not allowed in EntrySetGenerator");
        for (int i = 0; i < entry.getCount(); i++) {
          contents.add(entry.getElement());
        }
      }

        final FessMessages messages = new FessMessages();
        errorMessages.forEach(m -> m.message(messages));

        // The property key should be "doc.url" (for JSP binding)
        assertTrue(messages.hasMessageOf("doc.url"));

        // Verify messages exist at the doc.* property keys
        assertTrue(messages.hasMessageOf("doc.url"), "Required field 'url' should have error at 'doc.url' property");

   * ConcurrentMap#replace(Object, Object, Object)}.
   */
  REPLACED {
    @Override
    boolean wasEvicted() {
      return false;
    }
  },

  /**
   * The entry was removed automatically because its key or value was garbage-collected. This can
   * occur when using {@link CacheBuilder#weakKeys}, {@link CacheBuilder#weakValues}, or {@link
   * CacheBuilder#softValues}.
   */
  COLLECTED {
    @Override

/**
 * Suggestor - jQuery plugin for search autocomplete functionality
 * Provides real-time search suggestions with keyboard and mouse navigation
 */
(function ($) {
  "use strict";

  // Key code constants for better readability
  var KEY_CODES = {
    BACKSPACE: 8,
    ENTER: 13,
    SPACE: 32,
    UP: 38,
    DOWN: 40,
    DELETE: 46,
    NUM_0: 48,
    NUM_9: 57,
    A: 65,
    Z: 90,
    NUMPAD_0: 96,