Merge d35a51100e276f7c91d8c59fe7690ccc024c3d95 into 55c5c285558c410bb35ebf421245d320ab9ee9fa

.gitattributes

@@ -0,0 +1 @@
+gitstats/_version.py export-subst

.gitignore

@@ -0,0 +1,4 @@
+**/__pycache__
+*.egg-info
+build
+dist

MANIFEST.in

@@ -0,0 +1,3 @@
+include versioneer.py
+include gitstats/_version.py
+include gitstats/resources/*

Makefile

@@ -1,34 +0,0 @@
-PREFIX=/usr/local
-BINDIR=$(PREFIX)/bin
-RESOURCEDIR=$(PREFIX)/share/gitstats
-RESOURCES=gitstats.css sortable.js *.gif
-BINARIES=gitstats
-VERSION=$(shell git describe 2>/dev/null || git rev-parse --short HEAD 2>/dev/null || date +%Y-%m-%d)
-SEDVERSION=perl -pi -e 's/VERSION = 0/VERSION = "$(VERSION)"/' --
-
-all: help
-
-help:
-	@echo "Usage:"
-	@echo
-	@echo "make install                   # install to ${PREFIX}"
-	@echo "make install PREFIX=~          # install to ~"
-	@echo "make release [VERSION=foo]     # make a release tarball"
-	@echo
-
-install:
-	install -d $(BINDIR) $(RESOURCEDIR)
-	install -v $(BINARIES) $(BINDIR)
-	install -v -m 644 $(RESOURCES) $(RESOURCEDIR)
-	$(SEDVERSION) $(BINDIR)/gitstats
-
-release:
-	@cp gitstats gitstats.tmp
-	@$(SEDVERSION) gitstats.tmp
-	@tar --owner=0 --group=0 --transform 's!^!gitstats/!' --transform 's!gitstats.tmp!gitstats!' -zcf gitstats-$(VERSION).tar.gz gitstats.tmp $(RESOURCES) doc/ Makefile
-	@$(RM) gitstats.tmp
-
-man:
-	pod2man --center "User Commands" -r $(VERSION) doc/gitstats.pod > doc/gitstats.1
-
-.PHONY: all help install release

README.md

@@ -0,0 +1,20 @@
+# GitStats
+
+A utility to pull a number of statistics from a git repo including:
+
+* Total LOC (by file type)
+* LOC (by various time periods)
+* Commits (by various time periods)
+* Commits (by various authors)
+* Files (by type)
+* Files (by various time periods)
+
+## Usage
+
+`pip install gitstats`
+
+`gitstats <repo_dir>+ <output_dir>`
+
+## Dependencies
+
+This module is dependant upon [Tokei](https://github.com/Aaronepower/tokei). On OSX, `brew install tokei`

bin/publish

@@ -0,0 +1,15 @@
+#!/usr/bin/env bash
+# vim: filetype=sh:
+
+DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" && pwd )"
+cd $DIR
+cd ..
+
+if [ -z "$VIRTUAL_ENV" ]; then
+    . activate
+fi
+
+
+pip install wheel twine
+python setup.py bdist_wheel -d dist
+twine upload -r pypi-internal dist/*

doc/AUTHOR

@@ -1,9 +0,0 @@
-Author can be reached by sending e-mail to <hoxu@users.sf.net>.
-Include "gitstats" in the subject or prepare to battle the spam filters.
-
-See the following command for list of authors who have contributed:
-  $ git shortlog HEAD
-
-Also thanks to the following people:
-Alexander Botero-Lowry
-

doc/GPLv2

@@ -1,339 +0,0 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
- 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Lesser General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-			    NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License along
-    with this program; if not, write to the Free Software Foundation, Inc.,
-    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.

doc/GPLv3

@@ -1,674 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
-  The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works.  By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users.  We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors.  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
-  To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights.  Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received.  You must make sure that they, too, receive
-or can get the source code.  And you must show them these terms so they
-know their rights.
-
-  Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
-  For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software.  For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
-  Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so.  This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software.  The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable.  Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products.  If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
-  Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary.  To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                       TERMS AND CONDITIONS
-
-  0. Definitions.
-
-  "This License" refers to version 3 of the GNU General Public License.
-
-  "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
-  "The Program" refers to any copyrightable work licensed under this
-License.  Each licensee is addressed as "you".  "Licensees" and
-"recipients" may be individuals or organizations.
-
-  To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy.  The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
-  A "covered work" means either the unmodified Program or a work based
-on the Program.
-
-  To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy.  Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
-  To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies.  Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
-  An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License.  If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
-  1. Source Code.
-
-  The "source code" for a work means the preferred form of the work
-for making modifications to it.  "Object code" means any non-source
-form of a work.
-
-  A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
-  The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form.  A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
-  The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities.  However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work.  For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
-  The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
-  The Corresponding Source for a work in source code form is that
-same work.
-
-  2. Basic Permissions.
-
-  All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met.  This License explicitly affirms your unlimited
-permission to run the unmodified Program.  The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work.  This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
-  You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force.  You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright.  Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
-  Conveying under any other circumstances is permitted solely under
-the conditions stated below.  Sublicensing is not allowed; section 10
-makes it unnecessary.
-
-  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
-  No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
-  When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
-  4. Conveying Verbatim Copies.
-
-  You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
-  You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
-  5. Conveying Modified Source Versions.
-
-  You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
-    a) The work must carry prominent notices stating that you modified
-    it, and giving a relevant date.
-
-    b) The work must carry prominent notices stating that it is
-    released under this License and any conditions added under section
-    7.  This requirement modifies the requirement in section 4 to
-    "keep intact all notices".
-
-    c) You must license the entire work, as a whole, under this
-    License to anyone who comes into possession of a copy.  This
-    License will therefore apply, along with any applicable section 7
-    additional terms, to the whole of the work, and all its parts,
-    regardless of how they are packaged.  This License gives no
-    permission to license the work in any other way, but it does not
-    invalidate such permission if you have separately received it.
-
-    d) If the work has interactive user interfaces, each must display
-    Appropriate Legal Notices; however, if the Program has interactive
-    interfaces that do not display Appropriate Legal Notices, your
-    work need not make them do so.
-
-  A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit.  Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
-  6. Conveying Non-Source Forms.
-
-  You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
-    a) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by the
-    Corresponding Source fixed on a durable physical medium
-    customarily used for software interchange.
-
-    b) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by a
-    written offer, valid for at least three years and valid for as
-    long as you offer spare parts or customer support for that product
-    model, to give anyone who possesses the object code either (1) a
-    copy of the Corresponding Source for all the software in the
-    product that is covered by this License, on a durable physical
-    medium customarily used for software interchange, for a price no
-    more than your reasonable cost of physically performing this
-    conveying of source, or (2) access to copy the
-    Corresponding Source from a network server at no charge.
-
-    c) Convey individual copies of the object code with a copy of the
-    written offer to provide the Corresponding Source.  This
-    alternative is allowed only occasionally and noncommercially, and
-    only if you received the object code with such an offer, in accord
-    with subsection 6b.
-
-    d) Convey the object code by offering access from a designated
-    place (gratis or for a charge), and offer equivalent access to the
-    Corresponding Source in the same way through the same place at no
-    further charge.  You need not require recipients to copy the
-    Corresponding Source along with the object code.  If the place to
-    copy the object code is a network server, the Corresponding Source
-    may be on a different server (operated by you or a third party)
-    that supports equivalent copying facilities, provided you maintain
-    clear directions next to the object code saying where to find the
-    Corresponding Source.  Regardless of what server hosts the
-    Corresponding Source, you remain obligated to ensure that it is
-    available for as long as needed to satisfy these requirements.
-
-    e) Convey the object code using peer-to-peer transmission, provided
-    you inform other peers where the object code and Corresponding
-    Source of the work are being offered to the general public at no
-    charge under subsection 6d.
-
-  A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
-  A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling.  In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage.  For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product.  A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
-  "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source.  The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
-  If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information.  But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
-  The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed.  Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
-  Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
-  7. Additional Terms.
-
-  "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law.  If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
-  When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it.  (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.)  You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
-  Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
-    a) Disclaiming warranty or limiting liability differently from the
-    terms of sections 15 and 16 of this License; or
-
-    b) Requiring preservation of specified reasonable legal notices or
-    author attributions in that material or in the Appropriate Legal
-    Notices displayed by works containing it; or
-
-    c) Prohibiting misrepresentation of the origin of that material, or
-    requiring that modified versions of such material be marked in
-    reasonable ways as different from the original version; or
-
-    d) Limiting the use for publicity purposes of names of licensors or
-    authors of the material; or
-
-    e) Declining to grant rights under trademark law for use of some
-    trade names, trademarks, or service marks; or
-
-    f) Requiring indemnification of licensors and authors of that
-    material by anyone who conveys the material (or modified versions of
-    it) with contractual assumptions of liability to the recipient, for
-    any liability that these contractual assumptions directly impose on
-    those licensors and authors.
-
-  All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10.  If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term.  If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
-  If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
-  Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
-  8. Termination.
-
-  You may not propagate or modify a covered work except as expressly
-provided under this License.  Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
-  However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
-  Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
-  Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License.  If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
-  9. Acceptance Not Required for Having Copies.
-
-  You are not required to accept this License in order to receive or
-run a copy of the Program.  Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance.  However,
-nothing other than this License grants you permission to propagate or
-modify any covered work.  These actions infringe copyright if you do
-not accept this License.  Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
-  10. Automatic Licensing of Downstream Recipients.
-
-  Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License.  You are not responsible
-for enforcing compliance by third parties with this License.
-
-  An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations.  If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
-  You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License.  For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
-  11. Patents.
-
-  A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based.  The
-work thus licensed is called the contributor's "contributor version".
-
-  A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version.  For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
-  Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
-  In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement).  To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
-  If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients.  "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
-  If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
-  A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License.  You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
-  Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
-  12. No Surrender of Others' Freedom.
-
-  If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all.  For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
-  13. Use with the GNU Affero General Public License.
-
-  Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work.  The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
-  14. Revised Versions of this License.
-
-  The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-  Each version is given a distinguishing version number.  If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation.  If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
-  If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
-  Later license versions may give you additional or different
-permissions.  However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
-  15. Disclaimer of Warranty.
-
-  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. Limitation of Liability.
-
-  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
-  17. Interpretation of Sections 15 and 16.
-
-  If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.

doc/INSTALL

@@ -1,10 +0,0 @@
-gitstats does not currently need to be installed; it's used right from the
-directory (it also assumes some files like the stylesheet are in .)
-
-Suppose you have a git project at /mnt/src/git/project
-and you want to save the statistics to ~/public_html/project
-
-You would run:
-$ ./gitstats /mnt/src/git/project ~/public_html/project
-(go grab a cup of coffee if it's a large project :)
-$ sensible-browser ~/public_html/project/index.html

doc/LICENSE

@@ -1,4 +0,0 @@
-gitstats license is GPLv2/GPLv3, see doc/GPLv2 and doc/GPLv3 respectively.
-
-sortable.js, contained in gitstats, is licensed under the MIT license. See the
-file itself for details.

doc/README

@@ -1,22 +0,0 @@
-gitstats is a statistics generator for git repositories.  It is mostly intended
-for developers, as a way to check some development statistics for a project.
-
-Currently it produces only HTML output with tables and graphs.
-
-Requirements
-============
-- Python (>= 2.6.0)
-- Git (>= 1.5.2.4)
-- Gnuplot (>= 4.0.0)
-- a git repository (bare clone will work as well)
-
-The above versions are not absolute requirements; older versions may work also.
-
-Recommended
-===========
-- Lots of memory and fast disk for large projects
-
-Contributions
-=============
-Patches should be sent under "GPLv2 or later" license - this will allow
-upgrading to newer GPL versions if they are sensible.

doc/TODO.txt

@@ -1,77 +0,0 @@
-[]
-- cleanup: use defaultdict(int) for counting dicts instead of foo[x] = foo.get(x, 0) + 1
-	- not supported in python 2.4 - do any users use python 2.4?
-	- debian lenny (oldstable) has python 2.5
-- bug: multirepo tags
-	- self.tags contains tags from all repos - WRONG
-
-- general: analysis, ohloh-like?
-	- age: active days / days - high % means active project usually
-	- number of contributors (& their active days)
-
-- https://sourceforge.net/tracker/index.php?func=detail&aid=2865754&group_id=203965&atid=987714
-	- gitstats is a great tool, but the one thing that I miss is the number of
-	SLOC or comments on the "lines of code" image. Could this somehow be
-	added?
-
-[Unsorted]
-- clean up after running gnuplot (option to keep .dat files around?)
-- show raw data in some way (the tables used currently aren't very nice)
-- allow multiple stylesheets
-	- parameter --style
-	- styles/{default,...}.css
-- could show some statistics from last year, month, etc... pisg-like?
-- Commandline options
-	--debug / --verbose
-- save command line settings and use them next run if not overridden?
-
-[Stats]
-- General
-	- Total repository size (slooooow)?
-
-- Activity by Time?
-	- (G?) Last 30 days
-	- (G?) Last 12 months
-	- (T) Hour of Week: percentages / coloring?
-	- (G) Pace of Changes - number of line/other changes happening over time
-
-- Authors
-	- (T) List of authors
-		- Lines
-	- (T) Author of Month
-		- Lines
-	- (T) Author of Year
-		- Lines
-
-- Files
-	- Average revisions per file
-	- (G) Average file size: x = date, y = lines/file
-	- (T) Largest Files?
-	- (T) Files With Most Revisions?
-
-- Lines
-	- Average lines/file
-	- (G) Lines of Code: show tags as vertical lines?
-
-- Tags
-	- Lines
-
-- Author page for each author
-	- Name, mail
-	- Total commits (%)
-	- LOC (%)
-	- Last commit: date
-	- First commit: date
-	- Activity by Clock Time
-		- (G) Hour of Day
-		- (G) Day of Week
-	- (T) Activity in Directories: Directory, Changes, LOC, LOC/change
-	- (Most Recent Commits?)
-	- Author of Month(s):
-	- Author of Year(s):
-
-- Pages for years?
-	- Commits (% of all)
-	- Author top ten
-	- Month statistics
-

doc/gitstats.pod

@@ -1,115 +0,0 @@
-=encoding utf8
-
-=head1 NAME
-
-gitstats - git history statistics generator
-
-=head1 SYNOPSIS
-
-B<gitstats> [options] <repository dir> <output dir>
-
-=head1 DESCRIPTION
-
-B<gitstats> is a statistics generator for L<git(1)> repositories. It examines the repository and produces some interesting statistics from the history of it. Currently HTML is the only output format.
-
-=head1 OPTIONS
-
--c option=value
-
-Override a default configuration value. Defaults can be seen by running B<gitstats> without parameters.
-
-=head2 Values:
-
-=over
-
-=item authors_top
-
-How many top authors to show.
-
-=item commit_begin, commit_end
-
-Specify a commit range to generate statistics from. You can specify only commit_end limit statistics to a certain commit or another branch.
-
-=item linear_linestats
-
-When enabled, the lines of code statistics are collected from linear history.
-The downside is that commits of long feature branches appear only at the point
-where a merge commit is made.
-
-If disabled (old behaviour), the problem is that if two branches contain the
-same changes (for example, removal of same lines), the statistics get skewed.
-
-Defaults to on.
-
-=item max_authors
-
-How many authors to show in the list of authors.
-
-=item max_domains
-
-How many domains to show in domains by commits.
-
-=item max_ext_length
-
-Maximum file extension length.
-
-=item processes
-
-Number of concurrent processes to use when extracting git repository data.
-
-=item project_name
-
-Project name to show on the generated pages. Default is to use basename of the repository directory.
-
-=item start_date
-
-Specify a starting date to pass with --since to git.
-
-=item style
-
-CSS stylesheet to use.
-
-=back
-
-=head1 FAQ
-
-Q: How do I generate statistics of a non-master branch?
-
-A: Use C<-c commit_end=web> parameter.
-
-Q: I have files in my git repository that I would like to exclude from the statistics, how do I do that?
-
-A: At the moment the only way is to use L<git-filter-branch(1)> to create a temporary repository and generate the statistics from that.
-
-Q: How do I merge author information when the same author has made commits using different names or emails ?
-
-A: Use git .mailmap feature described in B<MAPPING AUTHORS> of L<git-shortlog(1)>.
-
-=head1 EXAMPLES
-
-=over
-
-=item Generates statistics from a git repository in C<foo> and outputs the result in a directory C<foo_stats>:
-
-  gitstats foo foo_stats
-
-=item As above, but only analyzes the last 10 commits:
-
-  gitstats -c commit_begin='HEAD~10' foo foo_stats
-
-=back
-
-=head1 AUTHORS
-
-B<gitstats> was written by Heikki Hokkanen and others.
-
-See the git repository at https://github.com/hoxu/gitstats for an up-to-date full list of contributors.
-
-=head1 WWW
-
-http://gitstats.sourceforge.net/
-
-=head1 SEE ALSO
-
-L<git(1)>
-

gitstats.css

@@ -1,145 +0,0 @@
-/**
- * GitStats - default style
- */
-body {
-	color: black;
-	background-color: #dfd;
-}
-
-dt {
-	font-weight: bold;
-	float: left;
-	margin-right: 1em;
-}
-
-dt:after {
-	content: ': ';
-}
-
-dd {
-	display: block;
-	clear: left;
-}
-
-table {
-	border: 1px solid black;
-	border-collapse: collapse;
-	font-size: 80%;
-	margin-bottom: 1em;
-}
-
-table.noborders {
-	border: none;
-}
-
-table.noborders td {
-	border: none;
-}
-
-.vtable {
-	float: right;
-	clear: both;
-}
-
-table.tags td {
-	vertical-align: top;
-}
-
-td {
-	background-color: white;
-}
-
-th {
-	background-color: #ddf;
-}
-
-th a {
-	text-decoration: none;
-}
-
-tr:hover {
-	background-color: #ddf;
-}
-
-td {
-	border: 1px solid black;
-	padding: 0.2em;
-	padding-left: 0.3em;
-	padding-right: 0.2em;
-}
-
-/* Navigation bar; tabbed style */
-.nav {
-	border-bottom: 1px solid black;
-	padding: 0.3em;
-}
-
-.nav ul {
-	list-style-type: none;
-	display: inline;
-	margin: 0;
-	padding: 0;
-}
-
-.nav li {
-	display: inline;
-}
-
-.nav li a {
-	padding: 0.3em;
-	text-decoration: none;
-	color: black;
-	border: 1px solid black;
-	margin: 0.5em;
-	background-color: #ddf;
-}
-
-.nav li a:hover {
-	background-color: #ddd;
-	border-bottom: 1px solid #ddf;
-}
-
-img {
-	border: 1px solid black;
-	padding: 0.5em;
-	background-color: white;
-}
-
-th img {
-	border: 0px;
-	padding: 0px;
-	background-color: #ddf;
-}
-
-h1 a, h2 a {
-	color: black;
-	text-decoration: none;
-}
-
-h1:hover a:after,
-h2:hover a:after {
-	content: '¶';
-	color: #555;
-}
-
-h1 {
-	font-size: x-large;
-}
-
-h2 {
-	background-color: #564;
-	border: 1px solid black;
-	padding-left: 0.5em;
-	padding-right: 0.5em;
-	color: white;
-	font-size: large;
-	clear: both;
-}
-
-h2 a {
-	color: white;
-}
-
-.moreauthors {
-	font-size: 80%;
-}

