Home
last modified time | relevance | path

Searched refs:more (Results 1 – 25 of 1368) sorted by relevance

12345678910>>...55

/sqlite-3.40.0/test/
H A Dfts4lastrowid.test8 # May you share freely, never taking more than you give.
45 INSERT INTO t1(rowid, str) VALUES(-22, 'some more text');
51 INSERT INTO t1(rowid, str) VALUES(45, 'some more text');
52 INSERT INTO t1(rowid, str) VALUES(46, 'some more text');
53 INSERT INTO t1(rowid, str) VALUES(222, 'some more text');
H A Danalyze8.test8 # May you share freely, never taking more than you give.
84 # There are many more values of c between 0 and 100000 than there are
85 # between 800000 and 900000. So t1c is more selective for the latter
89 # that (b BETWEEN 30 AND 34) will match more rows than (c BETWEEN
H A Dsort3.test8 # May you share freely, never taking more than you give.
93 # Sort more than 2GB of data. At one point this was causing a problem.
94 # This test might take one minute or more to run.
H A Dwal9.test8 # May you share freely, never taking more than you give.
62 # the *shm file is now more than one chunk (>32KiB).
76 # necessary to map any more of the *-shm file to read or write the database
H A Dtkt3793.test8 # May you share freely, never taking more than you give.
66 # more than 10 pages of table t1. At this point the shared-cache will
68 # more than 10 dirty pages in memory, it cannot upgrade to an EXCLUSIVE
H A Dmalloc5.test8 # May you share freely, never taking more than you give.
209 # to ensure that more than 1MB of dynamic memory is used to perform
294 # called and there is more than one pager open.
354 # more recently than all the db pages. Then try to reclaim 3000 bytes.
363 # do a SELECT on the db cache so that all the db pages are more recently
392 # Now release 9900 more (about 9 pages worth). This should expunge
H A Dresolver01.test8 # May you share freely, never taking more than you give.
69 # The "y" binds more tightly to output columns than to input columns.
106 # But if the form is "ORDER BY expr" then bind more tightly to the
156 # more tightly to the input tables in all cases.
H A Dshared7.test8 # May you share freely, never taking more than you give.
27 # the same database file more than once results in an error.
H A Dskipscan2.test8 # May you share freely, never taking more than you give.
75 -- to make it seem like there are many more.
103 # Add 8 more people, bringing the total to 34. Then the number of
128 # Add 2 more people, bringing the total to 36. Then the number of
H A Dlock7.test8 # May you share freely, never taking more than you give.
14 # already held (or, more accurately, that the SHARED lock is released after
H A Dsnapshot4.test8 # May you share freely, never taking more than you give.
23 # and there are one or more existing connections.
H A Dfts3snippet2.test8 # May you share freely, never taking more than you give.
27 # Request a snippet from a query with more than 64 phrases.
H A Dtkt2920.test8 # May you share freely, never taking more than you give.
61 # Increase the maximum size of the database by one more page.
H A Dfuzz.test8 # May you share freely, never taking more than you give.
148 # The problem here was that when there were more expressions in
325 # some more generated SELECT statements.
355 # Now that there is data in the database, run some more SELECT
H A Dvacuummem.test8 # May you share freely, never taking more than you give.
31 # this causes the total memory usage to drop much more than expected,
H A Dcse.test8 # May you share freely, never taking more than you give.
125 # Overflow the column cache. Create queries involving more and more
H A Dunique.test8 # May you share freely, never taking more than you give.
31 } {1 {table "t1" has more than one primary key}}
139 # Test the UNIQUE keyword as used on two or more fields.
H A Dtkt2409.test8 # May you share freely, never taking more than you give.
30 # error. The pcache module allocates more space and keeps working
47 # more malloc()'d memory.
H A Dsort5.test8 # May you share freely, never taking more than you give.
79 # each a bit over 100 bytes in size. In total a little more than 1MiB
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5lastrowid.test8 # May you share freely, never taking more than you give.
45 INSERT INTO t1(rowid, str) VALUES(-22, 'some more text');
51 INSERT INTO t1(rowid, str) VALUES(45, 'some more text');
52 INSERT INTO t1(rowid, str) VALUES(46, 'some more text');
53 INSERT INTO t1(rowid, str) VALUES(222, 'some more text');
H A Dfts5prefix2.test8 # May you share freely, never taking more than you give.
33 ('May you share freely, never taking more than you give f.');
40 {May you share [freely], never taking more than you give [f].}
/sqlite-3.40.0/ext/repair/
H A Dsqlite3_checker.tcl47 set more 1
66 while {$more} {
67 set more 0
69 set more 1
/sqlite-3.40.0/src/
H A Din-operator.md18 two or or more values) or a subquery that returns one or more columns.
20 subquery that returns two or more columns. An isolated value or
24 that returns two or more columns, or a list of scalars. It is not
38 a total-NULL if it contains one or more rows that contain only NULL values.
/sqlite-3.40.0/ext/fts3/
H A DREADME.syntax55 may be used to search for rows that contain two or more specified tokens
63 in the same column with not more than 10 other words between them. It does
72 by not more than 5 other tokens. More than one NEAR operator can be used
78 seperated by not more than two tokens from an instance of "engineering",
79 which is in turn separated by not more than 5 other tokens from an
83 Similar to the NEAR operator, one or more tokens or phrases may be
/sqlite-3.40.0/ext/expert/
H A DREADME.md31 1. The sqlite3expert object is configured with one or more SQL statements
32 by making one or more calls to **sqlite3\_expert\_sql()**. Each call may
42 1. One or more calls are made to **sqlite3\_expert\_report()** to extract

12345678910>>...55