Repository navigation
Expand file tree
/
Copy pathInsertionSorter.java
More file actions
74 lines (69 loc) · 2.68 KB
/
Copy pathInsertionSorter.java
File metadata and controls
74 lines (69 loc) · 2.68 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
/*
* 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.BaseFixedWidthVector;
import org.apache.arrow.vector.IntVector;
import org.apache.arrow.vector.ValueVector;
/**
* Insertion sorter.
*/
class InsertionSorter {
/**
* Sorts the range of a vector by insertion sort.
*
* @param vector the vector to be sorted.
* @param startIdx the start index of the range (inclusive).
* @param endIdx the end index of the range (inclusive).
* @param buffer an extra buffer with capacity 1 to hold the current key.
* @param comparator the criteria for vector element comparison.
* @param <V> the vector type.
*/
static <V extends BaseFixedWidthVector> void insertionSort(
V vector, int startIdx, int endIdx, VectorValueComparator<V> comparator, V buffer) {
comparator.attachVectors(vector, buffer);
for (int i = startIdx; i <= endIdx; i++) {
buffer.copyFrom(i, 0, vector);
int j = i - 1;
while (j >= startIdx && comparator.compare(j, 0) > 0) {
vector.copyFrom(j, j + 1, vector);
j = j - 1;
}
vector.copyFrom(0, j + 1, buffer);
}
}
/**
* Sorts the range of vector indices by insertion sort.
*
* @param indices the vector indices.
* @param startIdx the start index of the range (inclusive).
* @param endIdx the end index of the range (inclusive).
* @param comparator the criteria for vector element comparison.
* @param <V> the vector type.
*/
static <V extends ValueVector> void insertionSort(
IntVector indices, int startIdx, int endIdx, VectorValueComparator<V> comparator) {
for (int i = startIdx; i <= endIdx; i++) {
int key = indices.get(i);
int j = i - 1;
while (j >= startIdx && comparator.compare(indices.get(j), key) > 0) {
indices.set(j + 1, indices.get(j));
j = j - 1;
}
indices.set(j + 1, key);
}
}
}