Attachment #185767 for bug #329227




 *
 * Contributors:
 *     IBM Corporation - initial API and implementation
 *     daolaf@gmail.com - Contribution for bug 3292227
 *******************************************************************************/
package org.eclipse.jdt.internal.compiler.util;


	public static void reverseQuickSort(char[][] list, int left, int right) {
		int original_left= left;
		int original_right= right;
		char[] mid= list[left + ((right-left)/2)];
		do {
			while (CharOperation.compareTo(list[left], mid) > 0) {
				left++;

	public static void reverseQuickSort(char[][] list, int left, int right, int[] result) {
		int original_left= left;
		int original_right= right;
		char[] mid= list[left + ((right-left)/2)];
		do {
			while (CharOperation.compareTo(list[left], mid) > 0) {
				left++;

Lines 1-5 Link Here

(-)src/org/eclipse/jdt/core/tests/model/CompletionTestsRequestor.java (-2 / +2 lines)
1	/*******************************************************************************	1	/*******************************************************************************
2	* Copyright (c) 2000, 2009 IBM Corporation and others.	2	* Copyright (c) 2000, 2010 IBM Corporation and others.
3	* All rights reserved. This program and the accompanying materials	3	* All rights reserved. This program and the accompanying materials
4	* are made available under the terms of the Eclipse Public License v1.0	4	* are made available under the terms of the Eclipse Public License v1.0
5	* which accompanies this distribution, and is available at	5	* which accompanies this distribution, and is available at
Lines 184-190 Link Here
184	protected String[] quickSort(String[] collection, int left, int right) {	184	protected String[] quickSort(String[] collection, int left, int right) {
185	int original_left = left;	185	int original_left = left;
186	int original_right = right;	186	int original_right = right;
187	String mid = collection[ (left + right) / 2];	187	String mid = collection[left + ((right - left)/2)];
188	do {	188	do {
189	while (mid.compareTo(collection[left]) > 0)	189	while (mid.compareTo(collection[left]) > 0)
190	// s[left] >= mid	190	// s[left] >= mid

Lines 1-5 Link Here

(-)src/org/eclipse/jdt/core/tests/model/CompletionTestsRequestor2.java (-2 / +2 lines)
1	/*******************************************************************************	1	/*******************************************************************************
2	* Copyright (c) 2004, 2009 IBM Corporation and others.	2	* Copyright (c) 2004, 2010 IBM Corporation and others.
3	* All rights reserved. This program and the accompanying materials	3	* All rights reserved. This program and the accompanying materials
4	* are made available under the terms of the Eclipse Public License v1.0	4	* are made available under the terms of the Eclipse Public License v1.0
5	* which accompanies this distribution, and is available at	5	* which accompanies this distribution, and is available at
Lines 492-498 Link Here
492	protected CompletionProposal[] quickSort(CompletionProposal[] collection, int left, int right) {	492	protected CompletionProposal[] quickSort(CompletionProposal[] collection, int left, int right) {
493	int original_left = left;	493	int original_left = left;
494	int original_right = right;	494	int original_right = right;
495	CompletionProposal mid = collection[ (left + right) / 2];	495	CompletionProposal mid = collection[left + ((right - left)/2)];
496	do {	496	do {
497	while (compare(mid, collection[left]) > 0)	497	while (compare(mid, collection[left]) > 0)
498	// s[left] >= mid	498	// s[left] >= mid

Return to bug 329227

Lines 7-12 Link Here

(-)compiler/org/eclipse/jdt/internal/compiler/util/Util.java (-2 / +3 lines)
7	*	7	*
8	* Contributors:	8	* Contributors:
9	* IBM Corporation - initial API and implementation	9	* IBM Corporation - initial API and implementation
		10	* daolaf@gmail.com - Contribution for bug 3292227
10	*******************************************************************************/	11	*******************************************************************************/
11	package org.eclipse.jdt.internal.compiler.util;	12	package org.eclipse.jdt.internal.compiler.util;
12		13
Lines 677-683 Link Here
677	public static void reverseQuickSort(char[][] list, int left, int right) {	678	public static void reverseQuickSort(char[][] list, int left, int right) {
678	int original_left= left;	679	int original_left= left;
679	int original_right= right;	680	int original_right= right;
680	char[] mid= list[(right + left) / 2];	681	char[] mid= list[left + ((right-left)/2)];
681	do {	682	do {
682	while (CharOperation.compareTo(list[left], mid) > 0) {	683	while (CharOperation.compareTo(list[left], mid) > 0) {
683	left++;	684	left++;
Lines 703-709 Link Here
703	public static void reverseQuickSort(char[][] list, int left, int right, int[] result) {	704	public static void reverseQuickSort(char[][] list, int left, int right, int[] result) {
704	int original_left= left;	705	int original_left= left;
705	int original_right= right;	706	int original_right= right;
706	char[] mid= list[(right + left) / 2];	707	char[] mid= list[left + ((right-left)/2)];
707	do {	708	do {
708	while (CharOperation.compareTo(list[left], mid) > 0) {	709	while (CharOperation.compareTo(list[left], mid) > 0) {
709	left++;	710	left++;