1
0
mirror of https://github.com/sqlite/sqlite.git synced 2025-08-07 02:42:48 +03:00

Change leading tabs into spaces. (CVS 5755)

FossilOrigin-Name: 4e536463c1aa9991de85c7efc826c28896ca61d3
This commit is contained in:
drh
2008-09-30 14:06:28 +00:00
parent 2f78fc66b5
commit 7b682804c7
3 changed files with 20 additions and 20 deletions

View File

@@ -9,7 +9,7 @@
** May you share freely, never taking more than you give.
**
*************************************************************************
** $Id: btree.c,v 1.521 2008/09/30 09:31:45 danielk1977 Exp $
** $Id: btree.c,v 1.522 2008/09/30 14:06:29 drh Exp $
**
** This file implements a external (disk-based) database using BTrees.
** See the header comment on "btreeInt.h" for additional information.
@@ -5946,17 +5946,17 @@ int sqlite3BtreeDelete(BtCursor *pCur){
** It is not possible to copy the ancestry from pCur, as the same
** balance() call has invalidated the pCur->apPage[] and aiIdx[]
** arrays.
**
** The call to saveCursorPosition() below internally saves the
** key that leafCur is currently pointing to. Currently, there
** are two copies of that key in the tree - one here on the leaf
** page and one on some internal node in the tree. The copy on
** the leaf node is always the next key in tree-order after the
** copy on the internal node. So, the call to sqlite3BtreeNext()
** calls restoreCursorPosition() to point the cursor to the copy
** stored on the internal node, then advances to the next entry,
** which happens to be the copy of the key on the internal node.
** Net effect: leafCur is pointing back where
**
** The call to saveCursorPosition() below internally saves the
** key that leafCur is currently pointing to. Currently, there
** are two copies of that key in the tree - one here on the leaf
** page and one on some internal node in the tree. The copy on
** the leaf node is always the next key in tree-order after the
** copy on the internal node. So, the call to sqlite3BtreeNext()
** calls restoreCursorPosition() to point the cursor to the copy
** stored on the internal node, then advances to the next entry,
** which happens to be the copy of the key on the internal node.
** Net effect: leafCur is pointing back where
*/
#ifndef NDEBUG
Pgno leafPgno = pLeafPage->pgno;