/ Check-in [8f04d2c0]
Login
Overview
Comment:Remove the extraneous debugging printf() from the previous check-in.
Downloads: Tarball | ZIP archive | SQL archive
Timelines: family | ancestors | descendants | both | query-planner-fix
Files: files | file ages | folders
SHA1:8f04d2c0084afa6381e78847c9aa296498d448cb
User & Date: drh 2014-08-07 20:25:37
Context
2014-08-07
20:37
Clarify the computation of compatible isOrdered by in the plan solver of the query planner. Closed-Leaf check-in: b5e8fd57 user: drh tags: query-planner-fix
20:25
Remove the extraneous debugging printf() from the previous check-in. check-in: 8f04d2c0 user: drh tags: query-planner-fix
16:50
Oops! This check-in was on trunk. But it contains a debugging printf(). Original comment: When the estimated cost to do a sort overwhelms the estimated cost to do individual table lookups, make sure that the table lookup costs are still taken into consideration when selecting the lookup algorithm. check-in: ec5d84ba user: drh tags: query-planner-fix
Changes
Hide Diffs Unified Diffs Ignore Whitespace Patch

Changes to src/where.c.

5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
          ){
            testcase( jj==nTo-1 );
            break;
          }
        }
        if( jj>=nTo ){
          /* None of the existing best-so-far paths match the candidate. */
if( nTo>=mxChoice && rCost==mxCost ) printf("nOut=%d mxOut=%d\n", nOut, mxOut);
          if( nTo>=mxChoice
           && (rCost>mxCost || (rCost==mxCost && nOut>=mxOut))
          ){
            /* The current candidate is no better than any of the mxChoice
            ** paths currently in the best-so-far buffer.  So discard
            ** this candidate as not viable. */
#ifdef WHERETRACE_ENABLED /* 0x4 */







<







5543
5544
5545
5546
5547
5548
5549

5550
5551
5552
5553
5554
5555
5556
          ){
            testcase( jj==nTo-1 );
            break;
          }
        }
        if( jj>=nTo ){
          /* None of the existing best-so-far paths match the candidate. */

          if( nTo>=mxChoice
           && (rCost>mxCost || (rCost==mxCost && nOut>=mxOut))
          ){
            /* The current candidate is no better than any of the mxChoice
            ** paths currently in the best-so-far buffer.  So discard
            ** this candidate as not viable. */
#ifdef WHERETRACE_ENABLED /* 0x4 */