comparison mercurial/changelog.py @ 8209:a1a5a57efe90

replace util.sort with sorted built-in

This is marginally faster for small and moderately-sized lists

8208:32a2a1e244f1

                extra[k] = v
        return extra

    def encode_extra(self, d):
        # keys must be sorted to produce a deterministic changelog entry
        items = [_string_escape('%s:%s' % (k, d[k])) for k in util.sort(d)]
        return "\0".join(items)

    def read(self, node):
        """
        format used:

        if extra and extra.get("branch") in ("default", ""):
            del extra["branch"]
        if extra:
            extra = self.encode_extra(extra)
            parseddate = "%s %s" % (parseddate, extra)
        l = [hex(manifest), user, parseddate] + util.sort(files) + ["", desc]
        text = "\n".join(l)
        return self.addrevision(text, transaction, len(self), p1, p2)

8209:a1a5a57efe90

                extra[k] = v
        return extra

    def encode_extra(self, d):
        # keys must be sorted to produce a deterministic changelog entry
        items = [_string_escape('%s:%s' % (k, d[k])) for k in sorted(d)]
        return "\0".join(items)

    def read(self, node):
        """
        format used:

        if extra and extra.get("branch") in ("default", ""):
            del extra["branch"]
        if extra:
            extra = self.encode_extra(extra)
            parseddate = "%s %s" % (parseddate, extra)
        l = [hex(manifest), user, parseddate] + sorted(files) + ["", desc]
        text = "\n".join(l)
        return self.addrevision(text, transaction, len(self), p1, p2)