Fossil SCM
In the graph algorithm, try to put branches on rails as close as possible to their parent.
Commit
42bbfe9d64ebb6787c8f89e94be512feb7b56de6
Parent
340d3398e614245…
1 file changed
+1
-1
+1
-1
| --- src/graph.c | ||
| +++ src/graph.c | ||
| @@ -306,11 +306,11 @@ | ||
| 306 | 306 | continue; |
| 307 | 307 | } |
| 308 | 308 | if( pDesc->aiRaiser[pDesc->iRail]==0 && pDesc->zBranch==pRow->zBranch ){ |
| 309 | 309 | pRow->iRail = pDesc->iRail; |
| 310 | 310 | }else{ |
| 311 | - pRow->iRail = findFreeRail(p, 0, pDesc->idx, inUse, 0); | |
| 311 | + pRow->iRail = findFreeRail(p, 0, pDesc->idx, inUse, pDesc->iRail); | |
| 312 | 312 | } |
| 313 | 313 | pDesc->aiRaiser[pRow->iRail] = pRow->idx; |
| 314 | 314 | mask = 1<<pRow->iRail; |
| 315 | 315 | if( pRow->isLeaf ){ |
| 316 | 316 | inUse &= ~mask; |
| 317 | 317 |
| --- src/graph.c | |
| +++ src/graph.c | |
| @@ -306,11 +306,11 @@ | |
| 306 | continue; |
| 307 | } |
| 308 | if( pDesc->aiRaiser[pDesc->iRail]==0 && pDesc->zBranch==pRow->zBranch ){ |
| 309 | pRow->iRail = pDesc->iRail; |
| 310 | }else{ |
| 311 | pRow->iRail = findFreeRail(p, 0, pDesc->idx, inUse, 0); |
| 312 | } |
| 313 | pDesc->aiRaiser[pRow->iRail] = pRow->idx; |
| 314 | mask = 1<<pRow->iRail; |
| 315 | if( pRow->isLeaf ){ |
| 316 | inUse &= ~mask; |
| 317 |
| --- src/graph.c | |
| +++ src/graph.c | |
| @@ -306,11 +306,11 @@ | |
| 306 | continue; |
| 307 | } |
| 308 | if( pDesc->aiRaiser[pDesc->iRail]==0 && pDesc->zBranch==pRow->zBranch ){ |
| 309 | pRow->iRail = pDesc->iRail; |
| 310 | }else{ |
| 311 | pRow->iRail = findFreeRail(p, 0, pDesc->idx, inUse, pDesc->iRail); |
| 312 | } |
| 313 | pDesc->aiRaiser[pRow->iRail] = pRow->idx; |
| 314 | mask = 1<<pRow->iRail; |
| 315 | if( pRow->isLeaf ){ |
| 316 | inUse &= ~mask; |
| 317 |