| 1 |
|
/* |
| 2 |
< |
* Copyright 2000 Sun Microsystems, Inc. All Rights Reserved. |
| 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 |
| 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| 20 |
< |
* CA 95054 USA or visit www.sun.com if you need additional information or |
| 21 |
< |
* have any questions. |
| 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 |
< |
/** |
| 24 |
> |
/* |
| 25 |
|
* @test |
| 26 |
|
* @bug 4323074 |
| 27 |
|
* @summary Basic test for Collections.indexOfSubList/lastIndexOfSubList |
| 28 |
|
*/ |
| 29 |
|
|
| 30 |
< |
import java.util.*; |
| 30 |
> |
import java.util.ArrayList; |
| 31 |
> |
import java.util.Arrays; |
| 32 |
> |
import java.util.Collections; |
| 33 |
> |
import java.util.LinkedList; |
| 34 |
> |
import java.util.List; |
| 35 |
> |
import java.util.Vector; |
| 36 |
|
|
| 37 |
|
public class FindSubList { |
| 38 |
|
public static void main(String[] args) throws Exception { |
| 39 |
|
int N = 500; |
| 40 |
|
List source = new ArrayList(3 * N); |
| 41 |
< |
List target[]= new List[N+1]; |
| 42 |
< |
int index[] = new int[N+1]; |
| 41 |
> |
List[] target = new List[N+1]; |
| 42 |
> |
int[] index = new int[N+1]; |
| 43 |
|
for (int i=0; i<=N; i++) { |
| 44 |
|
List t = new ArrayList(); |
| 45 |
|
String s = Integer.toString(i, 2); |
| 55 |
|
} |
| 56 |
|
} |
| 57 |
|
|
| 58 |
< |
List src[] = {source, new LinkedList(source), new Vector(source), |
| 59 |
< |
Arrays.asList(source.toArray())}; |
| 58 |
> |
List[] src = { |
| 59 |
> |
source, |
| 60 |
> |
new LinkedList(source), |
| 61 |
> |
new Vector(source), |
| 62 |
> |
Arrays.asList(source.toArray()) |
| 63 |
> |
}; |
| 64 |
|
for (int j=0; j<src.length; j++) { |
| 65 |
|
List s = src[j]; |
| 66 |
|
|
| 84 |
|
if (i != N) |
| 85 |
|
index[i] = srcSize - index[i] - target[i].size(); |
| 86 |
|
} |
| 87 |
< |
List src2[] = {source, new LinkedList(source), new Vector(source), |
| 88 |
< |
Arrays.asList(source.toArray())}; |
| 87 |
> |
List[] src2 = { |
| 88 |
> |
source, |
| 89 |
> |
new LinkedList(source), |
| 90 |
> |
new Vector(source), |
| 91 |
> |
Arrays.asList(source.toArray()) |
| 92 |
> |
}; |
| 93 |
|
for (int j=0; j<src2.length; j++) { |
| 94 |
|
List s = src2[j]; |
| 95 |
|
|
