7
7
public class TreapTest {
8
8
9
9
@ Test
10
- void build () {
10
+ public void build () {
11
11
Treap treap = new Treap ();
12
12
treap .insert (4 );
13
13
treap .insert (5 );
@@ -17,7 +17,7 @@ void build() {
17
17
}
18
18
19
19
@ Test
20
- void delete () {
20
+ public void delete () {
21
21
Treap treap = new Treap ();
22
22
treap .insert (5 );
23
23
treap .insert (9 );
@@ -31,7 +31,7 @@ void delete() {
31
31
}
32
32
33
33
@ Test
34
- void searchAndFound () {
34
+ public void searchAndFound () {
35
35
Treap treap = new Treap ();
36
36
treap .insert (5 );
37
37
treap .insert (9 );
@@ -40,11 +40,11 @@ void searchAndFound() {
40
40
treap .insert (3 );
41
41
treap .insert (8 );
42
42
treap .insert (1 );
43
- assertEquals (5 , treap .search (5 ).value () );
43
+ assertEquals (5 , treap .search (5 ).value );
44
44
}
45
45
46
46
@ Test
47
- void searchAndNotFound () {
47
+ public void searchAndNotFound () {
48
48
Treap treap = new Treap ();
49
49
treap .insert (5 );
50
50
treap .insert (9 );
@@ -57,7 +57,7 @@ void searchAndNotFound() {
57
57
}
58
58
59
59
@ Test
60
- void lowerBound () {
60
+ public void lowerBound () {
61
61
Treap treap = new Treap ();
62
62
treap .insert (5 );
63
63
treap .insert (9 );
@@ -70,7 +70,7 @@ void lowerBound() {
70
70
}
71
71
72
72
@ Test
73
- void upperBound () {
73
+ public void upperBound () {
74
74
Treap treap = new Treap ();
75
75
treap .insert (5 );
76
76
treap .insert (9 );
@@ -83,7 +83,7 @@ void upperBound() {
83
83
}
84
84
85
85
@ Test
86
- void misc () {
86
+ public void misc () {
87
87
Treap treap = new Treap ();
88
88
treap .insert (5 );
89
89
treap .insert (9 );
0 commit comments