contrib/benchmarks/perf.py

convert: use a priority queue for sorting commits, to make sorting faster

To achieve this, we turn commit sorters into classes so they can
encapsulate state.

This reduces the sorting time from ~30s to ~10s on a 500k-commit
prefix of a repo I tried to convert. (and probably reduces the time
to sort the whole repo from many tens of minutes to minutes, but I
didn't try that again)

The date caching gets removed because priority queue already
caches the key.

# perf.py - asv benchmarks using contrib/perf.py extension
#
# Copyright 2016 Logilab SA <[e-mail]>
#
# This software may be used and distributed according to the terms of the
# GNU General Public License version 2 or any later version.


from . import perfbench


@perfbench()
def track_tags(perf):
    return perf("perftags")


@perfbench()
def track_status(perf):
    return perf("perfstatus", unknown=False)


@perfbench(params=[('rev', ['1000', '10000', 'tip'])])
def track_manifest(perf, rev):
    return perf("perfmanifest", rev)


@perfbench()
def track_heads(perf):
    return perf("perfheads")