drgreen/android_frameworks_base
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Remove unused performance tests.

Browse Source 
Change-Id: I5a252e314831716f99ce5fbb32d983c7473ee787
This commit is contained in:
Jesse Wilson
2010-12-21 08:21:48 -08:00
parent 41e7e6f933
commit bd1c5da28d
19 changed files with 46 additions and 4657 deletions
Download Patch File Download Diff File Expand all files Collapse all files

87
core/tests/coretests/AndroidManifest.xml
View File

@ -4,9 +4,9 @@
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
@ -117,7 +117,7 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.focus.FocusAfterRemoval" android:label="FocusAfterRemoval">
@ -145,28 +145,28 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.focus.ListOfEditTexts" android:label="ListOfEditTexts">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.focus.ListOfInternalSelectionViews" android:label="ListOfInternalSelectionViews">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.focus.ListWithFooterViewAndNewLabels" android:label="FocusListWithFooter">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.focus.ListWithMailMessages" android:label="ListWithMailMessages">
@ -180,7 +180,7 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.focus.VerticalFocusSearch" android:label="VerticalFocusSearch">
@ -257,7 +257,7 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.layout.linear.LLOfButtons1" android:label="LLOfButtons1">
@ -285,7 +285,7 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.layout.linear.Weight" android:label="Weight">
@ -483,7 +483,7 @@
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.view.PreDrawListener" android:label="PreDrawListener">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
@ -518,7 +518,7 @@
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListScrollListener" android:label="ListScrollListener">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
@ -532,21 +532,21 @@
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListTakeFocusFromSide" android:label="ListTakeFocusFromSide">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListBottomGravity" android:label="ListBottomGravity">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListBottomGravityMany" android:label="ListBottomGravityMany">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
@ -568,19 +568,19 @@
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListTopGravityMany" android:label="ListTopGravityMany">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListEndingWithMultipleSeparators" android:label="ListEndingWithMultipleSeparators">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListGetSelectedView" android:label="ListGetSelectedView">
@ -615,21 +615,21 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListOfItemsTallerThanScreen" android:label="ListOfItemsTallerThanScreen">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListOfThinItems" android:label="ListOfThinItems">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListOfShortTallShort" android:label="ListOfShortTallShort">
@ -643,14 +643,14 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListWithOffScreenNextSelectable" android:label="ListWithOffScreenNextSelectable">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListWithFirstScreenUnSelectable" android:label="ListWithFirstScreenUnSelectable">
@ -665,7 +665,7 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListWithHeaders" android:label="ListWithHeaders">
@ -686,14 +686,14 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListWithScreenOfNoSelectables" android:label="ListWithScreenOfNoSelectables">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListItemFocusablesFarApart" android:label="ListItemFocusablesFarApart">
@ -721,21 +721,21 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListItemsExpandOnSelection" android:label="ListItemsExpandOnSelection">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListWithOnItemSelectedAction" android:label="ListWithOnItemSelectedAction">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListItemISVAndButton" android:label="ListItemISVAndButton">
@ -770,30 +770,30 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListManagedCursor" android:label="ListManagedCursor">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.listview.ListWithEmptyView" android:label="ListWithEmptyView">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.gridview.GridInHorizontal" android:label="GridInHorizontal">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.gridview.GridPadding" android:label="GridPadding">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
@ -884,21 +884,21 @@
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.gridview.GridVerticalSpacingStackFromBottom" android:label="GridVerticalSpacingStackFromBottom">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.gridview.GridSingleColumn" android:label="GridSingleColumn">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.view.menu.ListContextMenu" android:label="ListContextMenu">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
@ -1012,7 +1012,7 @@
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</activity>
<activity android:name="android.widget.AutoCompleteTextViewSimple"
android:label="AutoCompleteTextViewSimple">
<intent-filter>
@ -1037,9 +1037,9 @@
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.FRAMEWORK_INSTRUMENTATION_TEST" />
</intent-filter>
</intent-filter>
</activity>
<!-- Activity-level metadata -->
@ -1052,13 +1052,6 @@
<meta-data android:name="com.android.frameworks.coretests.reference"
android:resource="@xml/metadata_app" />
<activity android:name="AndroidPerformanceTests" android:label="Android Performance Tests">
<intent-filter>
<action android:name="android.intent.action.MAIN" />
<category android:name="android.intent.category.UNIT_TEST" />
</intent-filter>
</activity>
<!-- Application components used for activity tests -->
<activity android:name="android.app.activity.TestedActivity"

7
test-runner/src/android/test/InstrumentationTestRunner.java
View File

