dataString.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475
  1. /*
  2. * This file is part of the PikaPython project.
  3. * http://github.com/pikastech/pikapython
  4. *
  5. * MIT License
  6. *
  7. * Copyright (c) 2021 lyon liang6516@outlook.com
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a
  10. * copy of this software and associated documentation files (the "Software"),
  11. * to deal in the Software without restriction, including without limitation
  12. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  13. * and/or sell copies of the Software, and to permit persons to whom the
  14. * Software is furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  22. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  24. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  25. * DEALINGS IN THE SOFTWARE.
  26. */
  27. #include "dataString.h"
  28. #include "PikaPlatform.h"
  29. #include "dataMemory.h"
  30. char* strCut(char* strOut, char* strIn, char startSign, char endSign) {
  31. int32_t Size = strGetSize(strIn);
  32. int32_t iStart = 0;
  33. int32_t iEnd = Size;
  34. uint8_t isStart = 0;
  35. uint8_t isEnd = 0;
  36. for (int32_t i = 0; i < Size; i++) {
  37. if (strIn[i] == startSign) {
  38. iStart = i;
  39. isStart = 1;
  40. break;
  41. }
  42. }
  43. for (int32_t i = Size - 1; i >= 0; i--) {
  44. if (strIn[i] == endSign) {
  45. iEnd = i;
  46. isEnd = 1;
  47. break;
  48. }
  49. }
  50. int outi = 0;
  51. for (int32_t i = iStart + 1; i < iEnd; i++) {
  52. strOut[outi] = strIn[i];
  53. outi++;
  54. }
  55. /* add \0 */
  56. strOut[outi] = 0;
  57. if (isStart && isEnd) {
  58. /* succeed */
  59. return strOut;
  60. }
  61. /* failed */
  62. return NULL;
  63. }
  64. char* strDeleteChar(char* strOut, char* strIn, char ch) {
  65. int32_t iOut = 0;
  66. uint32_t size = strGetSize(strIn);
  67. for (uint32_t i = 0; i < size; i++) {
  68. if (ch == strIn[i]) {
  69. continue;
  70. }
  71. strOut[iOut] = strIn[i];
  72. iOut++;
  73. }
  74. /* add \0 */
  75. strOut[iOut] = 0;
  76. return strOut;
  77. }
  78. char* strAppendWithSize(char* strOut, char* pData, int32_t Size) {
  79. int32_t strOut_i = strGetSize(strOut);
  80. for (int32_t i = 0; i < Size; i++) {
  81. strOut[strOut_i + i] = pData[i];
  82. }
  83. strOut_i += Size;
  84. // add \0 to the end of strOut
  85. strOut[strOut_i] = 0;
  86. return strOut;
  87. }
  88. const char bracketStart[] = {'(', '[', '{', '\'', '\"'};
  89. const char bracketEnd[] = {')', ']', '}', '\'', '\"'};
  90. #define BRACKET_TYPE_NUM (sizeof(bracketStart) / sizeof(char))
  91. int _strCountSign(char* strIn, char sign, pika_bool bracketDepth0) {
  92. pika_assert(NULL != strIn);
  93. int32_t iCount = 0;
  94. int32_t iTotalDepth = 0;
  95. pika_bool bEscaped = pika_false;
  96. for (size_t i = 0; strIn[i] != '\0'; i++) {
  97. if (!bracketDepth0) {
  98. if (strIn[i] == sign) {
  99. iCount++;
  100. }
  101. continue;
  102. }
  103. char cCurrentChar = strIn[i];
  104. if (cCurrentChar == '\\') {
  105. bEscaped = !bEscaped;
  106. continue;
  107. }
  108. if (!bEscaped) {
  109. for (int j = 0; j < BRACKET_TYPE_NUM; j++) {
  110. if (cCurrentChar == bracketStart[j]) {
  111. iTotalDepth++;
  112. } else if (cCurrentChar == bracketEnd[j]) {
  113. iTotalDepth--;
  114. }
  115. }
  116. }
  117. if (cCurrentChar == sign && iTotalDepth == 0) {
  118. iCount++;
  119. }
  120. bEscaped = pika_false;
  121. }
  122. return iCount;
  123. }
  124. int32_t strCountSign(char* strIn, char sign) {
  125. return _strCountSign(strIn, sign, 0);
  126. }
  127. int32_t strGetLineNum(char* strIn) {
  128. return strCountSign(strIn, '\n') + 1;
  129. }
  130. char* strReplaceChar(char* strIn, char src, char dst) {
  131. while (*strIn) {
  132. if (*strIn == src) {
  133. *strIn = dst;
  134. }
  135. strIn++;
  136. }
  137. return strIn;
  138. }
  139. int32_t strGetTokenNum(char* strIn, char sign) {
  140. return strCountSign(strIn, sign) + 1;
  141. }
  142. size_t strGetSize(char* pData) {
  143. pika_assert(pData != NULL);
  144. return strlen(pData);
  145. }
  146. char* strPointToLastToken(char* strIn, char sign) {
  147. pika_assert(NULL != strIn);
  148. if (!strIsContain(strIn, sign)) {
  149. return strIn;
  150. }
  151. int32_t size = strGetSize(strIn);
  152. for (int32_t i = size - 1; i > -1; i--) {
  153. if (strIn[i] == sign) {
  154. return strIn + i + 1;
  155. }
  156. }
  157. return strIn;
  158. }
  159. char* strPopLastToken(char* strIn, char sign) {
  160. char* last_token = strPointToLastToken(strIn, sign);
  161. if (last_token != strIn) {
  162. *(last_token - 1) = 0;
  163. }
  164. return last_token;
  165. }
  166. char* strGetLastToken(char* strOut, char* strIn, char sign) {
  167. int32_t size = strGetSize(strIn);
  168. int32_t buffSize = 0;
  169. for (int32_t i = size - 1; i > -1; i--) {
  170. if (strIn[i] != sign) {
  171. strOut[size - i - 1] = strIn[i];
  172. buffSize++;
  173. }
  174. if (strIn[i] == sign) {
  175. break;
  176. }
  177. }
  178. int32_t i = 0;
  179. for (i = 0; i < buffSize / 2; i++) {
  180. char buff = strOut[i];
  181. strOut[i] = strOut[buffSize - i - 1];
  182. strOut[buffSize - i - 1] = buff;
  183. }
  184. strOut[buffSize] = 0;
  185. return strOut;
  186. }
  187. char* strPopFirstToken(char** strIn, char sign) {
  188. char* strIn_ = *strIn;
  189. char* pos = strchr(strIn_, sign);
  190. if (pos != NULL) {
  191. /* found the first sign */
  192. *pos = 0;
  193. *strIn = pos + 1;
  194. return strIn_;
  195. }
  196. /* no found */
  197. *strIn = strchr(strIn_, 0);
  198. return strIn_;
  199. }
  200. char* strGetFirstToken(char* strOut, char* strIn, char sign) {
  201. int32_t size = strGetSize(strIn);
  202. for (int32_t i = 0; i < size; i++) {
  203. if (strIn[i] != sign) {
  204. strOut[i] = strIn[i];
  205. }
  206. if (strIn[i] == sign) {
  207. break;
  208. }
  209. }
  210. return strOut;
  211. }
  212. char* strAppend(char* strOut, char* pData) {
  213. uint32_t Size = 0;
  214. Size = strGetSize(pData);
  215. return strAppendWithSize(strOut, pData, Size);
  216. }
  217. int32_t strIsStartWith(char* str, char* strStart) {
  218. if (NULL == str || NULL == strStart) {
  219. /* input is null */
  220. return 0;
  221. }
  222. /* fast return */
  223. if (str[0] != strStart[0]) {
  224. return 0;
  225. }
  226. uint32_t size = strGetSize(strStart);
  227. if (0 == strncmp(str, strStart, size)) {
  228. return 1;
  229. }
  230. return 0;
  231. }
  232. int32_t strEqu(char* str1, char* str2) {
  233. if (NULL == str1 || NULL == str2) {
  234. return 0;
  235. }
  236. if (str1[0] != str2[0]) {
  237. /* fast return */
  238. return 0;
  239. }
  240. return !strcmp(str1, str2);
  241. }
  242. char* strRemovePrefix(char* inputStr, char* prefix, char* outputStr) {
  243. if (!strIsStartWith(inputStr, prefix)) {
  244. return NULL;
  245. }
  246. size_t len = strGetSize(inputStr);
  247. for (uint32_t i = strGetSize(prefix); i < len; i++) {
  248. outputStr[i - strGetSize(prefix)] = inputStr[i];
  249. }
  250. return outputStr;
  251. }
  252. int32_t strIsContain(char* str, char ch) {
  253. pika_assert(NULL != str);
  254. while (*str) {
  255. if (*str == ch) {
  256. return 1;
  257. }
  258. str++;
  259. }
  260. return 0;
  261. }
  262. char* strCopy(char* strBuff, char* strIn) {
  263. if ('\0' == strIn[0]) {
  264. return strBuff;
  265. }
  266. pika_platform_memcpy(strBuff, strIn, strGetSize(strIn) + 1);
  267. return strBuff;
  268. }
  269. int32_t strGetLineSize(char* str) {
  270. int i = 0;
  271. while (1) {
  272. if (str[i] == '\n') {
  273. return i;
  274. }
  275. i++;
  276. }
  277. }
  278. char* strGetLine(char* strOut, char* strIn) {
  279. int32_t lineSize = strGetLineSize(strIn);
  280. pika_platform_memcpy(strOut, strIn, lineSize);
  281. strOut[lineSize] = 0;
  282. return strOut;
  283. }
  284. char* strGetLastLine(char* strOut, char* strIn) {
  285. int32_t size = strGetSize(strIn);
  286. char sign = '\n';
  287. uint32_t beginIndex = 0;
  288. /* skip the latest '\n' */
  289. for (int32_t i = size - 2; i > -1; i--) {
  290. if (strIn[i] == sign) {
  291. beginIndex = i + 1;
  292. break;
  293. }
  294. }
  295. pika_platform_memcpy(strOut, strIn + beginIndex, size - beginIndex);
  296. strOut[size - beginIndex + 1] = 0;
  297. return strOut;
  298. }
  299. int strPathFormat(char* input, char* output) {
  300. int len = strlen(input);
  301. int i = 0;
  302. int j = 0;
  303. for (i = 0; i < len; i++) {
  304. if (input[i] == '\\') {
  305. output[j++] = '/';
  306. } else {
  307. output[j++] = input[i];
  308. }
  309. }
  310. output[j] = '\0';
  311. return j;
  312. }
  313. int strPathJoin(char* input1, char* input2, char* output) {
  314. /* format */
  315. size_t input1_len = strlen(input1);
  316. size_t input2_len = strlen(input2);
  317. /* if input1 is all space */
  318. if (input1_len == 0) {
  319. strPathFormat(input2, output);
  320. return 0;
  321. }
  322. char* input1_format = (char*)pikaMalloc(input1_len + 1);
  323. char* input2_format = (char*)pikaMalloc(input2_len + 1);
  324. strPathFormat(input1, input1_format);
  325. strPathFormat(input2, input2_format);
  326. /* join */
  327. int len1 = strlen(input1_format);
  328. int len2 = strlen(input2_format);
  329. int i = 0;
  330. int j = 0;
  331. for (i = 0; i < len1; i++) {
  332. output[j++] = input1_format[i];
  333. }
  334. if (input1_format[len1 - 1] != '/') {
  335. output[j++] = '/';
  336. }
  337. if (input2_format[0] == '/') {
  338. i = 1;
  339. } else {
  340. i = 0;
  341. }
  342. for (; i < len2; i++) {
  343. output[j++] = input2_format[i];
  344. }
  345. output[j] = '\0';
  346. /* free */
  347. pikaFree(input1_format, input1_len + 1);
  348. pikaFree(input2_format, input2_len + 1);
  349. return j;
  350. }
  351. int strPathGetFolder(char* input, char* output) {
  352. size_t input_len = strlen(input);
  353. char* input_format = (char*)pikaMalloc(input_len + 1);
  354. strPathFormat(input, input_format);
  355. int len = strlen(input_format);
  356. int i = 0;
  357. int j = 0;
  358. for (i = 0; i < len; i++) {
  359. if (input_format[i] == '/') {
  360. j = i;
  361. }
  362. }
  363. for (i = 0; i < j; i++) {
  364. output[i] = input_format[i];
  365. }
  366. output[i] = '\0';
  367. pikaFree(input_format, input_len + 1);
  368. return i;
  369. }
  370. int strPathGetFileName(char* input, char* output) {
  371. if (!strIsContain(input, '/') && !strIsContain(input, '\\')) {
  372. strCopy(output, input);
  373. return 0;
  374. };
  375. size_t input_len = strlen(input);
  376. char* input_format = (char*)pikaMalloc(input_len + 1);
  377. strPathFormat(input, input_format);
  378. int len = strlen(input_format);
  379. int i = 0;
  380. int j = 0;
  381. for (i = 0; i < len; i++) {
  382. if (input_format[i] == '/') {
  383. j = i;
  384. }
  385. }
  386. for (i = j + 1; i < len; i++) {
  387. output[i - j - 1] = input_format[i];
  388. }
  389. output[i - j - 1] = '\0';
  390. pikaFree(input_format, input_len + 1);
  391. return i - j - 1;
  392. }
  393. int strGetIndent(char* string) {
  394. int indent = 0;
  395. int len = strGetSize(string);
  396. for (int j = 0; j < len; j++) {
  397. if (string[j] == ' ') {
  398. indent++;
  399. } else {
  400. return indent;
  401. }
  402. }
  403. return indent;
  404. }
  405. int charIsBlank(char ch) {
  406. if (ch == ' ' || ch == '\t' || ch == '\r' || ch == '\n') {
  407. return 1;
  408. }
  409. return 0;
  410. }
  411. int strIsBlank(char* string) {
  412. int len = strGetSize(string);
  413. for (int j = 0; j < len; j++) {
  414. if (!charIsBlank(string[j])) {
  415. return 0;
  416. }
  417. }
  418. return 1;
  419. }
  420. int strOnly(char* string, char ch) {
  421. int len = strGetSize(string);
  422. if (len == 0) {
  423. return 0;
  424. }
  425. for (int j = 0; j < len; j++) {
  426. if (string[j] != ch) {
  427. return 0;
  428. }
  429. }
  430. return 1;
  431. }
  432. char* strFind(char* string, char ch) {
  433. int len = strGetSize(string);
  434. for (int j = 0; j < len; j++) {
  435. if (string[j] == ch) {
  436. return string + j;
  437. }
  438. }
  439. return NULL;
  440. }