map.put(one, three);
    assertNotified(listener, one, two, RemovalCause.REPLACED);

    Map<Object, Object> newMap = ImmutableMap.of(one, four);
    map.putAll(newMap);
    assertNotified(listener, one, three, RemovalCause.REPLACED);

    map.replace(one, five);
    assertNotified(listener, one, four, RemovalCause.REPLACED);

    map.replace(one, five, six);
    assertNotified(listener, one, five, RemovalCause.REPLACED);

    map.put(one, three);
    assertNotified(listener, one, two, RemovalCause.REPLACED);

    Map<Object, Object> newMap = ImmutableMap.of(one, four);
    map.putAll(newMap);
    assertNotified(listener, one, three, RemovalCause.REPLACED);

    map.replace(one, five);
    assertNotified(listener, one, four, RemovalCause.REPLACED);

    map.replace(one, five, six);
    assertNotified(listener, one, five, RemovalCause.REPLACED);

        final String source = fessConfig.getIndexReindexBody()//
                .replace("__SOURCE_INDEX__", fromIndex)//
                .replace("__SIZE__", fessConfig.getIndexReindexSize())//
                .replace("__DEST_INDEX__", toIndex)//
                .replace("__SCRIPT_SOURCE__", ComponentUtil.getLanguageHelper().getReindexScriptSource());

  @Override
  public boolean replace(K key, @Nullable V oldValue, V newValue) {
    checkNotNull(key);
    checkNotNull(newValue);
    if (oldValue == null) {
      return false;
    }
    int hash = hash(key);
    return segmentFor(hash).replace(key, hash, oldValue, newValue);
  }

  @CanIgnoreReturnValue
  @Override
  public @Nullable V replace(K key, V value) {
    checkNotNull(key);

  if (title === '') {\n      title = $item.text()\n    }\n\n    const link = $item.attr('href')\n    if (link === '#' || link === '' || link === undefined) {\n      return\n    }\n\n    const uniqueName = unescape(link).replace('./', '').replace(/[\"#&'./:=?[\\]]/gi, '-').replace(/(--)/gi, '')\n    const navId = `tab-${uniqueName}`\n\n    if (!this._config.allowDuplicates && $(`#${navId}`).length > 0) {\n      return this.switchTab(`#${navId}`, this._config.allowReload)\n    }\n\n    if ((!this....

	// Storage class is special, it can be replaced regardless of the
	// metadata directive, if set should be preserved and replaced
	// to the destination metadata.
	sc := r.Header.Get(xhttp.AmzStorageClass)
	if sc == "" {
		sc = r.Form.Get(xhttp.AmzStorageClass)
	}

	// if x-amz-metadata-directive says REPLACE then
	// we extract metadata from the input headers.

String); public static String join(java.util.Iterator, String); public static String replaceOnce(String, char, char); public static String replace(String, char, char); public static String replace(String, char, char, int); public static String replaceOnce(String, String, String); public static String replace(String, String, String); public static String replace(String, String, String, int); public static String overlayString(String, String, int, int); public static String center(String, int); public...

                    break;
                }
                suffix.append("%20");
            }
            name = name.replaceAll(" +$", suffix.toString());
        }
        return "URL:" + name.replace("?", "%3f");
    }

    /**
     * @return
     */
    private static boolean isWorkgroup(final SmbResource r) {
        try {
            return r.getLocator().isWorkgroup();

	([kubernetes/features#82](https://github.com/kubernetes/enhancements/issues/82))
  - [beta] `Federated Replica Sets` create and maintain matching
    `Replica Set`s in some or all clusters in a federation, with the
    desired replica count distributed equally or according to
    specified per-cluster weights.
	([docs](http://kubernetes.io/docs/user-guide/federation/federated-replicasets.md))

      throw new UnsupportedOperationException();
    }

    @Override
    public boolean replace(K key, V oldValue, V newValue) {
      throw new UnsupportedOperationException();
    }

    @Override
    public @Nullable V replace(K key, V value) {
      throw new UnsupportedOperationException();
    }

    @Override
    public V computeIfAbsent(