gitstats/__init__.py

@@ -0,0 +1,7 @@
+from gitstats.git_csv_generator import gen_csv
+from gitstats._version import get_versions
+__version__ = get_versions()['version']
+del get_versions
+
+if __name__ == "__main__":
+    gen_csv()

gitstats/_version.py

@@ -0,0 +1,520 @@
+
+# This file helps to compute a version number in source trees obtained from
+# git-archive tarball (such as those provided by githubs download-from-tag
+# feature). Distribution tarballs (built by setup.py sdist) and build
+# directories (produced by setup.py build) will contain a much shorter file
+# that just contains the computed version number.
+
+# This file is released into the public domain. Generated by
+# versioneer-0.18 (https://github.com/warner/python-versioneer)
+
+"""Git implementation of _version.py."""
+
+import errno
+import os
+import re
+import subprocess
+import sys
+
+
+def get_keywords():
+    """Get the keywords needed to look up the version information."""
+    # these strings will be replaced by git during git-archive.
+    # setup.py/versioneer.py will grep for the variable names, so they must
+    # each be defined on a line of their own. _version.py will just call
+    # get_keywords().
+    git_refnames = "$Format:%d$"
+    git_full = "$Format:%H$"
+    git_date = "$Format:%ci$"
+    keywords = {"refnames": git_refnames, "full": git_full, "date": git_date}
+    return keywords
+
+
+class VersioneerConfig:
+    """Container for Versioneer configuration parameters."""
+
+
+def get_config():
+    """Create, populate and return the VersioneerConfig() object."""
+    # these strings are filled in when 'setup.py versioneer' creates
+    # _version.py
+    cfg = VersioneerConfig()
+    cfg.VCS = "git"
+    cfg.style = "pep440"
+    cfg.tag_prefix = ""
+    cfg.parentdir_prefix = "gitstats-"
+    cfg.versionfile_source = "gitstats/_version.py"
+    cfg.verbose = False
+    return cfg
+
+
+class NotThisMethod(Exception):
+    """Exception raised if a method is not valid for the current scenario."""
+
+
+LONG_VERSION_PY = {}
+HANDLERS = {}
+
+
+def register_vcs_handler(vcs, method):  # decorator
+    """Decorator to mark a method as the handler for a particular VCS."""
+    def decorate(f):
+        """Store f in HANDLERS[vcs][method]."""
+        if vcs not in HANDLERS:
+            HANDLERS[vcs] = {}
+        HANDLERS[vcs][method] = f
+        return f
+    return decorate
+
+
+def run_command(commands, args, cwd=None, verbose=False, hide_stderr=False,
+                env=None):
+    """Call the given command(s)."""
+    assert isinstance(commands, list)
+    p = None
+    for c in commands:
+        try:
+            dispcmd = str([c] + args)
+            # remember shell=False, so use git.cmd on windows, not just git
+            p = subprocess.Popen([c] + args, cwd=cwd, env=env,
+                                 stdout=subprocess.PIPE,
+                                 stderr=(subprocess.PIPE if hide_stderr
+                                         else None))
+            break
+        except EnvironmentError:
+            e = sys.exc_info()[1]
+            if e.errno == errno.ENOENT:
+                continue
+            if verbose:
+                print("unable to run %s" % dispcmd)
+                print(e)
+            return None, None
+    else:
+        if verbose:
+            print("unable to find command, tried %s" % (commands,))
+        return None, None
+    stdout = p.communicate()[0].strip()
+    if sys.version_info[0] >= 3:
+        stdout = stdout.decode()
+    if p.returncode != 0:
+        if verbose:
+            print("unable to run %s (error)" % dispcmd)
+            print("stdout was %s" % stdout)
+        return None, p.returncode
+    return stdout, p.returncode
+
+
+def versions_from_parentdir(parentdir_prefix, root, verbose):
+    """Try to determine the version from the parent directory name.
+
+    Source tarballs conventionally unpack into a directory that includes both
+    the project name and a version string. We will also support searching up
+    two directory levels for an appropriately named parent directory
+    """
+    rootdirs = []
+
+    for i in range(3):
+        dirname = os.path.basename(root)
+        if dirname.startswith(parentdir_prefix):
+            return {"version": dirname[len(parentdir_prefix):],
+                    "full-revisionid": None,
+                    "dirty": False, "error": None, "date": None}
+        else:
+            rootdirs.append(root)
+            root = os.path.dirname(root)  # up a level
+
+    if verbose:
+        print("Tried directories %s but none started with prefix %s" %
+              (str(rootdirs), parentdir_prefix))
+    raise NotThisMethod("rootdir doesn't start with parentdir_prefix")
+
+
+@register_vcs_handler("git", "get_keywords")
+def git_get_keywords(versionfile_abs):
+    """Extract version information from the given file."""
+    # the code embedded in _version.py can just fetch the value of these
+    # keywords. When used from setup.py, we don't want to import _version.py,
+    # so we do it with a regexp instead. This function is not used from
+    # _version.py.
+    keywords = {}
+    try:
+        f = open(versionfile_abs, "r")
+        for line in f.readlines():
+            if line.strip().startswith("git_refnames ="):
+                mo = re.search(r'=\s*"(.*)"', line)
+                if mo:
+                    keywords["refnames"] = mo.group(1)
+            if line.strip().startswith("git_full ="):
+                mo = re.search(r'=\s*"(.*)"', line)
+                if mo:
+                    keywords["full"] = mo.group(1)
+            if line.strip().startswith("git_date ="):
+                mo = re.search(r'=\s*"(.*)"', line)
+                if mo:
+                    keywords["date"] = mo.group(1)
+        f.close()
+    except EnvironmentError:
+        pass
+    return keywords
+
+
+@register_vcs_handler("git", "keywords")
+def git_versions_from_keywords(keywords, tag_prefix, verbose):
+    """Get version information from git keywords."""
+    if not keywords:
+        raise NotThisMethod("no keywords at all, weird")
+    date = keywords.get("date")
+    if date is not None:
+        # git-2.2.0 added "%cI", which expands to an ISO-8601 -compliant
+        # datestamp. However we prefer "%ci" (which expands to an "ISO-8601
+        # -like" string, which we must then edit to make compliant), because
+        # it's been around since git-1.5.3, and it's too difficult to
+        # discover which version we're using, or to work around using an
+        # older one.
+        date = date.strip().replace(" ", "T", 1).replace(" ", "", 1)
+    refnames = keywords["refnames"].strip()
+    if refnames.startswith("$Format"):
+        if verbose:
+            print("keywords are unexpanded, not using")
+        raise NotThisMethod("unexpanded keywords, not a git-archive tarball")
+    refs = set([r.strip() for r in refnames.strip("()").split(",")])
+    # starting in git-1.8.3, tags are listed as "tag: foo-1.0" instead of
+    # just "foo-1.0". If we see a "tag: " prefix, prefer those.
+    TAG = "tag: "
+    tags = set([r[len(TAG):] for r in refs if r.startswith(TAG)])
+    if not tags:
+        # Either we're using git < 1.8.3, or there really are no tags. We use
+        # a heuristic: assume all version tags have a digit. The old git %d
+        # expansion behaves like git log --decorate=short and strips out the
+        # refs/heads/ and refs/tags/ prefixes that would let us distinguish
+        # between branches and tags. By ignoring refnames without digits, we
+        # filter out many common branch names like "release" and
+        # "stabilization", as well as "HEAD" and "master".
+        tags = set([r for r in refs if re.search(r'\d', r)])
+        if verbose:
+            print("discarding '%s', no digits" % ",".join(refs - tags))
+    if verbose:
+        print("likely tags: %s" % ",".join(sorted(tags)))
+    for ref in sorted(tags):
+        # sorting will prefer e.g. "2.0" over "2.0rc1"
+        if ref.startswith(tag_prefix):
+            r = ref[len(tag_prefix):]
+            if verbose:
+                print("picking %s" % r)
+            return {"version": r,
+                    "full-revisionid": keywords["full"].strip(),
+                    "dirty": False, "error": None,
+                    "date": date}
+    # no suitable tags, so version is "0+unknown", but full hex is still there
+    if verbose:
+        print("no suitable tags, using unknown + full revision id")
+    return {"version": "0+unknown",
+            "full-revisionid": keywords["full"].strip(),
+            "dirty": False, "error": "no suitable tags", "date": None}
+
+
+@register_vcs_handler("git", "pieces_from_vcs")
+def git_pieces_from_vcs(tag_prefix, root, verbose, run_command=run_command):
+    """Get version from 'git describe' in the root of the source tree.
+
+    This only gets called if the git-archive 'subst' keywords were *not*
+    expanded, and _version.py hasn't already been rewritten with a short
+    version string, meaning we're inside a checked out source tree.
+    """
+    GITS = ["git"]
+    if sys.platform == "win32":
+        GITS = ["git.cmd", "git.exe"]
+
+    out, rc = run_command(GITS, ["rev-parse", "--git-dir"], cwd=root,
+                          hide_stderr=True)
+    if rc != 0:
+        if verbose:
+            print("Directory %s not under git control" % root)
+        raise NotThisMethod("'git rev-parse --git-dir' returned error")
+
+    # if there is a tag matching tag_prefix, this yields TAG-NUM-gHEX[-dirty]
+    # if there isn't one, this yields HEX[-dirty] (no NUM)
+    describe_out, rc = run_command(GITS, ["describe", "--tags", "--dirty",
+                                          "--always", "--long",
+                                          "--match", "%s*" % tag_prefix],
+                                   cwd=root)
+    # --long was added in git-1.5.5
+    if describe_out is None:
+        raise NotThisMethod("'git describe' failed")
+    describe_out = describe_out.strip()
+    full_out, rc = run_command(GITS, ["rev-parse", "HEAD"], cwd=root)
+    if full_out is None:
+        raise NotThisMethod("'git rev-parse' failed")
+    full_out = full_out.strip()
+
+    pieces = {}
+    pieces["long"] = full_out
+    pieces["short"] = full_out[:7]  # maybe improved later
+    pieces["error"] = None
+
+    # parse describe_out. It will be like TAG-NUM-gHEX[-dirty] or HEX[-dirty]
+    # TAG might have hyphens.
+    git_describe = describe_out
+
+    # look for -dirty suffix
+    dirty = git_describe.endswith("-dirty")
+    pieces["dirty"] = dirty
+    if dirty:
+        git_describe = git_describe[:git_describe.rindex("-dirty")]
+
+    # now we have TAG-NUM-gHEX or HEX
+
+    if "-" in git_describe:
+        # TAG-NUM-gHEX
+        mo = re.search(r'^(.+)-(\d+)-g([0-9a-f]+)$', git_describe)
+        if not mo:
+            # unparseable. Maybe git-describe is misbehaving?
+            pieces["error"] = ("unable to parse git-describe output: '%s'"
+                               % describe_out)
+            return pieces
+
+        # tag
+        full_tag = mo.group(1)
+        if not full_tag.startswith(tag_prefix):
+            if verbose:
+                fmt = "tag '%s' doesn't start with prefix '%s'"
+                print(fmt % (full_tag, tag_prefix))
+            pieces["error"] = ("tag '%s' doesn't start with prefix '%s'"
+                               % (full_tag, tag_prefix))
+            return pieces
+        pieces["closest-tag"] = full_tag[len(tag_prefix):]
+
+        # distance: number of commits since tag
+        pieces["distance"] = int(mo.group(2))
+
+        # commit: short hex revision ID
+        pieces["short"] = mo.group(3)
+
+    else:
+        # HEX: no tags
+        pieces["closest-tag"] = None
+        count_out, rc = run_command(GITS, ["rev-list", "HEAD", "--count"],
+                                    cwd=root)
+        pieces["distance"] = int(count_out)  # total number of commits
+
+    # commit date: see ISO-8601 comment in git_versions_from_keywords()
+    date = run_command(GITS, ["show", "-s", "--format=%ci", "HEAD"],
+                       cwd=root)[0].strip()
+    pieces["date"] = date.strip().replace(" ", "T", 1).replace(" ", "", 1)
+
+    return pieces
+
+
+def plus_or_dot(pieces):
+    """Return a + if we don't already have one, else return a ."""
+    if "+" in pieces.get("closest-tag", ""):
+        return "."
+    return "+"
+
+
+def render_pep440(pieces):
+    """Build up version string, with post-release "local version identifier".
+
+    Our goal: TAG[+DISTANCE.gHEX[.dirty]] . Note that if you
+    get a tagged build and then dirty it, you'll get TAG+0.gHEX.dirty
+
+    Exceptions:
+    1: no tags. git_describe was just HEX. 0+untagged.DISTANCE.gHEX[.dirty]
+    """
+    if pieces["closest-tag"]:
+        rendered = pieces["closest-tag"]
+        if pieces["distance"] or pieces["dirty"]:
+            rendered += plus_or_dot(pieces)
+            rendered += "%d.g%s" % (pieces["distance"], pieces["short"])
+            if pieces["dirty"]:
+                rendered += ".dirty"
+    else:
+        # exception #1
+        rendered = "0+untagged.%d.g%s" % (pieces["distance"],
+                                          pieces["short"])
+        if pieces["dirty"]:
+            rendered += ".dirty"
+    return rendered
+
+
+def render_pep440_pre(pieces):
+    """TAG[.post.devDISTANCE] -- No -dirty.
+
+    Exceptions:
+    1: no tags. 0.post.devDISTANCE
+    """
+    if pieces["closest-tag"]:
+        rendered = pieces["closest-tag"]
+        if pieces["distance"]:
+            rendered += ".post.dev%d" % pieces["distance"]
+    else:
+        # exception #1
+        rendered = "0.post.dev%d" % pieces["distance"]
+    return rendered
+
+
+def render_pep440_post(pieces):
+    """TAG[.postDISTANCE[.dev0]+gHEX] .
+
+    The ".dev0" means dirty. Note that .dev0 sorts backwards
+    (a dirty tree will appear "older" than the corresponding clean one),
+    but you shouldn't be releasing software with -dirty anyways.
+
+    Exceptions:
+    1: no tags. 0.postDISTANCE[.dev0]
+    """
+    if pieces["closest-tag"]:
+        rendered = pieces["closest-tag"]
+        if pieces["distance"] or pieces["dirty"]:
+            rendered += ".post%d" % pieces["distance"]
+            if pieces["dirty"]:
+                rendered += ".dev0"
+            rendered += plus_or_dot(pieces)
+            rendered += "g%s" % pieces["short"]
+    else:
+        # exception #1
+        rendered = "0.post%d" % pieces["distance"]
+        if pieces["dirty"]:
+            rendered += ".dev0"
+        rendered += "+g%s" % pieces["short"]
+    return rendered
+
+
+def render_pep440_old(pieces):
+    """TAG[.postDISTANCE[.dev0]] .
+
+    The ".dev0" means dirty.
+
+    Eexceptions:
+    1: no tags. 0.postDISTANCE[.dev0]
+    """
+    if pieces["closest-tag"]:
+        rendered = pieces["closest-tag"]
+        if pieces["distance"] or pieces["dirty"]:
+            rendered += ".post%d" % pieces["distance"]
+            if pieces["dirty"]:
+                rendered += ".dev0"
+    else:
+        # exception #1
+        rendered = "0.post%d" % pieces["distance"]
+        if pieces["dirty"]:
+            rendered += ".dev0"
+    return rendered
+
+
+def render_git_describe(pieces):
+    """TAG[-DISTANCE-gHEX][-dirty].
+
+    Like 'git describe --tags --dirty --always'.
+
+    Exceptions:
+    1: no tags. HEX[-dirty]  (note: no 'g' prefix)
+    """
+    if pieces["closest-tag"]:
+        rendered = pieces["closest-tag"]
+        if pieces["distance"]:
+            rendered += "-%d-g%s" % (pieces["distance"], pieces["short"])
+    else:
+        # exception #1
+        rendered = pieces["short"]
+    if pieces["dirty"]:
+        rendered += "-dirty"
+    return rendered
+
+
+def render_git_describe_long(pieces):
+    """TAG-DISTANCE-gHEX[-dirty].
+
+    Like 'git describe --tags --dirty --always -long'.
+    The distance/hash is unconditional.
+
+    Exceptions:
+    1: no tags. HEX[-dirty]  (note: no 'g' prefix)
+    """
+    if pieces["closest-tag"]:
+        rendered = pieces["closest-tag"]
+        rendered += "-%d-g%s" % (pieces["distance"], pieces["short"])
+    else:
+        # exception #1
+        rendered = pieces["short"]
+    if pieces["dirty"]:
+        rendered += "-dirty"
+    return rendered
+
+
+def render(pieces, style):
+    """Render the given version pieces into the requested style."""
+    if pieces["error"]:
+        return {"version": "unknown",
+                "full-revisionid": pieces.get("long"),
+                "dirty": None,
+                "error": pieces["error"],
+                "date": None}
+
+    if not style or style == "default":
+        style = "pep440"  # the default
+
+    if style == "pep440":
+        rendered = render_pep440(pieces)
+    elif style == "pep440-pre":
+        rendered = render_pep440_pre(pieces)
+    elif style == "pep440-post":
+        rendered = render_pep440_post(pieces)
+    elif style == "pep440-old":
+        rendered = render_pep440_old(pieces)
+    elif style == "git-describe":
+        rendered = render_git_describe(pieces)
+    elif style == "git-describe-long":
+        rendered = render_git_describe_long(pieces)
+    else:
+        raise ValueError("unknown style '%s'" % style)
+
+    return {"version": rendered, "full-revisionid": pieces["long"],
+            "dirty": pieces["dirty"], "error": None,
+            "date": pieces.get("date")}
+
+
+def get_versions():
+    """Get version information or return default if unable to do so."""
+    # I am in _version.py, which lives at ROOT/VERSIONFILE_SOURCE. If we have
+    # __file__, we can work backwards from there to the root. Some
+    # py2exe/bbfreeze/non-CPython implementations don't do __file__, in which
+    # case we can only use expanded keywords.
+
+    cfg = get_config()
+    verbose = cfg.verbose
+
+    try:
+        return git_versions_from_keywords(get_keywords(), cfg.tag_prefix,
+                                          verbose)
+    except NotThisMethod:
+        pass
+
+    try:
+        root = os.path.realpath(__file__)
+        # versionfile_source is the relative path from the top of the source
+        # tree (where the .git directory might live) to this file. Invert
+        # this to find the root from __file__.
+        for i in cfg.versionfile_source.split('/'):
+            root = os.path.dirname(root)
+    except NameError:
+        return {"version": "0+unknown", "full-revisionid": None,
+                "dirty": None,
+                "error": "unable to find root of source tree",
+                "date": None}
+
+    try:
+        pieces = git_pieces_from_vcs(cfg.tag_prefix, root, verbose)
+        return render(pieces, cfg.style)
+    except NotThisMethod:
+        pass
+
+    try:
+        if cfg.parentdir_prefix:
+            return versions_from_parentdir(cfg.parentdir_prefix, root, verbose)
+    except NotThisMethod:
+        pass
+
+    return {"version": "0+unknown", "full-revisionid": None,
+            "dirty": None,
+            "error": "unable to compute version", "date": None}

