changeset 310:237de162be28

Fix building sort reverse array when element was initially in correct position.
author Artem Tikhomirov <tikhomirov.artem@gmail.com>
date Sat, 24 Sep 2011 13:25:33 +0200 (2011-09-24)
parents 962f78aac342
children b9592e21176a
files src/org/tmatesoft/hg/internal/ArrayHelper.java
diffstat 1 files changed, 8 insertions(+), 0 deletions(-) [+]
line wrap: on
line diff
--- a/src/org/tmatesoft/hg/internal/ArrayHelper.java	Sat Sep 24 13:02:48 2011 +0200
+++ b/src/org/tmatesoft/hg/internal/ArrayHelper.java	Sat Sep 24 13:25:33 2011 +0200
@@ -29,6 +29,14 @@
 //		Object[] aux = (Object[]) a.clone();
 		reverse = new int[a.length];
 		sort1((Comparable<Object>[])a, 0, a.length);
+		for (int i = 0; i < reverse.length; i++) {
+			// element that was not moved don't have an index in reverse.
+			// perhaps, can do it inside sort alg?
+			// TODO tests!
+			if (reverse[i] == 0) {
+				reverse[i] = i+1;
+			}
+		}
 	}
 	
     private void sort1(Comparable<Object> x[], int off, int len) {