MapCheck.java revision 3203
/*
* 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.
*/
/*
* This file is available under and governed by the GNU General Public
* License version 2 only, as published by the Free Software Foundation.
* However, the following notice accompanied the original version of this
* file:
*
* Written by Doug Lea with assistance from members of JCP JSR-166
* Expert Group and released to the public domain, as explained at
*/
/*
* @test
* @bug 4486658
* @compile -source 1.5 MapCheck.java
* @summary Times and checks basic map operations
*/
public class MapCheck {
static void reallyAssert(boolean b) {
if (!b) throw new Error("Failed Assertion");
}
int numTests = 8;
int size = 50000;
try {
} catch (ClassNotFoundException e) {
}
}
}
if (doSerializeTest)
}
try {
return m;
} catch (Exception e) {
}
}
}
static void forceMem(int n) {
// force enough memory
int sum = 0;
// System.gc();
}
int sum = 0;
int iters = 4;
for (int j = 0; j < iters; ++j) {
for (int i = 0; i < n; i++) {
}
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
}
}
int sum = 0;
for (int i = n-2; i >= 0; i-=2) {
}
}
int sum = 0;
for (int i = 0; i < n; i++) {
}
reallyAssert(sum == n);
}
int sum = 0;
for (int i = 0; i < n; i++) {
}
reallyAssert(sum == n);
}
int sum = 0;
for (int i = 0; i < n; i++) {
}
}
int sum = 0;
int iters = 20;
}
int sum = 0;
for (int i = 0; i < size; i++) {
}
}
int sum = 0;
++sum;
}
}
int sum = 0;
++sum;
}
}
int sum = 0;
++sum;
}
}
int sum = 0;
k = x.getKey();
v = x.getValue();
if (x != MISSING)
++sum;
}
reallyAssert(s.containsKey(k));
reallyAssert(!s.containsKey(k));
if (x != MISSING)
++sum;
}
s.put(k, v);
}
// for (int i = 0; i < size-1; ++i)
// ittest4(s, size, i);
}
int sum = 0;
++sum;
}
}
int sum = 0;
++sum;
}
}
int sum = 0;
for (int i = 0; i < size; ++i) {
++sum;
}
}
int sum = 0;
for (int i = 0; i < size; ++i) {
++sum;
}
}
if (s instanceof Hashtable) {
// entest3(ht, size);
// entest4(ht, size);
}
}
}
}
}
}
try {
}
catch (Exception e) { e.printStackTrace(); return; }
int sum = 0;
}
reallyAssert(!eqt);
reallyAssert(s.isEmpty());
}
if (!(s instanceof Serializable))
return;
for (int i = 0; i < size; i++) {
}
out.writeObject(s);
if (s instanceof IdentityHashMap) return;
reallyAssert(s.equals(m));
}
t9(s);
}
static class TestTimer {
private long numOps;
private long startTime;
static void printStats() {
double t;
if (n > 0)
else
}
}
}
return "Get ";
return "Put ";
return "Remove ";
return "Iter ";
else
return null;
}
void finish() {
else {
}
else {
}
}
}
}
static class Stats {
double sum = 0;
double least;
int number = 0;
}
for (int i=size; i>1; i--) {
keys[r] = t;
}
}
}