Commits

Chris Mutel  committed be52ab6

0.8.1.1: Better packaging

  • Participants
  • Parent commits 02d2ffc

Comments (0)

Files changed (3)

+Brightway2-calc
+===============
+
+The calculation engine for the Brightway2 life cycle assessment framework.
+
+The emphasis here has been on speed of solving the linear systems, for normal LCA calculations, graph traversal, or Monte Carlo uncertainty analysis.
+
+The Monte Carlo LCA class can do about 30 iterations a second (on a 2011 MacBook Pro). Instead of doing LU factorization, it uses an initial guess and the conjugant gradient squared algorithm.
+
+The multiprocessing Monte Carlo class (ParallelMonteCarlo) can do about 100 iterations a second, using 7 virtual cores. The MultiMonteCarlo class, which does Monte Carlo for many processes (and hence can re-use the factorized technosphere matrix), can do about 500 iterations a second, using 7 virtual cores. Both these algorithms perform best when the initial setup for each worker job is minimized, e.g. by dispatching big chunks.
+
+Roadmap
+-------
+
+* 0.8: Current release. All LCA and Monte Carlo functions.
+* 0.9: Documentation and inclusion of tests from Brightway 1 (updated and with coverage)
+* 1.0: Bugfixes and small changes from 0.9
+* 1.1: Graph traversal

File README.txt

-===============
-Brightway2-calc
-===============
-
-The calculation engine for the Brightway2 life cycle assessment framework.
-
-The emphasis here has been on speed of solving the linear systems, for normal LCA calculations, graph traversal, or Monte Carlo uncertainty analysis.
-
-The Monte Carlo LCA class can do about 30 iterations a second (on my 2011 MacBook Pro). Instead of doing LU factorization, it uses an initial guess and the conjugant gradient squared algorithm.
-
-The multiprocessing Monte Carlo class (ParallelMonteCarlo) can do about 100 iterations a second, using 7 virtual cores. The MultiMonteCarlo class, which does Monte Carlo for many processes (and hence can re-use the factorized technosphere matrix), can do about 500 iterations a second, using 7 virtual cores. Both these algorithms perform best when the initial setup for each worker job is minimized, e.g. by dispatching big chunks.
-
-Roadmap
-*******
-
-* 0.8: Current release. All LCA and Monte Carlo functions.
-* 0.9: Documentation and inclusion of tests from Brightway 1 (updated and with coverage)
-* 1.0: Bugfixes and small changes from 0.9
-* 1.1: Graph traversal
 
 setup(
   name='bw2calc',
-  version="0.8.1",
-  packages=["bw2calc"],
+  version="0.8.1.1",
+  packages=["bw2calc", "bw2calc.tests"],
   author="Chris Mutel",
   author_email="cmutel@gmail.com",
   license=open('LICENSE.txt').read(),
   url="https://bitbucket.org/cmutel/brightway2-calc",
-  long_description=open('README.txt').read(),
+  install_requires=["brightway2"],
+  long_description=open('README.rst').read(),
+  classifiers=[
+    'Development Status :: 4 - Beta',
+    'Intended Audience :: End Users/Desktop',
+    'Intended Audience :: Developers',
+    'Intended Audience :: Science/Research',
+    'License :: OSI Approved :: BSD License',
+    'Operating System :: MacOS :: MacOS X',
+    'Operating System :: Microsoft :: Windows',
+    'Operating System :: POSIX',
+    'Programming Language :: Python',
+    'Programming Language :: Python :: 2.7',
+    'Programming Language :: Python :: 2 :: Only',
+    'Topic :: Scientific/Engineering :: Information Analysis',
+    'Topic :: Scientific/Engineering :: Mathematics',
+    'Topic :: Scientific/Engineering :: Visualization',
+    ],
 )