@ -172,8 +172,6 @@ public class InstrumentationTestRunner extends Instrumentation implements TestSu
/** @hide */
public static final String ARGUMENT_TEST_SIZE_PREDICATE = "size";
/** @hide */
public static final String ARGUMENT_INCLUDE_PERF = "perf";
/** @hide */
public static final String ARGUMENT_DELAY_MSEC = "delay_msec";
private static final String SMALL_SUITE = "small";
@ -305,7 +303,6 @@ public class InstrumentationTestRunner extends Instrumentation implements TestSu
Predicate<TestMethod> testSizePredicate = null;
Predicate<TestMethod> testAnnotationPredicate = null;
Predicate<TestMethod> testNotAnnotationPredicate = null;
boolean includePerformance = false;
String testClassesArg = null;
boolean logOnly = false;
@ -323,7 +320,6 @@ public class InstrumentationTestRunner extends Instrumentation implements TestSu
testNotAnnotationPredicate = getNotAnnotationPredicate(
arguments.getString(ARGUMENT_NOT_ANNOTATION));
includePerformance = getBooleanArgument(arguments, ARGUMENT_INCLUDE_PERF);
logOnly = getBooleanArgument(arguments, ARGUMENT_LOG_ONLY);
mCoverage = getBooleanArgument(arguments, "coverage");
mCoverageFilePath = arguments.getString("coverageFile");
@ -348,9 +344,6 @@ public class InstrumentationTestRunner extends Instrumentation implements TestSu
if (testNotAnnotationPredicate != null) {
testSuiteBuilder.addRequirements(testNotAnnotationPredicate);
}
if (!includePerformance) {
testSuiteBuilder.addRequirements(REJECT_PERFORMANCE);
}
if (testClassesArg == null) {
if (mPackageOfTests != null) {

33
test-runner/src/android/test/PerformanceTestBase.java
View File

@ -1,33 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.test;
import junit.framework.TestCase;
/**
* {@hide} Not needed for SDK.
*/
public class PerformanceTestBase extends TestCase implements PerformanceTestCase {
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
return 0;
}
public boolean isPerformanceOnly() {
return true;
}
}

3
test-runner/src/android/test/suitebuilder/TestPredicates.java
View File

@ -17,7 +17,6 @@
package android.test.suitebuilder;
import android.test.InstrumentationTestCase;
import android.test.PerformanceTestBase;
import android.test.suitebuilder.annotation.HasAnnotation;
import android.test.suitebuilder.annotation.Suppress;
import android.test.suitebuilder.annotation.LargeTest;
@ -43,7 +42,5 @@ public class TestPredicates {
public static final Predicate<TestMethod> SELECT_LARGE = new HasAnnotation(LargeTest.class);
public static final Predicate<TestMethod> REJECT_SUPPRESSED =
Predicates.not(new HasAnnotation(Suppress.class));
public static final Predicate<TestMethod> REJECT_PERFORMANCE =
Predicates.not(new AssignableFrom(PerformanceTestBase.class));
}

11
test-runner/src/android/test/suitebuilder/TestSuiteBuilder.java
View File

@ -24,7 +24,6 @@ import com.android.internal.util.Predicate;
import com.google.android.collect.Lists;
import static android.test.suitebuilder.TestGrouping.SORT_BY_FULLY_QUALIFIED_NAME;
import static android.test.suitebuilder.TestPredicates.REJECT_SUPPRESSED;
import static android.test.suitebuilder.TestPredicates.REJECT_PERFORMANCE;
import junit.framework.Test;
import junit.framework.TestCase;
@ -71,9 +70,9 @@ public class TestSuiteBuilder {
this.testCases = Lists.newArrayList();
addRequirements(REJECT_SUPPRESSED);
}
/** @hide pending API Council approval */
public TestSuiteBuilder addTestClassByName(String testClassName, String testMethodName,
public TestSuiteBuilder addTestClassByName(String testClassName, String testMethodName,
Context context) {
AndroidTestRunner atr = new AndroidTestRunner();
@ -83,7 +82,7 @@ public class TestSuiteBuilder {
this.testCases.addAll(atr.getTestCases());
return this;
}
/** @hide pending API Council approval */
public TestSuiteBuilder addTestSuite(TestSuite testSuite) {
for (TestCase testCase : (List<TestCase>) TestCaseUtil.getTests(testSuite, true)) {
@ -242,7 +241,7 @@ public class TestSuiteBuilder {
/**
* @return the test package that represents the packages that were included for our test suite.
*
*
* {@hide} Not needed for 1.0 SDK.
*/
protected TestGrouping getTestGrouping() {
@ -262,7 +261,7 @@ public class TestSuiteBuilder {
addSuiteIfNecessary(testMethod.getEnclosingClassname());
suiteForCurrentClass.addTest(testMethod.createTest());
}
private void addTest(Test test) {
addSuiteIfNecessary(test.getClass().getName());
suiteForCurrentClass.addTest(test);

3
test-runner/src/android/test/suitebuilder/UnitTestSuiteBuilder.java
View File

@ -18,7 +18,7 @@ package android.test.suitebuilder;
/**
* A suite builder that finds unit tests.
*
*
* {@hide} Not needed for 1.0 SDK.
*/
public class UnitTestSuiteBuilder extends TestSuiteBuilder {
@ -31,6 +31,5 @@ public class UnitTestSuiteBuilder extends TestSuiteBuilder {
public UnitTestSuiteBuilder(String name, ClassLoader classLoader) {
super(name, classLoader);
addRequirements(TestPredicates.REJECT_INSTRUMENTATION);
addRequirements(TestPredicates.REJECT_PERFORMANCE);
}
}

35
tests/CoreTests/android/core/AndroidPerformanceTests.java
View File

@ -1,35 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.TestListActivity;
public class AndroidPerformanceTests extends TestListActivity {
@Override
public String getTestSuite() {
return "com.android.unit_tests.AndroidPerformanceTests$Suite";
}
public static class Suite {
public static String[] children() {
return new String[] {
JavaPerformanceTests.class.getName(),
PerformanceTests.class.getName(),
};
}
}
}

327
tests/CoreTests/android/core/ArrayListPerformanceTest.java
View File

@ -1,327 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import java.util.ArrayList;
import android.test.PerformanceTestBase;
public class ArrayListPerformanceTest extends PerformanceTestBase {
private ArrayList<Integer> mList;
@Override
@SuppressWarnings("unchecked")
protected void setUp() throws Exception {
super.setUp();
mList = new ArrayList();
mList.add(0);
mList.add(1);
mList.add(2);
mList.add(3);
mList.add(4);
mList.add(5);
mList.add(6);
mList.add(7);
mList.add(8);
mList.add(9);
}
public void testArrayListAdd() {
int i = 0;
for (; i < 10; i++) {
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
mList.add(i);
}
}
public void testArrayListAdd1() {
int i = 0;
for (; i < 10; i++) {
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
mList.add(7, i);
}
}
public void testArrayListToArray() {
Object rArray;
int i = 0;
for (; i < 100; i++) {
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
rArray = mList.toArray();
}
}
public void testArrayListSize() {
int i = 0, len;
for (; i < 100; i++) {
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
len = mList.size();
}
}
public void testArrayListGet() {
int i = 0, value;
int len = mList.size();
for (; i < len; i++) {
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
value = mList.get(i);
}
}
public void testArrayListContains() {
boolean flag;
int i = 0;
for (; i < 100; i++) {
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
flag = mList.contains(i);
}
}
public void testArrayListToArray1() {
Integer[] rArray = new Integer[10];
Integer[] mArray;
int i = 0;
for (; i < 100; i++) {
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
mArray = mList.toArray(rArray);
}
}
public void testArrayListSet() {
int i = 0;
for (; i < 10; i++) {
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
mList.set(5, 0);
}
}
public void testArrayListIndexOf() {
int i = 0, index;
for (; i < 100; i++) {
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
index = mList.indexOf(0);
}
}
public void testArrayListLastIndexOf() {
int i = 0, index;
for (; i < 100; i++) {
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
index = mList.lastIndexOf(0);
}
}
@SuppressWarnings("unchecked")
public void testArrayListRemove() {
ArrayList<Integer> aList;
aList = new ArrayList();
for (int j = 0; j < 10000; j++) {
aList.add(0);
}
int i = 0, index;
for (; i < 10; i++) {
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
index = aList.remove(0);
}
}
@SuppressWarnings("unchecked")
public void testArrayListAddAll() {
ArrayList<Integer> aList = new ArrayList();
int i = 0;
boolean b;
for (; i < 10; i++) {
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
b = aList.addAll(mList);
}
}
@SuppressWarnings("unchecked")
public void testArrayListRemove1() {
ArrayList<String> aList;
String s;
aList = new ArrayList();
for (int j = 0; j < 100; j++) {
aList.add("a");
aList.add("b");
}
s = new String("a");
int i = 0;
boolean b;
for (; i < 10; i++) {
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
b = aList.remove(s);
}
}
@SuppressWarnings("unchecked")
public void testArrayListAddAll1() {
ArrayList<Integer> aList = new ArrayList();
int i = 0;
boolean b;
for (; i < 10; i++) {
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
b = aList.addAll(0, mList);
}
}
public void testArrayListClone() {
Object rObj;
int i = 0;
for (; i < 100; i++) {
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
rObj = mList.clone();
}
}
}

93
tests/CoreTests/android/core/HashMapPerfTest.java
View File

@ -1,93 +0,0 @@
/*
* Copyright (C) 2008 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.os.SystemClock;
import android.test.suitebuilder.annotation.LargeTest;
import junit.framework.TestCase;
import java.util.HashMap;
import java.util.Random;
/**
* Tests basic functionality of HashMaps and prints the time needed to System.out
*/
public class HashMapPerfTest extends TestCase {
private static final Random sRandom = new Random(1);
class StringThing {
String mId;
public StringThing() {
int len = sRandom.nextInt(20) + 1;
char[] chars = new char[len];
chars[0] = 't';
for (int i = 1; i < len; i++) {
chars[i] = (char) ('q' + sRandom.nextInt(4));
}
mId = new String(chars, 0, len);
}
public String getId() {
return mId;
}
}
private static final int NUM_ELTS = 1000;
private static final int ITERS = 100;
String[] keyCopies = new String[NUM_ELTS];
private static final boolean lookupByOriginals = false;
@LargeTest
public void testHashMapPerformance() throws Exception {
StringThing[] st = new StringThing[NUM_ELTS];
for (int i = 0; i < NUM_ELTS; i++) {
st[i] = new StringThing();
keyCopies[i] = st[i].getId();
}
// android.os.Debug.startMethodTracing();
long start = SystemClock.uptimeMillis();
for (int i = 0; i < ITERS; i++) {
HashMap<String, StringThing> map = new HashMap<String, StringThing>();
for (int j = 0; j < NUM_ELTS; j++) {
StringThing s = st[i];
map.put(s.getId(), s);
}
for (int j = 0; j < NUM_ELTS; j++) {
if (lookupByOriginals) {
StringThing s = st[i];
map.get(s.getId());
} else {
map.get(keyCopies[j]);
}
}
}
long finish = SystemClock.uptimeMillis();
// android.os.Debug.stopMethodTracing();
// This should be an assertion instead
// System.out.println("time (" + NUM_ELTS +
// ", elts, " + ITERS +
// " iters) = " + (finish - start));
}
}

185
tests/CoreTests/android/core/HashMapPerformanceTest.java
View File

@ -1,185 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import java.util.Collection;
import java.util.HashMap;
import java.util.Set;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
public class HashMapPerformanceTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
public HashMap mMap;
public String[] mKeys;
@Override
@SuppressWarnings("unchecked")
protected void setUp() throws Exception {
super.setUp();
mMap = new HashMap();
mKeys = new String[ITERATIONS];
for (int i = ITERATIONS - 1; i >= 0; i--) {
mKeys[i] = Integer.toString(i, 16);
mMap.put(mKeys[i], i);
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
public void testHashMapGet() {
int num;
for (int i = ITERATIONS - 1; i >= 0; i--) {
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
num = (Integer) mMap.get(mKeys[i]);
}
}
public void testHashMapKeySet() {
Set keyset;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
keyset = mMap.keySet();
}
}
public void testHashMapEntrySet() {
Set keyset;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
keyset = mMap.entrySet();
}
}
public void testHashMapValues() {
Collection c;
for (int i = ITERATIONS - 1; i >= 0; i--) {
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
c = mMap.values();
}
}
public void testHashMapSize() {
int len;
for (int i = ITERATIONS - 1; i >= 0; i--) {
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
len = mMap.size();
}
}
public void testHashMapContainsValue() {
boolean flag;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
flag = mMap.containsValue(i);
}
}
public void testHashMapRemove() {
for (int i = ITERATIONS - 1; i >= 0; i--) {
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
mMap.remove(mKeys[i]);
}
}
public void testHashMapClone() {
HashMap cMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
cMap = (HashMap) mMap.clone();
}
}
}

207
tests/CoreTests/android/core/HashSetTest.java
View File

@ -1,207 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
import java.util.HashSet;
import java.util.Iterator;
/**
* Implements basic performance test functionality for HashSets
*/
public class HashSetTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
public static HashSet<Integer> sSet;
@Override
protected void setUp() throws Exception {
super.setUp();
sSet = new HashSet<Integer>();
for (int i = ITERATIONS - 1; i >= 0; i--) {
sSet.add(i);
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
/**
*
* Tests performance for the HashSet method Add(Object arg 0)
*
*/
@SuppressWarnings("unchecked")
public void testHashSetAdd() {
HashSet set = new HashSet();
for (int i = ITERATIONS - 1; i >= 0; i--) {
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
}
}
/**
*
* Tests performance of HashSet method contains(Object arg 0)
*
*/
public void testHashSetContains() {
Integer index = new Integer(500);
boolean flag;
HashSet set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
}
}
/**
*
* Tests performance of HashSet method size()
*
*/
public void testHashSetSize() {
int num;
HashSet set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
num = set.size();
num = set.size();
num = set.size();
num = set.size();
num = set.size();
num = set.size();
num = set.size();
num = set.size();
num = set.size();
}
}
/**
*
* Tests performance of the HashSet method -iterator()
*
*/
public void testHashSetIterator() {
Iterator iterator;
HashSet set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
}
}
/**
*
* Tests performance for the HashSet method Remove(Object arg 0)
*
*/
@SuppressWarnings("unchecked")
public void testHashSetRemove() {
HashSet set = new HashSet(sSet);
for (int i = ITERATIONS - 1; i >= 0; i--) {
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
}
}
/**
*
* Tests performance for the HashSet method isEmpty(Object arg 0)
*
*/
public void testHashSetIsEmpty() {
HashSet set = sSet;
boolean flag;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
flag = set.isEmpty();
}
}
/**
*
* Tests performance for the HashSet method clone()
*
*/
public void testHashSetClone() {
HashSet hSet = sSet;
Object set;
for (int i = ITERATIONS - 1; i > 0; i--) {
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
set = hSet.clone();
}
}
}

357
tests/CoreTests/android/core/HashtableTest.java
View File

@ -1,357 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
import java.util.Hashtable;
import java.util.Set;
import java.util.Enumeration;
/**
* Implements basic performance test functionality for java.util.Hashtable
*/
public class HashtableTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
public Hashtable<String, Integer> sTable;
public String[] sKeys;
@Override
@SuppressWarnings("unchecked")
protected void setUp() throws Exception {
super.setUp();
sTable = new Hashtable();
sKeys = new String[ITERATIONS];
for (int i = ITERATIONS - 1; i >= 0; i--) {
sKeys[i] = Integer.toString(i, 16);
sTable.put(sKeys[i], i);
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
@SuppressWarnings("unchecked")
public void testHashtablePut() {
Hashtable hTable = new Hashtable();
for (int i = ITERATIONS - 1; i >= 0; i--) {
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
hTable.put(i, i);
}
}
public void testHashtableGet() {
int value;
String[] keys = sKeys;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
value = hTable.get(keys[i]);
}
}
public void testHashtablekeyset() {
Set keyset;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
keyset = hTable.keySet();
}
}
/**
*
*/
public void testHashtableEntrySet() {
Set keyset;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
keyset = hTable.entrySet();
}
}
public void testHashtableSize() {
int len;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
len = hTable.size();
}
}
public void testHashtableContainsValue() {
boolean flag;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
flag = hTable.containsValue(i);
}
}
@SuppressWarnings("unchecked")
public void testHashtableRemove() {
Hashtable<String, Integer> hTable = new Hashtable(sTable);
String[] keys = sKeys;
for (int i = ITERATIONS - 1; i >= 0; i--) {
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
hTable.remove(keys[i]);
}
}
public void testHashtableContains() {
Hashtable<String, Integer> hTable = sTable;
boolean flag;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
flag = hTable.contains(i);
}
}
public void testHashtableContainsKey() {
Hashtable<String, Integer> hTable = sTable;
boolean flag;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
flag = hTable.containsKey(i);
}
}
public void testHashtableIsEmpty() {
Hashtable<String, Integer> hTable = sTable;
boolean flag;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
flag = hTable.isEmpty();
}
}
public void testHashtableKeys() {
Hashtable<String, Integer> hTable = sTable;
Enumeration<String> keys;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
keys = hTable.keys();
}
}
public void testHashtableElements() {
Hashtable<String, Integer> hTable = sTable;
Enumeration<Integer> elements;
for (int i = ITERATIONS - 1; i >= 0; i--) {
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
elements = hTable.elements();
}
}
public void testHashtableHashCode() {
int index;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
index = hTable.hashCode();
}
}
public void testHashtableEquals() {
boolean flag;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
flag = hTable.equals(hTable);
}
}
public void testHashtableToString() {
String str;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
str = hTable.toString();
}
}
@SuppressWarnings("unchecked")
public void testHashtablePutAll() {
Hashtable<String, Integer> hTable = new Hashtable();
Hashtable<String, Integer> hTable1 = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
hTable.putAll(hTable1);
}
}
/**
*
* clone() returns a Hashtable .. It should return Object as per the
* specification.
*
*/
public void testHashtableClone() {
Hashtable hashTable;
Hashtable<String, Integer> hTable = sTable;
for (int i = ITERATIONS - 1; i >= 0; i--) {
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
hashTable = (Hashtable) hTable.clone();
}
}
}

