tentativeArgs.set(i, alternateArg);
    return createInstance(factory, tentativeArgs).hashCode()
        == createInstance(factory, args).hashCode();
  }

  // distinctValues is a type-safe class-values mapping, but we don't have a type-safe data
  // structure to hold the mappings.
  @SuppressWarnings({"unchecked", "rawtypes"})
  private FreshValueGenerator newFreshValueGenerator() {
    FreshValueGenerator generator =

  /**
   * Returns a {@link Collector} that accumulates elements into an {@code ImmutableBiMap} whose keys
   * and values are the result of applying the provided mapping functions to the input elements.
   * Entries appear in the result {@code ImmutableBiMap} in encounter order.
   *
   * <p>If the mapped keys or values contain duplicates (according to {@link

        "char_filter" : ["mapping_char"],
        "filter" : ["lowercase", "content_length_filter", "limit_token_count_filter"]
      }
    },
    "char_filter" : {
      "mapping_char" : {
        "type" : "mapping",
        "mappings" : ["ｶﾞ=>ガ", "ｷﾞ=>ギ", "ｸﾞ=>グ", "ｹﾞ=>ゲ", "ｺﾞ=>ゴ", "ｻﾞ=>ザ", "ｼﾞ=>ジ", "ｽﾞ=>ズ", "ｾﾞ=>ゼ", "ｿﾞ=>ゾ", "ﾀﾞ=>ダ", "ﾁﾞ=>ヂ", "ﾂﾞ=>ヅ",

   * <p><b>{@code Stream} equivalent:</b> {@code
   * stream.collect(ImmutableMap.toImmutableMap(keyFunction, v -> v))}.
   *
   * @param keyFunction the function used to produce the key for each value
   * @return a map mapping the result of evaluating the function {@code keyFunction} on each value
   *     in this fluent iterable to that value
   * @throws IllegalArgumentException if {@code keyFunction} produces the same key for more than one

	_, err = loadPolicyRPC.Call(ctx, client.gridConn(), grid.NewMSSWith(map[string]string{
		peerRESTPolicy: policyName,
	}))
	return err
}

// LoadPolicyMapping - reload a specific policy mapping
func (client *peerRESTClient) LoadPolicyMapping(ctx context.Context, userOrGroup string, userType IAMUserType, isGroup bool) error {
	_, err := loadPolicyMappingRPC.Call(ctx, client.gridConn(), grid.NewMSSWith(map[string]string{

labels.crawling_info_details=Crawling Info Details
labels.data_config_details=Data Config Details
labels.dict_kuromoji_details=Dict Kuromoji Details
labels.dict_mapping_details=Dict Mapping Details
labels.dict_protwords_details=Dict Protwords Details
labels.dict_stemmeroverride_details=Dict Stemmeroverride Details
labels.dict_stopwords_details=Dict Stopwords Details

labels.crawling_info_details=Crawling Info Detalhes
labels.data_config_details=Data Config Detalhes
labels.dict_kuromoji_details=Dict Kuromoji Detalhes
labels.dict_mapping_details=Dict Mapping Detalhes
labels.dict_protwords_details=Dict Protwords Detalhes
labels.dict_stemmeroverride_details=Dict Stemmeroverride Detalhes
labels.dict_stopwords_details=Dict Stopwords Detalhes

    return partitionPoint;
  }

  /**
   * Selects the pivot to use, namely the median of the values at {@code from}, {@code to}, and
   * halfway between the two (rounded down), from {@code array}, and ensure (by swapping elements if
   * necessary) that that pivot value appears at the start of the slice i.e. at {@code from}.
   * Expects that {@code from} is strictly less than {@code to}.
   */

labels.boost_document_rule_details=Boost Document Rule 詳情
labels.crawling_info_details=Crawling Info 詳情
labels.data_config_details=Data Config 詳情
labels.dict_kuromoji_details=Dict Kuromoji 詳情
labels.dict_mapping_details=Dict Mapping 詳情
labels.dict_protwords_details=Dict Protwords 詳情
labels.dict_stemmeroverride_details=Dict Stemmeroverride 詳情
labels.dict_stopwords_details=Dict Stopwords 詳情
labels.dict_synonym_details=Dict Synonym 詳情

labels.crawling_info_details=Crawling Info Детали
labels.data_config_details=Data Config Детали
labels.dict_kuromoji_details=Dict Kuromoji Детали
labels.dict_mapping_details=Dict Mapping Детали
labels.dict_protwords_details=Dict Protwords Детали
labels.dict_stemmeroverride_details=Dict Stemmeroverride Детали
labels.dict_stopwords_details=Dict Stopwords Детали
labels.dict_synonym_details=Dict Synonym Детали