lib/sqlite/sqlite3.c

3463 **    SELECT eval('DELETE FROM t1') FROM t2;
61094       u64 t2 = t1;
61095       swapMixedEndianFloat(t2);
61096       assert( sizeof(r1)==sizeof(t2) && memcmp(&r1, &t2, sizeof(r1))==0 );
76875 **   sqlite_rename_parent('CREATE TABLE t1(a REFERENCES t2)', 't2', 't3')
86245 **   CREATE TABLE t2(b REFERENCES t1(a);
86249 ** "t2". Calling this function with "t2" as the argument would return a
86250 ** NULL pointer (as there are no FK constraints for which t2 is the parent
92635 **    SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.b AND t1.x=5
92638 ** term until after the t2 loop of the join.  In that way, a
92639 ** NULL t2 row will be inserted whenever t1.x!=5.  If we do not
93884 **     SELECT a FROM t1 UNION SELECT b FROM t2 UNION SELECT c FROM t3
93890 **      `----->  SELECT b FROM t2
93896 ** pPrior will be the t2 query.  p->op will be TK_UNION in this case.
95109   **         t1 LEFT OUTER JOIN (t2 JOIN t3)
95113   **         (t1 LEFT OUTER JOIN t2) JOIN t3
95122   **         t1 LEFT OUTER JOIN (SELECT * FROM t2 WHERE t2.x>0)
95126   **         (t1 LEFT OUTER JOIN t2) WHERE t2.x>0
95128   ** But the t2.x>0 test will always fail on a NULL row of t2, which
97858     **     INSERT OR REPLACE INTO t2 VALUES(new.a, new.b);
97861     **   INSERT INTO t1 ... ;            -- insert into t2 uses REPLACE policy
97862     **   INSERT OR IGNORE INTO t1 ... ;  -- insert into t2 uses IGNORE policy
101139 **     (A)     t1.x=t2.y OR t1.x=t2.z OR t1.y=15 OR t1.z=t3.a+5
101141 **     (C)     t1.x=t2.y OR (t1.x=t2.z AND t1.y=15)
101337           /* This term must be of the form t1.a==t2.b where t2 is in the
101339           ** or follwed by an inverted copy (t2.b==t1.a).  Skip this term
103708 ** Consider the term t2.z='ok' in the following queries:
103710 **   (1)  SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.x WHERE t2.z='ok'
103711 **   (2)  SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.x AND t2.z='ok'
103712 **   (3)  SELECT * FROM t1, t2 WHERE t1.a=t2.x AND t2.z='ok'
103714 ** The t2.z='ok' is disabled in the in (2) because it originates
103880 **   SELECT ... FROM t1 AS t2, t1 WHERE t1.a = t2.b;
103883 ** the right hand side of the equality constraint (t2.b) has NONE affinity,
103884 ** no conversion should be attempted before using a t2.b value as part of
104823 **       SELECT * FROM t1, t2, t3 WHERE ...;
104828 **        foreach row2 in t2 do      |-- by sqlite3WhereBegin()
104842 ** number pTabList->a[0].iCursor.  t2 uses the cursor pTabList->a[1].iCursor.
104867 ** An outer join of tables t1 and t2 is conceptally coded as follows:
104871 **      foreach row2 in t2 do
105108     **   CREATE TABLE t2(c, d);
105109     **   SELECT * FROM t2, t1 WHERE t2.rowid = t1.a;
105113     ** Since the cost of a linear scan through table t2 is the same
105115     ** algorithm may choose to use t2 for the outer loop, which is a much