37
tests/CoreTests/android/core/JavaPerformanceTests.java
View File

@ -1,37 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
/**
*
*/
public class JavaPerformanceTests {
public static String[] children() {
return new String[] {
HashMapPerformanceTest.class.getName(),
ArrayListPerformanceTest.class.getName(),
TreeMapPerformanceTest.class.getName(),
TreeSetTest.class.getName(),
HashSetTest.class.getName(),
HashtableTest.class.getName(),
VectorTest.class.getName(),
LinkedListTest.class.getName(),
MathPerformanceTest.class.getName(),
};
}
}

529
tests/CoreTests/android/core/LinkedListTest.java
View File

@ -1,529 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
import java.util.LinkedList;
import java.util.ListIterator;
/**
* This class contains performance tests for methods in java.util.LinkedList
*
*/
@SuppressWarnings("unchecked")
public class LinkedListTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
LinkedList<Integer> mLinkedList;
@Override
protected void setUp() throws Exception {
super.setUp();
mLinkedList = new LinkedList();
for (int i = ITERATIONS - 1; i >= 0; i--) {
mLinkedList.add(i);
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
public void testLinkedListAdd() {
LinkedList<Integer> list = new LinkedList();
for (int i = ITERATIONS - 1; i >= 0; i--) {
list.add(i);
list.add(i);
list.add(i);
list.add(i);
list.add(i);
list.add(i);
list.add(i);
list.add(i);
list.add(i);
list.add(i);
}
}
public void testLinkedListAdd1() {
LinkedList<Integer> list = new LinkedList();
for (int i = ITERATIONS - 1; i >= 0; i--) {
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
list.add(0, i);
}
}
public void testLinkedListToArray() {
Object array;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
array = list.toArray();
}
}
public void testLinkedListSize() {
LinkedList<Integer> list = mLinkedList;
int len;
for (int i = ITERATIONS - 1; i >= 0; i--) {
len = list.size();
len = list.size();
len = list.size();
len = list.size();
len = list.size();
len = list.size();
len = list.size();
len = list.size();
len = list.size();
len = list.size();
}
}
public void testLinkedListGet() {
int element;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
element = list.get(i);
}
}
public void testLinkedListContains() {
boolean flag;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
flag = list.contains(i);
}
}
public void testLinkedListToArray1() {
Integer[] rArray = new Integer[100];
Integer[] array;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
array = list.toArray(rArray);
}
}
public void testLinkedListSet() {
LinkedList<Integer> list = mLinkedList;
int value1 = 500, value2 = 0;
for (int i = ITERATIONS - 1; i >= 0; i--) {
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
list.set(value1, value2);
}
}
public void testLinkedListIndexOf() {
int index;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
index = list.indexOf(0);
}
}
public void testLinkedListLastIndexOf() {
int index;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
index = list.lastIndexOf(0);
}
}
public void testLinkedListRemove() {
int index;
LinkedList<Integer> list = new LinkedList(mLinkedList);
for (int i = 10; i > 0; i--) {
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
index = list.remove();
}
}
public void testLinkedListRemove1() {
int index;
LinkedList<Integer> list = new LinkedList(mLinkedList);
for (int i = 10; i > 0; i--) {
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
index = list.remove(0);
}
}
public void testLinkedListRemoveFirst() {
int index;
LinkedList<Integer> list = new LinkedList(mLinkedList);
for (int i = 10; i > 0; i--) {
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
index = list.removeFirst();
}
}
public void testLinkedListRemoveLast() {
int index;
LinkedList<Integer> list = new LinkedList(mLinkedList);
for (int i = 10; i > 0; i--) {
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
index = list.removeLast();
}
}
public void testLinkedListAddAll() {
LinkedList<Integer> mList = mLinkedList;
boolean flag;
LinkedList<Integer> list = new LinkedList();
for (int i = 10; i > 0; i--) {
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
flag = list.addAll(mList);
}
}
public void testLinkedListRemove2() {
LinkedList<String> list;
String s = new String("a");
list = new LinkedList();
for (int j = 1000; j > 0; j--) {
list.add("a");
list.add("b");
}
boolean flag;
for (int i = 10; i > 0; i--) {
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
flag = list.remove(s);
}
}
public void testLinkedListAddAll1() {
LinkedList<Integer> mList = new LinkedList();
int pos = 0;
boolean flag;
LinkedList<Integer> list = mLinkedList;
for (int i = 0; i < 10; i++) {
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
flag = mList.addAll(pos, list);
}
}
public void testLinkedListClone() {
Object rObj;
LinkedList<Integer> list = mLinkedList;
for (int i = 100; i > 0; i--) {
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
rObj = list.clone();
}
}
public void testLinkedListHashcode() {
int element;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
element = list.hashCode();
}
}
public void testLinkedListElement() {
int element;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
element = list.element();
element = list.element();
element = list.element();
element = list.element();
element = list.element();
element = list.element();
element = list.element();
element = list.element();
element = list.element();
element = list.element();
}
}
public void testLinkedListToString() {
String str;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
str = list.toString();
}
}
public void testLinkedListIsEmpty() {
boolean flag;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
flag = list.isEmpty();
}
}
public void testLinkedListOffer() {
LinkedList<Integer> list = new LinkedList();
for (int i = ITERATIONS - 1; i >= 0; i--) {
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
list.offer(i);
}
}
public void testLinkedListPeek() {
int element;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
element = list.peek();
}
}
public void testLinkedListPoll() {
int element;
LinkedList<Integer> list = new LinkedList(mLinkedList);
for (int i = 10; i > 0; i--) {
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
element = list.poll();
}
}
public void testLinkedListAddLast() {
LinkedList<Integer> list = new LinkedList();
for (int i = ITERATIONS - 1; i >= 0; i--) {
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
list.addLast(i);
}
}
public void testLinkedListAddFirst() {
LinkedList<Integer> list = new LinkedList();
for (int i = ITERATIONS - 1; i >= 0; i--) {
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
list.addFirst(i);
}
}
public void testLinkedListIterator() {
ListIterator iterator;
LinkedList<Integer> list = mLinkedList;
for (int i = ITERATIONS - 1; i >= 0; i--) {
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
iterator = list.listIterator();
}
}
}

