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
|
/*******************************************************************************
* Copyright (c) 2000, 2008 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.jface.text.tests;
import static org.junit.Assert.assertTrue;
import org.junit.Test;
public class TextHoverPopupTest {
protected int search(int[] array, int x) {
int low= 0;
int high= array.length -1;
while (high > low) {
int offset= (low + high) / 2;
int lookup= array[offset];
if (lookup > x)
high= offset - 1;
else if (lookup < x)
low= offset + 1;
else
low= high= offset;
}
return high;
}
@Test
public void testSearch() {
int[] values= { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
for (int i= 0; i < 10; i++) {
int result= search(values, i);
assertTrue(i == result);
}
int[] values2= { 0, 3, 6, 9, 12, 15, 18, 21, 24, 27 };
for (int i= 0; i < 10; i++) {
int result= search(values2, i * 3);
assertTrue(i == result);
}
}
}
|
