C++ String常用操作接口封装

 
#ifndef __STRING_H__
#define __STRING_H__

#include <algorithm>
#include <cctype>
#include <iostream>
#include <iterator>
#include <limits>
#include <sstream>
#include <string>
#include <vector>

namespace String {

template<int (&F)(int)>
int TypeCheck(unsigned char c) {
	return F(c);
}

inline bool EndsWith(const std::string &s, char ch) {
	return !s.empty() && s.back() == ch;
}

inline bool EndsWith(const std::string &s, const std::string &suffix) {
	return std::mismatch(suffix.rbegin(), suffix.rend(), s.rbegin()).first == suffix.rend();
}

inline bool StartsWith(const std::string &s, char ch) {
	return !s.empty() && s.front() == ch;
}

inline bool StartsWith(const std::string &s, const std::string &prefix) {
	return std::mismatch(prefix.begin(), prefix.end(), s.begin()).first == prefix.end();
}

inline void RTrim(std::string &s) {
	s.erase(std::find_if(s.rbegin(), s.rend(), [](int ch) {
		 return !TypeCheck<std::isspace>(ch);
	 }).base(), s.end());
}

inline void LTrim(std::string &s) {
	s.erase(s.begin(), std::find_if(s.begin(), s.end(), [](int ch) {
		return !TypeCheck<std::isspace>(ch);
	}));
}

inline void Trim(std::string &s) {
	LTrim(s);
	RTrim(s);
}

inline std::string RTrimCopy(std::string s) {
	RTrim(s);
	return s;
}

inline std::string LTrimCopy(std::string s) {
	LTrim(s);
	return s;
}

inline std::string TrimCopy(std::string &s) {
	Trim(s);
	return s;
}

inline void ToUpper(std::string &s) {
	std::transform(s.begin(), s.end(), s.begin(), [](int ch) {
		return std::toupper(ch);
	});
}

inline void ToLower(std::string &s) {
	std::transform(s.begin(), s.end(), s.begin(), [](int ch) {
		return std::tolower(ch);
	});
}

inline std::string ToupperCopy(std::string s) {
	ToUpper(s);
	return s;
}

inline std::string TolowerCopy(std::string s) {
	ToLower(s);
	return s;
}

//------------------------------------------------------------------------------
// Desc: join elements with a char
//------------------------------------------------------------------------------
inline std::string Implode(char glue, const std::vector<std::string> &pieces) {
	std::string s;
	if(!pieces.empty()) {
		s.append(pieces[0]);
		for(size_t i = 1; i < pieces.size(); ++i) {
			s.push_back(glue);
			s.append(pieces[i]);
		}
	}
	return s;
}

//------------------------------------------------------------------------------
// Desc: join elements with a string
//------------------------------------------------------------------------------
inline std::string Implode(const std::string &glue, const std::vector<std::string> &pieces) {
	std::string s;
	if(!pieces.empty()) {
		s.append(pieces[0]);
		for(size_t i = 1; i < pieces.size(); ++i) {
			s.append(glue);
			s.append(pieces[i]);
		}
	}
	return s;
}

inline std::vector<std::string> Explode(const std::string &delimeter, const std::string &string, int limit) {
	std::vector<std::string> r;

	if(!string.empty()) {
		if(limit >= 0) {
			if(limit == 0) {
				limit = 1;
			}

			size_t first = 0;
			size_t last  = string.find(delimeter);

			while(last != std::string::npos) {

				if(--limit == 0) {
					break;
				}

				r.emplace_back(string.substr(first, last - first));
				first = last + delimeter.size();
				last  = string.find(delimeter, last + delimeter.size());
			}

			r.emplace_back(string.substr(first));
		} else {
			size_t first = 0;
			size_t last  = string.find(delimeter);

			while(last != std::string::npos) {
				r.emplace_back(string.substr(first, last - first));
				first = last + delimeter.size();
				last  = string.find(delimeter, last + delimeter.size());
			}

			r.emplace_back(string.substr(first));
			
			while(limit < 0) {
				r.pop_back();
				++limit;
			}
		}
	}
	
	return r;
}

inline std::vector<std::string> Explode(const std::string &delimeter, const std::string &string) {
	return Explode(delimeter, string, std::numeric_limits<int>::max());
}

inline std::vector<std::string> Explode(char delimeter, const std::string &string, int limit) {
	std::vector<std::string> r;

	if(!string.empty()) {
		if(limit >= 0) {
			if(limit == 0) {
				limit = 1;
			}

			size_t first = 0;
			size_t last  = string.find(delimeter);

			while(last != std::string::npos) {

				if(--limit == 0) {
					break;
				}

				r.emplace_back(string.substr(first, last - first));
				first = last + 1;
				last  = string.find(delimeter, last + 1);
			}

			r.emplace_back(string.substr(first));
		} else {
			size_t first = 0;
			size_t last  = string.find(delimeter);

			while(last != std::string::npos) {
				r.emplace_back(string.substr(first, last - first));
				first = last + 1;
				last  = string.find(delimeter, last + 1);
			}

			r.emplace_back(string.substr(first));
			
			while(limit < 0) {
				r.pop_back();
				++limit;
			}
		}
	}
	
	return r;
}

inline std::vector<std::string> Explode(char delimeter, const std::string &string) {
	return Explode(delimeter, string, std::numeric_limits<int>::max());
}

template <class Op>
void Split(const std::string &s, char delim, Op op) {
	std::stringstream ss(s);
	for(std::string item; std::getline(ss, item, delim); ) {
		*op++ = item;
	}
}

inline std::vector<std::string> Split(const std::string &s, char delim) {
    std::vector<std::string> elems;
    Split(s, delim, std::back_inserter(elems));
    return elems;
}

}

#endif

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

qq_21239475

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值