/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/* @test
* @bug 4162796 4162796
* @summary Test indexOf and lastIndexOf
*/
public class IndexOf {
private static boolean failure = false;
simpleTest();
if (failure)
throw new RuntimeException("One or more BitSet failures.");
}
if (failCount > 0)
failure = true;
}
for(int y=0; y<aNewLength; y++) {
}
return aNewString.toString();
}
return constraint1 + x;
}
private static void simpleTest() {
int failCount = 0;
for (int i=0; i<10000; i++) {
do {
failCount++;
failCount++;
failCount++;
}
}
// Note: it is possible although highly improbable that failCount will
// be > 0 even if everthing is working ok
private static void compareIndexOfLastIndexOf() {
int failCount = 0;
for (int i=0; i<10000; i++) {
do {
// extremely remote possibility of > 1 match
int matches = 0;
int index2 = -1;
matches++;
if (matches > 1)
continue;
failCount++;
failCount++;
}
}
private static void compareStringStringBuffer() {
int failCount = 0;
for (int x=0; x<10000; x++) {
throw new RuntimeException("Initial equality failure");
int x1 = 0;
int x2 = 1000;
}
failCount++;
failCount++;
failCount++;
failCount++;
}
}
}