equal
deleted
inserted
replaced
1212 seen.add(ha) |
1212 seen.add(ha) |
1213 missing = sorted(expected - seen) # sort to stabilize output |
1213 missing = sorted(expected - seen) # sort to stabilize output |
1214 if missing: |
1214 if missing: |
1215 raise error.Abort(_('missing rules for changeset %s') % |
1215 raise error.Abort(_('missing rules for changeset %s') % |
1216 missing[0][:12], |
1216 missing[0][:12], |
1217 hint=_('do you want to use the drop action?')) |
1217 hint=_('use "drop %s" to discard the change') % missing[0][:12]) |
1218 |
1218 |
1219 def newnodestoabort(state): |
1219 def newnodestoabort(state): |
1220 """process the list of replacements to return |
1220 """process the list of replacements to return |
1221 |
1221 |
1222 1) the list of final node |
1222 1) the list of final node |