source: trunk/lib/utility.h @ 313

Last change on this file since 313 was 313, checked in by Peter Johansson, 14 years ago

precentage in tables, fixes #194

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
File size: 7.4 KB
Line 
1#ifndef _theplu_svndigest_utility_
2#define _theplu_svndigest_utility_
3
4// $Id: utility.h 313 2007-05-17 11:40:44Z peter $
5
6/*
7  Copyright (C) 2005, 2006 Jari Häkkinen, Peter Johansson
8  Copyright (C) 2007 Peter Johansson
9
10  This file is part of svndigest, http://lev.thep.lu.se/trac/svndigest
11
12  svndigest is free software; you can redistribute it and/or modify it
13  under the terms of the GNU General Public License as published by
14  the Free Software Foundation; either version 2 of the License, or
15  (at your option) any later version.
16
17  svndigest is distributed in the hope that it will be useful, but
18  WITHOUT ANY WARRANTY; without even the implied warranty of
19  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20  General Public License for more details.
21
22  You should have received a copy of the GNU General Public License
23  along with this program; if not, write to the Free Software
24  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
25  02111-1307, USA.
26*/
27
28#include <algorithm>
29#include <functional>
30#include <iosfwd>
31#include <string>
32#include <utility>
33#include <vector>
34
35#include <sys/stat.h>
36
37namespace theplu{
38namespace svndigest{
39
40  ///
41  /// @brief Check if access permissions match \a mode. \a mode must
42  /// be given as r, w, x, or combinations of these letters.
43  ///
44  /// @return On success (all requested permissions granted), zero
45  /// is returned. On error (at least one bit in mode asked for a
46  /// permission that is denied, or some other error occurred), -1
47  /// is returned, and errno is set appropriately.
48  ///
49  /// @throw An std::runtime_error is thrown when checking for write
50  /// permissions for a file/direcotry that does not exist.
51  ///
52  /// @see access(2)
53  ///
54  int access_rights(const std::string& path,const std::string& bits);
55
56  ///
57  /// @return everything after last '/'
58  ///
59  std::string file_name(const std::string&);
60
61  ///
62  /// @brief environment variable @a var
63  ///
64  std::string getenv(const std::string& var); 
65
66  ///
67  /// @brief remove trailing whitespaces
68  ///
69  std::string htrim(std::string str);
70
71  ///
72  /// @return true if \a str is an integer
73  ///
74  bool is_int(std::string str);
75
76  ///
77  /// @brief remove leading whitespaces
78  ///
79  std::string ltrim(std::string str);
80
81  inline bool match_begin(std::string::const_iterator first, 
82                          std::string::const_iterator last, 
83                          const std::string& str)
84  { return (std::distance(first, last)>=static_cast<int>(str.size()) && 
85            std::equal(str.begin(), str.end(), first)); 
86  }
87
88  inline bool match_end(std::string::const_reverse_iterator first, 
89                        std::string::const_reverse_iterator last, 
90                        const std::string& str)
91  { return (std::distance(first,last)>=static_cast<int>(str.size()) && 
92            std::equal(str.rbegin(), str.rend(), first)); 
93  }
94
95  ///
96  /// Create directory \a dir. The call can fail in many ways, cf. 'man
97  /// mkdir'.
98  ///
99  inline int mkdir(const std::string& dir) { return ::mkdir(dir.c_str(),0777); }
100
101  ///
102  /// @brief Check whether \a path already exists or not.
103  ///
104  /// @return True if \a path exists, false otherwise.
105  ///
106  bool node_exist(const std::string& path);
107
108  /**
109     @return 0 if \a b = 0 otherwise \f$ \frac{100*a}{b} \f$
110  */
111  int percent(int a, int b);
112
113  ///
114  /// @return the current working directory.
115  ///
116  std::string pwd(void);
117
118  ///
119  /// Search finds a subsecuence in [first, last) being identical to @ str
120  ///
121  /// @return iterator pointing to first character in found subsequence
122  ///
123  /// @see std::search
124  ///
125  inline std::string::iterator search(std::string::iterator first, 
126                                      std::string::iterator last, 
127                                      std::string str)
128  { return std::search(first, last, str.begin(), str.end()); }
129
130  ///
131  ///
132  ///
133  time_t str2time(const std::string&);
134
135  ///
136  /// If file does not exist create empty file.
137  ///
138  void touch(std::string);
139
140  ///
141  /// remove leading and trailing whitespaces
142  ///
143  inline std::string trim(std::string str) { return htrim(ltrim(str)); }
144
145
146  template <class T>
147  std::string match(std::string::const_iterator& first,
148                    const std::string::const_iterator& last,
149                    const T& func)
150  {
151    std::string res;
152    for (;first!=last && func(first); ++first) 
153      res.append(1,*first);
154    return res;
155  }
156
157
158  std::string match(std::string::const_iterator& first,
159                    const std::string::const_iterator& last,
160                    std::string);
161
162  struct AlNum
163  {
164    inline bool operator()(std::string::const_iterator i) const 
165    { return isalnum(*i); }
166  };
167
168
169  struct Digit
170  {
171    inline bool operator()(std::string::const_iterator i) const 
172    { return isdigit(*i); }
173  };
174
175
176  class notChar
177  {
178  public:
179    notChar(char);
180    inline bool operator()(std::string::const_iterator i) const 
181    { return *i!=char_; }
182  private:
183    char char_;
184  };
185
186  class not2Char
187  {
188  public:
189    not2Char(char, char);
190    inline bool operator()(std::string::const_iterator i) const 
191    { return *i!=char1_ && *i!=char2_; }
192  private:
193    const char char1_;
194    const char char2_;
195  };
196
197  class not2Str
198  {
199  public:
200    not2Str(std::string, std::string);
201    inline bool operator()(std::string::const_iterator i) const 
202    { 
203      return !(std::equal(str1_.begin(), str1_.end(), i) ||
204              std::equal(str2_.begin(), str2_.end(), i));
205    } 
206
207  private:
208    const std::string str1_;
209    const std::string str2_;
210  };
211
212  ///
213  /// @brief Functor comparing pairs using second.
214  ///
215  /// STL provides operator< for the pair.first element, but none for
216  /// pair.second. This template provides this and can be used as the
217  /// comparison object in generic functions such as the STL sort.
218  ///
219  template <class T1,class T2>
220  struct pair_value_compare
221  {
222    ///
223    /// @return true if x.second<y.second or (x.second==y.second and
224    /// x.first<y.first)
225    ///
226    inline bool operator()(const std::pair<T1,T2>& x,
227                           const std::pair<T1,T2>& y) {
228      return ((x.second<y.second) ||
229              (!(y.second<x.second) && (x.first<y.first))); 
230    }
231  };
232
233  template <class T1,class T2, class T3>
234  struct PairSecondCompare
235  {
236
237    ///
238    /// @brief Constructor
239    ///
240    explicit PairSecondCompare(const T3& comp)
241      : compare_(comp) {}
242
243    ///
244    /// @return true if x.second<y.second or (x.second==y.second and
245    /// x.first<y.first)
246    ///
247    inline bool operator()(const std::pair<T1,T2>& x,
248                           const std::pair<T1,T2>& y) const
249    { return compare_(x.second,y.second); }
250
251  private:
252    T3 compare_;
253
254  };
255
256  ///
257  /// Calculating sum of two vectors.
258  ///
259  /// @return resulting vector
260  ///
261  template <typename T >
262  struct VectorPlus : 
263    public std::binary_function<std::vector<T>,std::vector<T>,std::vector<T> >
264  {
265    std::vector<T> operator()(const std::vector<T>& u,
266                              const std::vector<T>& v) const 
267    {
268      if ( u.size() > v.size() ){
269        std::vector<T> res(u.size());
270        transform(u.begin(), u.end(), v.begin(), res.begin(), std::plus<T>());
271        copy(u.begin()+v.size(), u.end(), res.begin()+v.size());
272        return res;
273      }
274 
275      std::vector<T> res(v.size());
276      transform(v.begin(), v.end(), u.begin(), res.begin(), std::plus<T>());
277      if ( v.size() > u.size() )
278        copy(v.begin()+u.size(), v.end(), res.begin()+u.size());
279      return res;
280    }
281
282  };
283
284  ///
285  /// @return resulting vector
286  ///
287  template <typename Key, typename T>
288  struct PairValuePlus :
289    public std::binary_function<std::vector<T>,
290                                std::pair<const Key, std::vector<T> >, 
291                                std::vector<T> >
292  {
293    std::vector<T> operator()(const std::vector<T>& sum, 
294                              const std::pair<const Key,std::vector<T> >& p)
295    {
296      return VectorPlus<T>()(sum, p.second);
297    }
298  };
299
300}} // end of namespace svndigest end of namespace theplu
301
302#endif
Note: See TracBrowser for help on using the repository browser.