gitstats/cd.py

@@ -0,0 +1,16 @@
+"""Holds the current working directory context class. A python version of pushd/popd"""
+import os
+
+# pylint: disable=too-few-public-methods
+class cd: # pylint: disable=invalid-name
+    """Context manager for changing the current working directory"""
+    def __init__(self, newPath):
+        self.new_path = os.path.expanduser(newPath)
+        self.saved_path = os.getcwd()
+
+    def __enter__(self):
+        self.saved_path = os.getcwd()
+        os.chdir(self.new_path)
+
+    def __exit__(self, etype, value, traceback):
+        os.chdir(self.saved_path)

gitstats/cli.py

@@ -0,0 +1,74 @@
+import getopt
+import logging
+import os
+import sys
+
+from datetime import datetime, timezone
+
+conf = {
+    'max_domains': 10,
+    'max_ext_length': 10,
+    'style': 'gitstats.css',
+    'max_authors': 20,
+    'authors_top': 5,
+    'commit_begin': '',
+    'commit_end': 'HEAD',
+    'linear_linestats': 1,
+    'project_name': '',
+    'processes': 8,
+    'start_date': '',
+    'end_date': '',
+    'logging': logging.INFO,
+    'resrouce_file_pattern': '**/resources/**/*',
+}
+
+
+def _usage():
+    print(f"""
+Usage: gitstats [options] <gitpath..> <outputpath>
+
+Options:
+-c key=value     Override configuration value
+
+Default config values:
+{conf}
+
+Please see the manual page for more details.
+""")
+
+
+def get_cli():
+    optlist, args = getopt.getopt(sys.argv[1:], 'hc:', ["help"])
+    for o, v in optlist:
+        if o == '-c':
+            key, value = v.split('=', 1)
+            if key not in conf:
+                raise KeyError('no such key "%s" in config' % key)
+            if isinstance(conf[key], int):
+                conf[key] = int(value)
+            else:
+                conf[key] = value
+        elif o in ('-h', '--help'):
+            _usage()
+            sys.exit()
+
+    if len(args) < 2:
+        _usage()
+        sys.exit(0)
+
+    outputpath = os.path.abspath(args[-1])
+    paths = args[0:-1]
+    outputpath = os.path.abspath(outputpath)
+
+    return conf, paths, outputpath
+
+def get_begin_end_timestamps(conf):
+    if 'start_date' in conf and conf['start_date']:
+        begin = int(datetime.strptime(conf['start_date'], '%Y-%m-%d').replace(tzinfo=timezone.utc).timestamp())
+    else:
+        begin = 0
+    if 'end_date' in conf and conf['end_date']:
+        end = int(datetime.strptime(conf['end_date'], '%Y-%m-%d').replace(tzinfo=timezone.utc).timestamp())
+    else:
+        end = 99999999999
+    return begin, end

