Repository navigation
Expand file tree
/
Copy pathTestVectorRangeSearcher.java
More file actions
195 lines (170 loc) · 5.99 KB
/
Copy pathTestVectorRangeSearcher.java
File metadata and controls
195 lines (170 loc) · 5.99 KB
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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 org.apache.arrow.algorithm.search;
import static org.junit.Assert.assertEquals;
import java.util.Arrays;
import java.util.Collection;
import org.apache.arrow.algorithm.sort.DefaultVectorComparators;
import org.apache.arrow.algorithm.sort.VectorValueComparator;
import org.apache.arrow.memory.BufferAllocator;
import org.apache.arrow.memory.RootAllocator;
import org.apache.arrow.vector.IntVector;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Parameterized;
/**
* Test cases for {@link VectorRangeSearcher}.
*/
@RunWith(Parameterized.class)
public class TestVectorRangeSearcher {
private BufferAllocator allocator;
private int repeat;
public TestVectorRangeSearcher(int repeat) {
this.repeat = repeat;
}
@Before
public void prepare() {
allocator = new RootAllocator(1024 * 1024);
}
@After
public void shutdown() {
allocator.close();
}
@Test
public void testGetLowerBounds() {
final int maxValue = 100;
try (IntVector intVector = new IntVector("int vec", allocator)) {
// allocate vector
intVector.allocateNew(maxValue * repeat);
intVector.setValueCount(maxValue * repeat);
// prepare data in sorted order
// each value is repeated some times
for (int i = 0; i < maxValue; i++) {
for (int j = 0; j < repeat; j++) {
if (i == 0) {
intVector.setNull(i * repeat + j);
} else {
intVector.set(i * repeat + j, i);
}
}
}
// do search
VectorValueComparator<IntVector> comparator = DefaultVectorComparators.createDefaultComparator(intVector);
for (int i = 0; i < maxValue; i++) {
int result = VectorRangeSearcher.getFirstMatch(intVector, comparator, intVector, i * repeat);
assertEquals(i * repeat, result);
}
}
}
@Test
public void testGetLowerBoundsNegative() {
final int maxValue = 100;
try (IntVector intVector = new IntVector("int vec", allocator);
IntVector negVector = new IntVector("neg vec", allocator)) {
// allocate vector
intVector.allocateNew(maxValue * repeat);
intVector.setValueCount(maxValue * repeat);
negVector.allocateNew(maxValue);
negVector.setValueCount(maxValue);
// prepare data in sorted order
// each value is repeated some times
for (int i = 0; i < maxValue; i++) {
for (int j = 0; j < repeat; j++) {
if (i == 0) {
intVector.setNull(i * repeat + j);
} else {
intVector.set(i * repeat + j, i);
}
}
negVector.set(i, maxValue + i);
}
// do search
VectorValueComparator<IntVector> comparator = DefaultVectorComparators.createDefaultComparator(intVector);
for (int i = 0; i < maxValue; i++) {
int result = VectorRangeSearcher.getFirstMatch(intVector, comparator, negVector, i);
assertEquals(-1, result);
}
}
}
@Test
public void testGetUpperBounds() {
final int maxValue = 100;
try (IntVector intVector = new IntVector("int vec", allocator)) {
// allocate vector
intVector.allocateNew(maxValue * repeat);
intVector.setValueCount(maxValue * repeat);
// prepare data in sorted order
// each value is repeated some times
for (int i = 0; i < maxValue; i++) {
for (int j = 0; j < repeat; j++) {
if (i == 0) {
intVector.setNull(i * repeat + j);
} else {
intVector.set(i * repeat + j, i);
}
}
}
// do search
VectorValueComparator<IntVector> comparator = DefaultVectorComparators.createDefaultComparator(intVector);
for (int i = 0; i < maxValue; i++) {
int result = VectorRangeSearcher.getLastMatch(intVector, comparator, intVector, i * repeat);
assertEquals((i + 1) * repeat - 1, result);
}
}
}
@Test
public void testGetUpperBoundsNegative() {
final int maxValue = 100;
try (IntVector intVector = new IntVector("int vec", allocator);
IntVector negVector = new IntVector("neg vec", allocator)) {
// allocate vector
intVector.allocateNew(maxValue * repeat);
intVector.setValueCount(maxValue * repeat);
negVector.allocateNew(maxValue);
negVector.setValueCount(maxValue);
// prepare data in sorted order
// each value is repeated some times
for (int i = 0; i < maxValue; i++) {
for (int j = 0; j < repeat; j++) {
if (i == 0) {
intVector.setNull(i * repeat + j);
} else {
intVector.set(i * repeat + j, i);
}
}
negVector.set(i, maxValue + i);
}
// do search
VectorValueComparator<IntVector> comparator = DefaultVectorComparators.createDefaultComparator(intVector);
for (int i = 0; i < maxValue; i++) {
int result = VectorRangeSearcher.getLastMatch(intVector, comparator, negVector, i);
assertEquals(-1, result);
}
}
}
@Parameterized.Parameters(name = "repeat = {0}")
public static Collection<Object[]> getRepeat() {
return Arrays.asList(
new Object[]{1},
new Object[]{2},
new Object[]{5},
new Object[]{10}
);
}
}