hstring.cpp 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250
  1. #include "hstring.h"
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4. #include <string.h>
  5. #include <stdarg.h>
  6. namespace hv {
  7. std::string empty_string;
  8. std::map<std::string, std::string> empty_map;
  9. std::string& toupper(std::string& str) {
  10. // std::transform(str.begin(), str.end(), str.begin(), ::toupper);
  11. char* p = (char*)str.c_str();
  12. while (*p != '\0') {
  13. if (*p >= 'a' && *p <= 'z') {
  14. *p &= ~0x20;
  15. }
  16. ++p;
  17. }
  18. return str;
  19. }
  20. std::string& tolower(std::string& str) {
  21. // std::transform(str.begin(), str.end(), str.begin(), ::tolower);
  22. char* p = (char*)str.c_str();
  23. while (*p != '\0') {
  24. if (*p >= 'A' && *p <= 'Z') {
  25. *p |= 0x20;
  26. }
  27. ++p;
  28. }
  29. return str;
  30. }
  31. std::string& reverse(std::string& str) {
  32. // std::reverse(str.begin(), str.end());
  33. char* b = (char*)str.c_str();
  34. char* e = b + str.length() - 1;
  35. char tmp;
  36. while (e > b) {
  37. tmp = *e;
  38. *e = *b;
  39. *b = tmp;
  40. --e;
  41. ++b;
  42. }
  43. return str;
  44. }
  45. bool startswith(const std::string& str, const std::string& start) {
  46. if (str.length() < start.length()) return false;
  47. return str.compare(0, start.length(), start) == 0;
  48. }
  49. bool endswith(const std::string& str, const std::string& end) {
  50. if (str.length() < end.length()) return false;
  51. return str.compare(str.length() - end.length(), end.length(), end) == 0;
  52. }
  53. bool contains(const std::string& str, const std::string& sub) {
  54. if (str.length() < sub.length()) return false;
  55. return str.find(sub) != std::string::npos;
  56. }
  57. static inline int vscprintf(const char* fmt, va_list ap) {
  58. return vsnprintf(NULL, 0, fmt, ap);
  59. }
  60. std::string asprintf(const char* fmt, ...) {
  61. va_list ap;
  62. va_start(ap, fmt);
  63. int len = vscprintf(fmt, ap);
  64. va_end(ap);
  65. std::string str;
  66. str.reserve(len+1);
  67. // must resize to set str.size
  68. str.resize(len);
  69. // must recall va_start on unix
  70. va_start(ap, fmt);
  71. vsnprintf((char*)str.data(), len+1, fmt, ap);
  72. va_end(ap);
  73. return str;
  74. }
  75. StringList split(const std::string& str, char delim) {
  76. /*
  77. std::stringstream ss;
  78. ss << str;
  79. string item;
  80. StringList res;
  81. while (std::getline(ss, item, delim)) {
  82. res.push_back(item);
  83. }
  84. return res;
  85. */
  86. const char* p = str.c_str();
  87. const char* value = p;
  88. StringList res;
  89. while (*p != '\0') {
  90. if (*p == delim) {
  91. res.push_back(std::string(value, p-value));
  92. value = p+1;
  93. }
  94. ++p;
  95. }
  96. res.push_back(value);
  97. return res;
  98. }
  99. hv::KeyValue splitKV(const std::string& str, char kv_kv, char k_v) {
  100. enum {
  101. s_key,
  102. s_value,
  103. } state = s_key;
  104. const char* p = str.c_str();
  105. const char* key = p;
  106. const char* value = NULL;
  107. int key_len = 0;
  108. int value_len = 0;
  109. hv::KeyValue kvs;
  110. while (*p != '\0') {
  111. if (*p == kv_kv) {
  112. if (key_len && value_len) {
  113. kvs[std::string(key, key_len)] = std::string(value, value_len);
  114. key_len = value_len = 0;
  115. }
  116. state = s_key;
  117. key = p+1;
  118. }
  119. else if (*p == k_v && state != s_value) {
  120. state = s_value;
  121. value = p+1;
  122. }
  123. else {
  124. state == s_key ? ++key_len : ++value_len;
  125. }
  126. ++p;
  127. }
  128. if (key_len && value_len) {
  129. kvs[std::string(key, key_len)] = std::string(value, value_len);
  130. }
  131. return kvs;
  132. }
  133. std::string trim(const std::string& str, const char* chars) {
  134. std::string::size_type pos1 = str.find_first_not_of(chars);
  135. if (pos1 == std::string::npos) return "";
  136. std::string::size_type pos2 = str.find_last_not_of(chars);
  137. return str.substr(pos1, pos2-pos1+1);
  138. }
  139. std::string ltrim(const std::string& str, const char* chars) {
  140. std::string::size_type pos = str.find_first_not_of(chars);
  141. if (pos == std::string::npos) return "";
  142. return str.substr(pos);
  143. }
  144. std::string rtrim(const std::string& str, const char* chars) {
  145. std::string::size_type pos = str.find_last_not_of(chars);
  146. return str.substr(0, pos+1);
  147. }
  148. std::string trim_pairs(const std::string& str, const char* pairs) {
  149. const char* s = str.c_str();
  150. const char* e = str.c_str() + str.size() - 1;
  151. const char* p = pairs;
  152. bool is_pair = false;
  153. while (*p != '\0' && *(p+1) != '\0') {
  154. if (*s == *p && *e == *(p+1)) {
  155. is_pair = true;
  156. break;
  157. }
  158. p += 2;
  159. }
  160. return is_pair ? str.substr(1, str.size()-2) : str;
  161. }
  162. std::string replace(const std::string& str, const std::string& find, const std::string& rep) {
  163. std::string res(str);
  164. std::string::size_type pos = res.find(find);
  165. if (pos != std::string::npos) {
  166. res.replace(pos, find.size(), rep);
  167. }
  168. return res;
  169. }
  170. std::string replaceAll(const std::string& str, const std::string& find, const std::string& rep) {
  171. std::string::size_type pos = 0;
  172. std::string::size_type a = find.size();
  173. std::string::size_type b = rep.size();
  174. std::string res(str);
  175. while ((pos = res.find(find, pos)) != std::string::npos) {
  176. res.replace(pos, a, rep);
  177. pos += b;
  178. }
  179. return res;
  180. }
  181. void NetAddr::from_string(const std::string& ipport) {
  182. auto pos = ipport.find_last_of(':');
  183. if (pos != std::string::npos) {
  184. ip = trim_pairs(ipport.substr(0, pos), "[]");
  185. std::string strPort = ipport.substr(pos + 1);
  186. port = atoi(strPort.c_str());
  187. } else if (ipport.find('.') != std::string::npos) {
  188. ip = ipport;
  189. port = 0;
  190. } else {
  191. port = atoi(ipport.c_str());
  192. }
  193. }
  194. std::string NetAddr::to_string() {
  195. return NetAddr::to_string(ip.c_str(), port);
  196. }
  197. std::string NetAddr::to_string(const char* ip, int port) {
  198. const char* fmt = strchr(ip, ':') ? "[%s]:%d" : "%s:%d";
  199. return hv::asprintf(fmt, ip, port);
  200. }
  201. #ifdef OS_WIN
  202. std::string wchar_to_string(const UINT codePage, const std::wstring &wstr) {
  203. std::string str(4 * wstr.size() + 1, '\0');
  204. str.resize(WideCharToMultiByte(
  205. codePage, 0,
  206. wstr.c_str(), wstr.size(),
  207. const_cast<char*>(str.data()), str.size(),
  208. NULL, NULL));
  209. return str;
  210. }
  211. std::wstring string_to_wchar(const UINT codePage, const std::string &str) {
  212. std::wstring wstr(2 * str.size() + 2, '\0');
  213. wstr.resize(MultiByteToWideChar(
  214. codePage, 0,
  215. str.c_str(), str.size(),
  216. const_cast<wchar_t*>(wstr.data()), wstr.size()));
  217. return wstr;
  218. }
  219. #endif // OS_WIN
  220. } // end namespace hv