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