diff options
author | drh <drh@noemail.net> | 2009-08-21 13:22:25 +0000 |
---|---|---|
committer | drh <drh@noemail.net> | 2009-08-21 13:22:25 +0000 |
commit | d00151613a780df55536fe77ffbcc1a879fb929e (patch) | |
tree | 29360dcb0217edc80491d7aed95fccd2a3e17d2a /src/where.c | |
parent | 9359c7b7abeb8f56b3038f2ef5c8a6632b16fb14 (diff) | |
download | sqlite-d00151613a780df55536fe77ffbcc1a879fb929e.tar.gz sqlite-d00151613a780df55536fe77ffbcc1a879fb929e.zip |
Change the expression code generator to account for the fact that the new
sqlite3AtoF() never returns NaN. Also, clarification of a comment in
where.c.
FossilOrigin-Name: 75f596a04a74eb3a538c7be5b41756c970a21a1b
Diffstat (limited to 'src/where.c')
-rw-r--r-- | src/where.c | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/src/where.c b/src/where.c index 7d8f05de3..836324156 100644 --- a/src/where.c +++ b/src/where.c @@ -3558,7 +3558,9 @@ WhereInfo *sqlite3WhereBegin( ** FROM clause entry that permits the lowest-cost, "optimal" scan. In ** this context an optimal scan is one that uses the same strategy ** for the given FROM clause entry as would be selected if the entry - ** were used as the innermost nested loop. + ** were used as the innermost nested loop. In other words, a table + ** is chosen such that the cost of running that table cannot be reduced + ** by waiting for other tables to run first. ** ** The second iteration is only performed if no optimal scan strategies ** were found by the first. This iteration is used to search for the |