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
|
/*******************************************************************************
* Copyright (c) 2000 2015 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
* QNX Software System
*******************************************************************************/
package org.eclipse.cdt.internal.autotools.ui.editors.automake;
import org.eclipse.core.runtime.Assert;
/**
* Quick sort to sort two arrays in parallel.
*/
public class TwoArrayQuickSort {
private static void internalSort(String[] keys, Object[] values, int left, int right, boolean ignoreCase) {
int originalLeft= left;
int originalRight= right;
String mid= keys[(left + right) >>> 1];
do {
while (smaller(keys[left], mid, ignoreCase)) {
left++;
}
while (smaller(mid, keys[right], ignoreCase)) {
right--;
}
if (left <= right) {
String tmp= keys[left];
keys[left]= keys[right];
keys[right]= tmp;
Object tmp2= values[left];
values[left]= values[right];
values[right]= tmp2;
left++;
right--;
}
} while (left <= right);
if (originalLeft < right) {
internalSort(keys , values, originalLeft, right, ignoreCase);
}
if (left < originalRight) {
internalSort(keys, values, left, originalRight, ignoreCase);
}
}
private static boolean smaller(String left, String right, boolean ignoreCase) {
if (ignoreCase)
return left.compareToIgnoreCase(right) < 0;
return left.compareTo(right) < 0;
}
/**
* Sorts keys and values in parallel.
*/
public static void sort(String[] keys, Object[] values, boolean ignoreCase) {
if (keys != null && values != null) {
Assert.isTrue(keys.length == values.length);
if (keys.length > 1)
internalSort(keys, values, 0, keys.length - 1, ignoreCase);
} else {
if (keys != null || values != null)
Assert.isTrue(false, "Either keys or values in null"); //$NON-NLS-1$
}
}
}
|
