Show More
@@ -152,7 +152,7 b' def preservedrequirements(repo):' | |||||
152 |
|
152 | |||
153 |
|
153 | |||
154 | DEFICIENCY = b'deficiency' |
|
154 | DEFICIENCY = b'deficiency' | |
155 |
|
|
155 | OPTIMISATION = b'optimization' | |
156 |
|
156 | |||
157 |
|
157 | |||
158 | class improvement(object): |
|
158 | class improvement(object): | |
@@ -165,14 +165,14 b' class improvement(object):' | |||||
165 | will be mapped to an action later in the upgrade process. |
|
165 | will be mapped to an action later in the upgrade process. | |
166 |
|
166 | |||
167 | type |
|
167 | type | |
168 |
Either ``DEFICIENCY`` or `` |
|
168 | Either ``DEFICIENCY`` or ``OPTIMISATION``. A deficiency is an obvious | |
169 | problem. An optimization is an action (sometimes optional) that |
|
169 | problem. An optimization is an action (sometimes optional) that | |
170 | can be taken to further improve the state of the repository. |
|
170 | can be taken to further improve the state of the repository. | |
171 |
|
171 | |||
172 | description |
|
172 | description | |
173 | Message intended for humans explaining the improvement in more detail, |
|
173 | Message intended for humans explaining the improvement in more detail, | |
174 | including the implications of it. For ``DEFICIENCY`` types, should be |
|
174 | including the implications of it. For ``DEFICIENCY`` types, should be | |
175 |
worded in the present tense. For `` |
|
175 | worded in the present tense. For ``OPTIMISATION`` types, should be | |
176 | worded in the future tense. |
|
176 | worded in the future tense. | |
177 |
|
177 | |||
178 | upgrademessage |
|
178 | upgrademessage | |
@@ -551,7 +551,7 b' def findoptimizations(repo):' | |||||
551 | optimizations.append( |
|
551 | optimizations.append( | |
552 | improvement( |
|
552 | improvement( | |
553 | name=b're-delta-parent', |
|
553 | name=b're-delta-parent', | |
554 |
type= |
|
554 | type=OPTIMISATION, | |
555 | description=_( |
|
555 | description=_( | |
556 | b'deltas within internal storage will be recalculated to ' |
|
556 | b'deltas within internal storage will be recalculated to ' | |
557 | b'choose an optimal base revision where this was not ' |
|
557 | b'choose an optimal base revision where this was not ' | |
@@ -571,7 +571,7 b' def findoptimizations(repo):' | |||||
571 | optimizations.append( |
|
571 | optimizations.append( | |
572 | improvement( |
|
572 | improvement( | |
573 | name=b're-delta-multibase', |
|
573 | name=b're-delta-multibase', | |
574 |
type= |
|
574 | type=OPTIMISATION, | |
575 | description=_( |
|
575 | description=_( | |
576 | b'deltas within internal storage will be recalculated ' |
|
576 | b'deltas within internal storage will be recalculated ' | |
577 | b'against multiple base revision and the smallest ' |
|
577 | b'against multiple base revision and the smallest ' | |
@@ -595,7 +595,7 b' def findoptimizations(repo):' | |||||
595 | optimizations.append( |
|
595 | optimizations.append( | |
596 | improvement( |
|
596 | improvement( | |
597 | name=b're-delta-all', |
|
597 | name=b're-delta-all', | |
598 |
type= |
|
598 | type=OPTIMISATION, | |
599 | description=_( |
|
599 | description=_( | |
600 | b'deltas within internal storage will always be ' |
|
600 | b'deltas within internal storage will always be ' | |
601 | b'recalculated without reusing prior deltas; this will ' |
|
601 | b'recalculated without reusing prior deltas; this will ' | |
@@ -613,7 +613,7 b' def findoptimizations(repo):' | |||||
613 | optimizations.append( |
|
613 | optimizations.append( | |
614 | improvement( |
|
614 | improvement( | |
615 | name=b're-delta-fulladd', |
|
615 | name=b're-delta-fulladd', | |
616 |
type= |
|
616 | type=OPTIMISATION, | |
617 | description=_( |
|
617 | description=_( | |
618 | b'every revision will be re-added as if it was new ' |
|
618 | b'every revision will be re-added as if it was new ' | |
619 | b'content. It will go through the full storage ' |
|
619 | b'content. It will go through the full storage ' | |
@@ -1295,7 +1295,7 b' def upgraderepo(' | |||||
1295 | ui.write(b'\n') |
|
1295 | ui.write(b'\n') | |
1296 |
|
1296 | |||
1297 | def printoptimisations(): |
|
1297 | def printoptimisations(): | |
1298 |
optimisations = [a for a in actions if a.type == |
|
1298 | optimisations = [a for a in actions if a.type == OPTIMISATION] | |
1299 | optimisations.sort(key=lambda a: a.name) |
|
1299 | optimisations.sort(key=lambda a: a.name) | |
1300 | if optimisations: |
|
1300 | if optimisations: | |
1301 | ui.write(_(b'optimisations: ')) |
|
1301 | ui.write(_(b'optimisations: ')) |
General Comments 0
You need to be logged in to leave comments.
Login now