source: trunk/lib/ClassicStats.cc @ 487

// $Id: ClassicStats.cc 487 2007-10-13 22:20:17Z peter $

/*
  Copyright (C) 2005 Peter Johansson
  Copyright (C) 2006, 2007 Jari Häkkinen, Peter Johansson

  This file is part of svndigest, http://trac.thep.lu.se/trac/svndigest

  svndigest 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.

  svndigest 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., 59 Temple Place - Suite 330, Boston, MA
  02111-1307, USA.
*/

#include "ClassicStats.h"

#include "Functor.h"
#include "GnuplotFE.h"
#include "SVNblame.h"
#include "SVNinfo.h"
#include "utility.h"

#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <string>
#include <sstream>
#include <unistd.h>
#include <utility>
#include <vector>


namespace theplu{
namespace svndigest{


  ClassicStats::ClassicStats(const std::string& path)
    : Stats(path)
  {
  }


  std::vector<u_int> ClassicStats::accumulated(const Map_& map) const
  {
    // sum of all users
    std::vector<u_int> sum(revision()+1);
    sum=std::accumulate(map.begin(), map.end(), sum,
                        PairValuePlus<std::string,u_int>());

    // calculate accumulated sum
    std::vector<u_int> accum(sum.size());
    std::partial_sum(sum.begin(),sum.end(),accum.begin());
    assert(sum.size()==accum.size());
    return accum;
  }

  std::vector<u_int> ClassicStats::accumulated(const Map_& map, 
                                        const std::string& user) const
  {
    if (!map.count(user))
      return std::vector<u_int>(last_changed_rev(),0);
    std::vector<u_int> vec=(map.find(user))->second;

    // static_cast to remove annoying compiler warning
    if (vec.size() < static_cast<size_t>(revision()+1))
      vec.insert(vec.end(), revision()+1-vec.size(), 0);

    std::vector<u_int> accum(vec.size());
    std::partial_sum(vec.begin(),vec.end(),accum.begin());
    return accum;
  }

  void ClassicStats::add(const std::string& user, const u_int& rev, 
                         const Parser::line_type& lt)
  {
    assert(user.size());
    add_author(user);

    std::vector<u_int>* total = &(total_[user]);
    assert(total);
    if (total->size() < rev+1){
      total->reserve(revision() + 1);
      total->insert(total->end(), rev - total->size(), 0);
      total->push_back(1);
    }
    else
      ++(*total)[rev];

    std::vector<u_int>* code = &(code_[user]);
    assert(code);
    if (code->size() < rev+1){
      code->reserve(revision() + 1);
      code->insert(code->end(), rev - code->size(), 0);
      if (lt == Parser::code)
        code->push_back(1);
      else 
        code->push_back(0);
    }
    else if (lt == Parser::code)
      ++(*code)[rev];

    std::vector<u_int>* comments = &(comments_[user]);
    assert(comments);
    if (comments->size() < rev+1){
      comments->reserve(revision() + 1);
      comments->insert(comments->end(), rev - comments->size(), 0);
      if (lt == Parser::comment)
        comments->push_back(1);
      else 
        comments->push_back(0);
    }
    else if (lt == Parser::comment)
      ++(*comments)[rev];

    std::vector<u_int>* empty = &(empty_[user]);
    assert(empty);
    if (empty->size() < rev+1){
      empty->reserve(revision() + 1);
      empty->insert(empty->end(), rev - empty->size(), 0);
      if (lt == Parser::empty)
        empty->push_back(1);
      else 
        empty->push_back(0);
    }
    else if (lt == Parser::empty)
      ++(*empty)[rev];
  }


  bool ClassicStats::do_load_cache(std::istream& is)
  {
    svn_revnum_t rev;
    is >> rev;
    if (rev<last_changed_rev()){
      return false; // cache is not up to date
    }
    reset();
    size_t a_size=0;
    is >> a_size;
    std::string str;
    while (authors().size()<a_size){
      getline(is, str);
      assert(str.size());
      add_author(str);
    }
    getline(is, str);
    if (str!=code_cache()){
      return false;
    }
    load(is, code_);
    getline(is, str);
    getline(is, str);
    if (str!=comments_cache()){
      return false;
    }
    load(is, comments_);
    getline(is, str);
    getline(is, str);
    if (str!=empty_cache()){
      return false;
    }
    load(is, empty_);
    getline(is, str);
    getline(is, str);
    if (str!=total_cache()){
      return false;
    }
    load(is, total_);
    getline(is,str);
    getline(is,str);
    return str==end_of_cache();
  }


  void ClassicStats::load(std::istream& is, Map_& m)
  {
    while (m.size() < authors().size() && is.good()) {
      std::string name;
      std::getline(is, name);
      assert(name.size());
      std::vector<u_int>& vec=m[name];
      size_t revs=0;
      is >> revs;
      vec.reserve(revs);
      while (vec.size() < revs) {
        u_int tmp;
        is >> tmp;
        vec.push_back(tmp);
      }
    }
  }