380
tests/CoreTests/android/core/MathPerformanceTest.java
View File

@ -1,380 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
/**
*
* Implements basic performance test functionality for java.lang.Math
*
*/
public class MathPerformanceTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
public static final double sDouble1 = -2450.50;
public static final double sDouble2 = -500;
public static final float sFloat = 300.50f;
public static final int sInt = 90;
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
public void testDoubleAbs() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
result = Math.abs(sDouble1);
}
}
public void testFloatAbs() {
float result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
result = Math.abs(sFloat);
}
}
public void testMathSin() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
result = Math.sin(sDouble1);
}
}
public void testMathCos() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
result = Math.cos(sDouble1);
}
}
public void testMathTan() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
result = Math.tan(sDouble1);
}
}
public void testMathASin() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
result = Math.asin(sDouble1);
}
}
public void testMathACos() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
result = Math.acos(sDouble1);
}
}
public void testMathATan() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
result = Math.atan(sDouble1);
}
}
public void testMathLog() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
result = Math.log(sDouble1);
}
}
public void testMathSqrt() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
result = Math.sqrt(sDouble1);
}
}
public void testMathCeil() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
result = Math.ceil(sDouble1);
}
}
public void testMathRound() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
result = Math.round(sDouble1);
}
}
public void testMathFloor() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
result = Math.floor(sDouble1);
}
}
public void testMathExp() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
result = Math.exp(sDouble1);
}
}
/**
*
*/
public void testMathPow() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
result = Math.pow(sDouble1, sDouble2);
}
}
public void testMathMax() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
result = Math.max(sDouble1, sDouble2);
}
}
public void testMathMin() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
result = Math.min(sDouble1, sDouble2);
}
}
public void testMathRandom() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
result = Math.random();
}
}
public void testMathIEEERemainder() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
result = Math.IEEEremainder(sDouble1, sDouble2);
}
}
public void testMathToDegrees() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
result = Math.toDegrees(sDouble1);
}
}
public void testMathToRadians() {
double result;
for (int i = ITERATIONS - 1; i >= 0; i--) {
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
result = Math.toRadians(sDouble1);
}
}
}

