diff a/test/jdk/java/util/Collections/ReplaceAll.java b/test/jdk/java/util/Collections/ReplaceAll.java
--- a/test/jdk/java/util/Collections/ReplaceAll.java
+++ b/test/jdk/java/util/Collections/ReplaceAll.java
@@ -1,7 +1,7 @@
 /*
- * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
  * under the terms of the GNU General Public License version 2 only, as
  * published by the Free Software Foundation.
@@ -23,12 +23,14 @@
 
 /*
  * @test
  * @bug 4323074
  * @summary Basic test for new replaceAll algorithm
+ * @library /test/lib
  */
 
+import jdk.test.lib.valueclass.VClass;
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.Vector;
@@ -55,7 +57,14 @@
                     throw new Exception("Wrong change:"+i+", "+j);
             }
             if (Collections.replaceAll(lst, "love", "hate"))
                 throw new Exception("True return value: "+i);
         }
+
+        List<VClass> values = new ArrayList<>();
+        for (int j = 1; j <= SIZE; j++) values.add(new VClass(j % 3, new int[] { j % 3 }));
+        if (!Collections.replaceAll(values, new VClass(1, new int[] { 1 }), new VClass(99, new int[] { 99 })))
+            throw new Exception("value false return");
+        if (Collections.replaceAll(values, new VClass(100, new int[] { 100 }), new VClass(0, new int[] { 0 })))
+            throw new Exception("value true return for absent element");
     }
 }