X-Git-Url: http://git.mutantstargoat.com/user/nuclear/?p=dosdemo;a=blobdiff_plain;f=src%2Fscr%2Fthunder.c;h=3aa3b7ea96ba30ee1da78eb050a7f1a36fefd54a;hp=062eb57f58ecc716f6a1eeccdf8707a5464d922a;hb=223ecd536161ba06dd1d0f39ccf911b082742b92;hpb=cfa71f2849ee3482ebe617931972657b6a69c930

diff --git a/src/scr/thunder.c b/src/scr/thunder.c
index 062eb57..3aa3b7e 100644
--- a/src/scr/thunder.c
+++ b/src/scr/thunder.c
@@ -377,62 +377,62 @@ unsigned char fog(float z) {
 	return (unsigned char)ret;
 }
 
-void sort(PointSprite *begin, PointSprite *end) {
-	PointSprite pivotValue;
-	size_t sz;
-	PointSprite *left, *right;
-	int leftCond, rightCond;
-	PointSprite tmp;
-
-	sz = end - begin;
-
-	if (sz < 2) return; /* already sorted */
-	if (sz == 2) {
-		/* trivial case */
-		if (begin[1] < begin[0]) {
-			tmp = begin[0];
-			begin[0] = begin[1];
-			begin[1] = tmp;
-			return;
-		}
-	}
-
-	/* minimum 3 elements from now on */
-
-	/* choose a pivot near the middle, since we frequently sort already sorted arrays */
-	pivotValue = begin[sz / 2];
-
-	left = begin;
-	right = end - 1;
-
-	while (right > left) {
-		/* check if left and right elements meet the conditions */
-		leftCond = pivotValue >= *left;
-		rightCond = pivotValue < *right;
-
-		if (!leftCond && !rightCond) {
-			tmp = *left;
-			*left = *right;
-			*right = tmp;
-			left++;
-			right--;
-		}
-		else if (leftCond && rightCond) {
-			left++;
-			right--;
-		}
-		else if (leftCond) {
-			left++;
-		}
-		else {
-			right--;
-		}
-	}
-
-	/* recursion */
-	sort(begin, left);
-	sort(left, end);
-}
+void sort(PointSprite *begin, PointSprite *end) {
+	PointSprite pivotValue;
+	size_t sz;
+	PointSprite *left, *right;
+	int leftCond, rightCond;
+	PointSprite tmp;
+
+	sz = end - begin;
+
+	if (sz < 2) return; /* already sorted */
+	if (sz == 2) {
+		/* trivial case */
+		if (begin[1] < begin[0]) {
+			tmp = begin[0];
+			begin[0] = begin[1];
+			begin[1] = tmp;
+			return;
+		}
+	}
+
+	/* minimum 3 elements from now on */
+
+	/* choose a pivot near the middle, since we frequently sort already sorted arrays */
+	pivotValue = begin[sz / 2];
+
+	left = begin;
+	right = end - 1;
+
+	while (right > left) {
+		/* check if left and right elements meet the conditions */
+		leftCond = pivotValue >= *left;
+		rightCond = pivotValue < *right;
+
+		if (!leftCond && !rightCond) {
+			tmp = *left;
+			*left = *right;
+			*right = tmp;
+			left++;
+			right--;
+		}
+		else if (leftCond && rightCond) {
+			left++;
+			right--;
+		}
+		else if (leftCond) {
+			left++;
+		}
+		else {
+			right--;
+		}
+	}
+
+	/* recursion */
+	sort(begin, left);
+	sort(left, end);
+}
 
 void sortPointSprites() {
 	sort(pointSprites, pointSprites + pointSpriteCount);