310 |
|
try { |
311 |
|
AsyncFib f = this; |
312 |
|
int n = f.number; |
313 |
< |
if (n > 1) { |
314 |
< |
while (n > 1) { |
315 |
< |
AsyncFib p = f; |
316 |
< |
AsyncFib r = new AsyncFib(n - 2); |
317 |
< |
f = new AsyncFib(--n); |
318 |
< |
p.linkSubtasks(r, f); |
319 |
< |
r.fork(); |
320 |
< |
} |
321 |
< |
f.number = n; |
313 |
> |
while (n > 1) { |
314 |
> |
AsyncFib p = f; |
315 |
> |
AsyncFib r = new AsyncFib(n - 2); |
316 |
> |
f = new AsyncFib(--n); |
317 |
> |
p.linkSubtasks(r, f); |
318 |
> |
r.fork(); |
319 |
|
} |
320 |
|
f.complete(); |
321 |
|
} |
348 |
|
try { |
349 |
|
FailingAsyncFib f = this; |
350 |
|
int n = f.number; |
351 |
< |
if (n > 1) { |
352 |
< |
while (n > 1) { |
353 |
< |
FailingAsyncFib p = f; |
354 |
< |
FailingAsyncFib r = new FailingAsyncFib(n - 2); |
355 |
< |
f = new FailingAsyncFib(--n); |
356 |
< |
p.linkSubtasks(r, f); |
360 |
< |
r.fork(); |
361 |
< |
} |
362 |
< |
f.number = n; |
351 |
> |
while (n > 1) { |
352 |
> |
FailingAsyncFib p = f; |
353 |
> |
FailingAsyncFib r = new FailingAsyncFib(n - 2); |
354 |
> |
f = new FailingAsyncFib(--n); |
355 |
> |
p.linkSubtasks(r, f); |
356 |
> |
r.fork(); |
357 |
|
} |
358 |
|
f.complete(); |
359 |
|
} |