Searched refs:balance (Results 1 – 14 of 14) sorted by relevance
20 # 1.1.* A one-pass UPDATE that does balance() operations on the IPK index60 # A one-pass UPDATE that does balance() operations on the IPK index
13 # when it tries to balance the merge tree.
19 # The refactoring on the b-tree balance() routine in check-in
144 # Now attempt to balance two AND trees joined by an OR.
27 # io-1.* - Test that quick-balance does not journal pages unnecessarily.113 # This insert should use the quick-balance trick to add a third leaf
285 # Test case cc-3 inserts an extra record into t1, forcing balance-deeper
333 INSERT INTO t10 VALUES('You have to get the right balance between');
121 # transient malloc() calls in btree.c, which can occur during the tree-balance
787 … "New Gen 2001_2002" link has all of the supply side info that is used to calculate the L/R balance
1455 balance balanc
8732 static int balance(BtCursor *pCur){ in balance() function9258 rc = balance(pCur); in sqlite3BtreeInsert()9579 rc = balance(pCur); in sqlite3BtreeDelete()9588 rc = balance(pCur); in sqlite3BtreeDelete()
735 balance balanc balcony balconi