Rotate.java revision 2362
0N/A/*
2362N/A * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/**
0N/A * @test
0N/A * @bug 4323074
0N/A * @summary Basic test for new rotate algorithm
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class Rotate {
0N/A // Should have lots of distinct factors and be > ROTATE_THRESHOLD
0N/A static final int SIZE = 120;
0N/A
0N/A static Random rnd = new Random();
0N/A
0N/A public static void main(String[] args) throws Exception {
0N/A List a[] = {new ArrayList(), new LinkedList(), new Vector()};
0N/A
0N/A for (int i=0; i<a.length; i++) {
0N/A List lst = a[i];
0N/A for (int j=0; j<SIZE; j++)
0N/A lst.add(new Integer(j));
0N/A int totalDist = 0;
0N/A
0N/A for (int j=0; j<10000; j++) {
0N/A int dist = rnd.nextInt(200) - 100;
0N/A Collections.rotate(lst, dist);
0N/A
0N/A // Check that things are as they should be
0N/A totalDist = (totalDist + dist) % SIZE;
0N/A if (totalDist < 0)
0N/A totalDist += SIZE;
0N/A int index =0;
0N/A for (int k=totalDist; k<SIZE; k++, index++)
0N/A if (((Integer)lst.get(k)).intValue() != index)
0N/A throw new Exception("j: "+j+", lst["+k+"]="+lst.get(k)+
0N/A ", should be "+index);
0N/A for (int k=0; k<totalDist; k++, index++)
0N/A if (((Integer)lst.get(k)).intValue() != index)
0N/A throw new Exception("j: "+j+", lst["+k+"]="+lst.get(k)+
0N/A ", should be "+index);
0N/A }
0N/A }
0N/A }
0N/A}