##// END OF EJS Templates
copies: fix some documentation typos...
Matt Harbison -
r49307:19e6446c default
parent child Browse files
Show More
@@ -289,7 +289,7 b' def _changesetforwardcopies(a, b, match)'
289 289 # no common revision to track copies from
290 290 return {}
291 291 if has_graph_roots:
292 # this deal with the special case mentionned in the [1] footnotes. We
292 # this deal with the special case mentioned in the [1] footnotes. We
293 293 # must filter out revisions that leads to non-common graphroots.
294 294 roots = list(roots)
295 295 m = min(roots)
@@ -300,11 +300,11 b' def _changesetforwardcopies(a, b, match)'
300 300
301 301 if repo.filecopiesmode == b'changeset-sidedata':
302 302 # When using side-data, we will process the edges "from" the children.
303 # We iterate over the childre, gathering previous collected data for
303 # We iterate over the children, gathering previous collected data for
304 304 # the parents. Do know when the parents data is no longer necessary, we
305 305 # keep a counter of how many children each revision has.
306 306 #
307 # An interresting property of `children_count` is that it only contains
307 # An interesting property of `children_count` is that it only contains
308 308 # revision that will be relevant for a edge of the graph. So if a
309 309 # children has parent not in `children_count`, that edges should not be
310 310 # processed.
General Comments 0
You need to be logged in to leave comments. Login now