Lines Matching refs:t1
3304 ** CREATE TABLE t1(c1 VARIANT);
3308 ** SELECT c1 + 1, c1 FROM t1;
50074 static const u64 t1 = ((u64)0x3ff00000)<<32;
50076 u64 t2 = t1;
60431 ** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY x;
60435 ** SELECT a+b AS x, c+d AS y FROM t1 ORDER BY a+b;
60541 ** CREATE TABLE t1(a);
60542 ** SELECT * FROM t1 WHERE a;
60543 ** SELECT a AS b FROM t1 WHERE b;
60544 ** SELECT * FROM t1 WHERE (select a from t1);
63236 ** CREATE TABLE t1(a, b);
64349 ** sqlite_rename_parent('CREATE TABLE t1(a REFERENCES t2)', 't2', 't3')
64350 ** -> 'CREATE TABLE t1(a REFERENCES t3)'
72935 ** CREATE TABLE t1(a, b INTEGER PRIMARY KEY, c);
72936 ** INSERT INTO t1 VALUES(1, 2, 3.1);
73374 ** CREATE TABLE t1(a PRIMARY KEY);
73375 ** CREATE TABLE t2(b REFERENCES t1(a);
73377 ** Calling this function with table "t1" as an argument returns a pointer
79526 ** SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.b AND t1.x=5
79528 ** The where clause needs to defer the handling of the t1.x=5
79530 ** NULL t2 row will be inserted whenever t1.x!=5. If we do not
79531 ** defer the handling of t1.x=5, it will be processed immediately
79532 ** after the t1 loop and rows with t1.x!=5 will never appear in
80180 ** CREATE TABLE t1(col INTEGER);
80181 ** SELECT (SELECT t1.col) FROM FROM t1;
80183 ** when columnType() is called on the expression "t1.col" in the
80187 ** This is not a problem, as the column type of "t1.col" is never
80189 ** "(SELECT t1.col)", the correct type is returned (see the TK_SELECT
80688 ** SELECT a FROM t1 UNION SELECT b FROM t2 UNION SELECT c FROM t3
80696 ** `------> SELECT a FROM t1
81713 ** SELECT a FROM (SELECT x+y AS a FROM t1 WHERE z<100) WHERE a>5
81725 ** SELECT x+y AS a FROM t1 WHERE z<100 AND a>5
81729 ** exist on the table t1, a complete scan of the data might be
81875 ** t1 LEFT OUTER JOIN (t2 JOIN t3)
81879 ** (t1 LEFT OUTER JOIN t2) JOIN t3
81888 ** t1 LEFT OUTER JOIN (SELECT * FROM t2 WHERE t2.x>0)
81892 ** (t1 LEFT OUTER JOIN t2) WHERE t2.x>0
82107 ** SELECT a+5, b*10 FROM (SELECT x*3 AS a, y+10 AS b FROM t1) WHERE a>b;
84417 ** CREATE TRIGGER AFTER INSERT ON t1 BEGIN;
84421 ** INSERT INTO t1 ... ; -- insert into t2 uses REPLACE policy
84422 ** INSERT OR IGNORE INTO t1 ... ; -- insert into t2 uses IGNORE policy
86819 ** (t1.X <op> <expr>) OR (t1.Y <op> <expr>) OR ....
87535 ** (A) t1.x=t2.y OR t1.x=t2.z OR t1.y=15 OR t1.z=t3.a+5
87537 ** (C) t1.x=t2.y OR (t1.x=t2.z AND t1.y=15)
87733 /* This term must be of the form t1.a==t2.b where t2 is in the
87734 ** chngToIN set but t1 is not. This term will be either preceeded
87735 ** or follwed by an inverted copy (t2.b==t1.a). Skip this term
88822 ** example, assuming that index p is on t1(a):
88824 ** ... FROM t1 WHERE a > ? AND a < ? ...
88835 ** on t1(a, b), and the SQL query is:
88837 ** ... FROM t1 WHERE a = ? AND b > ? AND b < ? ...
88842 ** ... FROM t1 WHERE a > ? AND a < ? ...
89314 ** (1) SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.x WHERE t2.z='ok'
89315 ** (2) SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.x AND t2.z='ok'
89316 ** (3) SELECT * FROM t1, t2 WHERE t1.a=t2.x AND t2.z='ok'
89454 ** For example, consider table t1(a,b,c,d,e,f) with index i1(a,b,c).
89480 ** CREATE TABLE t1(a TEXT PRIMARY KEY, b);
89481 ** SELECT ... FROM t1 AS t2, t1 WHERE t1.a = t2.b;
89483 ** In the example above, the index on t1(a) has TEXT affinity. But since
89983 ** CREATE TABLE t1(a,b,c,d);
89984 ** CREATE INDEX i1 ON t1(a);
89985 ** CREATE INDEX i2 ON t1(b);
89986 ** CREATE INDEX i3 ON t1(c);
89988 ** SELECT * FROM t1 WHERE a=5 OR b=7 OR (c=11 AND d=13)
90234 ** SELECT * FROM t1, t2, t3 WHERE ...;
90238 ** foreach row1 in t1 do \ Code generated
90252 ** There are Btree cursors associated with each table. t1 uses cursor
90278 ** An outer join of tables t1 and t2 is conceptally coded as follows:
90280 ** foreach row1 in t1 do
90488 ** CREATE TABLE t1(a, b);
90490 ** SELECT * FROM t2, t1 WHERE t2.rowid = t1.a;
90492 ** The best strategy is to iterate through table t1 first. However it
90495 ** as the cost of a linear scan through table t1, a simple greedy
