Sorting is now done using a sorting index rather than loading the entire
result set into memory and doing a merge sort. The old merge sort technique
was a carry-over from SQLite version 1. The new method uses a bounded amount
of memory and scales to much larger result sets. There are still errors:
some 39 regression tests fail. (CVS 2653)
FossilOrigin-Name: 09db0a24241f9248584250d1728117b8a3159626
diff --git a/src/expr.c b/src/expr.c
index 3d3655d..134de24 100644
--- a/src/expr.c
+++ b/src/expr.c
@@ -12,7 +12,7 @@
** This file contains routines used for analyzing expressions and
** for generating VDBE code that evaluates expressions in SQLite.
**
-** $Id: expr.c,v 1.222 2005/08/30 00:54:02 drh Exp $
+** $Id: expr.c,v 1.223 2005/09/01 03:07:44 drh Exp $
*/
#include "sqliteInt.h"
#include <ctype.h>
@@ -546,9 +546,12 @@
pNew->pOffset = sqlite3ExprDup(p->pOffset);
pNew->iLimit = -1;
pNew->iOffset = -1;
- pNew->ppOpenVirtual = 0;
pNew->isResolved = p->isResolved;
pNew->isAgg = p->isAgg;
+ pNew->pRightmost = 0;
+ pNew->addrOpenVirt[0] = -1;
+ pNew->addrOpenVirt[1] = -1;
+ pNew->addrOpenVirt[2] = -1;
return pNew;
}
#else