gitstats/data/__init__.py

@@ -0,0 +1,4 @@
+from .revision import Revision
+from .pr import PullRequest
+from .file_info import FileInfo
+from .revision_graph import RevisionGraph

gitstats/data/file_info.py

@@ -0,0 +1,25 @@
+from dataclasses import dataclass
+
+@dataclass
+class FileInfo:
+    language: str
+    file_count: int
+    line_count: int
+    code_line_count: int
+    comment_line_count: int
+    blank_line_count: int
+
+    def __post_init__(self):
+        self.file_count = int(self.file_count)
+        self.line_count = int(self.line_count)
+        self.code_line_count = int(self.code_line_count)
+        self.comment_line_count = int(self.comment_line_count)
+        self.blank_line_count = int(self.blank_line_count)
+
+    def __sub__(self, other: 'FileInfo') -> 'FileInfo':
+        return FileInfo(self.language,
+                        self.file_count - other.file_count,
+                        self.line_count - other.line_count,
+                        self.code_line_count - other.code_line_count,
+                        self.comment_line_count - other.comment_line_count,
+                        self.blank_line_count - other.blank_line_count)

gitstats/data/pr.py

@@ -0,0 +1,15 @@
+from datetime import timedelta
+from dataclasses import dataclass
+from typing import List
+
+@dataclass
+class PullRequest:
+    stamp: int
+    hash: str
+    author: str
+    parent_hashes: List[str]
+    branch_rev: str = None
+    master_rev: str = None
+    duration: timedelta = None
+    invalid_pr: bool = False
+

