changeset 7612:5824e6f1d279 HEAD

sort index: Removed some optimization checks that wouldn't always be true, causing bad results.
author Timo Sirainen <tss@iki.fi>
date Fri, 06 Jun 2008 19:40:07 +0300
parents 5f481022db04
children 63602977ca9b
files src/lib-storage/index/index-sort-string.c
diffstat 1 files changed, 1 insertions(+), 2 deletions(-) [+]
line wrap: on
line diff
--- a/src/lib-storage/index/index-sort-string.c	Fri Jun 06 17:15:14 2008 +0300
+++ b/src/lib-storage/index/index-sort-string.c	Fri Jun 06 19:40:07 2008 +0300
@@ -483,8 +483,7 @@
 	right_sort_id = nodes[right_idx].sort_id;
 	/* check if all of them should have the same sort IDs. we don't want
 	   to hit the renumbering code in that situation. */
-	if ((left_sort_id == right_sort_id && left_sort_id != 0) ||
-	    left_sort_id == (uint32_t)-1 || right_sort_id == 1) {
+	if (left_sort_id == right_sort_id && left_sort_id != 0) {
 		/* they should all have the same sort ID */
 		for (i = left_idx + 1; i < right_idx; i++) {
 			nodes[i].sort_id = left_sort_id;