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/* @test
0N/A * @bug 4162796 4162796
0N/A * @summary Test indexOf and lastIndexOf
0N/A */
0N/A
0N/Aimport java.util.Random;
0N/A
0N/Apublic class IndexOf {
0N/A
0N/A static Random generator = new Random();
0N/A private static boolean failure = false;
0N/A
0N/A public static void main(String[] args) throws Exception {
0N/A simpleTest();
0N/A compareIndexOfLastIndexOf();
0N/A compareStringStringBuffer();
0N/A
0N/A if (failure)
0N/A throw new RuntimeException("One or more BitSet failures.");
0N/A }
0N/A
0N/A private static void report(String testName, int failCount) {
0N/A System.err.println(testName+": " +
0N/A (failCount==0 ? "Passed":"Failed("+failCount+")"));
0N/A if (failCount > 0)
0N/A failure = true;
0N/A }
0N/A
0N/A private static String generateTestString(int min, int max) {
0N/A StringBuffer aNewString = new StringBuffer(120);
0N/A int aNewLength = getRandomIndex(min, max);
0N/A for(int y=0; y<aNewLength; y++) {
0N/A int achar = generator.nextInt(30)+30;
0N/A char test = (char)(achar);
0N/A aNewString.append(test);
0N/A }
0N/A return aNewString.toString();
0N/A }
0N/A
0N/A private static int getRandomIndex(int constraint1, int constraint2) {
0N/A int range = constraint2 - constraint1;
0N/A int x = generator.nextInt(range);
0N/A return constraint1 + x;
0N/A }
0N/A
0N/A private static void simpleTest() {
0N/A int failCount = 0;
0N/A String sourceString;
0N/A StringBuffer sourceBuffer;
0N/A String targetString;
0N/A
0N/A for (int i=0; i<10000; i++) {
0N/A do {
0N/A sourceString = generateTestString(99, 100);
0N/A sourceBuffer = new StringBuffer(sourceString);
0N/A targetString = generateTestString(10, 11);
0N/A } while (sourceString.indexOf(targetString) != -1);
0N/A
0N/A int index1 = generator.nextInt(90) + 5;
0N/A sourceBuffer = sourceBuffer.replace(index1, index1, targetString);
0N/A
0N/A if (sourceBuffer.indexOf(targetString) != index1)
0N/A failCount++;
0N/A if (sourceBuffer.indexOf(targetString, 5) != index1)
0N/A failCount++;
0N/A if (sourceBuffer.indexOf(targetString, 99) == index1)
0N/A failCount++;
0N/A }
0N/A
0N/A report("Basic Test ", failCount);
0N/A }
0N/A
0N/A // Note: it is possible although highly improbable that failCount will
0N/A // be > 0 even if everthing is working ok
0N/A private static void compareIndexOfLastIndexOf() {
0N/A int failCount = 0;
0N/A String sourceString;
0N/A StringBuffer sourceBuffer;
0N/A String targetString;
0N/A
0N/A for (int i=0; i<10000; i++) {
0N/A do {
0N/A sourceString = generateTestString(99, 100);
0N/A sourceBuffer = new StringBuffer(sourceString);
0N/A targetString = generateTestString(10, 11);
0N/A } while (sourceString.indexOf(targetString) != -1);
0N/A
0N/A int index1 = generator.nextInt(100);
0N/A sourceBuffer = sourceBuffer.replace(index1, index1, targetString);
0N/A
0N/A // extremely remote possibility of > 1 match
0N/A int matches = 0;
0N/A int index2 = -1;
0N/A while((index2 = sourceBuffer.indexOf(targetString,index2+1)) != -1)
0N/A matches++;
0N/A if (matches > 1)
0N/A continue;
0N/A
0N/A if (sourceBuffer.indexOf(targetString) !=
0N/A sourceBuffer.lastIndexOf(targetString))
0N/A failCount++;
0N/A sourceString = sourceBuffer.toString();
0N/A if (sourceString.indexOf(targetString) !=
0N/A sourceString.lastIndexOf(targetString))
0N/A failCount++;
0N/A }
0N/A
0N/A report("IndexOf vs LastIndexOf ", failCount);
0N/A }
0N/A
0N/A private static void compareStringStringBuffer() {
0N/A int failCount = 0;
0N/A
0N/A for (int x=0; x<10000; x++) {
0N/A String testString = generateTestString(1, 100);
0N/A int len = testString.length();
0N/A
0N/A StringBuffer testBuffer = new StringBuffer(len);
0N/A testBuffer.append(testString);
0N/A if (!testString.equals(testBuffer.toString()))
0N/A throw new RuntimeException("Initial equality failure");
0N/A
0N/A int x1 = 0;
0N/A int x2 = 1000;
0N/A while(x2 > testString.length()) {
0N/A x1 = generator.nextInt(len);
0N/A x2 = generator.nextInt(100);
0N/A x2 = x1 + x2;
0N/A }
0N/A String fragment = testString.substring(x1,x2);
0N/A
0N/A int sAnswer = testString.indexOf(fragment);
0N/A int sbAnswer = testBuffer.indexOf(fragment);
0N/A
0N/A if (sAnswer != sbAnswer)
0N/A failCount++;
0N/A
0N/A int testIndex = getRandomIndex(-100, 100);
0N/A
0N/A sAnswer = testString.indexOf(fragment, testIndex);
0N/A sbAnswer = testBuffer.indexOf(fragment, testIndex);
0N/A
0N/A if (sAnswer != sbAnswer)
0N/A failCount++;
0N/A
0N/A sAnswer = testString.lastIndexOf(fragment);
0N/A sbAnswer = testBuffer.lastIndexOf(fragment);
0N/A
0N/A if (sAnswer != sbAnswer)
0N/A failCount++;
0N/A
0N/A testIndex = getRandomIndex(-100, 100);
0N/A
0N/A sAnswer = testString.lastIndexOf(fragment, testIndex);
0N/A sbAnswer = testBuffer.lastIndexOf(fragment, testIndex);
0N/A
0N/A if (sAnswer != sbAnswer)
0N/A failCount++;
0N/A }
0N/A
0N/A report("String vs StringBuffer ", failCount);
0N/A }
0N/A
0N/A}