gitstats/data/revision.py

@@ -0,0 +1,19 @@
+from dataclasses import dataclass, field
+from .file_info import FileInfo
+from typing import Dict
+
+@dataclass
+class Revision:
+    hash: str
+    stamp: int
+    timezone: int = 0
+    author: str = ''
+    email: str = ''
+    domain: str = ''
+    comments: str = ''
+    master_pr: int = 0
+    branch_parent: str = ''
+    master_parent: str = ''
+    file_infos: Dict[str, FileInfo] = field(default_factory=lambda: {})
+    delta: Dict[str, FileInfo] = field(default_factory=lambda: {})
+    valid_pr: bool = True

gitstats/data/revision_graph.py

@@ -0,0 +1,17 @@
+from dataclasses import dataclass
+from typing import Dict, List, Set
+from gitstats.data.revision import Revision
+
+@dataclass
+class RevisionGraph:
+    revisions: Dict[str, Revision]
+    master_revs: Set[str]
+    linkage: Dict[str, List[str]]
+
+    def add_revision_to_graph(self, revision: Revision, parents: List[str], is_master: bool=False):
+        if not revision.hash in self.revisions:
+            self.revisions[revision.hash] = revision
+        if not revision.hash in self.linkage:
+            self.linkage[revision.hash] = parents
+        if revision.master_pr or is_master:
+            self.master_revs.add(revision.hash)

gitstats/data_generators/__init__.py

@@ -0,0 +1,3 @@
+from .gen_pr_data import gen_pr_data
+from .gen_revision_graph import gen_revision_graph
+from .gen_complete_file_info import gen_complete_file_info

gitstats/data_generators/gen_complete_file_info.py

@@ -0,0 +1,76 @@
+import csv
+import os
+
+from gitstats import cli, cd
+from gitstats.miscfuncs import getpipeoutput
+from gitstats.data import FileInfo, Revision, RevisionGraph
+from gitstats.data_generators import gen_revision_graph
+
+
+def gen_complete_file_info(graph: RevisionGraph):
+    '''
+    Given a dictionary of revisions on the master branch, collect all file info
+    using tokei for that revision
+
+    :param: master_rev - a dictionary of commit hash to Revision object for revisions on the master branch
+
+    :return: None. As a side effect, compliete file info by language type will be added to all
+    revisions in master_rev
+    '''
+
+    # use tokei to gather detailed file info for each revision on master
+    for revision in graph.master_revs:
+        getpipeoutput([f'git checkout {revision}'])
+        # for some reason if we combine these, tokei gives incorrect results!!!!
+        lines = getpipeoutput(['tokei']).split('\n')
+        for line in lines[3:-3] + [lines[-2]]:
+            line = line.strip()
+            file_info = FileInfo(*line.rsplit(maxsplit=5))
+            graph.revisions[revision].file_infos[file_info.language] = file_info
+
+    getpipeoutput(['git checkout master'])
+
+    # run through master revisions and calculate delta with previous master revision
+    for revision in graph.master_revs:
+        master_parent = graph.revisions[revision].master_parent
+        if master_parent in graph.master_revs:
+            current = graph.revisions[revision].file_infos
+            previous = graph.revisions[master_parent].file_infos
+            for lang, cur_file_info in current.items():
+                if lang in previous:
+                    graph.revisions[revision].delta[lang] = cur_file_info - previous[lang]
+                else:
+                    graph.revisions[revision].delta[lang] = cur_file_info
+
+
+if __name__ == "__main__":
+    conf, paths, outputpath = cli.get_cli()
+
+    with open(outputpath, 'w', encoding='utf8') as f:
+        writer = csv.writer(f)
+        writer.writerow(['repo', 'hash', 'stamp', 'author', 'language', 'files', 'lines', 'code', 'comments', 'blanks'])
+
+        for path in paths:
+            repo_name = os.path.split(path)[1]
+            with (cd.cd(path)):
+                graph = gen_revision_graph()
+                gen_complete_file_info(graph)
+
+                for rev in graph.master_revs:
+                    revision: Revision = graph.revisions[rev]
+                    for lang, file_info in revision.delta.items():
+                        if file_info.file_count or \
+                                file_info.line_count or \
+                                file_info.code_line_count or \
+                                file_info.comment_line_count or \
+                                file_info.blank_line_count:
+                            writer.writerow([repo_name,
+                                             revision.hash,
+                                             revision.stamp,
+                                             graph.revisions[revision.branch_parent].author,
+                                             lang,
+                                             file_info.file_count,
+                                             file_info.line_count,
+                                             file_info.code_line_count,
+                                             file_info.comment_line_count,
+                                             file_info.blank_line_count])

gitstats/data_generators/gen_pr_data.py

