1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
/*
* Copyright (C) 2011 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 com.android.inputmethod.compat;
import android.test.AndroidTestCase;
public class ArraysCompatUtilsTests extends AndroidTestCase {
// See {@link tests.api.java.util.ArraysTest}.
private static final int ARRAY_SIZE = 100;
private final int[] mIntArray = new int[ARRAY_SIZE];
@Override
protected void setUp() throws Exception {
super.setUp();
for (int counter = 0; counter < ARRAY_SIZE; counter++) {
mIntArray[counter] = counter;
}
}
public void testEmptyArray() {
final int index = ArraysCompatUtils.binarySearch(mIntArray, 0, 0, 0);
assertEquals("empty", ~0, index);
final int compat = ArraysCompatUtils.compatBinarySearch(mIntArray, 0, 0, 0);
assertEquals("empty compat", ~0, compat);
}
public void testEmptyRangeArray() {
final int mid = ARRAY_SIZE / 3;
final int index = ArraysCompatUtils.binarySearch(mIntArray, mid, mid, 1);
assertEquals("empty", ~mid, index);
final int compat = ArraysCompatUtils.compatBinarySearch(mIntArray, mid, mid, 1);
assertEquals("empty compat", ~mid, compat);
}
public void testFind() {
for (int counter = 0; counter < ARRAY_SIZE; counter++) {
final int index = ArraysCompatUtils.binarySearch(mIntArray, 0, ARRAY_SIZE, counter);
assertEquals("found", counter, index);
}
for (int counter = 0; counter < ARRAY_SIZE; counter++) {
final int compat = ArraysCompatUtils.compatBinarySearch(
mIntArray, 0, ARRAY_SIZE, counter);
assertEquals("found compat", counter, compat);
}
}
public void testFindNegative() {
final int offset = ARRAY_SIZE / 2;
for (int counter = 0; counter < ARRAY_SIZE; counter++) {
mIntArray[counter] -= offset;
}
for (int counter = 0; counter < ARRAY_SIZE; counter++) {
final int index = ArraysCompatUtils.binarySearch(
mIntArray, 0, ARRAY_SIZE, counter - offset);
assertEquals("found", counter, index);
}
for (int counter = 0; counter < ARRAY_SIZE; counter++) {
final int compat = ArraysCompatUtils.compatBinarySearch(
mIntArray, 0, ARRAY_SIZE, counter - offset);
assertEquals("found compat", counter, compat);
}
}
public void testNotFountAtTop() {
final int index = ArraysCompatUtils.binarySearch(mIntArray, 0, ARRAY_SIZE, -1);
assertEquals("not found top", ~0, index);
final int compat = ArraysCompatUtils.compatBinarySearch(
mIntArray, 0, ARRAY_SIZE, -1);
assertEquals("not found top compat", ~0, compat);
}
public void testNotFountAtEnd() {
final int index = ArraysCompatUtils.binarySearch(mIntArray, 0, ARRAY_SIZE, ARRAY_SIZE);
assertEquals("not found end", ~ARRAY_SIZE, index);
final int compat = ArraysCompatUtils.compatBinarySearch(
mIntArray, 0, ARRAY_SIZE, ARRAY_SIZE);
assertEquals("not found end compat", ~ARRAY_SIZE, compat);
}
public void testNotFountAtMid() {
final int mid = ARRAY_SIZE / 3;
mIntArray[mid] = mIntArray[mid + 1];
final int index = ArraysCompatUtils.binarySearch(mIntArray, 0, ARRAY_SIZE, mid);
assertEquals("not found mid", ~mid, index);
final int compat = ArraysCompatUtils.compatBinarySearch(
mIntArray, 0, ARRAY_SIZE, mid);
assertEquals("not found mid compat", ~mid, compat);
}
}
|
