1 /*
2 * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23
24 /*
25 * @test
26 * @bug 4323074
27 * @summary Basic test for new replaceAll algorithm
28 */
29
30 import java.util.ArrayList;
31 import java.util.Collections;
32 import java.util.LinkedList;
33 import java.util.List;
34 import java.util.Vector;
35
36 public class ReplaceAll {
37 static final int SIZE = 20;
38
39 public static void main(String[] args) throws Exception {
40 List[] a = {new ArrayList(), new LinkedList(), new Vector()};
41
42 for (int i=0; i<a.length; i++) {
43 List lst = a[i];
44 for (int j=1; j<=SIZE; j++)
45 lst.add(new Integer(j % 3));
46 List goal = Collections.nCopies(SIZE, "*");
47
48 for (int j=0; j<3; j++) {
49 List before = new ArrayList(lst);
50 if (!Collections.replaceAll(lst, new Integer(j), "*"))
51 throw new Exception("False return value: "+i+", "+j);
52 if (lst.equals(before))
53 throw new Exception("Unchanged: "+i+", "+j+", "+": "+lst);
54 if (lst.equals(goal) != (j==2))
55 throw new Exception("Wrong change:"+i+", "+j);
56 }
57 if (Collections.replaceAll(lst, "love", "hate"))
58 throw new Exception("True return value: "+i);
59 }
60 }
61 }
|
1 /*
2 * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23
24 /*
25 * @test
26 * @bug 4323074
27 * @summary Basic test for new replaceAll algorithm
28 * @library /test/lib
29 */
30
31 import jdk.test.lib.valueclass.VClass;
32 import java.util.ArrayList;
33 import java.util.Collections;
34 import java.util.LinkedList;
35 import java.util.List;
36 import java.util.Vector;
37
38 public class ReplaceAll {
39 static final int SIZE = 20;
40
41 public static void main(String[] args) throws Exception {
42 List[] a = {new ArrayList(), new LinkedList(), new Vector()};
43
44 for (int i=0; i<a.length; i++) {
45 List lst = a[i];
46 for (int j=1; j<=SIZE; j++)
47 lst.add(new Integer(j % 3));
48 List goal = Collections.nCopies(SIZE, "*");
49
50 for (int j=0; j<3; j++) {
51 List before = new ArrayList(lst);
52 if (!Collections.replaceAll(lst, new Integer(j), "*"))
53 throw new Exception("False return value: "+i+", "+j);
54 if (lst.equals(before))
55 throw new Exception("Unchanged: "+i+", "+j+", "+": "+lst);
56 if (lst.equals(goal) != (j==2))
57 throw new Exception("Wrong change:"+i+", "+j);
58 }
59 if (Collections.replaceAll(lst, "love", "hate"))
60 throw new Exception("True return value: "+i);
61 }
62
63 List<VClass> values = new ArrayList<>();
64 for (int j = 1; j <= SIZE; j++) values.add(new VClass(j % 3, new int[] { j % 3 }));
65 if (!Collections.replaceAll(values, new VClass(1, new int[] { 1 }), new VClass(99, new int[] { 99 })))
66 throw new Exception("value false return");
67 if (Collections.replaceAll(values, new VClass(100, new int[] { 100 }), new VClass(0, new int[] { 0 })))
68 throw new Exception("value true return for absent element");
69 }
70 }
|