Show More
@@ -338,15 +338,16 b' def successorssets(repo, initialnode, ca' | |||||
338 | successors set. To distinguish this from a pruned changeset, the successor |
|
338 | successors set. To distinguish this from a pruned changeset, the successor | |
339 | set will contain itself only, i.e. [(A,)]. |
|
339 | set will contain itself only, i.e. [(A,)]. | |
340 |
|
340 | |||
341 |
Finally, successors unknown locally are considered to be pruned |
|
341 | Finally, final successors unknown locally are considered to be pruned | |
342 | without any successors). |
|
342 | (pruned: obsoleted without any successors). (Final: successors not affected | |
|
343 | by markers). | |||
343 |
|
344 | |||
344 |
The optional `cache` parameter is a dictionary that may contain |
|
345 | The optional `cache` parameter is a dictionary that may contains | |
345 |
successors sets. It is meant to reuse the computation of a |
|
346 | precomputed successors sets. It is meant to reuse the computation of a | |
346 |
`successorssets` when multiple calls are made at the same |
|
347 | previous call to `successorssets` when multiple calls are made at the same | |
347 |
dictionary is updated in place. The caller is responsible |
|
348 | time. The cache dictionary is updated in place. The caller is responsible | |
348 |
span. Code that makes multiple calls to `successorssets` |
|
349 | for its life span. Code that makes multiple calls to `successorssets` | |
349 |
cache mechanism or |
|
350 | *should* use this cache mechanism or risk a performance hit. | |
350 | """ |
|
351 | """ | |
351 |
|
352 | |||
352 | succmarkers = repo.obsstore.successors |
|
353 | succmarkers = repo.obsstore.successors |
General Comments 0
You need to be logged in to leave comments.
Login now