f, err := os.CreateTemp(t.TempDir(), "")
	if err != nil {
		t.Fatal(err)
	}
	name1 := f.Name()
	defer os.Remove(name1)
	f.WriteString("aaaaaaaaaa")
	f.Close()

	f, err = os.CreateTemp(t.TempDir(), "")
	if err != nil {
		t.Fatal(err)
	}
	name2 := f.Name()
	defer os.Remove(name2)
	f.WriteString("bbbbbbbbbb")
	f.Close()

	if err = AppendFile(name1, name2, false); err != nil {
		t.Error(err)

        NetServerEnumIterator iterator = new NetServerEnumIterator(parent, treeHandle, "*", 0, null);

        // Then: Remove should throw UnsupportedOperationException
        UnsupportedOperationException exception = assertThrows(UnsupportedOperationException.class, iterator::remove);
        assertEquals("remove", exception.getMessage());
    }

    @Test
    @DisplayName("Close should be idempotent")

  public int get(@Nullable Object key) {
    int index = indexOf(key);
    return (index == -1) ? 0 : values[index];
  }

  @CanIgnoreReturnValue
  public int remove(@Nullable Object key) {
    return remove(key, smearedHash(key));
  }

  private int remove(@Nullable Object key, int hash) {
    int tableIndex = hash & hashTableMask();
    int next = table[tableIndex];
    if (next == UNSET) { // empty bucket
      return 0;

    assertThat(map.containsKey(one)).isTrue();
    assertThat(map.containsValue(one)).isTrue();
    assertThat(map.remove(one)).isSameInstanceAs(one);
    assertThat(map).isEmpty();

    cache.getUnchecked(one);
    assertThat(map).hasSize(1);
    assertThat(map.remove(one, two)).isFalse();
    assertThat(map.remove(one, one)).isTrue();
    assertThat(map).isEmpty();

    cache.getUnchecked(one);

public class EmptyIterator<T> implements Iterator<T> {

    /**
     * Creates an {@link EmptyIterator}.
     */
    public EmptyIterator() {
    }

    @Override
    public void remove() {
        throw new ClUnsupportedOperationException("remove");
    }

    @Override
    public boolean hasNext() {
        return false;
    }

    @Override
    public T next() {

		d.replaceHashed(candidate, nil, *flat)

		// Remove top entry and subtract removed children.
		remove -= removing
		leaves = leaves[1:]
	}
}

// forceCompact will force compact the cache of the top entry.
// If the number of children is more than limit*100, it will compact self.
// When above the limit a cleanup will also be performed to remove any possible abandoned entries.

docker-compose -f docker-compose-site2.yaml up -d

./mc ready site1/
./mc ready site2/

for i in $(seq 1 10); do
	# mc admin heal -r --remove when used against a LB endpoint
	# behaves flaky, let this run 10 times before giving up
	./mc admin heal -r --remove --json site1/ 2>&1 >/dev/null
	./mc admin heal -r --remove --json site2/ 2>&1 >/dev/null
done

		adminRouter.Methods(http.MethodGet).Path(adminVersion + "/idp/builtin/policy-entities").HandlerFunc(adminMiddleware(adminAPI.ListPolicyMappingEntities))

		// Remove policy IAM
		adminRouter.Methods(http.MethodDelete).Path(adminVersion+"/remove-canned-policy").HandlerFunc(adminMiddleware(adminAPI.RemoveCannedPolicy)).Queries("name", "{name:.*}")

		// Set user or group policy

     */
    public void addSitemap(final Sitemap sitemap) {
        sitemapList.add(sitemap);
    }

    /**
     * Removes a sitemap from this set.
     * @param sitemap the sitemap to remove
     */
    public void removeSitemap(final Sitemap sitemap) {
        sitemapList.remove(sitemap);
    }

    /**
     * Gets all sitemaps in this set as an array.
     * @return an array of sitemaps
     */

    @Override
    public boolean remove(@Nullable Object key, @Nullable Object value) {
      return map.entrySet().remove(Maps.immutableEntry(key, value));
    }

    @Override
    public Set<V> removeAll(@Nullable Object key) {
      Set<V> values = new HashSet<>(2);
      if (!map.containsKey(key)) {
        return values;
      }
      values.add(map.remove(key));
      return values;
    }