字符串相关操作

strings.h

#ifndef _STRINGS_H

#define _STRINGS_H

#include <string>

#include <stdlib.h>

#include <stdio.h>

#include <unistd.h>

#include <vector>

#include <string.h>

using namespace std;

//数值转字符串系列函数

string Itoa(int16_t i);

string Itoa(int32_t i);

string Itoa(int64_t i);

//修正字符串，删除头尾的空格，回车

string Trim(const string &src);

// 转大写

string ToUpperCase(const string &src);

// 转小写

string ToLowerCase(const string &src);

/* * 替换字符串号的特定字符

* @param src 原字符串

* @param target 需要替换的原字符

* @param replacement 替换的新字符

* @return 替换后结果

*/

string ReplaceAll(const string &src, string target, string replacement);

/* * 按特定分割符，分割字符串

* @param src 原字符串

* @param split_flag 分割符

* @param result 分割出来的结果

* @return 分割的个数

*/

int Split(const string &src, string split_flag, vector& result);

/*

* 格式化字符串（长度有限制只有4096）

* @param format  格式与printf一样

* @return  格式化完的字符串

*/

string Format(const char *format, ...);

/*

* 十六进制字符串转字符

* @param src  0x0d,0x0a

* @return  解析好的字符串

*/

string ParseString2Hex(string src);

/*

* 字符串转十六进制字符

* @param src  \r\n

* @return  字符串

*/

string ParseHex2String(string hex);

#endif // _STRINGS_H

strings.cpp

#include#include "strings.h"

string Itoa(int16_t i) { char buf[255] = {0}; sprintf(buf, "%d", i); string ret = (const char *) buf; return ret;}

string Itoa(int32_t i) { char buf[255] = {0}; sprintf(buf, "%d", i); string ret = (const char *) buf; return ret;}

string Itoa(int64_t i) { char buf[255] = {0}; sprintf(buf, "%ld", i); string ret = (const char *) buf; return ret;}

string Trim(const string &src) { string ret_str = src; if (ret_str.length() == 0) return ret_str; size_t start_pos = 0; while (start_pos < ret_str.length()) { if (ret_str[start_pos] == '\r' || ret_str[start_pos] == '\n' || ret_str[start_pos] == '\t' || ret_str[start_pos] == ' ') { start_pos++; continue; } break; } int end_pos = ret_str.length() - 1; while (end_pos > 0) { if (ret_str[end_pos] == '\r' || ret_str[end_pos] == '\n' || ret_str[end_pos] == '\t' || ret_str[end_pos] == ' ') { end_pos--; continue; } break; } return ret_str.substr(start_pos, end_pos - start_pos + 1);}string ToUpperCase(const string &src) { string ret_str = src; int i = ret_str.size(); string::iterator itr = ret_str.begin(); while (i--) { (*itr) = (unsigned char) toupper((unsigned char) (*itr)); itr++; } return ret_str;}string ToLowerCase(const string &src) { string ret_str = src; int i = ret_str.size(); string::iterator itr = ret_str.begin(); while (i--) { (*itr) = (unsigned char) tolower((unsigned char) (*itr)); itr++; } return ret_str;}int Split(const string &src, string split_flag, vector& result) { result.clear(); size_t start_pos = 0; size_t pos = src.find(split_flag); while (pos != string::npos) { result.push_back(src.substr(start_pos, pos - start_pos)); start_pos = pos + split_flag.length(); pos = src.find(split_flag, start_pos); } if (start_pos < src.length()) { result.push_back(src.substr(start_pos)); } return result.size();}string ReplaceAll(const string &src, string target, string replacement) { string ret = src; size_t pos = 0; for (; (pos = ret.find(target, pos)) != string::npos;) { ret.erase(pos, target.length()); ret.insert(pos, replacement); pos += replacement.length(); } return ret;}string Format(const char *format, ...) { char buf[4096]; string ret; if (format != 0) { va_list args; va_start(args, format); vsnprintf(buf, sizeof(buf), format, args); buf[sizeof(buf) - 1] = 0; va_end(args); ret = buf; } return ret;}

string ParseString2Hex(string src)

{

src = ToUpperCase(src);

vector<string>list_result;

Split(src, ",", list_result);

string result;

for (size_t i = 0; i < list_result.size(); i++) {

string temp = Trim(list_result[i]);

if (temp.length() < 3)

continue;

if (strncmp(temp.c_str(), "0X", 2) != 0)

continue;

char *temp_ptr;

int num = strtol(temp.c_str() + 2, &(temp_ptr), 16);

result.push_back(num);

}

return result;

}

string ParseHex2String(string hex) {

string result;

for (size_t i = 0; i < hex.length(); i++) {

result += Format("0x%02x", hex[i]);

if (i != hex.length() - 1)

result += ",";

}

return result;

}