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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
// Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.search.dispatch.searchcluster;
import org.junit.Test;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
/**
* @author bratseth
*/
public class SearchClusterCoverageTest {
@Test
public void two_groups_equal_docs() {
var tester = new SearchClusterTester(2, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode(100, 1);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertTrue(tester.group(1).hasSufficientCoverage());
}
@Test
public void two_groups_one_missing_docs() {
var tester = new SearchClusterTester(2, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode( 70, 1);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertFalse(tester.group(1).hasSufficientCoverage());
}
@Test
public void three_groups_one_missing_docs() {
var tester = new SearchClusterTester(3, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode( 87, 1); // min is set to 88 in MockSearchCluster
tester.setDocsPerNode(100, 2);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertFalse(tester.group(1).hasSufficientCoverage());
assertTrue(tester.group(2).hasSufficientCoverage());
}
@Test
public void three_groups_one_missing_docs_but_too_few() {
var tester = new SearchClusterTester(3, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode( 89, 1); // min is set to 88 in MockSearchCluster
tester.setDocsPerNode(100, 2);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertTrue(tester.group(1).hasSufficientCoverage());
assertTrue(tester.group(2).hasSufficientCoverage());
}
@Test
public void three_groups_one_has_too_many_docs() {
var tester = new SearchClusterTester(3, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode(150, 1);
tester.setDocsPerNode(100, 2);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertTrue(tester.group(1).hasSufficientCoverage());
assertTrue(tester.group(2).hasSufficientCoverage());
}
@Test
public void three_groups_one_has_a_node_down() {
var tester = new SearchClusterTester(3, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode(100, 1);
tester.setDocsPerNode(100, 2);
tester.setWorking(1, 1, false);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertFalse(tester.group(1).hasSufficientCoverage());
assertTrue(tester.group(2).hasSufficientCoverage());
}
@Test
public void three_groups_one_has_a_node_down_but_remaining_has_enough_docs() {
var tester = new SearchClusterTester(3, 3);
tester.setDocsPerNode(100, 0);
tester.setDocsPerNode(150, 1);
tester.setDocsPerNode(100, 2);
tester.setWorking(1, 1, false);
tester.pingIterationCompleted();
assertTrue(tester.group(0).hasSufficientCoverage());
assertTrue("Sufficient documents on remaining two nodes", tester.group(1).hasSufficientCoverage());
assertTrue(tester.group(2).hasSufficientCoverage());
}
@Test
public void one_group_few_docs_has_well_balanced_content() {
var tester = new SearchClusterTester(1, 2);
Node node0 = tester.group(0).nodes().get(0);
Node node1 = tester.group(0).nodes().get(1);
// 1 document
node0.setWorking(true);
node1.setWorking(true);
node0.setActiveDocuments(1);
node1.setActiveDocuments(0);
tester.pingIterationCompleted();
assertTrue(tester.group(0).isContentWellBalanced());
}
}
|
