assertFalse(dataMap.containsKey("z.overwrite"));
        assertEquals(1, dataMap.size());
        assertEquals("Z1", dataMap.get("z"));
    }

    /** Case 5: Overwrite processing for multiple fields, existing overwrite keys are also properly removed */
    public void test_mergeResponseData_multipleOverwrite() {
        Map<String, Object> dataMap = new HashMap<>();
        // Case where the initial dataMap also contains overwrite keys

 * because of the possibility of splitting a surrogate pair. The only case in which it is safe to
 * escape strings and concatenate the results is if you can rule out this possibility, either by
 * splitting an existing long string into short strings adaptively around {@linkplain
 * Character#isHighSurrogate surrogate} {@linkplain Character#isLowSurrogate pairs}, or by starting
 * with short strings already known to be free of unpaired surrogates.

        if (keyLength == 32) {
            // AES-256 support
            transformation = "AES/GCM/NoPadding";
        } else if (keyLength == 16) {
            // AES-128 (existing)
            transformation = "AES/GCM/NoPadding";
        } else {
            throw new IllegalArgumentException("Unsupported key length for GCM: " + keyLength);
        }

        byte[] key = null;

// initial contents. The new [Buffer] takes ownership of buf, and the
// caller should not use buf after this call. NewBuffer is intended to
// prepare a [Buffer] to read existing data. It can also be used to set
// the initial size of the internal buffer for writing. To do that,
// buf should have the desired capacity but a length of zero.
//

        String asString = dataStoreParams.getAsString("complexKey");
        assertNotNull(asString);
        assertTrue(asString.contains("nested"));
    }

    // Test overwriting existing values
    public void test_overwriteValues() {
        dataStoreParams.put("key1", "originalValue");
        assertEquals("originalValue", dataStoreParams.get("key1"));

        dataStoreParams.put("key1", "newValue");

            return null;
        });

        return asJson(new ApiUpdateResponse().id(webConfig.getId()).created(true).status(Status.OK).result());
    }

    /**
     * Updates an existing web configuration setting.
     *
     * @param body the web configuration data to update
     * @return JSON response containing the updated web configuration setting ID
     */
    // PUT /api/admin/webconfig/setting

        });
        return asJson(
                new ApiUpdateResponse().id(doc.get(fessConfig.getIndexFieldDocId()).toString()).created(true).status(Status.OK).result());
    }

    /**
     * Updates an existing document in the search index.
     *
     * @param body the document data to update
     * @return JSON response containing the updated document ID
     */
    // PUT /api/admin/searchlist/doc
    @Execute

        facetInfo.addQuery("query1");
        assertNotNull(facetInfo.query);
        assertEquals(1, facetInfo.query.length);
        assertEquals("query1", facetInfo.query[0]);
    }

    // Test addQuery with existing queries
    public void test_addQuery_existingQueries() {
        facetInfo.query = new String[] { "query1", "query2" };
        facetInfo.addQuery("query3");
        assertNotNull(facetInfo.query);

	x.versions = append(x.versions, xlMetaV2ShallowVersion{header: xlMetaV2VersionHeader{ModTime: -1}})

	// Linear search, we likely have to insert at front.
	for i, existing := range x.versions {
		if existing.header.ModTime <= modTime {
			// Insert at current idx. First move current back.
			copy(x.versions[i+1:], x.versions[i:])
			x.versions[i] = xlMetaV2ShallowVersion{
				header: ver.header(),

It is also possible to set the default `GODEBUG` for a given program
(discussed below).

When preparing any change that is permitted by Go 1 compatibility
but may nonetheless break some existing programs,
we first engineer the change to keep as many existing programs working as possible.
For the remaining programs,
we define a new GODEBUG setting that
allows individual programs to opt back in to the old behavior.