J. Duke | 319a3b9 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 1 | /* |
Kelly O'Hair | fe008ae | 2010-05-25 15:58:33 -0700 | [diff] [blame] | 2 | * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved. |
J. Duke | 319a3b9 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 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 | * |
Kelly O'Hair | fe008ae | 2010-05-25 15:58:33 -0700 | [diff] [blame] | 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. |
J. Duke | 319a3b9 | 2007-12-01 00:00:00 +0000 | [diff] [blame] | 22 | */ |
| 23 | |
| 24 | /** |
| 25 | * @test |
| 26 | * @bug 4323074 |
| 27 | * @summary Basic test for new replaceAll algorithm |
| 28 | */ |
| 29 | |
| 30 | import java.util.*; |
| 31 | |
| 32 | public class ReplaceAll { |
| 33 | static final int SIZE = 20; |
| 34 | |
| 35 | public static void main(String[] args) throws Exception { |
| 36 | List a[] = {new ArrayList(), new LinkedList(), new Vector()}; |
| 37 | |
| 38 | for (int i=0; i<a.length; i++) { |
| 39 | List lst = a[i]; |
| 40 | for (int j=1; j<=SIZE; j++) |
| 41 | lst.add(new Integer(j % 3)); |
| 42 | List goal = Collections.nCopies(SIZE, "*"); |
| 43 | |
| 44 | for (int j=0; j<3; j++) { |
| 45 | List before = new ArrayList(lst); |
| 46 | if (!Collections.replaceAll(lst, new Integer(j), "*")) |
| 47 | throw new Exception("False return value: "+i+", "+j); |
| 48 | if (lst.equals(before)) |
| 49 | throw new Exception("Unchanged: "+i+", "+j+", "+": "+lst); |
| 50 | if (lst.equals(goal) != (j==2)) |
| 51 | throw new Exception("Wrong change:"+i+", "+j); |
| 52 | } |
| 53 | if (Collections.replaceAll(lst, "love", "hate")) |
| 54 | throw new Exception("True return value: "+i); |
| 55 | } |
| 56 | } |
| 57 | } |