Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Fix typo in comment. No changes to code. |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: |
9f6f17b5c97c9576c340173d068485fd |
| User & Date: | mistachkin 2016-04-28 19:23:10 |
Context
|
2016-04-28
| ||
| 20:11 | Comment changes only: Add several optimization marks in rowset.c. Add a header comment that explains what the various special comments mean. check-in: 8cdbe89a user: drh tags: trunk | |
| 19:23 | Fix typo in comment. No changes to code. check-in: 9f6f17b5 user: mistachkin tags: trunk | |
| 18:53 | Rearrange some code in the RowSet logic for clarity of presentation, while adding an /*OPTIMIZATION-IF-TRUE*/ comment. It should operate identically. check-in: 5748e643 user: drh tags: trunk | |
Changes
Changes to src/rowset.c.
335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 |
){
struct RowSetEntry *p; /* Root of the new tree */
struct RowSetEntry *pLeft; /* Left subtree */
if( *ppList==0 ){
return 0;
}
if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/
/* This branch cases a *balanced* tree to be generated. A valid tree
** is still generated without this branch, but it is wildly unbalanced
** and inefficient. */
pLeft = rowSetNDeepTree(ppList, iDepth-1);
p = *ppList;
if( p==0 ){
return pLeft;
}
|
| |
335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 |
){
struct RowSetEntry *p; /* Root of the new tree */
struct RowSetEntry *pLeft; /* Left subtree */
if( *ppList==0 ){
return 0;
}
if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/
/* This branch causes a *balanced* tree to be generated. A valid tree
** is still generated without this branch, but it is wildly unbalanced
** and inefficient. */
pLeft = rowSetNDeepTree(ppList, iDepth-1);
p = *ppList;
if( p==0 ){
return pLeft;
}
|