source: trunk/lib/utility.h @ 112

Last change on this file since 112 was 112, checked in by Peter Johansson, 15 years ago

fixes #27 and added some beauty

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
File size: 3.5 KB
Line 
1// $Id: utility.h 112 2006-06-29 09:30:54Z peter $
2
3/*
4  Copyright (C) 2005, 2006 Jari Häkkinen, Peter Johansson
5
6  This file is part of svnstat, http://lev.thep.lu.se/trac/svnstat
7
8  svnstat is free software; you can redistribute it and/or modify it
9  under the terms of the GNU General Public License as published by
10  the Free Software Foundation; either version 2 of the License, or
11  (at your option) any later version.
12
13  svnstat is distributed in the hope that it will be useful, but
14  WITHOUT ANY WARRANTY; without even the implied warranty of
15  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
16  General Public License for more details.
17
18  You should have received a copy of the GNU General Public License
19  along with this program; if not, write to the Free Software
20  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
21  02111-1307, USA.
22*/
23
24#ifndef _theplu_svnstat_utility_
25#define _theplu_svnstat_utility_
26
27#include <algorithm>
28#include <fstream>
29#include <functional>
30#include <map>
31#include <string>
32#include <utility>
33#include <vector>
34
35namespace theplu{
36namespace svnstat{
37
38  ///
39  /// @return 0 if ok
40  ///
41  int blame(const std::string&);
42 
43  ///
44  /// Create directory \a dir. The call can fail in many ways, cf. 'man
45  /// mkdir'. If the \a dir exists, setting \a force to true will
46  /// trigger a recursive removal of the target \a dir.
47  ///
48  int createdir(const std::string& dir, bool force=false);
49
50  ///
51  /// @return everything after last '/'
52  ///
53  std::string file_name(const std::string&);
54
55  ///
56  /// Extracts information from 'svn info <node>'
57  ///
58  /// @note <node> must be in subversion control.
59  ///
60  std::map<std::string, std::string> info(const std::string&);
61
62  ///
63  /// @printing cascading style sheet to stream @a s.
64  ///
65  void print_css(std::ostream& s);
66
67  ///
68  /// Calculating sum of two vectors.
69  ///
70  /// @return resulting vector
71  ///
72  template <typename T >
73  struct VectorPlus : 
74    public std::binary_function<std::vector<T>,std::vector<T>,std::vector<T> >
75  {
76    std::vector<T> operator()(const std::vector<T>& u,
77                              const std::vector<T>& v) const 
78    {
79      if ( u.size() > v.size() ){
80        std::vector<T> res(u.size());
81        transform(u.begin(), u.end(), v.begin(), res.begin(), std::plus<T>());
82        copy(u.begin()+v.size(), u.end(), res.begin()+v.size());
83        return res;
84      }
85 
86      std::vector<T> res(v.size());
87      transform(v.begin(), v.end(), u.begin(), res.begin(), std::plus<T>());
88      if ( v.size() > u.size() )
89        copy(v.begin()+u.size(), v.end(), res.begin()+u.size());
90      return res;
91    }
92
93  };
94
95  ///
96  /// @return resulting vector
97  ///
98  template <typename Key, typename T>
99  struct PairValuePlus :
100    public std::binary_function<std::vector<T>,
101                                std::pair<const Key, std::vector<T> >, 
102                                std::vector<T> >
103  {
104    std::vector<T> operator()(const std::vector<T>& sum, 
105                              const std::pair<const Key,std::vector<T> >& p)
106    {
107      return VectorPlus<T>()(sum, p.second);
108    }
109  };
110
111  ///
112  /// Jari, is this obsolete? And thus erasable?
113  ///
114  struct CodingMore :
115    public std::binary_function<std::pair<std::string,std::vector<u_int> >,
116                                std::pair<std::string,std::vector<u_int> >,
117                                bool >
118  {
119    inline bool operator()
120      (const std::pair<std::string,std::vector<u_int> >& a, 
121       const std::pair<std::string,std::vector<u_int> >& b)
122    {
123      if (a.second.back() > b.second.back())
124        return true;
125      else if (a.second.back() < b.second.back())
126        return false;
127      return a.first < b.first;
128    }
129  };
130
131}}
132
133// end of namespace svnstat end of namespace theplu
134#endif
Note: See TracBrowser for help on using the repository browser.