source: trunk/lib/utility.h

#ifndef _theplu_svndigest_utility_
#define _theplu_svndigest_utility_

// $Id: utility.h 1675 2023-08-26 17:13:59Z peter $

/*
  Copyright (C) 2005 Peter Johansson
  Copyright (C) 2006, 2007, 2008 Jari Häkkinen, Peter Johansson
  Copyright (C) 2009, 2010, 2011, 2012 Peter Johansson

  This file is part of svndigest, http://dev.thep.lu.se/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 3 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 svndigest. If not, see <http://www.gnu.org/licenses/>.
*/

#include "Functor.h"

#include <algorithm>
#include <functional>
#include <iosfwd>
#include <limits>
#include <sstream>
#include <stdexcept>
#include <string>
#include <utility>
#include <vector>

#include <sys/stat.h>

namespace theplu{
namespace svndigest{

  /**
     if path is absolute return path otherwise return
     concatenate_path(pwd(), path)
   */
  std::string absolute_path(const std::string& path);

  ///
  /// @brief Check if access permissions match \a mode. \a mode must
  /// be given as r, w, x, or combinations of these letters.
  ///
  /// @return On success (all requested permissions granted), zero
  /// is returned. On error (at least one bit in mode asked for a
  /// permission that is denied, or some other error occurred), -1
  /// is returned, and errno is set appropriately.
  ///
  /// @throw An std::runtime_error is thrown when checking for write
  /// permissions for a file/direcotry that does not exist.
  ///
  /// @see access(2)
  ///
  int access_rights(const std::string& path,const std::string& bits);

  /**
     \return dir+base if dir ends with '/', else dir+'/'+base
   */
  std::string concatenate_path(std::string dir, std::string base);

  ///
  /// @brief environment variable @a var
  ///
  std::string getenv(const std::string& var);

  ///
  /// If @a width is set, size is forced to length @a width. This
  /// implies, e.g., that hex(15,2) and hex(17,1) return "0F" and "1",
  /// respectively.
  ///
  /// @return x in hexadecimal base
  ///
  std::string hex(int x, unsigned int width=0);

  ///
  /// @brief remove trailing whitespaces
  ///
  std::string htrim(std::string str);

  /**
     \return true if path has finite size and first charcter is '/'
   */
  bool is_absolute_path(const std::string& path);

  /**
     same as lstat(2) but throws an errno_error if error is detected
   */
  void lstat(const std::string path, struct stat*);

  ///
  /// @brief remove leading whitespaces
  ///
  std::string ltrim(std::string str);

  inline bool match_begin(std::string::const_iterator first,
                          std::string::const_iterator last,
                          const std::string& str)
  { return (std::distance(first, last)>=static_cast<int>(str.size()) &&
            std::equal(str.begin(), str.end(), first));
  }

  inline bool match_end(std::string::const_reverse_iterator first,
                        std::string::const_reverse_iterator last,
                        const std::string& str)
  { return (std::distance(first,last)>=static_cast<int>(str.size()) &&
            std::equal(str.rbegin(), str.rend(), first));
  }

  ///
  /// @brief Check whether \a path already exists or not.
  ///
  /// @return True if \a path exists, false otherwise.
  ///
  bool node_exist(const std::string& path);

  /**
     @return 0 if \a b = 0 otherwise \f$ \frac{100*a}{b} \f$
  */
  int percent(int a, int b);

  ///
  /// @return the current working directory.
  ///
  std::string pwd(void);

  /**
     \return true if \a str matches \a pattern

     \a pattern may contain wildcards '*', '?' and \a vec will contain
     the matching string in \a str. If it's not a match, \a vec is
     undefined. The algorithm is greedy, i.e., wildcards '*' will
     consume as many charcters as possible.

     \note \a vec is supposed to be empty
   */
  bool regexp(const std::string& pattern, const std::string& str,
              std::vector<std::string>& vec);

  /**
     \return \a abs_path relative from \a dir, i.e., abs_path =
     dir/<returned value>
   */
  std::string relative_path(const std::string& abs_path,const std::string& dir);

  ///
  /// Search finds a subsecuence in [first, last) being identical to @ str
  ///
  /// @return iterator pointing to first character in found subsequence
  ///
  /// @see std::search
  ///
  inline std::string::iterator search(std::string::iterator first,
                                      std::string::iterator last,
                                      std::string str)
  { return std::search(first, last, str.begin(), str.end()); }

  /**
     same as sum(3) but using binary(result, *first) rather than
     result += *first
   */
  template<typename InputIterator, typename T, typename BinaryOperation>
  void sum(InputIterator first, InputIterator last, T& result,
           BinaryOperation binary)
  {
    for (; first!=last; ++first)
      binary(result, *first);
  }

  /**
     Add all values of [first, last) to result
   */
  template<typename InputIterator, typename T>
  void sum(InputIterator first, InputIterator last, T& result)
  {
    typedef typename std::iterator_traits<InputIterator>::const_reference ref;
    typedef PlusAssign<T&, ref> binary;
    return sum(first, last, result, binary());
  }

  ///
  /// If file does not exist create empty file.
  ///
  void touch(std::string);

  ///
  /// remove leading and trailing whitespaces
  ///
  inline std::string trim(std::string str) { return htrim(ltrim(str)); }


  template <typename T>
  std::string match(std::string::const_iterator& first,
                    const std::string::const_iterator& last,
                    const T& func)
  {
    std::string res;
    for (;first!=last && func(first); ++first)
      res.append(1,*first);
    return res;
  }


  std::string match(std::string::const_iterator& first,
                    const std::string::const_iterator& last,
                    std::string);

}} // end of namespace svndigest end of namespace theplu
#endif