Show More
@@ -41,7 +41,7 b' from mercurial import (' | |||
|
41 | 41 | encoding, |
|
42 | 42 | error, |
|
43 | 43 | mdiff, |
|
44 |
obs |
|
|
44 | obsutil, | |
|
45 | 45 | patch, |
|
46 | 46 | registrar, |
|
47 | 47 | scmutil, |
@@ -167,7 +167,7 b' def getoldnodedrevmap(repo, nodelist):' | |||
|
167 | 167 | for node in nodelist: |
|
168 | 168 | ctx = unfi[node] |
|
169 | 169 | # For tags like "D123", put them into "toconfirm" to verify later |
|
170 |
precnodes = list(obs |
|
|
170 | precnodes = list(obsutil.allpredecessors(unfi.obsstore, [node])) | |
|
171 | 171 | for n in precnodes: |
|
172 | 172 | if n in nodemap: |
|
173 | 173 | for tag in unfi.nodetags(n): |
@@ -949,7 +949,7 b' def _computebumpedset(repo):' | |||
|
949 | 949 | # We only evaluate mutable, non-obsolete revision |
|
950 | 950 | node = ctx.node() |
|
951 | 951 | # (future) A cache of predecessors may worth if split is very common |
|
952 |
for pnode in obsutil.allpre |
|
|
952 | for pnode in obsutil.allpredecessors(repo.obsstore, [node], | |
|
953 | 953 | ignoreflags=bumpedfix): |
|
954 | 954 | prev = torev(pnode) # unfiltered! but so is phasecache |
|
955 | 955 | if (prev is not None) and (phase(repo, prev) <= public): |
@@ -102,7 +102,16 b' def closestpredecessors(repo, nodeid):' | |||
|
102 | 102 | else: |
|
103 | 103 | stack.append(precnodeid) |
|
104 | 104 | |
|
105 |
def allprecursors( |
|
|
105 | def allprecursors(*args, **kwargs): | |
|
106 | """ (DEPRECATED) | |
|
107 | """ | |
|
108 | msg = ("'obsutil.allprecursors' is deprecated, " | |
|
109 | "use 'obsutil.allpredecessors'") | |
|
110 | util.nouideprecwarn(msg, '4.4') | |
|
111 | ||
|
112 | return allpredecessors(*args, **kwargs) | |
|
113 | ||
|
114 | def allpredecessors(obsstore, nodes, ignoreflags=0): | |
|
106 | 115 | """Yield node for every precursors of <nodes>. |
|
107 | 116 | |
|
108 | 117 | Some precursors may be unknown locally. |
General Comments 0
You need to be logged in to leave comments.
Login now