Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
H
hg-windows-ci
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
mercurial
hg-windows-ci
Commits
c05b968d
Commit
c05b968d
authored
11 years ago
by
Sean Farley
Browse files
Options
Downloads
Patches
Plain Diff
obsolete: clarify documentation for succcessorssets
parent
6545770b
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
mercurial/obsolete.py
+30
-18
30 additions, 18 deletions
mercurial/obsolete.py
with
30 additions
and
18 deletions
mercurial/obsolete.py
+
30
−
18
View file @
c05b968d
...
...
@@ -509,7 +509,7 @@
def
successorssets
(
repo
,
initialnode
,
cache
=
None
):
"""
Return all set of successors of initial nodes
S
uccessors set of changeset A are a group of revision that succeed
A. It
succeed A as a consistent whole, each revision being only partial
replacement.
S
uccessors set contains non-obsolete changeset only.
The s
uccessors set of
a
changeset A are a group of revision
s
that succeed
A. It
succeed
s
A as a consistent whole, each revision being only
a
partial
replacement.
The s
uccessors set contains non-obsolete changeset
s
only.
...
...
@@ -515,5 +515,6 @@
In most cases a changeset A have zero (changeset pruned) or a single
successors set that contains a single successor (changeset A replaced by
A
'
)
This function returns the full list of successor sets which is why it
returns a list of tuples and not just a single tuple. Each tuple is a valid
successors set. Not that (A,) may be a valid successors set for changeset A
(see below).
...
...
@@ -519,5 +520,7 @@
When changeset is split, it results successors set containing more than
a single element. Divergent rewriting will result in multiple successors
sets.
In most cases, a changeset A will have a single element (e.g. the changeset
A is replaced by A
'
) in its successors set. Though, it is also common for a
changeset A to have no elements in its successor set (e.g. the changeset
has been pruned). Therefore, the returned list of successors sets will be
[(A
'
,)] or [], respectively.
...
...
@@ -523,3 +526,6 @@
They are returned as a list of tuples containing all valid successors sets.
When a changeset A is split into A
'
and B
'
, however, it will result in a
successors set containing more than a single element, i.e. [(A
'
,B
'
)].
Divergent changesets will result in multiple successors sets, i.e. [(A
'
,),
(A
''
)].
...
...
@@ -525,4 +531,5 @@
Final successors unknown locally are considered plain prune (obsoleted
without successors).
If a changeset A is not obsolete, then it will conceptually have no
successors set. To distinguish this from a pruned changeset, the successor
set will only contain itself, i.e. [(A,)].
...
...
@@ -528,10 +535,15 @@
The optional `cache` parameter is a dictionary that may contains
precomputed successors sets. It is meant to reuse the computation of
previous call to `successorssets` when multiple calls are made at the same
time. The cache dictionary is updated in place. The caller is responsible
for its live spawn. Code that makes multiple calls to `successorssets`
*must* use this cache mechanism or suffer terrible performances.
"""
Finally, successors unknown locally are considered to be pruned (obsoleted
without any successors).
The optional `cache` parameter is a dictionary that may contain precomputed
successors sets. It is meant to reuse the computation of a previous call to
`successorssets` when multiple calls are made at the same time. The cache
dictionary is updated in place. The caller is responsible for its live
spawn. Code that makes multiple calls to `successorssets` *must* use this
cache mechanism or suffer terrible performances.
"""
succmarkers
=
repo
.
obsstore
.
successors
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment