Lines Matching defs:intKey
8326 i64 intKey,
48594 ** 0 1 Flags. 1: intkey, 2: zerodata, 4: leafdata, 8: leaf
48603 ** only keys and no data. The intkey flag means that the key is a integer
48659 ** var Number of bytes of key. Or the key itself if intkey flag is set.
48740 u8 intKey; /* True if intkey flag is set */
48922 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */
49968 /* If this is an intKey table, then the above call to BtreeKeySize()
49970 ** all that is required. Otherwise, if pCur is not open on an intKey
49974 if( 0==pCur->apPage[0]->intKey ){
49987 assert( !pCur->apPage[0]->intKey || !pCur->pKey );
50299 if( pPage->intKey ){
50380 if( pPage->intKey ){
50439 assert( (info.nData+(pPage->intKey?0:info.nKey))==info.nPayload );
50746 pPage->intKey = 1;
50751 pPage->intKey = 0;
53061 ** For a table with the INTKEY flag set, this routine returns the key
53257 nKey = (pPage->intKey ? 0 : (int)pCur->info.nKey);
53491 if( pPage->intKey ){
53548 ** if an intkey page appears to be the parent of a non-intkey page, or
53571 if( pNewPage->nCell<1 || pNewPage->intKey!=pCur->apPage[i]->intKey ){
53691 assert( pCur->apPage[0]->intKey==1 || pCur->apPage[0]->intKey==0 );
53692 if( (pCur->pKeyInfo==0)!=pCur->apPage[0]->intKey ){
53705 assert( pRoot->isInit && (pCur->pKeyInfo==0)==pRoot->intKey );
53840 ** specified by pIdxKey or intKey. Return a success code.
53842 ** For INTKEY tables, the intKey parameter is used. pIdxKey
53843 ** must be NULL. For index tables, pIdxKey is used and intKey
53857 ** is smaller than intKey/pIdxKey or if the table is empty
53861 ** exactly matches intKey/pIdxKey.
53864 ** is larger than intKey/pIdxKey.
53870 i64 intKey, /* The table key */
53884 && pCur->apPage[0]->intKey
53886 if( pCur->info.nKey==intKey ){
53890 if( pCur->atLast && pCur->info.nKey<intKey ){
53908 assert( pCur->apPage[0]->intKey || pIdxKey );
53922 assert( pPage->intKey==(pIdxKey==0) );
53936 if( pPage->intKey ){
53943 if( nCellKey==intKey ){
53945 }else if( nCellKey<intKey ){
53948 assert( nCellKey>intKey );
54003 if( pPage->intKey && !pPage->leaf ){
54022 assert( lwr==upr+1 || (pPage->intKey && !pPage->leaf) );
54122 if( pPage->intKey ){
54188 if( pPage->intKey && !pPage->leaf ){
54751 if( pPage->intKey ){
55831 ** 4) If the sibling pages are not internal intkey nodes, then any
55833 ** (internal intkey nodes never contain pointers to overflow pages).
55856 ** intkey b-tree, then cell i was a divider cell. */
55880 ** intkey b-tree, then cell i is a divider cell. */
56133 ** For an INTKEY table, only the nKey value of the key is used. pKey is
56180 ** intkey table, the caller should be inserting integer keys with a
56197 ** data into the intkey B-Tree. In this case btreeMoveto() recognizes
56211 assert( pPage->intKey || nKey>=0 );
56212 assert( pPage->leaf || !pPage->intKey );
56262 ** multiple records into an intkey b-tree using a single cursor (as can
56593 assert( pPage->intKey );
56616 ** If pnChange is not NULL, then table iTable must be an intkey table. The
56865 if( pPage->leaf || !pPage->intKey ){
57149 if( !pPage->intKey ) sz += (int)info.nKey;
57150 /* For intKey pages, check that the keys are in order.
57203 /* For intKey leaf pages, check that the min/max keys are in order
57206 if( pPage->leaf && pPage->intKey ){
57567 ** INTKEY table currently pointing at a valid table entry.
57595 ** (e) the cursor points at a valid row of an intKey table.
57604 assert( pCsr->apPage[pCsr->iPage]->intKey );
69696 ** intkey table (an SQL table, not an index). In this case the row change
76001 ** intkey B-Tree to store the set of IN(...) values instead of the usual
98901 ** OP_Count instruction is executed either on the intkey table that
120813 ** of data that will fit on a single leaf page of an intkey table in
