Log message:
Add SHA512 digests for distfiles for devel category

Issues found with existing distfiles:
	distfiles/eclipse-sourceBuild-srcIncluded-3.0.1.zip
	distfiles/fortran-utils-1.1.tar.gz
	distfiles/ivykis-0.39.tar.gz
	distfiles/enum-1.11.tar.gz
	distfiles/pvs-3.2-libraries.tgz
	distfiles/pvs-3.2-linux.tgz
	distfiles/pvs-3.2-solaris.tgz
	distfiles/pvs-3.2-system.tgz
No changes made to these distinfo files.

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.

Log message:
0.5     -- Added support for Python 3.5 infix matrix
           multiplication

Log message:
Updated to 0.4.1. No longer has tests directory installed to ${PYSITELIB}.

0.4.1   -- Added missing SourceGenerator.visit_arguments()

Log message:
Forgot to commit distinfo somehow...

Log message:
Remove files installed to ${PYSITELIB}/tests in post-install.

Log message:
Import py27-astor-0.3 as devel/py-astor.

astor is designed to allow easy manipulation of Python source via the AST. There
are some other similar libraries, but astor focuses on the following areas:

 * Round-trip back to Python via Armin Ronacher's codegen.py module:
   ** Modified AST doesn't need linenumbers, ctx, etc. or otherwise be directly
      compileable
   ** Easy to read generated code as, well, code
 * Dump pretty-printing of AST
   ** Harder to read than round-tripped code, but more accurate to figure out
      what is going on.
   ** Easier to read than dump from built-in AST module
 * Non-recursive treewalk
   ** Sometimes you want a recursive treewalk (and astor supports that, starting
      at any node on the tree), but sometimes you don't need to do that. astor
      doesn't require you to explicitly visit sub-nodes unless you want to:
   ** You can add code that executes before a node's children are visited,
      and/or
   ** You can add code that executes after a node's children are visited, and/or
   ** You can add code that executes and keeps the node's children from being
      visited (and optionally visit them yourself via a recursive call)
   ** Write functions to access the tree based on object names and/or attribute
      names
   ** Enjoy easy access to parent node(s) for tree rewriting