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 rotate algorithm
28 * @key randomness
29 */
30
31 import java.util.ArrayList;
32 import java.util.Collections;
33 import java.util.LinkedList;
34 import java.util.List;
35 import java.util.Random;
36 import java.util.Vector;
37
38 public class Rotate {
39 // Should have lots of distinct factors and be > ROTATE_THRESHOLD
40 static final int SIZE = 120;
41
42 static Random rnd = new Random();
43
44 public static void main(String[] args) throws Exception {
45 List[] a = {new ArrayList(), new LinkedList(), new Vector()};
46
47 for (int i=0; i<a.length; i++) {
48 List lst = a[i];
49 for (int j=0; j<SIZE; j++)
50 lst.add(new Integer(j));
51 int totalDist = 0;
52
53 for (int j=0; j<10000; j++) {
54 int dist = rnd.nextInt(200) - 100;
55 Collections.rotate(lst, dist);
56
57 // Check that things are as they should be
58 totalDist = (totalDist + dist) % SIZE;
59 if (totalDist < 0)
60 totalDist += SIZE;
61 int index =0;
62 for (int k=totalDist; k<SIZE; k++, index++)
63 if (((Integer)lst.get(k)).intValue() != index)
64 throw new Exception("j: "+j+", lst["+k+"]="+lst.get(k)+
65 ", should be "+index);
66 for (int k=0; k<totalDist; k++, index++)
67 if (((Integer)lst.get(k)).intValue() != index)
68 throw new Exception("j: "+j+", lst["+k+"]="+lst.get(k)+
69 ", should be "+index);
70 }
71 }
72 }
73 }
|
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 rotate algorithm
28 * @key randomness
29 * @library /test/lib
30 */
31
32 import jdk.test.lib.valueclass.VClass;
33 import java.util.ArrayList;
34 import java.util.Arrays;
35 import java.util.Collections;
36 import java.util.LinkedList;
37 import java.util.List;
38 import java.util.Random;
39 import java.util.Vector;
40
41 public class Rotate {
42 // Should have lots of distinct factors and be > ROTATE_THRESHOLD
43 static final int SIZE = 120;
44
45 static Random rnd = new Random();
46
47 public static void main(String[] args) throws Exception {
48 List[] a = {new ArrayList(), new LinkedList(), new Vector()};
49
50 for (int i=0; i<a.length; i++) {
51 List lst = a[i];
52 for (int j=0; j<SIZE; j++)
53 lst.add(new Integer(j));
54 int totalDist = 0;
55
56 for (int j=0; j<10000; j++) {
57 int dist = rnd.nextInt(200) - 100;
58 Collections.rotate(lst, dist);
59
60 // Check that things are as they should be
61 totalDist = (totalDist + dist) % SIZE;
62 if (totalDist < 0)
63 totalDist += SIZE;
64 int index =0;
65 for (int k=totalDist; k<SIZE; k++, index++)
66 if (((Integer)lst.get(k)).intValue() != index)
67 throw new Exception("j: "+j+", lst["+k+"]="+lst.get(k)+
68 ", should be "+index);
69 for (int k=0; k<totalDist; k++, index++)
70 if (((Integer)lst.get(k)).intValue() != index)
71 throw new Exception("j: "+j+", lst["+k+"]="+lst.get(k)+
72 ", should be "+index);
73 }
74 }
75
76 List<VClass> vl = new ArrayList<>(Arrays.asList(new VClass(1, new int[] { 1 }), new VClass(2, new int[] { 2 }), new VClass(3, new int[] { 3 }), new VClass(4, new int[] { 4 })));
77 Collections.rotate(vl, 1);
78 if (!vl.equals(Arrays.asList(new VClass(4, new int[] { 4 }), new VClass(1, new int[] { 1 }), new VClass(2, new int[] { 2 }), new VClass(3, new int[] { 3 }))))
79 throw new RuntimeException("value rotate failed");
80 }
81 }
|