discovery: first version of the "hash tree" idea
We build a hash for each node based on the markers that applies to it and the
hash of its parent. This will allow a kind of discovery process for markers.
# Copied from histedit setup.py
# Credit to Augie Fackler <durin42@gmail.com>
from distutils.core import setup
setup(
name='hg-evolve',
version='3.3.0',
author='Pierre-Yves David',
maintainer='Pierre-Yves David',
maintainer_email='pierre-yves.david@logilab.fr',
url='https://bitbucket.org/marmoute/mutable-history',
description='Flexible evolution of Mercurial history.',
long_description=open('README').read(),
keywords='hg mercurial',
license='GPLv2+',
py_modules=['hgext.evolve', 'hgext.pushexperiment'],
)