Repository navigation
Expand file tree
/
Copy pathCompositeVectorComparator.java
More file actions
71 lines (63 loc) · 2.47 KB
/
Copy pathCompositeVectorComparator.java
File metadata and controls
71 lines (63 loc) · 2.47 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
/*
* 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.sort;
import org.apache.arrow.vector.ValueVector;
/**
* A composite vector comparator compares a number of vectors
* by a number of inner comparators.
* <p>
* It works by first using the first comparator, if a non-zero value
* is returned, it simply returns it. Otherwise, it uses the second comparator,
* and so on, until a non-zero value is produced, or all inner comparators have
* been used.
* </p>
*/
public class CompositeVectorComparator extends VectorValueComparator<ValueVector> {
private final VectorValueComparator[] innerComparators;
public CompositeVectorComparator(VectorValueComparator[] innerComparators) {
this.innerComparators = innerComparators;
}
@Override
public int compareNotNull(int index1, int index2) {
// short-cut for scenarios when the caller can be sure that the vectors are non-nullable.
for (int i = 0; i < innerComparators.length; i++) {
int result = innerComparators[i].compareNotNull(index1, index2);
if (result != 0) {
return result;
}
}
return 0;
}
@Override
public int compare(int index1, int index2) {
for (int i = 0; i < innerComparators.length; i++) {
int result = innerComparators[i].compare(index1, index2);
if (result != 0) {
return result;
}
}
return 0;
}
@Override
public VectorValueComparator<ValueVector> createNew() {
VectorValueComparator[] newInnerComparators = new VectorValueComparator[innerComparators.length];
for (int i = 0; i < innerComparators.length; i++) {
newInnerComparators[i] = innerComparators[i].createNew();
}
return new CompositeVectorComparator(newInnerComparators);
}
}