comparison: src/misc.cpp
src/misc.cpp
- changeset 544
- a52cfa218780
- parent 542
- 46a33bdc0b36
equal
deleted
inserted
replaced
| 543:7029f7938dae | 544:a52cfa218780 |
|---|---|
| 282 // This does not always yield into usable results. If at some point r == r0 or | 282 // This does not always yield into usable results. If at some point r == r0 or |
| 283 // r == r1, there is no hope of finding the rings, at least with this algorithm, | 283 // r == r1, there is no hope of finding the rings, at least with this algorithm, |
| 284 // as it would fall into an infinite recursion. | 284 // as it would fall into an infinite recursion. |
| 285 // ----------------------------------------------------------------------------- | 285 // ----------------------------------------------------------------------------- |
| 286 bool RingFinder::findRingsRecursor (double r0, double r1, Solution& currentSolution) | 286 bool RingFinder::findRingsRecursor (double r0, double r1, Solution& currentSolution) |
| 287 { char tabs[64]; | 287 { // Don't recurse too deep. |
| 288 memset (tabs, '\t', m_stack); | |
| 289 tabs[m_stack] = '\0'; | |
| 290 | |
| 291 // Don't recurse too deep. | |
| 292 if (m_stack >= 5) | 288 if (m_stack >= 5) |
| 293 return false; | 289 return false; |
| 294 | 290 |
| 295 // Find the scale and number of a ring between r1 and r0. | 291 // Find the scale and number of a ring between r1 and r0. |
| 296 assert (r1 >= r0); | 292 assert (r1 >= r0); |
