Mercurial > hg
comparison hgext/convert/cvs.py @ 8209:a1a5a57efe90
replace util.sort with sorted built-in
This is marginally faster for small and moderately-sized lists
author | Matt Mackall <mpm@selenic.com> |
---|---|
date | Sun, 26 Apr 2009 16:50:44 -0500 |
parents | 6584953be356 |
children | 1b60efdb8bc5 |
comparison
equal
deleted
inserted
replaced
8208:32a2a1e244f1 | 8209:a1a5a57efe90 |
---|---|
345 return self.modecache[(file, rev)] | 345 return self.modecache[(file, rev)] |
346 | 346 |
347 def getchanges(self, rev): | 347 def getchanges(self, rev): |
348 self._parse() | 348 self._parse() |
349 self.modecache = {} | 349 self.modecache = {} |
350 return util.sort(self.files[rev].items()), {} | 350 return sorted(self.files[rev].iteritems()), {} |
351 | 351 |
352 def getcommit(self, rev): | 352 def getcommit(self, rev): |
353 self._parse() | 353 self._parse() |
354 return self.changeset[rev] | 354 return self.changeset[rev] |
355 | 355 |
357 self._parse() | 357 self._parse() |
358 return self.tags | 358 return self.tags |
359 | 359 |
360 def getchangedfiles(self, rev, i): | 360 def getchangedfiles(self, rev, i): |
361 self._parse() | 361 self._parse() |
362 return util.sort(self.files[rev].keys()) | 362 return sorted(self.files[rev]) |