iterator.remove();
      assertEquals(initialSize - 1, map.size());
      // (We can't assert that the values collection no longer contains the
      // removed value, because the underlying map can have multiple mappings
      // to the same value.)
      assertInvariants(map);
      assertThrows(IllegalStateException.class, iterator::remove);
    } else {
      iterator.next();

      "number_of_replicas": 0,
      "auto_expand_replicas": "${fess.index.auto_expand_replicas}"
    },
    "analysis": {
      "char_filter": {
        "mapping_fa_filter": {
          "type": "mapping",

      "number_of_replicas": 0,
      "auto_expand_replicas": "${fess.index.auto_expand_replicas}"
    },
    "analysis": {
      "char_filter": {
        "mapping_fa_filter": {
          "type": "mapping",

     */
    protected boolean isLogFilename(final String name) {
        return name.endsWith(".log") || name.endsWith(".log.gz");
    }

    /**
     * Rebuilds selected configuration indices with the latest mappings.
     * Executes asynchronously in a background thread.
     *
     * @param form the action form containing the target index checkboxes and loadBulkData flag
     * @return HTML response redirecting to the maintenance page

//
//	user=... -> repeatable query parameter, specifying users to query for
//	policy mapping
//
//	group=... -> repeatable query parameter, specifying groups to query for
//	policy mapping
//
//	policy=... -> repeatable query parameter, specifying policy to query for
//	user/group mapping
//
// When all query parameters are omitted, returns mappings for all policies.

		}
	}
	// Retrieve all keys and values to avoid too many calls to etcd in case of
	// a large number of policy mappings
	r, err := ies.client.Get(cctx, basePrefix, etcd.WithPrefix())
	if err != nil {
		return err
	}

	// Parse all policies mapping to create the proper data model
	for _, kv := range r.Kvs {
		if err = getMappedPolicy(kv, m, basePrefix); err != nil && !errors.Is(err, errNoSuchPolicy) {

      // of the tail map.
      Entry<K, V> previousEntry = map.tailMap(key).entrySet().iterator().next();
      throw new IllegalArgumentException(
          "Duplicate keys in mappings "
              + previousEntry.getKey()
              + "="
              + previousEntry.getValue()
              + " and "
              + key
              + "="
              + value);
    }

    /** Injected helper for data store indexing operations. */
    @Resource
    protected DataIndexHelper dataIndexHelper;

    /** Injected service for managing path mappings during crawling. */
    @Resource
    protected PathMappingService pathMappingService;

    /** Injected service for managing crawling session information. */
    @Resource

    return new HashBiMap<>(expectedSize);
  }

  /**
   * Constructs a new bimap containing initial values from {@code map}. The bimap is created with an
   * initial capacity sufficient to hold the mappings in the specified map.
   */
  public static <K extends @Nullable Object, V extends @Nullable Object> HashBiMap<K, V> create(
      Map<? extends K, ? extends V> map) {
    HashBiMap<K, V> bimap = create(map.size());

      iterator.remove();
      assertEquals(initialSize - 1, map.size());
      // (We can't assert that the values collection no longer contains the
      // removed value, because the underlying map can have multiple mappings
      // to the same value.)
      assertInvariants(map);
      assertThrows(IllegalStateException.class, iterator::remove);
    } else {
      iterator.next();