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 Collections.indexOfSubList/lastIndexOfSubList
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class FindSubList {
0N/A public static void main(String[] args) throws Exception {
0N/A int N = 500;
0N/A List source = new ArrayList(3 * N);
0N/A List target[]= new List[N+1];
0N/A int index[] = new int[N+1];
0N/A for (int i=0; i<=N; i++) {
0N/A List t = new ArrayList();
0N/A String s = Integer.toString(i, 2);
0N/A for (int j=0, len = s.length(); j<len; j++)
0N/A t.add(s.charAt(j)=='1' ? "1" : "0");
0N/A target[i] = t;
0N/A if (i == N) {
0N/A index[i] = -1;
0N/A } else {
0N/A index[i] = source.size();
0N/A source.addAll(t);
0N/A source.add("*");
0N/A }
0N/A }
0N/A
0N/A List src[] = {source, new LinkedList(source), new Vector(source),
0N/A Arrays.asList(source.toArray())};
0N/A for (int j=0; j<src.length; j++) {
0N/A List s = src[j];
0N/A
0N/A for (int i=0; i<=N; i++) {
0N/A int idx = Collections.indexOfSubList(s, target[i]);
0N/A if (idx != index[i])
0N/A throw new Exception(s.getClass()+" indexOfSubList: " + i +
0N/A "is " + idx + ", should be "+index[i]);
0N/A }
0N/A
0N/A if (Collections.indexOfSubList(s,Collections.nCopies(2*s.size(),
0N/A "0")) != -1)
0N/A throw new Exception(s.getClass()+" indexOfSubList: big target");
0N/A
0N/A }
0N/A
0N/A Collections.reverse(source);
0N/A int srcSize = source.size();
0N/A for (int i=0; i<=N; i++) {
0N/A Collections.reverse(target[i]);
0N/A if (i != N)
0N/A index[i] = srcSize - index[i] - target[i].size();
0N/A }
0N/A List src2[] = {source, new LinkedList(source), new Vector(source),
0N/A Arrays.asList(source.toArray())};
0N/A for (int j=0; j<src2.length; j++) {
0N/A List s = src2[j];
0N/A
0N/A for (int i=0; i<=N; i++) {
0N/A int idx = Collections.lastIndexOfSubList(s, target[i]);
0N/A if (idx != index[i])
0N/A throw new Exception(s.getClass()+" lastIdexOfSubList: "+i +
0N/A "is " + idx + ", should be "+index[i]);
0N/A }
0N/A if (Collections.indexOfSubList(s,Collections.nCopies(2*s.size(),
0N/A "0")) != -1)
0N/A throw new Exception(s.getClass()+" lastIndexOfSubList: big tgt");
0N/A }
0N/A }
0N/A}