1224
tests/CoreTests/android/core/PerformanceTests.java
View File

File diff suppressed because it is too large Load Diff

281
tests/CoreTests/android/core/TreeMapPerformanceTest.java
View File

@ -1,281 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
import java.util.Collection;
import java.util.Set;
import java.util.SortedMap;
import java.util.TreeMap;
/**
* Implements basic performance test functionality for java.util.TreeMap
*/
public class TreeMapPerformanceTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
public static TreeMap<String, Integer> sMap;
public static String[] sKeys;
@Override
@SuppressWarnings("unchecked")
protected void setUp() throws Exception {
super.setUp();
sMap = new TreeMap();
sKeys = new String[ITERATIONS];
for (int i = ITERATIONS - 1; i >= 0; i--) {
sKeys[i] = Integer.toString(i, 16);
sMap.put(sKeys[i], i);
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
@SuppressWarnings("unchecked")
public void testTreeMapPut() {
TreeMap map = new TreeMap();
for (int i = ITERATIONS - 1; i >= 0; i--) {
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
map.put(i, i);
}
}
public void testTreeMapGet() {
int value;
TreeMap<String, Integer> map = sMap;
String[] keys = sKeys;
for (int i = ITERATIONS - 1; i >= 0; i--) {
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
value = map.get(keys[i]);
}
}
public void testTreeMapFirstKey() {
String key;
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
key = map.firstKey();
}
}
public void testTreeMapKeySet() {
Set keyset;
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
keyset = map.keySet();
}
}
public void testTreeMapEntrySet() {
Set keyset;
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
keyset = map.entrySet();
}
}
public void testTreeMapValues() {
Collection collection;
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
collection = map.values();
}
}
public void testTreeMapSize() {
int len;
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
len = map.size();
len = map.size();
len = map.size();
len = map.size();
len = map.size();
len = map.size();
len = map.size();
len = map.size();
len = map.size();
len = map.size();
}
}
public void testTreeMapContainsKey() {
boolean flag;
String key = sKeys[525];
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
flag = map.containsKey(key);
}
}
public void testTreeMapContainsValue() {
boolean flag;
TreeMap<String, Integer> map = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
flag = map.containsValue(i);
}
}
public void testTreeMapHeadMap() {
SortedMap map;
String str = sKeys[100];
TreeMap<String, Integer> tMap = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
map = tMap.headMap(str);
}
}
public void testTreeMapSubMap() {
String str1 = sKeys[400];
String str2 = sKeys[500];
SortedMap map;
TreeMap<String, Integer> tMap = sMap;
for (int i = ITERATIONS - 1; i >= 0; i--) {
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
map = tMap.subMap(str1, str2);
}
}
public void testTreeMapTailMap() {
String str = sKeys[900];
TreeMap<String, Integer> tMap = sMap;
SortedMap map;
for (int i = ITERATIONS - 1; i >= 0; i--) {
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
map = tMap.tailMap(str);
}
}
@SuppressWarnings("unchecked")
public void testTreeMapRemove() {
TreeMap<String, Integer> tMap = new TreeMap(sMap);
String[] keys = sKeys;
for (int i = ITERATIONS - 1; i >= 0; i--) {
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
tMap.remove(keys[i]);
}
}
}

