chararray.h 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354
  1. /*
  2. *
  3. * Copyright (c) 2011, Jue Ruan <ruanjue@gmail.com>
  4. *
  5. *
  6. * This program is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  18. */
  19. #ifndef __STRING_RJ_H
  20. #define __STRING_RJ_H
  21. #include <stdio.h>
  22. #include <stdarg.h>
  23. #include <string.h>
  24. #include <stdlib.h>
  25. #include "list.h"
  26. #include "mem_share.h"
  27. /**
  28. * String
  29. */
  30. #ifdef HUGE_STRING
  31. typedef long int string_size_t;
  32. #else
  33. typedef int string_size_t;
  34. #endif
  35. typedef struct {
  36. union { char *string; char *buffer; };
  37. string_size_t size;
  38. string_size_t capacity;
  39. } String;
  40. typedef struct {
  41. char *string;
  42. string_size_t size;
  43. } VString;
  44. define_list(VStrv, VString);
  45. static inline String* init_string(string_size_t cap){
  46. String *str;
  47. str = (String*)malloc(sizeof(String));
  48. str->size = 0;
  49. str->capacity = (cap&0x1)? cap + 1 : cap + 2;
  50. str->string = (char*)malloc(sizeof(char) * (str->capacity));
  51. str->string[0] = 0;
  52. return str;
  53. }
  54. static inline size_t string_obj_desc_cnt(void *obj, int idx){
  55. return ((String*)obj)->size + 1;
  56. idx = idx;
  57. }
  58. static const obj_desc_t string_obj_desc = {"string_obj_desc", sizeof(String), 1, {1}, {offsetof(String, string)}, {(obj_desc_t*)&OBJ_DESC_DATA}, string_obj_desc_cnt, NULL};
  59. static inline unsigned int _string_size_roundup_power2(unsigned int v){
  60. v--;
  61. v |= v >> 1;
  62. v |= v >> 2;
  63. v |= v >> 4;
  64. v |= v >> 8;
  65. v |= v >> 16;
  66. return v + 1;
  67. }
  68. static inline void encap_string(String *str, string_size_t inc){
  69. if(inc + str->size + 1 > str->capacity){
  70. if(inc + str->size + 1 < 0xFFFFFFF){
  71. str->capacity = _string_size_roundup_power2(inc + str->size + 1);
  72. } else {
  73. str->capacity += (((inc + str->size + 1) - str->capacity + 0xFFFFFFF - 1) / 0xFFFFFFF) * 0xFFFFFFF;
  74. }
  75. str->string = (char*)realloc(str->string, str->capacity);
  76. }
  77. }
  78. static inline void recap_string(String *str, string_size_t cap){
  79. if(cap <= str->size) return;
  80. str->string = (char*)realloc(str->string, cap);
  81. str->capacity = cap;
  82. }
  83. static inline void uc_string(String *str){
  84. string_size_t i;
  85. for(i=0;i<str->size;i++){
  86. if(str->string[i] >= 'a' && str->string[i] <= 'z') str->string[i] = str->string[i] + 'A' - 'a';
  87. }
  88. }
  89. static inline void lc_string(String *str){
  90. string_size_t i;
  91. for(i=0;i<str->size;i++){
  92. if(str->string[i] >= 'A' && str->string[i] <= 'Z') str->string[i] = str->string[i] + 'a' - 'A';
  93. }
  94. }
  95. static inline char* substr(char *string, string_size_t len, char *dst){
  96. char *str;
  97. if(len < 0) len = strlen(string);
  98. if(dst != NULL) str = dst;
  99. else str = (char*)malloc(sizeof(char) * (len + 1));
  100. strncpy(str, string, len);
  101. str[len] = '\0';
  102. return str;
  103. }
  104. static inline char* catstr(string_size_t n_str, ...){
  105. char *str, *s;
  106. string_size_t i, len, inc;
  107. va_list params;
  108. len = 0;
  109. str = NULL;
  110. va_start(params, n_str);
  111. for(i=0;i<n_str;i++){
  112. s = va_arg(params, char*);
  113. if(s == NULL) continue;
  114. inc = strlen(s);
  115. str = realloc(str, len + inc + 1);
  116. memcpy(str + len, s, inc + 1);
  117. len += inc;
  118. }
  119. va_end(params);
  120. return str;
  121. }
  122. static inline void chomp_string(String *str){
  123. if(str->size && str->string[str->size - 1] == '\n'){
  124. str->size --;
  125. str->string[str->size] = 0;
  126. }
  127. }
  128. static inline void chomp_vstring(VString *str){
  129. if(str->size && str->string[str->size - 1] == '\n'){
  130. str->size --;
  131. }
  132. }
  133. static inline void trim_string(String *str){
  134. string_size_t i, j;
  135. i = str->size - 1;
  136. while(i >= 0 && (str->string[i] == '\n' || str->string[i] == '\t' || str->string[i] == ' ')) i--;
  137. str->size = i + 1;
  138. i = 0;
  139. while(i < str->size && (str->string[i] == '\n' || str->string[i] == '\t' || str->string[i] == ' ')) i++;
  140. if(i){
  141. for(j=i;j<str->size;j++){ str->string[j-i] = str->string[j]; }
  142. str->size -= i;
  143. }
  144. str->string[str->size] = 0;
  145. }
  146. static inline void trim_vstring(VString *str){
  147. string_size_t i;
  148. i = str->size - 1;
  149. while(i >= 0 && (str->string[i] == '\n' || str->string[i] == '\t' || str->string[i] == ' ')) i--;
  150. str->size = i + 1;
  151. i = 0;
  152. while(i < str->size && (str->string[i] == '\n' || str->string[i] == '\t' || str->string[i] == ' ')) i++;
  153. str->string += i;
  154. }
  155. static inline void append_string(String *str, char *src, string_size_t offlen){
  156. encap_string(str, offlen);
  157. memcpy(str->string + str->size, src, offlen);
  158. str->size += offlen;
  159. str->string[str->size] = 0;
  160. }
  161. static inline void append_char_string(String *str, char c, string_size_t num){
  162. encap_string(str, num);
  163. while(num-- > 0){ str->string[str->size ++] = c; }
  164. str->string[str->size] = 0;
  165. }
  166. static inline String* as_string(char *chs, string_size_t len){
  167. String *str;
  168. str = init_string(len);
  169. memcpy(str->string, chs, len);
  170. str->size = len;
  171. str->string[len] = 0;
  172. return str;
  173. }
  174. static inline VString* as_vstring(char *chs){
  175. string_size_t len;
  176. VString *str;
  177. len = strlen(chs);
  178. str = malloc(sizeof(VString));
  179. str->string = chs;
  180. str->size = len;
  181. return str;
  182. }
  183. static inline void add_char_string(String *str, char ch){
  184. encap_string(str, 1);
  185. str->string[str->size++] = ch;
  186. str->string[str->size] = 0;
  187. }
  188. #define push_string(str, ch) add_char_string(str, ch)
  189. static inline void add_int_string(String *str, long long val){
  190. string_size_t n;
  191. long long v;
  192. encap_string(str, 30);
  193. if(val == 0){
  194. str->string[str->size++] = '0';
  195. } else {
  196. if(val < 0){
  197. val = - val;
  198. str->string[str->size++] = '-';
  199. }
  200. v = val;
  201. for(n=0;v;n++) v /= 10;
  202. str->size += n;
  203. v = val;
  204. while(v){
  205. str->string[--str->size] = '0' + (v % 10);
  206. v /= 10;
  207. }
  208. str->size += n;
  209. }
  210. str->string[str->size] = 0;
  211. }
  212. static inline void clear_string(String *str){ str->size = 0; str->string[0] = 0; }
  213. static inline string_size_t split_string(String *str, char separator, VStrv *vstrs){
  214. VString *vstr;
  215. string_size_t n_tab, i, s;
  216. for(i=s=n_tab=0;i<str->size;i++){
  217. if(str->string[i] == separator){
  218. if(i > s){
  219. str->string[i] = '\0';
  220. vstr = next_ref_VStrv(vstrs);
  221. vstr->string = str->string + s;
  222. n_tab ++;
  223. vstr->size = i - s;
  224. }
  225. s = i + 1;
  226. }
  227. }
  228. if(i > s){
  229. str->string[i] = '\0';
  230. vstr = next_ref_VStrv(vstrs);
  231. vstr->string = str->string + s;
  232. n_tab ++;
  233. vstr->size = i - s;
  234. }
  235. return n_tab;
  236. }
  237. static inline string_size_t split_vstring(VString *str, char separator, VStrv *vstrs, string_size_t cut){
  238. VString *vstr;
  239. string_size_t n_tab, i, s;
  240. for(i=s=n_tab=0;i<str->size;i++){
  241. if(str->string[i] == separator){
  242. if(i > s){
  243. if(cut) str->string[i] = '\0';
  244. vstr = next_ref_VStrv(vstrs);
  245. vstr->string = str->string + s;
  246. n_tab ++;
  247. vstr->size = i - s;
  248. }
  249. s = i + 1;
  250. }
  251. }
  252. if(i > s){
  253. if(cut) str->string[i] = '\0';
  254. vstr = next_ref_VStrv(vstrs);
  255. vstr->string = str->string + s;
  256. n_tab ++;
  257. vstr->size = i - s;
  258. }
  259. return n_tab;
  260. }
  261. static inline void reverse_string(String *str){
  262. string_size_t i, j;
  263. char c;
  264. i = 0;
  265. j = str->size - 1;
  266. while(i < j){
  267. swap_tmp(str->string[i], str->string[j], c);
  268. i ++;
  269. j --;
  270. }
  271. }
  272. static inline void reverse_str(char *str, string_size_t len){
  273. string_size_t i, j;
  274. char c;
  275. i = 0;
  276. j = len - 1;
  277. while(i < j){
  278. swap_tmp(str[i], str[j], c);
  279. i ++;
  280. j --;
  281. }
  282. }
  283. static inline void tidy_string(String *src, String *dst, char ch){
  284. string_size_t i;
  285. encap_string(dst, src->size);
  286. for(i=0;i<src->size;i++){
  287. if(src->string[i] != ch){
  288. dst->string[dst->size ++] = src->string[i];
  289. }
  290. }
  291. dst->string[dst->size] = 0;
  292. }
  293. static inline string_size_t occ_str(char *str, string_size_t len, char c){
  294. string_size_t i, ret;
  295. for(i=ret=0;i<len;i++){
  296. if(str[i] == c) ret ++;
  297. }
  298. return ret;
  299. }
  300. static inline void trunc_string(String *str, string_size_t size){
  301. if(size >= str->size || size < 0) return;
  302. str->size = size;
  303. str->string[size] = 0;
  304. }
  305. static inline String* clone_string(String *str){
  306. String *clone;
  307. clone = init_string(str->size);
  308. append_string(clone, str->string, str->size);
  309. return clone;
  310. }
  311. static inline void free_string(String *str){ free(str->string); free(str); }
  312. static inline void free_vstring(VString *str){ free(str); }
  313. #endif