Mercurial > hg
comparison hgext/sqlitestore.py @ 40444:256b1f0c24e8 stable
changegroup: introduce an explicit linear sorting
We still need to linearize the revisions in some cases, introduce an explicit
`linear` sorting before changing back the default order.
Differential Revision: https://phab.mercurial-scm.org/D5195
author | Boris Feld <boris.feld@octobus.net> |
---|---|
date | Mon, 29 Oct 2018 17:26:25 +0100 |
parents | 595641bd8404 |
children | 4fe63b573791 |
comparison
equal
deleted
inserted
replaced
40431:8ebb05f747e5 | 40444:256b1f0c24e8 |
---|---|
557 def cmp(self, node, fulltext): | 557 def cmp(self, node, fulltext): |
558 return not storageutil.filedataequivalent(self, node, fulltext) | 558 return not storageutil.filedataequivalent(self, node, fulltext) |
559 | 559 |
560 def emitrevisions(self, nodes, nodesorder=None, revisiondata=False, | 560 def emitrevisions(self, nodes, nodesorder=None, revisiondata=False, |
561 assumehaveparentrevisions=False, deltaprevious=False): | 561 assumehaveparentrevisions=False, deltaprevious=False): |
562 if nodesorder not in ('nodes', 'storage', None): | 562 if nodesorder not in ('nodes', 'storage', 'linear', None): |
563 raise error.ProgrammingError('unhandled value for nodesorder: %s' % | 563 raise error.ProgrammingError('unhandled value for nodesorder: %s' % |
564 nodesorder) | 564 nodesorder) |
565 | 565 |
566 nodes = [n for n in nodes if n != nullid] | 566 nodes = [n for n in nodes if n != nullid] |
567 | 567 |