@@ -0,0 +1,52 @@
+import csv
+import logging
+import os
+
+from datetime import datetime
+
+from gitstats import cli, cd
+from gitstats.data import Revision, PullRequest, RevisionGraph
+from gitstats.data_generators import gen_revision_graph
+
+
+def gen_pr_data(row_processor, graph: RevisionGraph):
+    '''
+    Given a configuration, pull revision information. For
+    each author, callback to the row_processor passing an PullRequest
+
+    As a side effect, every revision in the master_rev dictionary will be updated
+    with it's branch_parent and master_parent
+
+    :param row_processor: function to receive the callback
+    :return: None
+    '''
+
+    for rev in graph.master_revs:
+        revision = graph.revisions[rev]
+        if revision.valid_pr and revision.branch_parent in graph.revisions:
+            branch_rev: Revision = graph.revisions[revision.branch_parent]
+            delta = datetime.utcfromtimestamp(revision.stamp) - datetime.utcfromtimestamp(branch_rev.stamp)
+            if delta.total_seconds() < 0:
+                logging.warning(f"Unexpected. Negative duration: {rev}")
+                revision.valid_pr = False
+            else:
+                row_processor(PullRequest(revision.stamp, revision.hash, revision.author,
+                                          graph.linkage[rev], revision.branch_parent, rev, delta))
+
+
+if __name__ == "__main__":
+    conf, paths, outputpath = cli.get_cli()
+    begin, end = cli.get_begin_end_timestamps(conf)
+    with open(outputpath, 'w', encoding='utf8') as f:
+        writer = csv.writer(f)
+        writer.writerow(['repo', 'hash', 'stamp', 'masterRev', 'branchRev', 'prMergeDuration', 'prMergeDurationHr'])
+
+        for path in paths:
+            repo_name = os.path.split(path)[1]
+            with (cd.cd(path)):
+                graph = gen_revision_graph()
+
+                def row_processor(row: PullRequest):
+                    if row.stamp >= begin and row.stamp <= end:
+                        writer.writerow([repo_name, row.hash, row.stamp, row.master_rev, row.branch_rev, row.duration.total_seconds(), row.duration])
+                gen_pr_data(row_processor, graph)

gitstats/data_generators/gen_revision_graph.py

@@ -0,0 +1,114 @@
+import logging
+import os
+import re
+
+from typing import Dict
+from gitstats import cli, cd
+from gitstats.miscfuncs import getpipeoutput
+from gitstats.data import Revision, RevisionGraph
+
+
+def gen_revision_graph() -> RevisionGraph:
+    '''
+    Given beginning and ending time stamp, get all revisions from the repo within that range,
+    key them by tree_hash, commit_hash as well as create a graph of revisions and a list
+    of revisions merging to master
+
+    :return: RevisionGraph
+    '''
+
+    # this match string for PRs merged to master is particular to BitBucket
+    # probably should come from configuration
+    prog = re.compile(r'Merge pull request #([0-9]*) in.*to master')
+
+    graph = RevisionGraph({}, set(), {})
+
+    lines = getpipeoutput(
+        [f'git rev-list --pretty="%T|%H|%at|%ai|%aN|%aE|%P|%s" "HEAD"',
+         'grep -v ^commit']).split('\n')
+    for line in lines:
+        line = line.strip()
+        if line:
+            graph.add_revision_to_graph(*get_revision_from_line(line, prog))
+
+    new_masters = set()
+    for rev in graph.master_revs:
+        parents = graph.linkage[rev]
+        revision: Revision = graph.revisions[rev]
+        for parent in parents:
+            if parent in graph.master_revs:
+                if revision.master_parent:
+                    logging.warning(f"{rev} has multiple master parents")
+                    revision.valid_pr = False
+                revision.master_parent = parent
+            else:
+                if revision.branch_parent:
+                    if not revision.master_parent:
+                        # we likely have a merge into master in a branch that didn't use
+                        # bitbucket conventions... arbitrarily choose the oldest parent
+                        # revision as the master branch (we could back chain both and find
+                        # which branch exists in the ancestry of the other, but for now,
+                        # this will suffice
+                        if graph.revisions[parent].stamp < graph.revisions[revision.branch_parent].stamp:
+                            revision.master_parent = parent
+                            new_masters.add(parent)
+                        else:
+                            revision.master_parent = revision.branch_parent
+                            new_masters.add(revision.branch_parent)
+                            revision.branch_parent = parent
+                    else:
+                        logging.warning(f"{rev} has multiple branch parents")
+                        revision.valid_pr = False
+                else:
+                    revision.branch_parent = parent
+    graph.master_revs.update(new_masters)
+
+    # validate masters based on git log --first-parent
+    lines = getpipeoutput(
+        ['git log --first-parent --pretty="%T|%H|%at|%ai|%aN|%aE|%P|%s"',
+         'grep -v ^commit']).split('\n')
+    for line in lines:
+        line = line.strip()
+        if line:
+            graph.add_revision_to_graph(*get_revision_from_line(line, prog), is_master=True)
+
+    # update master branch as appropriate
+    for rev in graph.master_revs:
+        if not graph.revisions[rev].master_parent:
+            parents = graph.linkage[rev]
+            if len(parents) == 1 and parents[0]:
+                graph.revisions[rev].master_parent = parents[0]
+            else:
+                if parents[0]:
+                    logging.warning(f"{rev} has no master parent info. {parents}")
+
+    return graph
+
+
+def get_revision_from_line(line, prog):
+    tree_hash, sha, stamp, time, author, mail, parents, comments = line.split('|', 7)
+    try:
+        stamp = int(stamp)
+    except ValueError:
+        stamp = 0
+    timezone = time.split(' ')[2]
+    domain = '?'
+    if mail.find('@') != -1:
+        domain = mail.rsplit('@', 1)[1]
+    parents = parents.split(' ')
+    revision = Revision(sha, stamp, timezone, author, mail, domain, comments)
+    match = prog.search(comments)
+    if match:
+        revision.master_pr = int(match.group(1))
+    return revision, parents
+
+
+if __name__ == "__main__":
+    conf, paths, outputpath = cli.get_cli()
+    graphs: Dict[str, RevisionGraph] = {}
+    for path in paths:
+        repo_name = os.path.split(path)[1]
+        with (cd.cd(path)):
+            graphs[repo_name] = gen_revision_graph()
+    for k, v in graphs.items():
+        print(f"{k}: {len(v.revisions)} revisions, {len(v.master_revs)} revisions on master")

gitstats/git_csv_generator.py

@@ -0,0 +1,214 @@
+#! /usr/bin/env python3
+import csv
+import logging
+import os
+import sys
+
+import multiprocessing_logging
+
+from collections import defaultdict
+
+from gitstats.cd import cd
+
+from gitstats import cli
+from gitstats.data import PullRequest, Revision
+from gitstats.data_generators import gen_pr_data, gen_revision_graph, gen_complete_file_info
+
+exectime_internal = 0.0
+exectime_external = 0.0
+
+
+class _FileHandles:
+    def __init__(self, output_dir):
+        self.author_totals_info = open(os.path.join(output_dir, 'author_totals.csv'), 'w', encoding='utf8')
+        self.author_totals_info_writer = csv.writer(self.author_totals_info)
+        self.author_totals_info_writer.writerow(["Repo", "Author", "Commits"])
+
+        self.revision_info = open(os.path.join(output_dir, 'revs.csv'), 'w', encoding='utf8')
+        self.revision_info_writer = csv.writer(self.revision_info)
+        self.revision_info_writer.writerow(['Repo', 'CommitHash', 'TimeStamp', 'TimeZone', 'Author', 'AuthorEmail',
+                                            'Domain'])
+
+        self.loc_info = open(os.path.join(output_dir, 'loc.csv'), 'w', encoding='utf8')
+        self.loc_info_writer = csv.writer(self.loc_info)
+        self.loc_info_writer.writerow(['Repo', 'CommitHash', 'TimeStamp', 'Language', 'Files', 'Lines', 'Code',
+                                       'Comments', 'Blanks'])
+
+        self.loc_delta = open(os.path.join(output_dir, 'loc_delta.csv'), 'w', encoding='utf8')
+        self.loc_delta_writer = csv.writer(self.loc_delta)
+        self.loc_delta_writer.writerow(['Repo', 'CommitHash', 'TimeStamp', 'Author', 'Language', 'Files', 'Lines',
+                                        'Code', 'Comments', 'Blanks'])
+
+        self.repo_info = open(os.path.join(output_dir, 'repo.csv'), 'w', encoding='utf8')
+        self.repo_info_writer = csv.writer(self.repo_info)
+        self.repo_info_writer.writerow(['Repo', 'Language', 'Files', 'Lines',
+                                        'Code', 'Comments', 'Blanks'])
+
+        self.prs_info = open(os.path.join(output_dir, 'prs.csv'), 'w', encoding='utf8')
+        self.prs_info_writer = csv.writer(self.prs_info)
+        self.prs_info_writer.writerow(['Repo', 'CommitHash', 'TimeStamp', 'ParentHashMaster', 'ParentHashBranch',
+                                       'PrMergeDuration'])
+
+    def close(self):
+        self.author_totals_info.close()
+        self.revision_info.close()
+        self.loc_info.close()
+        self.loc_delta.close()
+        self.repo_info.close()
+        self.prs_info.close()
+
+class GitCsvGenerator():
+    def __init__(self, conf, output_dir):
+        self.conf = conf
+        self.files: _FileHandles = None
+        self.output_dir = output_dir
+        self.begin, self.end = cli.get_begin_end_timestamps(conf)
+
+    def __enter__(self):
+        self.files = _FileHandles(self.output_dir)
+
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        self.files.close()
+
+    def collect(self, dir):
+
+        with cd(dir):
+            if len(self.conf['project_name']) == 0:
+                self.projectname = os.path.basename(os.path.abspath(dir))
+            else:
+                self.projectname = self.conf['project_name']
+
+            graph = gen_revision_graph()
+            gen_complete_file_info(graph)
+
+            self.extract_total_authors(graph)
+            self.extract_pr_info(graph)
+            self.extract_code_info(graph)
+            self.extract_revision_info(graph)
+            # self.get_revision_info(graph)
+            # self.get_tags()
+            # self.get_file_info()
+            # self.get_loc_info()
+            # self.get_author_info()
+
+    def extract_total_authors(self, graph):
+        logging.info(f"Getting author totals for {self.projectname}")
+
+        authors = defaultdict(int)
+        for rev in graph.revisions.values():
+            # don't include merge to master as a commit in counting total author
+            # commits.
+            if rev.stamp >= self.begin and rev.stamp <= self.end and rev.master_pr == 0:
+                authors[rev.author] += 1
+
+        for author, total_commits in authors.items():
+            self.files.author_totals_info_writer.writerow([self.projectname, author, total_commits])
+
+    def extract_pr_info(self, graph):
+        logging.info(f"Getting pull request info for {self.projectname}")
+        def row_processor(row: PullRequest):
+            if row.stamp >= self.begin and row.stamp <= self.end:
+                self.files.prs_info_writer.writerow([self.projectname, row.hash, row.stamp, row.master_rev,
+                                                        row.branch_rev, row.duration.total_seconds()])
+        gen_pr_data(row_processor, graph)
+
+    def extract_code_info(self, graph):
+        rev_max: Revision = None
+        for rev in graph.master_revs:
+            revision: Revision = graph.revisions[rev]
+            if not rev_max or revision.stamp > rev_max.stamp:
+                rev_max = revision
+            if revision.stamp >= self.begin and revision.stamp <= self.end:
+                for lang, file_info in revision.delta.items():
+                        if file_info.file_count or \
+                                file_info.line_count or \
+                                file_info.code_line_count or \
+                                file_info.comment_line_count or \
+                                file_info.blank_line_count:
+
+                            if revision.branch_parent in graph.revisions:
+                                parent = revision.branch_parent
+                            else:
+                                parent = revision.master_parent
+                            if parent:
+                                self.files.loc_delta_writer.writerow([self.projectname,
+                                                 revision.hash,
+                                                 revision.stamp,
+                                                 graph.revisions[parent].author,
+                                                 lang,
+                                                 file_info.file_count,
+                                                 file_info.line_count,
+                                                 file_info.code_line_count,
+                                                 file_info.comment_line_count,
+                                                 file_info.blank_line_count])
+                for lang, file_info in revision.file_infos.items():
+                        if file_info.file_count or \
+                                file_info.line_count or \
+                                file_info.code_line_count or \
+                                file_info.comment_line_count or \
+                                file_info.blank_line_count:
+                            self.files.loc_info_writer.writerow([self.projectname,
+                                             revision.hash,
+                                             revision.stamp,
+                                             lang,
+                                             file_info.file_count,
+                                             file_info.line_count,
+                                             file_info.code_line_count,
+                                             file_info.comment_line_count,
+                                             file_info.blank_line_count])
+
+        for file_info in rev_max.file_infos.values():
+            self.files.repo_info_writer.writerow([self.projectname,
+                                                  file_info.language,
+                                                  file_info.file_count,
+                                                  file_info.line_count,
+                                                  file_info.code_line_count,
+                                                  file_info.comment_line_count,
+                                                  file_info.blank_line_count])
+
+    def extract_revision_info(self, graph):
+        for revision in graph.revisions.values():
+            if revision.stamp >= self.begin and revision.stamp <= self.end:
+                self.files.revision_info_writer.writerow([self.projectname,
+                                                          revision.hash,
+                                                          revision.stamp,
+                                                          revision.timezone,
+                                                          revision.author,
+                                                          revision.email,
+                                                          revision.domain])
+
+def gen_csv():
+    conf, paths, outputpath = cli.get_cli()
+
+    for path in paths:
+        if not os.path.isdir(path):
+            logging.fatal(f'Input path {path} does not exist')
+            sys.exit(1)
+
+    logging.basicConfig(level=conf['logging'], format='%(message)s')
+    multiprocessing_logging.install_mp_handler()
+    try:
+        os.makedirs(outputpath)
+    except OSError:
+        pass
+    if not os.path.isdir(outputpath):
+        logging.fatal('Output path is not a directory or does not exist')
+        sys.exit(1)
+
+    logging.info(f'Output path: {outputpath}')
+
+    data = GitCsvGenerator(conf, outputpath)
+    with data:
+        for gitpath in paths:
+            logging.info(f'Git path: {gitpath}')
+
+            prevdir = os.getcwd()
+            os.chdir(gitpath)
+
+            logging.info('Collecting data...')
+            data.collect(gitpath)
+
+            os.chdir(prevdir)
+
+if __name__ == '__main__':
+    gen_csv()

