utility.h

[詳解]

/*
 * Copyright 2021 oZ/acy (名賀月晃嗣) <acy@hiemalis.org>
 *
 * Redistribution and use in source and binary forms, 
 *     with or without modification, 
 *   are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */
#ifndef INCLUDE_GUARD_EUNOMIA_UTILITY_H
#define INCLUDE_GUARD_EUNOMIA_UTILITY_H
 
#include <cctype>
#include <cwctype>
#include <string>
#include <vector>
 
namespace eunomia
{
 
 
inline
std::string lower(const std::string& str)
{
  std::string res = str;
  for (auto& c : res) {
    c = std::tolower((unsigned char)c);
  }
  return res;
}
 
inline
std::wstring lower(const std::wstring& str)
{
  std::wstring res = str;
  for (auto& c : res) {
    c = std::towlower(c);
  }
  return res;
}
 
 
 
template<class C, class T, class A>
inline
std::vector<std::basic_string<C, T, A>>
split(
  const std::basic_string<C, T, A>& str, const std::basic_string<C, T, A>& dlm)
{
  std::vector<std::basic_string<C, T, A>> rvec;
  typename std::basic_string<C, T, A>::size_type f = 0;
 
  while (f < str.size()) {
    auto b = str.find_first_of(dlm, f);
    if (b == std::basic_string<C, T, A>::npos) {
      b = str.size();
    }
    if (f < b) {
      auto s = str.substr(f, b - f);
      rvec.push_back(s);
    }
    f = b + 1;
  }
 
  return rvec;
}
 
 
template<class C, class T, class A>
inline
std::vector<std::basic_string<C, T, A>>
split(const std::basic_string<C, T, A>& str, const C* dlm)
{
  std::vector<std::basic_string<C, T, A>> rvec;
  typename std::basic_string<C, T, A>::size_type f = 0;
 
  while (f < str.size()) {
    auto b = str.find_first_of(dlm, f);
    if (b == std::basic_string<C, T, A>::npos) {
      b = str.size();
    }
    if (f < b) {
      auto s = str.substr(f, b - f);
      rvec.push_back(s);
    }
    f = b + 1;
  }
 
  return rvec;
}
 
 
template<class C, class T, class A>
inline
std::vector<std::basic_string<C, T, A>>
split(const std::basic_string<C, T, A>& str, C dlm)
{
  std::vector<std::basic_string<C, T, A>> rvec;
  typename std::basic_string<C, T, A>::size_type f = 0;
 
  while (f < str.size()) {
    auto b = str.find_first_of(dlm, f);
    if (b == std::basic_string<C, T, A>::npos) {
      b = str.size();
    }
    if (f < b) {
      auto s = str.substr(f, b - f);
      rvec.push_back(s);
    }
    f = b + 1;
  }
 
  return rvec;
}
 
 
 
template<class C, class T, class A>
inline
std::basic_string<C, T, A>
trim(
  const std::basic_string<C, T, A>& str,
  const std::basic_string<C, T, A>& removed)
{
  auto l = str.find_first_not_of(removed);
 
  if (l == std::basic_string<C, T, A>::npos)
    return std::string("");
 
  auto r = str.find_last_not_of(removed);
  return str.substr(l, r - l + 1);
}
 
 
template<class C, class T, class A>
inline
std::basic_string<C, T, A>
trim(const std::basic_string<C, T, A>& str, const C* removed)
{
  auto l = str.find_first_not_of(removed);
 
  if (l == std::basic_string<C, T, A>::npos)
    return std::string("");
 
  auto r = str.find_last_not_of(removed);
  return str.substr(l, r - l + 1);
}
 
 
template<class C, class T, class A>
inline
std::basic_string<C, T, A>
ltrim(
  const std::basic_string<C, T, A>& str,
  const std::basic_string<C, T, A>& removed)
{
  auto l = str.find_first_not_of(removed);
 
  if (l == std::basic_string<C, T, A>::npos)
    return std::string("");
  else
    return str.substr(l, str.size() - l);
}
 
 
template<class C, class T, class A>
inline
std::basic_string<C, T, A>
ltrim(const std::basic_string<C, T, A>& str, const C* removed)
{
  auto l = str.find_first_not_of(removed);
 
  if (l == std::basic_string<C, T, A>::npos)
    return std::string("");
  else
    return str.substr(l, str.size() - l);
}
 
 
template<class C, class T, class A>
inline
std::basic_string<C, T, A>
rtrim(
  const std::basic_string<C, T, A>& str,
  const std::basic_string<C, T, A>& removed)
{
  auto r = str.find_last_not_of(removed);
  if (r == std::basic_string<C, T, A>::npos)
    return std::string("");
  else
    return str.substr(0, r + 1);
}
 
 
template<class C, class T, class A>
inline
std::basic_string<C, T, A>
rtrim(const std::basic_string<C, T, A>& str, const C* removed)
{
  auto r = str.find_last_not_of(removed);
  if (r == std::basic_string<C, T, A>::npos)
    return std::string("");
  else
    return str.substr(0, r + 1);
}
 
 
 
 
 
}// end of namespace eunomia
 
 
#endif // INCLUDE_GUARD_EUNOMIA_UTILITY_H