349
tests/CoreTests/android/core/TreeSetTest.java
View File

@ -1,349 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
import java.util.TreeSet;
import java.util.SortedSet;
import java.util.Iterator;
import java.util.Comparator;
/**
* Implements basic performance test functionality for java.util.TreeSet
*/
public class TreeSetTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
public static TreeSet<Integer> sSet;
@Override
protected void setUp() throws Exception {
super.setUp();
sSet = new TreeSet<Integer>();
for (int i = ITERATIONS - 1; i >= 0; i--) {
sSet.add(i);
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
/**
*
* Tests performance for the java.util.TreeSet method Add(Object arg 0)
*
*/
@SuppressWarnings("unchecked")
public void testTreeSetAdd() {
TreeSet<Integer> set = new TreeSet();
for (int i = ITERATIONS - 1; i >= 0; i--) {
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
set.add(i);
}
}
/**
*
* Tests performance for the java.util.TreeSet method - first()
*
*/
public void testTreeSetFirst() {
int value;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
value = set.first();
value = set.first();
value = set.first();
value = set.first();
value = set.first();
value = set.first();
value = set.first();
value = set.first();
value = set.first();
}
}
/**
*
* Tests performance for the java.util.TreeSet method - last()
*
*/
public void testTreeSetLast() {
int value;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
value = set.last();
value = set.last();
value = set.last();
value = set.last();
value = set.last();
value = set.last();
value = set.last();
value = set.last();
value = set.last();
}
}
/**
*
* Tests performance of the java.util.TreeSet method- contains(Object arg0)
*
*/
public void testTreeSetContains() {
Integer index = new Integer(500);
boolean flag;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
flag = set.contains(index);
}
}
/**
*
* Tests performance for the java.util.TreeSet method - size()
*
*/
public void testTreeSetSize() {
int value;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
value = set.size();
value = set.size();
value = set.size();
value = set.size();
value = set.size();
value = set.size();
value = set.size();
value = set.size();
value = set.size();
}
}
/**
*
* Tests performance for the java.util.TreeSet method - iterator()
*
*/
public void testTreeSetIterator() {
Iterator iterator;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
iterator = set.iterator();
}
}
/**
*
* Tests performance for the java.util.TreeSet method - comparator()
*
*/
public void testTreeSetComparator() {
Comparator comparator;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
comparator = set.comparator();
}
}
/**
*
* Tests performance for the java.util.TreeSet method - clone()
*
*/
public void testTreeSetClone() {
Object obj;
TreeSet<Integer> set = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
obj = set.clone();
}
}
/**
*
* Tests performance of the java.util.TreeSet method - remove(Object arg0)
*
*/
@SuppressWarnings("unchecked")
public void testTreeSetRemove() {
TreeSet<Integer> set = new TreeSet(sSet);
for (int i = ITERATIONS - 1; i >= 0; i--) {
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
set.remove(i);
}
}
/**
*
* Tests performance of the java.util.TreeSet method- headSet(Integer arg0)
*
*/
public void testTreeSetHeadSet() {
Integer value = new Integer(100);
SortedSet set;
TreeSet<Integer> tSet = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
set = tSet.headSet(value);
}
}
/**
*
* Tests performance of subSet(Integer arg0, Integer arg1) - TreeSet
*
*/
public void testTreeSetSubSet() {
Integer value = new Integer(400);
Integer nInt = new Integer(500);
SortedSet set;
TreeSet<Integer> tSet = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
set = tSet.subSet(value, nInt);
}
}
/**
*
* Tests performance of tailSet(Integer arg0) - TreeSet
*
*/
public void testTreeSetTailSet() {
Integer value = new Integer(900);
SortedSet set;
TreeSet<Integer> tSet = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
set = tSet.tailSet(value);
}
}
/**
*
* Tests performance for the java.util.TreeSet method - isEmpty()
*
*/
public void testTreeSetIsEmpty() {
boolean flag;
TreeSet<Integer> tSet = sSet;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
flag = tSet.isEmpty();
}
}
}