gitstats/miscfuncs.py

@@ -0,0 +1,17 @@
+import logging
+import subprocess
+import time
+
+def getpipeoutput(cmds):
+    start = time.time()
+    p = subprocess.Popen(cmds[0], stdout=subprocess.PIPE, shell=True)
+    processes = [p]
+    for x in cmds[1:]:
+        p = subprocess.Popen(x, stdin=p.stdout, stdout=subprocess.PIPE, shell=True)
+        processes.append(p)
+    output = p.communicate()[0].decode('utf-8')
+    for p in processes:
+        p.wait()
+    end = time.time()
+    logging.info(f'\r[{end - start:.4f}] >> {" | ".join(cmds)}')
+    return output.rstrip('\n')

setup.cfg

@@ -0,0 +1,13 @@
+
+# See the docstring in versioneer.py for instructions. Note that you must
+# re-run 'versioneer.py setup' after changing this section, and commit the
+# resulting files.
+
+[versioneer]
+VCS = git
+style = pep440
+versionfile_source = gitstats/_version.py
+versionfile_build = gitstats/_version.py
+tag_prefix =
+parentdir_prefix = gitstats-
+

setup.py

@@ -0,0 +1,61 @@
+import versioneer
+from setuptools import setup, find_packages
+
+setup(
+    name='gitstats',
+    version=versioneer.get_version(),
+    cmdclass=versioneer.get_cmdclass(),
+    description='gitstats',
+    long_description='Statistics for Git Repo',
+    url='',
+
+    author='rappdw',
+    author_email='rappdw@gmail.com',
+
+    license='MIT',
+    keywords='library',
+
+    classifiers=[
+        'Development Status :: 3 - Alpha',
+        'Intended Audience :: Developers',
+        # Set this topic to what works for you
+        'Topic :: Python :: Library',
+        # Pick your license as you wish (should match "license" above)
+        'License :: MIT',
+        'Programming Language :: Python :: 3.5',
+    ],
+
+    packages=find_packages(exclude=['contrib', 'docs', 'tests']),
+    include_package_data=True,
+
+    # Alternatively, if you want to distribute just a my_module.py, uncomment
+    # this:
+    #   py_modules=["my_module"],
+
+    setup_requires=[
+        # Setuptools 18.0 properly handles Cython extensions.
+        'setuptools>=18.0'
+    ],
+    install_requires=[
+        'dataclasses',
+        'multiprocessing_logging'
+    ],
+
+    extras_require={
+        'dev': [
+            'wheel>=0.30.0'
+        ],
+        'test': [
+        ],
+    },
+
+    package_data={
+        # 'sample': ['package_data.dat'],
+    },
+
+    entry_points={
+        'console_scripts': [
+            'gitstats = gitstats.git_csv_generator:gen_csv',
+        ],
+    },
+)

sortable.js

