Lines Matching full:scan
4750 ** particular lookup. A full scan of a table with N entries should have
5642 ** that the prepared statement is using a full table scan rather than
5669 ** a table as part of a full table scan. Large numbers for this counter
43788 ** keep entries in the disk file in order so that a scan
43789 ** of the table is a linear scan through the file. That
47641 ** the label is resolved to a specific address, the VDBE will scan
51846 ** ALGORITHM: Scan the input string looking for host parameters in any of
51977 ** Various scripts scan this source file in order to generate HTML
53156 ** Formatting is important to scripts that scan this file.
54674 /* Scan the header and use it to fill in the u.am.aType[] and u.am.aOffset[]
59932 ExprList *pEList, /* List of expressions to scan */
67471 ** Scan the column type name zType (length nType) and return the
69078 /* Scan the names of the columns of the table to be indexed and
70764 SrcList *pSrc, /* the FROM clause -- which tables to scan */
70994 /* The usual case: There is a WHERE clause so we have to scan through
71015 ** database scan. We have to delete items after the scan is complete
71016 ** because deleting an item can change the scan order. */
73262 SrcList *pSrc, /* SrcList containing the table to scan */
73272 Expr *pWhere = 0; /* WHERE clause to scan with */
73323 /* If the child table is the same as the parent table, and this scan
73325 ** row being deleted from the scan by adding ($rowid != rowid) to the WHERE
79293 SrcList *pSrc, /* the FROM clause -- which tables to scan */
79916 ** of the scan loop.
81135 ** of the scan loop.
81622 ** Scan through the expression pExpr. Replace every reference to
81668 ExprList *pList, /* List to scan and in which to make substitutes */
81728 ** but only has to scan the data once. And because indices might
81729 ** exist on the table t1, a complete scan of the data might be
82047 ** will scan expressions looking for iParent references and replace
82288 ** (4) Scan the list of columns in the result set (pEList) looking
82994 ** Begin the database scan
83014 /* End the database scan loop.
83292 const int iCsr = pParse->nTab++; /* Cursor to scan b-tree */
83304 ** will therefore be cheaper to scan to determine the query result.
85127 /* Begin the database scan
85142 /* End the database scan loop.
85463 /* Generate code to scan the ephemeral table and call VUpdate. */
86997 #define WHERE_REVERSE 0x02000000 /* Scan in reverse order */
88368 /* If there is an ORDER BY clause, increase the scan cost to account
88834 ** optimized by the proposed index scan. For example, assuming index p is
88847 ** value of 1 indicates that the proposed range scan is expected to visit
88850 ** that the range scan will visit every row (100%) selected by the equality
89037 int rev; /* True to scan in reverse order */
89042 ** scan being evaluated. They are then used to determine the expected
89153 ** naturally scan rows in the required order, set the appropriate flags
89155 ** will scan rows in a different order, set the bSort variable. */
89573 int bRev; /* True if we need to scan in reverse order */
89753 /* Case 3: A scan using an index.
89858 /* If we are doing a reverse order scan on an ascending index, or
89859 ** a forward order scan on a descending index, interchange the
89971 ** WHERE clause terms made redundant by the index range scan.
90082 WhereInfo *pSubWInfo; /* Info for single OR-term scan */
90121 ** scan of the entire table.
90262 ** If the WHERE clause is empty, the foreach loops must each scan their
90265 ** refer to those indices, a complete table scan can be avoided and the
90300 ** scan is correct for the ORDER BY clause, then that index is used and
90472 ** FROM clause entry that permits the lowest-cost, "optimal" scan. In
90473 ** this context an optimal scan is one that uses the same strategy
90479 ** The second iteration is only performed if no optimal scan strategies
90481 ** lowest cost scan overall.
90494 ** However, since the cost of a linear scan through table t2 is the same
90495 ** as the cost of a linear scan through table t1, a simple greedy
90556 ** used for the scan. If not, then query compilation has failed.
90819 /* If this scan uses an index, make code substitutions to read data
98882 #define FTS3_FULLSCAN_SEARCH 0 /* Linear scan of %_content table */
99449 ** 3. Linear scan of %_content table.
99456 /* By default use a full table scan. This is an expensive option,
100278 sqlite3_stmt *pStmt = 0; /* SQL statement to scan %_segdir table */
100307 ** create a Fts3SegReader to scan the single leaf.
100559 ** If idxNum==FTS3_FULLSCAN_SEARCH then do a full table scan against
100583 "SELECT * FROM %Q.'%q_content' WHERE docid = ?", /* non-full-table-scan */
100584 "SELECT * FROM %Q.'%q_content'", /* full-table-scan */
100604 /* Compile a SELECT statement for this cursor. For a full-table-scan, the
103097 /* Scan past delimiter characters */
103810 /* Scan past delimiter characters */
104862 Fts3HashElem **aElem = 0; /* Array of term hash entries to scan */
108273 ** record (i.e if the scan has finished), or zero otherwise.
108441 /* This "scan" is a direct lookup by rowid. There is no next entry. */
108560 /* Normal case - r-tree scan. Set up the RtreeCursor.aConstraint array
108609 ** table scan strategies to choose from (in order from most to
108616 ** 3 Unused Full table scan.
110076 rtreeFilter, /* xFilter - configure scan constraints */