555
tests/CoreTests/android/core/VectorTest.java
View File

@ -1,555 +0,0 @@
/*
* Copyright (C) 2007 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package android.core;
import android.test.PerformanceTestBase;
import android.test.PerformanceTestCase;
import java.util.Vector;
import java.util.Enumeration;
/**
* Basic Performance Tests for java.util.Vector
*/
@SuppressWarnings("unchecked")
public class VectorTest extends PerformanceTestBase {
public static final int ITERATIONS = 1000;
private Vector<Integer> mVector;
private Vector<String> mStrVector;
private String mTestString = "Hello Android";
@Override
protected void setUp() throws Exception {
super.setUp();
mVector = new Vector();
mStrVector = new Vector();
for (int i = ITERATIONS - 1; i >= 0; i--) {
assertTrue(mVector.add(i));
assertTrue(mStrVector.add(Integer.toString(i)));
}
}
@Override
public int startPerformance(PerformanceTestCase.Intermediates intermediates) {
intermediates.setInternalIterations(ITERATIONS);
return 0;
}
public void testVectorAdd() {
Vector<Integer> vector = new Vector();
for (int i = ITERATIONS - 1; i >= 0; i--) {
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
vector.add(i);
}
}
public void testVectorAdd1() {
Vector<Integer> vector = new Vector();
for (int i = ITERATIONS - 1; i >= 0; i--) {
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
vector.add(0, i);
}
}
public void testVectorToArray() {
Object array;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
array = vector.toArray();
}
}
/**
*
*/
public void testVectorSize() {
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
int mLen;
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
mLen = vector.size();
}
}
public void testVectorGet() {
int element;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
element = vector.get(i);
}
}
public void testVectorContains() {
boolean flag;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
flag = vector.contains(i);
}
}
public void testVectorToArray1() {
Integer[] rArray = new Integer[100];
Integer[] array;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
array = vector.toArray(rArray);
}
}
public void testVectorSet() {
Vector<Integer> vector = mVector;
int pos = 5, value = 0;
for (int i = ITERATIONS - 1; i >= 0; i--) {
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
vector.set(pos, value);
}
}
public void testVectorIndexOf() {
int index, value = 0;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
index = vector.indexOf(value);
}
}
public void testVectorLastIndexOf() {
int index, value = 0;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i >= 0; i--) {
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
index = vector.lastIndexOf(value);
}
}
public void testVectorRemove() {
int index, value = 0;
Vector<Integer> vector = new Vector(mVector);
for (int i = 10; i > 0; i--) {
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
index = vector.remove(value);
}
}
public void testVectorRemoveElement() {
Vector<Integer> vector = new Vector(mVector);
for (int i = 10; i > 0; i--) {
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
vector.removeElement(i);
}
}
public void VectorRemoveElementAt() {
Vector<Integer> vector = new Vector(mVector);
for (int i = 10; i > 0; i--) {
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
vector.removeElementAt(i);
}
}
public void VectorAddAll() {
Vector<Integer> vector = new Vector(), vector1 = mVector;
boolean flag;
for (int i = 10; i > 0; i--) {
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
flag = vector.addAll(vector1);
}
}
public void VectorRemove1() {
Vector<String> vector = mStrVector;
for (int j = 1000; j > 0; j--) {
vector.add("a");
vector.add("b");
}
String s = new String("a");
boolean flag;
for (int i = 10; i > 0; i--) {
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
flag = vector.remove(s);
}
}
public void testVectorAddAll1() {
Vector<Integer> mEmptyVector = new Vector();
boolean flag;
int pos = 0;
Vector<Integer> vector1 = mVector;
Vector<Integer> vector = mEmptyVector;
for (int i = 10; i > 0; i--) {
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
flag = vector.addAll(pos, vector1);
}
}
public void testVectorClone() {
Object obj;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
obj = vector.clone();
}
}
public void testVectorCapacity() {
int capacity;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
capacity = vector.capacity();
}
}
public void testVectorHashcode() {
int element;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
element = vector.hashCode();
}
}
public void testVectorElements() {
Enumeration<Integer> elements;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
elements = vector.elements();
}
}
public void testVectorToString() {
String str;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
str = vector.toString();
}
}
public void testVectorElementAt() {
int element;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
element = vector.elementAt(50);
}
}
public void testVectorAddElement() {
int element;
Vector<String> vector = mStrVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
vector.addElement(mTestString);
}
}
public void testVectorFirstElement() {
int element;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
element = vector.firstElement();
}
}
public void testVectorLastElement() {
int element;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
element = vector.lastElement();
}
}
public void testVectorSetElementAt() {
Vector<Integer> vector = mVector;
int value1 = 500, value2 = 50;
for (int i = ITERATIONS - 1; i > 0; i--) {
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
vector.setElementAt(value1, value2);
}
}
public void testVectorIsEmpty() {
boolean flag;
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
flag = vector.isEmpty();
}
}
public void testVectorCopyInto() {
Integer[] rArray = new Integer[ITERATIONS];
Vector<Integer> vector = mVector;
for (int i = ITERATIONS - 1; i > 0; i--) {
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
vector.copyInto(rArray);
}
}
public void testVectorInsertElementAt() {
Vector<String> vector = mStrVector;
String string = mTestString;
for (int i = ITERATIONS - 1; i > 0; i--) {
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
vector.insertElementAt(string, i);
}
}
}