-C Allow\sthe\sDEFAULT\svalue\sof\sa\scolumn\sto\sbe\sobtained\sby\scalling\sa\nfunction\sthat\shas\sconstant\sarguments,\ssuch\sas\sjulianday('now').\s(CVS\s2534)
-D 2005-06-30T17:04:21
+C Fix\stypos\sin\scomments.\s\sNo\schanges\sto\scode.\s(CVS\s2535)
+D 2005-07-01T11:38:45
F Makefile.in 64a6635ef44a98325e0cffe8d67669920a3dad47
F Makefile.linux-gcc 06be33b2a9ad4f005a5f42b22c4a19dab3cbb5c7
F README 9c4e2d6706bdcc3efdd773ce752a8cdab4f90028
F src/vdbeapi.c 7f392f0792d1258c958083d7de9eae7c3530c9a6
F src/vdbeaux.c 38332d91887817a2146f46b58fff2a8a88ed0278
F src/vdbemem.c da8e8d6f29dd1323f782f000d7cd120027c9ff03
-F src/where.c 3a9a2258ab3364655e9ea215ad5ae7bf41813f54
+F src/where.c 97f356317024597e684b750658f2e8822cb15f10
F tclinstaller.tcl 046e3624671962dc50f0481d7c25b38ef803eb42
F test/all.test 7f0988442ab811dfa41793b5b550f5828ce316f3
F test/alter.test 9d6837a3d946b73df692b7cef2a7644d2e2f6bc6
F www/vdbe.tcl 87a31ace769f20d3627a64fa1fade7fed47b90d0
F www/version3.tcl a99cf5f6d8bd4d5537584a2b342f0fb9fa601d8b
F www/whentouse.tcl 528299b8316726dbcc5548e9aa0648c8b1bd055b
-P 78cb8a9a17a29bb8d9ffb6298b25cc43f9cbfed9
-R 6d328edc4432a3b72476415dacbf70aa
+P d273766ef2442eb87971b07f9ecf5682c88298ee
+R f1acb0912a84792dbfe7271bb022ab10
U drh
-Z 281195efb9a2e6148f227a3626a22b0f
+Z 31cf2d310f53ee63090391c3d851ca5a
** so is applicable. Because this module is responsible for selecting
** indices, you might also think of this module as the "query optimizer".
**
-** $Id: where.c,v 1.139 2005/06/12 21:35:53 drh Exp $
+** $Id: where.c,v 1.140 2005/07/01 11:38:45 drh Exp $
*/
#include "sqliteInt.h"
/* If we found a term that tests ROWID with == or IN, that term
** will be used to locate the rows in the database table. There
- ** is not need to continue into the code below that looks for
+ ** is no need to continue into the code below that looks for
** an index. We will always use the ROWID over an index.
*/
if( iDirectEq[i]>=0 ){
if( (m & eqMask)!=m ) break;
}
- /* Begin assemblying the score
+ /* Begin assembling the score
*/
score = nEq*32; /* Base score is 32 times number of == constraints */
m = ((Bitmask)1)<<nEq;