Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
Comment: | Remove a faulty assert() from the btree balancing logic. |
---|---|
Downloads: | Tarball | ZIP archive |
Timelines: | family | ancestors | descendants | both | trunk |
Files: | files | file ages | folders |
SHA1: |
d06669d968c8f6af8799fbfeabadaab6 |
User & Date: | drh 2015-04-13 14:44:01.870 |
Context
2015-04-13
| ||
17:43 | Add a comment to wal.c to explain why a race condition is safe. (check-in: bc33af8664 user: dan tags: trunk) | |
14:44 | Remove a faulty assert() from the btree balancing logic. (check-in: d06669d968 user: drh tags: trunk) | |
14:08 | Test that if the definition of a collation sequence is changed and VACUUM run, the new database contains records sorted in the (new) correct order. (check-in: ce6eaac10a user: dan tags: trunk) | |
Changes
Changes to src/btree.c.
︙ | ︙ | |||
6731 6732 6733 6734 6735 6736 6737 | }else{ assert( bBulk==0 || bBulk==1 ); if( iParentIdx==0 ){ nxDiv = 0; }else if( iParentIdx==i ){ nxDiv = i-2+bBulk; }else{ | < | 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 | }else{ assert( bBulk==0 || bBulk==1 ); if( iParentIdx==0 ){ nxDiv = 0; }else if( iParentIdx==i ){ nxDiv = i-2+bBulk; }else{ nxDiv = iParentIdx-1; } i = 2-bBulk; } nOld = i+1; if( (i+nxDiv-pParent->nOverflow)==pParent->nCell ){ pRight = &pParent->aData[pParent->hdrOffset+8]; |
︙ | ︙ |