Lines Matching refs:intKey
6935 #define BTREE_LEAFDATA 4 /* Data stored in leaves only. Implies INTKEY */
6979 i64 intKey,
36924 ** 0 1 Flags. 1: intkey, 2: zerodata, 4: leafdata, 8: leaf
36933 ** only keys and no data. The intkey flag means that the key is a integer
36989 ** var Number of bytes of key. Or the key itself if intkey flag is set.
37070 u8 intKey; /* True if intkey flag is set */
37240 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */
38350 /* If this is an intKey table, then the above call to BtreeKeySize()
38352 ** all that is required. Otherwise, if pCur is not open on an intKey
38356 if( 0==pCur->apPage[0]->intKey ){
38369 assert( !pCur->apPage[0]->intKey || !pCur->pKey );
38667 if( pPage->intKey ){
38753 if( pPage->intKey ){
38812 assert( (info.nData+(pPage->intKey?0:info.nKey))==info.nPayload );
39119 pPage->intKey = 1;
39124 pPage->intKey = 0;
41279 ** For a table with the INTKEY flag set, this routine returns the key
41475 nKey = (pPage->intKey ? 0 : (int)pCur->info.nKey);
41675 if( pPage->intKey ){
41732 ** if an intkey page appears to be the parent of a non-intkey page, or
41755 if( pNewPage->nCell<1 || pNewPage->intKey!=pCur->apPage[i]->intKey ){
41862 assert( pCur->apPage[0]->intKey==1 || pCur->apPage[0]->intKey==0 );
41863 if( (pCur->pKeyInfo==0)!=pCur->apPage[0]->intKey ){
41876 assert( pRoot->isInit && (pCur->pKeyInfo==0)==pRoot->intKey );
42012 ** specified by pIdxKey or intKey. Return a success code.
42014 ** For INTKEY tables, the intKey parameter is used. pIdxKey
42015 ** must be NULL. For index tables, pIdxKey is used and intKey
42029 ** is smaller than intKey/pIdxKey or if the table is empty
42033 ** exactly matches intKey/pIdxKey.
42036 ** is larger than intKey/pIdxKey.
42042 i64 intKey, /* The table key */
42056 && pCur->apPage[0]->intKey
42058 if( pCur->info.nKey==intKey ){
42062 if( pCur->atLast && pCur->info.nKey<intKey ){
42080 assert( pCur->apPage[0]->intKey || pIdxKey );
42094 assert( pPage->intKey==(pIdxKey==0) );
42108 if( pPage->intKey ){
42115 if( nCellKey==intKey ){
42117 }else if( nCellKey<intKey ){
42120 assert( nCellKey>intKey );
42170 if( pPage->intKey && !pPage->leaf ){
42284 if( pPage->intKey ){
42350 if( pPage->intKey && !pPage->leaf ){
42892 if( pPage->intKey ){
43937 ** 4) If the sibling pages are not internal intkey nodes, then any
43939 ** (internal intkey nodes never contain pointers to overflow pages).
43962 ** intkey b-tree, then cell i was a divider cell. */
43985 ** intkey b-tree, then cell i is a divider cell. */
44235 ** For an INTKEY table, only the nKey value of the key is used. pKey is
44281 ** intkey table, the caller should be inserting integer keys with a
44298 ** data into the intkey B-Tree. In this case btreeMoveto() recognizes
44312 assert( pPage->intKey || nKey>=0 );
44313 assert( pPage->leaf || !pPage->intKey );
44363 ** multiple records into an intkey b-tree using a single cursor (as can
44681 assert( pPage->intKey );
44704 ** If pnChange is not NULL, then table iTable must be an intkey table. The
44946 if( pPage->leaf || !pPage->intKey ){
45230 if( !pPage->intKey ) sz += (int)info.nKey;
45231 /* For intKey pages, check that the keys are in order.
45284 /* For intKey leaf pages, check that the min/max keys are in order
45287 if( pPage->leaf && pPage->intKey ){
45622 ** INTKEY table currently pointing at a valid table entry.
45650 ** (e) the cursor points at a valid row of an intKey table.
45658 assert( pCsr->apPage[pCsr->iPage]->intKey );
55536 ** automatically created table with root-page 1 (an INTKEY table).
56952 ** intkey table (an SQL table, not an index). In this case the row change
62044 ** intkey B-Tree to store the set of IN(...) values instead of the usual
83275 ** OP_Count instruction is executed either on the intkey table that
