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