@@ -1,324 +0,0 @@
-/*
-Table sorting script  by Joost de Valk, check it out at http://www.joostdevalk.nl/code/sortable-table/.
-Based on a script from http://www.kryogenix.org/code/browser/sorttable/.
-Distributed under the MIT license: http://www.kryogenix.org/code/browser/licence.html .
-
-Copyright (c) 1997-2007 Stuart Langridge, Joost de Valk.
-
-Version 1.5.7
-*/
-
-/* You can change these values */
-var image_path = "";
-var image_up = "arrow-up.gif";
-var image_down = "arrow-down.gif";
-var image_none = "arrow-none.gif";
-var europeandate = true;
-var alternate_row_colors = true;
-
-/* Don't change anything below this unless you know what you're doing */
-addEvent(window, "load", sortables_init);
-
-var SORT_COLUMN_INDEX;
-var thead = false;
-
-function sortables_init() {
-	// Find all tables with class sortable and make them sortable
-	if (!document.getElementsByTagName) return;
-	tbls = document.getElementsByTagName("table");
-	for (ti=0;ti<tbls.length;ti++) {
-		thisTbl = tbls[ti];
-		if (((' '+thisTbl.className+' ').indexOf("sortable") != -1) && (thisTbl.id)) {
-			ts_makeSortable(thisTbl);
-		}
-	}
-}
-
-function ts_makeSortable(t) {
-	if (t.rows && t.rows.length > 0) {
-		if (t.tHead && t.tHead.rows.length > 0) {
-			var firstRow = t.tHead.rows[t.tHead.rows.length-1];
-			thead = true;
-		} else {
-			var firstRow = t.rows[0];
-		}
-	}
-	if (!firstRow) return;
-	
-	// We have a first row: assume it's the header, and make its contents clickable links
-	for (var i=0;i<firstRow.cells.length;i++) {
-		var cell = firstRow.cells[i];
-		var txt = ts_getInnerText(cell);
-		if (cell.className != "unsortable" && cell.className.indexOf("unsortable") == -1) {
-			cell.innerHTML = '<a href="#" class="sortheader" onclick="ts_resortTable(this, '+i+');return false;">'+txt+'<span class="sortarrow">&nbsp;&nbsp;<img src="'+ image_path + image_none + '" alt="&darr;"/></span></a>';
-		}
-	}
-	if (alternate_row_colors) {
-		alternate(t);
-	}
-}
-
-function ts_getInnerText(el) {
-	if (typeof el == "string") return el;
-	if (typeof el == "undefined") { return el };
-	if (el.innerText) return el.innerText;	//Not needed but it is faster
-	var str = "";
-	
-	var cs = el.childNodes;
-	var l = cs.length;
-	for (var i = 0; i < l; i++) {
-		switch (cs[i].nodeType) {
-			case 1: //ELEMENT_NODE
-				str += ts_getInnerText(cs[i]);
-				break;
-			case 3:	//TEXT_NODE
-				str += cs[i].nodeValue;
-				break;
-		}
-	}
-	return str;
-}
-
-function ts_resortTable(lnk, clid) {
-	var span;
-	for (var ci=0;ci<lnk.childNodes.length;ci++) {
-		if (lnk.childNodes[ci].tagName && lnk.childNodes[ci].tagName.toLowerCase() == 'span') span = lnk.childNodes[ci];
-	}
-	var spantext = ts_getInnerText(span);
-	var td = lnk.parentNode;
-	var column = clid || td.cellIndex;
-	var t = getParent(td,'TABLE');
-	// Work out a type for the column
-	if (t.rows.length <= 1) return;
-	var itm = "";
-	var i = 1;
-	while (itm == "" && i < t.tBodies[0].rows.length) {
-		var itm = ts_getInnerText(t.tBodies[0].rows[i].cells[column]);
-		itm = trim(itm);
-		if (itm.substr(0,4) == "<!--" || itm.length == 0) {
-			itm = "";
-		}
-		i++;
-	}
-	if (itm == "") return; 
-	sortfn = ts_sort_caseinsensitive;
-	if (itm.match(/^\d\d[\/\.-][a-zA-z][a-zA-Z][a-zA-Z][\/\.-]\d\d\d\d$/)) sortfn = ts_sort_date;
-	if (itm.match(/^\d\d[\/\.-]\d\d[\/\.-]\d\d\d{2}?$/)) sortfn = ts_sort_date;
-	if (itm.match(/^-?[£$€Û¢´]\d/)) sortfn = ts_sort_numeric;
-	// ignore stuff in () after the numbers.
-	if (itm.match(/^-?(\d+[,\.]?)+(E[-+][\d]+)?%?( \(.*\))?$/)) sortfn = ts_sort_numeric;
-	SORT_COLUMN_INDEX = column;
-	var firstRow = new Array();
-	var newRows = new Array();
-	for (k=0;k<t.tBodies.length;k++) {
-		for (i=0;i<t.tBodies[k].rows[0].length;i++) { 
-			firstRow[i] = t.tBodies[k].rows[0][i]; 
-		}
-	}
-	for (k=0;k<t.tBodies.length;k++) {
-		if (!thead) {
-			// Skip the first row
-			for (j=1;j<t.tBodies[k].rows.length;j++) { 
-				newRows[j-1] = t.tBodies[k].rows[j];
-			}
-		} else {
-			// Do NOT skip the first row
-			for (j=0;j<t.tBodies[k].rows.length;j++) { 
-				newRows[j] = t.tBodies[k].rows[j];
-			}
-		}
-	}
-	newRows.sort(sortfn);
-	if (span.getAttribute("sortdir") == 'down') {
-			ARROW = '&nbsp;&nbsp;<img src="'+ image_path + image_down + '" alt="&darr;"/>';
-			newRows.reverse();
-			span.setAttribute('sortdir','up');
-	} else {
-			ARROW = '&nbsp;&nbsp;<img src="'+ image_path + image_up + '" alt="&uarr;"/>';
-			span.setAttribute('sortdir','down');
-	} 
-    // We appendChild rows that already exist to the tbody, so it moves them rather than creating new ones
-    // don't do sortbottom rows
-    for (i=0; i<newRows.length; i++) { 
-		if (!newRows[i].className || (newRows[i].className && (newRows[i].className.indexOf('sortbottom') == -1))) {
-			t.tBodies[0].appendChild(newRows[i]);
-		}
-	}
-    // do sortbottom rows only
-    for (i=0; i<newRows.length; i++) {
-		if (newRows[i].className && (newRows[i].className.indexOf('sortbottom') != -1)) 
-			t.tBodies[0].appendChild(newRows[i]);
-	}
-	// Delete any other arrows there may be showing
-	var allspans = document.getElementsByTagName("span");
-	for (var ci=0;ci<allspans.length;ci++) {
-		if (allspans[ci].className == 'sortarrow') {
-			if (getParent(allspans[ci],"table") == getParent(lnk,"table")) { // in the same table as us?
-				allspans[ci].innerHTML = '&nbsp;&nbsp;<img src="'+ image_path + image_none + '" alt="&darr;"/>';
-			}
-		}
-	}		
-	span.innerHTML = ARROW;
-	alternate(t);
-}
-
-function getParent(el, pTagName) {
-	if (el == null) {
-		return null;
-	} else if (el.nodeType == 1 && el.tagName.toLowerCase() == pTagName.toLowerCase()) {
-		return el;
-	} else {
-		return getParent(el.parentNode, pTagName);
-	}
-}
-
-function sort_date(date) {	
-	// y2k notes: two digit years less than 50 are treated as 20XX, greater than 50 are treated as 19XX
-	dt = "00000000";
-	if (date.length == 11) {
-		mtstr = date.substr(3,3);
-		mtstr = mtstr.toLowerCase();
-		switch(mtstr) {
-			case "jan": var mt = "01"; break;
-			case "feb": var mt = "02"; break;
-			case "mar": var mt = "03"; break;
-			case "apr": var mt = "04"; break;
-			case "may": var mt = "05"; break;
-			case "jun": var mt = "06"; break;
-			case "jul": var mt = "07"; break;
-			case "aug": var mt = "08"; break;
-			case "sep": var mt = "09"; break;
-			case "oct": var mt = "10"; break;
-			case "nov": var mt = "11"; break;
-			case "dec": var mt = "12"; break;
-			// default: var mt = "00";
-		}
-		dt = date.substr(7,4)+mt+date.substr(0,2);
-		return dt;
-	} else if (date.length == 10) {
-		if (europeandate == false) {
-			dt = date.substr(6,4)+date.substr(0,2)+date.substr(3,2);
-			return dt;
-		} else {
-			dt = date.substr(6,4)+date.substr(3,2)+date.substr(0,2);
-			return dt;
-		}
-	} else if (date.length == 8) {
-		yr = date.substr(6,2);
-		if (parseInt(yr) < 50) { 
-			yr = '20'+yr; 
-		} else { 
-			yr = '19'+yr; 
-		}
-		if (europeandate == true) {
-			dt = yr+date.substr(3,2)+date.substr(0,2);
-			return dt;
-		} else {
-			dt = yr+date.substr(0,2)+date.substr(3,2);
-			return dt;
-		}
-	}
-	return dt;
-}
-
-function ts_sort_date(a,b) {
-	dt1 = sort_date(ts_getInnerText(a.cells[SORT_COLUMN_INDEX]));
-	dt2 = sort_date(ts_getInnerText(b.cells[SORT_COLUMN_INDEX]));
-	
-	if (dt1==dt2) {
-		return 0;
-	}
-	if (dt1<dt2) { 
-		return -1;
-	}
-	return 1;
-}
-function ts_sort_numeric(a,b) {
-	var aa = ts_getInnerText(a.cells[SORT_COLUMN_INDEX]);
-	aa = clean_num(aa);
-	var bb = ts_getInnerText(b.cells[SORT_COLUMN_INDEX]);
-	bb = clean_num(bb);
-	return compare_numeric(aa,bb);
-}
-function compare_numeric(a,b) {
-	var a = parseFloat(a);
-	a = (isNaN(a) ? 0 : a);
-	var b = parseFloat(b);
-	b = (isNaN(b) ? 0 : b);
-	return a - b;
-}
-function ts_sort_caseinsensitive(a,b) {
-	aa = ts_getInnerText(a.cells[SORT_COLUMN_INDEX]).toLowerCase();
-	bb = ts_getInnerText(b.cells[SORT_COLUMN_INDEX]).toLowerCase();
-	if (aa==bb) {
-		return 0;
-	}
-	if (aa<bb) {
-		return -1;
-	}
-	return 1;
-}
-function ts_sort_default(a,b) {
-	aa = ts_getInnerText(a.cells[SORT_COLUMN_INDEX]);
-	bb = ts_getInnerText(b.cells[SORT_COLUMN_INDEX]);
-	if (aa==bb) {
-		return 0;
-	}
-	if (aa<bb) {
-		return -1;
-	}
-	return 1;
-}
-function addEvent(elm, evType, fn, useCapture)
-// addEvent and removeEvent
-// cross-browser event handling for IE5+,	NS6 and Mozilla
-// By Scott Andrew
-{
-	if (elm.addEventListener){
-		elm.addEventListener(evType, fn, useCapture);
-		return true;
-	} else if (elm.attachEvent){
-		var r = elm.attachEvent("on"+evType, fn);
-		return r;
-	} else {
-		alert("Handler could not be removed");
-	}
-}
-function clean_num(str) {
-	str = str.replace(new RegExp(/[^-?0-9.]/g),"");
-	return str;
-}
-function trim(s) {
-	return s.replace(/^\s+|\s+$/g, "");
-}
-function alternate(table) {
-	// Take object table and get all it's tbodies.
-	var tableBodies = table.getElementsByTagName("tbody");
-	// Loop through these tbodies
-	for (var i = 0; i < tableBodies.length; i++) {
-		// Take the tbody, and get all it's rows
-		var tableRows = tableBodies[i].getElementsByTagName("tr");
-		// Loop through these rows
-		// Start at 1 because we want to leave the heading row untouched
-		for (var j = 0; j < tableRows.length; j++) {
-			// Check if j is even, and apply classes for both possible results
-			if ( (j % 2) == 0  ) {
-				if ( !(tableRows[j].className.indexOf('odd') == -1) ) {
-					tableRows[j].className = tableRows[j].className.replace('odd', 'even');
-				} else {
-					if ( tableRows[j].className.indexOf('even') == -1 ) {
-						tableRows[j].className += " even";
-					}
-				}
-			} else {
-				if ( !(tableRows[j].className.indexOf('even') == -1) ) {
-					tableRows[j].className = tableRows[j].className.replace('even', 'odd');
-				} else {
-					if ( tableRows[j].className.indexOf('odd') == -1 ) {
-						tableRows[j].className += " odd";
-					}
-				}
-			} 
-		}
-	}
-}