String[] sitemaps = new String[] { "http://example.com/sitemap.xml", "http://test.com/sitemap.xml" };
        crawlerContext.addSitemaps(sitemaps);

        // Remove and verify
        String[] removedSitemaps = crawlerContext.removeSitemaps();
        assertNotNull(removedSitemaps);
        assertEquals(2, removedSitemaps.length);
        assertEquals("http://example.com/sitemap.xml", removedSitemaps[0]);

  }

  private interface ListMap<K, V> extends Map<K, List<V>> {}

  public void testGetSupertype_fullyGenericType() {
    ParameterizedType expectedType =
        Types.newParameterizedType(
            Map.class,
            ListMap.class.getTypeParameters()[0],
            Types.newParameterizedType(List.class, ListMap.class.getTypeParameters()[1]));

  }

  private interface ListMap<K, V> extends Map<K, List<V>> {}

  public void testGetSupertype_fullyGenericType() {
    ParameterizedType expectedType =
        Types.newParameterizedType(
            Map.class,
            ListMap.class.getTypeParameters()[0],
            Types.newParameterizedType(List.class, ListMap.class.getTypeParameters()[1]));

     * Set interface capabilities
     *
     * @param capability capability flags
     */
    public void setCapability(int capability) {
        this.capability = capability;
        // Update capability flags based on bitmask
        this.rssCapable = (capability & Smb2ChannelCapabilities.NETWORK_INTERFACE_CAP_RSS) != 0;
        this.rdmaCapable = (capability & Smb2ChannelCapabilities.NETWORK_INTERFACE_CAP_RDMA) != 0;
    }

    /**

			}
		}
		if strings.Join(enc, ",") != oi1.ContentEncoding {
			return replicateMetadata
		}
	}

	t, _ := tags.ParseObjectTags(oi1.UserTags)
	oi2Map := make(map[string]string)
	maps.Copy(oi2Map, oi2.UserTags)
	if (oi2.UserTagCount > 0 && !reflect.DeepEqual(oi2Map, t.ToMap())) || (oi2.UserTagCount != len(t.ToMap())) {
		return replicateMetadata
	}

	// Compare only necessary headers
	compareKeys := []string{

    // The alternative (x + y) / 2 fails for large values.
    // The alternative (x + y) >>> 1 fails for negative values.
    return (x & y) + ((x ^ y) >> 1);
  }

  /*
   * This bitmask is used as an optimization for cheaply testing for divisibility by 2, 3, or 5.
   * Each bit is set to 1 for all remainders that indicate divisibility by 2, 3, or 5, so