newParams.put("key3", "value3");
        assertTrue(newParams.containsKey("key3"));
        assertFalse(dataStoreParams.containsKey("key3"));

        // Verify that modifications to original don't affect new instance
        dataStoreParams.put("key4", "value4");
        assertTrue(dataStoreParams.containsKey("key4"));
        assertFalse(newParams.containsKey("key4"));
    }

    // Test asMap
    @Test

        doc.put("key4", expected4);
        assertEquals(expected4, DocumentUtil.getValue(doc, "key4", Date.class));
    }

    @Test
    public void test_long() {
        Map<String, Object> doc = new HashMap<>();

        long expected5 = 999999999999999999L;
        doc.put("key5", expected5);
        assertEquals(expected5, DocumentUtil.getValue(doc, "key5", Long.class).longValue());
    }

    @Test

        dataMap.put("key1", "value1");
        dataMap.put("key2", "");
        dataMap.put("key3", null);

        // Test with existing value
        String result1 = (String) method.invoke(crawler, dataMap, "key1", "default");
        assertEquals("value1", result1);

        // Test with empty value
        String result2 = (String) method.invoke(crawler, dataMap, "key2", "default");

        // Test with whitespace around keys and values
        value = "  key1  =  value1  \n  key2=value2\n";
        paramMap = ParameterUtil.parse(value);
        assertEquals(2, paramMap.size());
        assertEquals("value1", paramMap.get("key1"));
        assertEquals("value2", paramMap.get("key2"));

        // Test with empty lines and mixed whitespace
        value = "key1=value1\n\n\t\nkey2=value2\n \n";

        String[] keys = entrySet.stream().map(Map.Entry::getKey).toArray(String[]::new);

        assertTrue("Should contain all keys", Arrays.asList(keys).contains("lang"));
        assertTrue("Should contain all keys", Arrays.asList(keys).contains("a_key"));
        assertTrue("Should contain all keys", Arrays.asList(keys).contains("b_key"));
        assertTrue("Should contain all keys", Arrays.asList(keys).contains("c_key"));

	lru := lru.NewLRU[string, int](2, nil, time.Hour)
	lru.Add("key1", 1)
	lru.Add("key2", 2)
	lru.Add("key3", 3)

	if _, ok := lru.Get("key1"); ok {
		t.Errorf("Expected key1 to be removed, but it still exists")
	}
}

func TestLRU_Add_UnlimitedSize_NoEviction(t *testing.T) {
	lru := lru.NewLRU[string, int](0, nil, time.Hour)
	lru.Add("key1", 1)
	lru.Add("key2", 2)
	lru.Add("key3", 3)

	if _, ok := lru.Get("key1"); !ok {

    public void testGenerateRandomKey() {
        byte[] key1 = keyManager.generateRandomKey(32);
        byte[] key2 = keyManager.generateRandomKey(32);

        assertNotNull(key1, "Should generate key 1");
        assertNotNull(key2, "Should generate key 2");
        assertEquals(32, key1.length, "Key 1 should have correct length");
        assertEquals(32, key2.length, "Key 2 should have correct length");

      while (same != 0xffffffff || diff != 0xffffffff) {
        int key1 = rand.nextInt();
        // flip input bit for key2
        int key2 = key1 ^ (1 << i);
        // get hashes
        int hash1 = function.hashInt(key1).asInt();
        int hash2 = function.hashInt(key2).asInt();
        // test whether the hash values have same output bits
        same |= ~(hash1 ^ hash2);

		t.Fatal("Unmarshal: ", err)
	} else if len(jk.Keys) != 2 {
		t.Fatalf("Expected 2 keys, got %d", len(jk.Keys))
	}

	keys := make([]crypto.PublicKey, len(jk.Keys))
	for ii, jks := range jk.Keys {
		var err error
		keys[ii], err = jks.DecodePublicKey()
		if err != nil {
			t.Fatalf("Failed to decode key %d: %v", ii, err)
		}
	}

	//nolint:gocritic
	if key0, ok := keys[0].(*ecdsa.PublicKey); !ok {

        assertEquals(100, builder.initialSettings.get("key2"));
        assertEquals(true, builder.initialSettings.get("key3"));

        // Test overwriting existing setting
        builder.addInitialSettings("key1", "newValue1");
        assertEquals(3, builder.initialSettings.size());
        assertEquals("newValue1", builder.initialSettings.get("key1"));
    }

    @Test