hstring.cpp 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  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& toupper(std::string& str) {
  8. // std::transform(str.begin(), str.end(), str.begin(), ::toupper);
  9. char* p = (char*)str.c_str();
  10. while (*p != '\0') {
  11. if (*p >= 'a' && *p <= 'z') {
  12. *p &= ~0x20;
  13. }
  14. ++p;
  15. }
  16. return str;
  17. }
  18. std::string& tolower(std::string& str) {
  19. // std::transform(str.begin(), str.end(), str.begin(), ::tolower);
  20. char* p = (char*)str.c_str();
  21. while (*p != '\0') {
  22. if (*p >= 'A' && *p <= 'Z') {
  23. *p |= 0x20;
  24. }
  25. ++p;
  26. }
  27. return str;
  28. }
  29. std::string& reverse(std::string& str) {
  30. // std::reverse(str.begin(), str.end());
  31. char* b = (char*)str.c_str();
  32. char* e = b + str.length() - 1;
  33. char tmp;
  34. while (e > b) {
  35. tmp = *e;
  36. *e = *b;
  37. *b = tmp;
  38. --e;
  39. ++b;
  40. }
  41. return str;
  42. }
  43. bool startswith(const std::string& str, const std::string& start) {
  44. if (str.length() < start.length()) return false;
  45. return str.compare(0, start.length(), start) == 0;
  46. }
  47. bool endswith(const std::string& str, const std::string& end) {
  48. if (str.length() < end.length()) return false;
  49. return str.compare(str.length() - end.length(), end.length(), end) == 0;
  50. }
  51. bool contains(const std::string& str, const std::string& sub) {
  52. if (str.length() < sub.length()) return false;
  53. return str.find(sub) != std::string::npos;
  54. }
  55. static inline int vscprintf(const char* fmt, va_list ap) {
  56. return vsnprintf(NULL, 0, fmt, ap);
  57. }
  58. std::string asprintf(const char* fmt, ...) {
  59. va_list ap;
  60. va_start(ap, fmt);
  61. int len = vscprintf(fmt, ap);
  62. va_end(ap);
  63. std::string str;
  64. str.reserve(len+1);
  65. // must resize to set str.size
  66. str.resize(len);
  67. // must recall va_start on unix
  68. va_start(ap, fmt);
  69. vsnprintf((char*)str.data(), len+1, fmt, ap);
  70. va_end(ap);
  71. return str;
  72. }
  73. StringList split(const std::string& str, char delim) {
  74. /*
  75. std::stringstream ss;
  76. ss << str;
  77. string item;
  78. StringList res;
  79. while (std::getline(ss, item, delim)) {
  80. res.push_back(item);
  81. }
  82. return res;
  83. */
  84. const char* p = str.c_str();
  85. const char* value = p;
  86. StringList res;
  87. while (*p != '\0') {
  88. if (*p == delim) {
  89. res.push_back(std::string(value, p-value));
  90. value = p+1;
  91. }
  92. ++p;
  93. }
  94. res.push_back(value);
  95. return res;
  96. }
  97. hv::KeyValue splitKV(const std::string& str, char kv_kv, char k_v) {
  98. enum {
  99. s_key,
  100. s_value,
  101. } state = s_key;
  102. const char* p = str.c_str();
  103. const char* key = p;
  104. const char* value = NULL;
  105. int key_len = 0;
  106. int value_len = 0;
  107. hv::KeyValue kvs;
  108. while (*p != '\0') {
  109. if (*p == kv_kv) {
  110. if (key_len && value_len) {
  111. kvs[std::string(key, key_len)] = std::string(value, value_len);
  112. key_len = value_len = 0;
  113. }
  114. state = s_key;
  115. key = p+1;
  116. }
  117. else if (*p == k_v) {
  118. state = s_value;
  119. value = p+1;
  120. }
  121. else {
  122. state == s_key ? ++key_len : ++value_len;
  123. }
  124. ++p;
  125. }
  126. if (key_len && value_len) {
  127. kvs[std::string(key, key_len)] = std::string(value, value_len);
  128. }
  129. return kvs;
  130. }
  131. std::string trim(const std::string& str, const char* chars) {
  132. std::string::size_type pos1 = str.find_first_not_of(chars);
  133. if (pos1 == std::string::npos) return "";
  134. std::string::size_type pos2 = str.find_last_not_of(chars);
  135. return str.substr(pos1, pos2-pos1+1);
  136. }
  137. std::string trimL(const std::string& str, const char* chars) {
  138. std::string::size_type pos = str.find_first_not_of(chars);
  139. if (pos == std::string::npos) return "";
  140. return str.substr(pos);
  141. }
  142. std::string trimR(const std::string& str, const char* chars) {
  143. std::string::size_type pos = str.find_last_not_of(chars);
  144. return str.substr(0, pos+1);
  145. }
  146. std::string trim_pairs(const std::string& str, const char* pairs) {
  147. const char* s = str.c_str();
  148. const char* e = str.c_str() + str.size() - 1;
  149. const char* p = pairs;
  150. bool is_pair = false;
  151. while (*p != '\0' && *(p+1) != '\0') {
  152. if (*s == *p && *e == *(p+1)) {
  153. is_pair = true;
  154. break;
  155. }
  156. p += 2;
  157. }
  158. return is_pair ? str.substr(1, str.size()-2) : str;
  159. }
  160. std::string replace(const std::string& str, const std::string& find, const std::string& rep) {
  161. std::string::size_type pos = 0;
  162. std::string::size_type a = find.size();
  163. std::string::size_type b = rep.size();
  164. std::string res(str);
  165. while ((pos = res.find(find, pos)) != std::string::npos) {
  166. res.replace(pos, a, rep);
  167. pos += b;
  168. }
  169. return res;
  170. }
  171. } // end namespace hv