view setup.py @ 863:e9693738f234

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.
author Pierre-Yves David <pierre-yves.david@fb.com>
date Wed, 05 Mar 2014 16:58:56 -0800
parents 83882f2fbecb
children 48e68d3b0144
line wrap: on
line source

# 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'],
)