  void ClassicStats::do_parse(const std::string& path)
  {
    Parser parser(path);
    std::vector<Parser::line_type>::const_iterator count=parser.type().begin();

    SVNblame svn_blame(path);
    while (svn_blame.valid()) {
      add(svn_blame.author(), svn_blame.revision(), *count);
      svn_blame.next_line();
      ++count;
    }
  }


  std::string ClassicStats::do_plot(const std::string& filename,
                                    const std::string& linetype) const
  {
    plot_init(filename);
    GnuplotFE* gp=GnuplotFE::instance();
    const Map_* stat=NULL;
    if (linetype=="total")
      stat = &total_;
    else if (linetype=="code")
      stat = &code_;
    else if (linetype=="comments")
      stat = &comments_;
    else if (linetype=="empty")
      stat = &empty_;
    assert(stat);
    std::vector<u_int> total=accumulated(*stat);    
    double yrange_max=1.03*total.back()+1;
    gp->yrange(yrange_max);

    typedef std::vector<std::pair<std::string, std::vector<u_int> > > vec_type;
    vec_type author_cont;
    author_cont.reserve(stat->size());
    for (MapConstIter_ i= stat->begin(); i != stat->end(); ++i) {
      author_cont.push_back(std::make_pair(i->first,
                                           accumulated(*stat,i->first)));
    }

    LessReversed<std::vector<u_int> > lr;
    PairSecondCompare<std::string, std::vector<u_int>, 
      LessReversed<std::vector<u_int> > > compare(lr);
    std::sort(author_cont.begin(), author_cont.end(), compare);

    size_t plotno=author_cont.size();
    std::stringstream ss;
    vec_type::iterator end(author_cont.end());
    for (vec_type::iterator i(author_cont.begin()); i!=end; ++i) {
      ss.str("");
      ss << "set key height " << 2*plotno;
      gp->command(ss.str());
      ss.str("");
      ss << i->second.back() << " " << i->first;
      gp->yrange(yrange_max);
      gp->linetitle(ss.str());
      ss.str("");
      ss << "steps " << --plotno+2;
      gp->linestyle(ss.str());
      gp->plot(i->second);
    }
    ss.str("");
    ss << total.back() << " total";
    gp->command("set key height 0");
    gp->linetitle(ss.str());
    gp->linestyle("steps 1");
    gp->plot(total);

    gp->command("unset multiplot");
    gp->yrange();

    return filename;
  }


  void ClassicStats::do_print(std::ostream& os) const
  {
    os << last_changed_rev() << " ";
    os << authors().size() << " ";

    std::copy(authors().begin(), authors().end(), 
              std::ostream_iterator<std::string>(os, "\n"));
    os << code_cache() << "\n";
    do_print(os, code_);
    os << "\n" << comments_cache() << "\n";
    do_print(os, comments_);
    os << "\n" << empty_cache() << "\n";
    do_print(os, empty_);
    os << "\n" << total_cache() << "\n";
    do_print(os, total_);
    os << "\n" << end_of_cache() << "\n";
  }


  void ClassicStats::do_print(std::ostream& os, const Map_& m) const
  {
    for (MapConstIter_ i(m.begin()); i!=m.end(); ++i){
      os << i->first << "\n";
      os << i->second.size() << " ";
      std::copy(i->second.begin(), i->second.end(),
                std::ostream_iterator<u_int>(os, " "));
    }
  }

  
  std::vector<u_int> ClassicStats::vector(std::string type, 
                                          std::string user) const
  {
    const Map_* map = NULL;
    if (type=="code")
      map = &code_;
    else if (type=="comments")
      map = &comments_;
    else if (type=="other")
      map = &empty_;
    assert(map && "type is of invalid type");
    if (!map->count(user))
      return std::vector<u_int>(last_changed_rev(),0);
    const std::vector<u_int>& vec=(map->find(user))->second;
    
    std::vector<u_int> accum(vec.size());
    std::partial_sum(vec.begin(),vec.end(),accum.begin());
    // static_cast to remove annoying compiler warning
    if (accum.size() < static_cast<size_t>(revision()+1))
      accum.insert(accum.end(), revision()+1-vec.size(), accum.back());
    return accum;

  }


  ClassicStats& ClassicStats::operator+=(const ClassicStats& rhs)
  {
    base_add(rhs.code_.begin(), rhs.code_.end(), code_);
    base_add(rhs.comments_.begin(), rhs.comments_.end(), comments_);
    base_add(rhs.empty_.begin(), rhs.empty_.end(), empty_);
    base_add(rhs.total_.begin(), rhs.total_.end(), total_);
    
    base_add(rhs);
    return *this;
  }

}} // end of namespace svndigest and namespace theplu