Show More
@@ -109,7 +109,7 b' def findliteralblocks(blocks):' | |||||
109 | elif len(blocks[i]['lines']) == 1 and \ |
|
109 | elif len(blocks[i]['lines']) == 1 and \ | |
110 | blocks[i]['lines'][0].lstrip(' ').startswith('.. ') and \ |
|
110 | blocks[i]['lines'][0].lstrip(' ').startswith('.. ') and \ | |
111 | blocks[i]['lines'][0].find(' ', 3) == -1: |
|
111 | blocks[i]['lines'][0].find(' ', 3) == -1: | |
112 |
# directive on its o |
|
112 | # directive on its own line, not a literal block | |
113 | i += 1 |
|
113 | i += 1 | |
114 | continue |
|
114 | continue | |
115 | else: |
|
115 | else: | |
@@ -382,7 +382,7 b' def addmargins(blocks):' | |||||
382 | blocks[i]['type'] in ('bullet', 'option', 'field')): |
|
382 | blocks[i]['type'] in ('bullet', 'option', 'field')): | |
383 | i += 1 |
|
383 | i += 1 | |
384 | elif not blocks[i - 1]['lines']: |
|
384 | elif not blocks[i - 1]['lines']: | |
385 |
# no lines in previous block, do not sep |
|
385 | # no lines in previous block, do not separate | |
386 | i += 1 |
|
386 | i += 1 | |
387 | else: |
|
387 | else: | |
388 | blocks.insert(i, dict(lines=[''], indent=0, type='margin')) |
|
388 | blocks.insert(i, dict(lines=[''], indent=0, type='margin')) |
@@ -766,7 +766,7 b' def _computeextinctset(repo):' | |||||
766 | def _computebumpedset(repo): |
|
766 | def _computebumpedset(repo): | |
767 | """the set of revs trying to obsolete public revisions""" |
|
767 | """the set of revs trying to obsolete public revisions""" | |
768 | bumped = set() |
|
768 | bumped = set() | |
769 | # utils function (avoid attribut lookup in the loop) |
|
769 | # utils function (avoid attribute lookup in the loop) | |
770 | phase = repo._phasecache.phase # would be faster to grab the full list |
|
770 | phase = repo._phasecache.phase # would be faster to grab the full list | |
771 | public = phases.public |
|
771 | public = phases.public | |
772 | cl = repo.changelog |
|
772 | cl = repo.changelog |
@@ -96,7 +96,7 b' def computeimpactable(repo):' | |||||
96 |
|
96 | |||
97 | # function to compute filtered set |
|
97 | # function to compute filtered set | |
98 | # |
|
98 | # | |
99 |
# When add |
|
99 | # When adding a new filter you MUST update the table at: | |
100 | # mercurial.branchmap.subsettable |
|
100 | # mercurial.branchmap.subsettable | |
101 | # Otherwise your filter will have to recompute all its branches cache |
|
101 | # Otherwise your filter will have to recompute all its branches cache | |
102 | # from scratch (very slow). |
|
102 | # from scratch (very slow). |
General Comments 0
You need to be logged in to leave comments.
Login now