Lines Matching full:leaves
2158 ** memory is in use leaves the configuration unchanged and returns
8276 ** is stored in the leaves. (BTREE_INTKEY is used for SQL tables.) With
9421 ** byte ranges are used for Unix. This leaves open the possiblity of having
25559 ** transaction crashes and leaves behind hot journals, then any
28355 ** a no-op, replace it with a stub that returns SQLITE_OK but leaves
48578 ** | page header | 8 bytes for leaves. 12 bytes for interior nodes
48599 ** 8 4 Right child (the Ptr(N) value). Omitted on leaves.
48679 ** * zero or more pages numbers of leaves
48859 ** The shared-cache leaves the 'pending lock' state when either of
54229 u32 k; /* Number of leaves on the trunk of the freelist */
54296 k = get4byte(&pTrunk->aData[4]); /* # of leaves on this trunk page */
54298 /* The trunk has no leaves and the list is not being searched.
54318 ** to allocate, regardless of whether it has leaves.
54339 ** pointers to free-list leaves. The first leaf becomes a trunk
55075 ** that page. This leaves the right side of the tree somewhat
55476 ** child pointers. If siblings are not leaves, then all cell in
55743 /* If the tree is a leaf-data tree, and the siblings are leaves,
55828 ** 3) If the sibling pages are not leaves, then the child pages of
55835 ** 5) If the sibling pages are not leaves, then the pointer-map
71928 ** leaves the iterator pointing to the first key in the PMA (or EOF if the
78843 ** If the table is a system table, this function leaves an error message
81524 ** routine leaves an error message in pParse->zErrMsg where
107132 ** The code that sqlite3WhereBegin() generates leaves the cursors named
118255 const char *zTerm, /* Term to select leaves for */
118377 const char *zTerm, /* Term to select leaves for */
118486 ** a POS_END varint (0). This routine leaves *ppPoslist pointing to
119314 ** root node, the range of leaves scanned can be reduced. Do this. */
121080 ** leaves 0 positions, zero is returned. Otherwise, non-zero.
125287 ** or the pending-terms table being flushed), leaves are written into the
125289 ** the tree is assembled in memory and written out only once all leaves have
130675 ** are the leaves, and so on. If the depth as specified on the root node
