-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathc_string.c
523 lines (485 loc) · 13.2 KB
/
c_string.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
#include "c_string.h"
// Check For Vowel
static bool isvowel(const char ch)
{
if (isalpha(ch))
switch (ch)
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
case 'A':
case 'E':
case 'I':
case 'O':
case 'U':
return true;
default:
return false;
}
else
return false;
}
// Returning Substring of String
static string substring(const string source, const int start, int n)
{
int l = strlen(source);
if (start + n > l)
n = l - start;
string ret = (string)malloc(n + 1);
strncpy(ret, source + start, n);
ret[n] = NULL_CHAR;
return ret;
}
// Giving String in C (Essence of Java String)
static string getstring()
{
char ch[MAX_STR_SIZE];
scanf("%[^\n]s", ch);
getchar();
string ret = substring(ch,0,strlen(ch) + 1);
return ret;
}
// Checking for number of occurrences of Particular Character in String
static int occur(const string s, const int k)
{
int ctr = 0;
for (int i = 0; s[i] != NULL_CHAR; i++)
if (s[i] == k)
ctr++;
return ctr;
}
// Splitting String according to given Delimeter and Returning an Array of String (Essence of Java String.split() method)
static string *split_array(const string s, const string exp, int *size)
{
*size = occur(s, exp[0]) + 1;
string *rstr = (string *)malloc(sizeof(string) * (*size + 1));
int i = 0;
*(rstr + i) = strtok(s, exp);
while (*(rstr + i) != NULL)
{
i++;
*(rstr + i) = strtok(NULL, exp);
}
return rstr;
}
static void insert_split(node_split **s, node_split **e, string str)
{
int l = strlen(str);
if (*s != NULL)
{
node_split *t = (node_split *)malloc(sizeof(node_split));
t->s = (string)malloc(l);
strcpy(t->s, str);
t->l = NULL;
(*e)->l = t;
*e = (*e)->l;
}
else
{
*s = (node_split *)malloc(sizeof(node_split) + l);
(*s)->s = (string)malloc(l);
strcpy((*s)->s, str);
(*s)->l = NULL;
*e = *s;
}
}
// Splitting String as per expression and returning a link list contains splitted parts
static node_split *split_link(const string str, const string exp, node_split **e)
{
node_split *s = NULL;
*e = NULL;
string ch;
ch = strtok(str, exp);
while (ch != NULL)
{
insert_split(&s, e, ch);
ch = strtok(NULL, exp);
}
return s;
}
// Trimming beginning of string for space
static string trimleft(string str)
{
int i = 0;
while (str[i] == SPACE_CHAR && str[i] != NULL_CHAR)
i++;
return str + i;
}
// Trimming end of string for space
static string trimright(string str)
{
int i = strlen(str) - 1;
while (str[i] == SPACE_CHAR && i >= 0)
i--;
str[i] = NULL_CHAR;
return str;
}
// Trimming Beginning and End of String for Spaces
static string trim(string str)
{
str = trimleft(str);
str = trimright(str);
return str;
}
// Trimming beginning of string for space
static string trimleftforchar(string str, int ch)
{
int i = 0;
while (str[i] == ch && str[i] != NULL_CHAR)
i++;
return str + i;
}
// Return Binary String Of Primitive Data Types
static string tobinarystring(const void *data, size_t size)
{
string ret = (string)malloc(8 * size);
int i = 0, k = 0;
unsigned char ch2 = 1 << 7;
unsigned char ch1;
while (k < size)
{
ch1 = *((char *)data + (size - (k + 1)));
for (int j = 0; j < 8; j++, i++)
{
ret[i] = ch1 & ch2 ? 49 : 48;
ch1 <<= 1;
}
k++;
}
ret[i] = NULL_CHAR;
ret = trimleftforchar(ret, '0');
return ret;
}
// Return Index Of String in String if
static int indexof(const string str, const string key)
{
char *ch = strstr(str, key);
if (ch != NULL)
return ch - str;
return -1;
}
// Return Indexes of All Occurrences of String in String
static int *indexofall(const string str, const string key, int *size)
{
*size = 0;
char *ch = strstr(str, key);
if (ch != NULL)
{
int *ptr1, *ptr2;
int k = 0;
ptr1 = (int *)malloc(sizeof(int) * strlen(str));
*(ptr1 + k) = ch - str;
while (ch != NULL)
{
ch = strstr(ch + 1, key);
k++;
*(ptr1 + k) = ch - str;
}
*size = k;
ptr2 = (int *)malloc(sizeof(int) * k);
for (int i = 0; i < k; i++)
ptr2[i] = ptr1[i];
free(ptr1);
return ptr2;
}
return NULL;
}
// Return Last Index Of String in String if
static int lastindexof(const string str, const string key)
{
string temp = (string)malloc(strlen(str) + 1);
strcpy(temp,str);
char ch = key[0];
char *lIndCh = strrchr(temp,ch);
if (lIndCh == NULL)
{
free(temp);
return -1;
}
int lenKey = strlen(key);
while (lIndCh != NULL)
{
if (strlen(lIndCh) < lenKey)
continue;
if (strncmp(lIndCh,key,lenKey) == 0)
{
int retVal = lIndCh - temp;
free(temp);
return retVal;
}
temp[lIndCh - temp] = NULL_CHAR;
lIndCh = strrchr(temp,ch);
}
free(temp);
return -1;
}
// Return Index Of Character in String if
static int indexofchar(const string str, const int key)
{
char *ch = strchr(str, key);
if (ch != NULL)
return ch - str;
return -1;
}
// Return Last Index Of Char in String
static int lastindexofchar(const string str, const int key)
{
char *ch = strrchr(str, key);
if (ch != NULL)
return ch - str;
return -1;
}
// Return Indexes of All Occurrences of Character in String
static int *indexofallchar(const string str, const int key, int *size)
{
*size = 0;
char *ch = strchr(str, key);
if (ch != NULL)
{
int *ptr1, *ptr2;
int k = 0;
ptr1 = (int *)malloc(sizeof(int) * strlen(str));
*(ptr1 + k) = ch - str;
while (ch != NULL)
{
ch = strchr(ch + 1, key);
k++;
*(ptr1 + k) = ch - str;
}
*size = k;
ptr2 = (int *)malloc(sizeof(int) * k);
for (int i = 0; i < k; i++)
ptr2[i] = ptr1[i];
free(ptr1);
return ptr2;
}
return NULL;
}
// Return Index Of String in String From Offset (Included)
static int indexoffrom(const string str, const string key, const int offset)
{
if (offset <= 0)
return indexof(str,key);
char *ch = strstr(str + offset, key);
if (ch != NULL)
return ch - str;
return -1;
}
// Return Index Of String in String Upto maxset (Included)
static int indexofupto(const string str, const string key, const int maxset)
{
if (maxset >= strlen(str))
return indexof(str,key);
char *ch = strstr(str, key);
if (ch != NULL && (ch - str) <= maxset)
return ch - str;
return -1;
}
// Return Index Of String in String In Between offset, maxset (Both Included)
static int indexofbetween(const string str, const string key, const int offset, const int maxset)
{
if (offset <= 0)
return indexofupto(str,key,maxset);
int ind = indexoffrom(str,key,offset);
return ind <= maxset ? ind : -1;
}
// Return Last Index Of String in String From Offset (Included)
static int lastindexoffrom(const string str, const string key, const int offset)
{
int ind = lastindexof(str + (offset < 0 ? 0 : offset),key);
return ind < offset ? -1 : ind;
}
// Return Last Index Of String in String Upto maxset (Included)
static int lastindexofupto(const string str, const string key, const int maxset)
{
if (maxset >= strlen(str))
return lastindexof(str,key);
string temp = (string)malloc(maxset + 1);
strncpy(temp,str,maxset);
temp[maxset] = NULL_CHAR;
int ind = lastindexof(temp,key);
free(temp);
return ind;
}
// Return Last Index Of String in String In Between offset, maxset (Both Included)
static int lastindexofbetween(const string str, const string key, const int offset, const int maxset)
{
if (offset <= 0)
return lastindexofupto(str,key,maxset);
string temp = (string)malloc(maxset - offset + 2);
strncpy(temp,str + offset,maxset - offset + 1);
temp[maxset - offset + 1] = NULL_CHAR;
int ind = lastindexof(temp,key);
free(temp);
return ind != -1 ? ind + offset : ind;
}
// Return All Index Of String in String From Offset (Included)
static int *allindexoffrom(const string str, const string key, const int offset, int *size)
{
if (offset <= 0)
return indexofall(str,key,size);
int *ind = indexofall(str + offset,key,size);
for (int i = 0; i < *size; i++)
ind[i] += offset;
return ind;
}
// Return All Index Of String in String Upto maxset (Included)
static int *allindexofupto(const string str, const string key, const int maxset, int *size)
{
if (maxset >= strlen(str))
return indexofall(str,key,size);
string temp = (string)malloc(maxset + 1);
strncpy(temp,str,maxset);
temp[maxset] = NULL_CHAR;
int *ind = indexofall(temp,key,size);
free(temp);
return ind;
}
// Return All Index Of String in String In Between offset, maxset (Both Included)
static int *allindexofbetween(const string str, const string key, const int offset, const int maxset, int *size)
{
if (offset <= 0)
return allindexofupto(str,key,maxset,size);
string temp = (string)malloc(maxset - offset + 2);
strncpy(temp,str + offset,maxset - offset + 1);
temp[maxset - offset + 1] = NULL_CHAR;
int *ind = indexofall(temp,key,size);
free(temp);
for (int i = 0; i < *size; i++)
ind[i] += offset;
return ind;
}
// Return Index Of char in String From Offset (Included)
static int indexofcharfrom(const string str, const int key, const int offset)
{
if (offset <= 0)
return indexofchar(str,key);
char *ch = strchr(str + offset, key);
if (ch != NULL)
return ch - str;
return -1;
}
// Return Index Of char in String Upto maxset (Included)
static int indexofcharupto(const string str, const int key, const int maxset)
{
if (maxset >= strlen(str))
return indexofchar(str,key);
char *ch = strchr(str, key);
if (ch != NULL && (ch - str) <= maxset)
return ch - str;
return -1;
}
// Return Index Of char in String in between offset, maxset (Both Included)
static int indexofcharbetween(const string str, const int key, const int offset, const int maxset)
{
if (offset <= 0)
return indexofcharupto(str,key,maxset);
int ind = indexofcharfrom(str,key,offset);
return ind <= maxset ? ind : -1;
}
// Return Last Index Of char in String From Offset (Included)
static int lastindexofcharfrom(const string str, const int key, const int offset)
{
if (offset <= 0)
return lastindexofchar(str,key);
char *ch = strrchr(str + offset, key);
if (ch != NULL)
return ch - str;
return -1;
}
// Return Last Index Of char in String Upto maxset (Included)
static int lastindexofcharupto(const string str, const int key, const int maxset)
{
if (maxset >= strlen(str))
return lastindexofchar(str,key);
int retVal = -1;
string temp = (string)malloc(maxset + 1);
strncpy(temp,str,maxset);
char *ch = strrchr(temp, key);
if (ch != NULL && (ch - temp) <= maxset)
retVal = ch - temp;
free(temp);
return retVal;
}
// Return Last Index Of char in String in between offset, maxset (Both Included)
static int lastindexofcharbetween(const string str, const int key, const int offset, const int maxset)
{
if (offset <= 0)
return lastindexofcharupto(str,key,maxset);
string temp = (string)malloc(maxset - offset + 2);
strncpy(temp,str + offset,maxset - offset + 1);
temp[maxset - offset + 1] = NULL_CHAR;
int ind = lastindexofchar(temp,key);
free(temp);
return ind != -1 ? ind + offset : ind;
}
// Return Index Of char in String From Offset (Included)
static int *allindexofcharfrom(const string str, const int key, const int offset, int *size)
{
return indexofallchar(str + (offset < 0 ? 0 : offset),key,size);
}
// Return Index Of char in String Upto maxset (Included)
static int *allindexofcharupto(const string str, const int key, const int maxset, int *size)
{
if (maxset >= strlen(str))
return indexofallchar(str,key,size);
string temp = (string)malloc(maxset + 1);
strncpy(temp,str,maxset);
temp[maxset] = NULL_CHAR;
int *ind = indexofallchar(temp,key,size);
free(temp);
return ind;
}
// Return Index Of char in String in between offset, maxset (Both Included)
static int *allindexofcharbetween(const string str, const int key, const int offset, const int maxset, int *size)
{
if (offset <= 0)
return allindexofcharupto(str,key,maxset,size);
string temp = (string)malloc(maxset - offset + 2);
strncpy(temp,str + offset,maxset - offset + 1);
temp[maxset - offset + 1] = NULL_CHAR;
int *ind = indexofallchar(temp,key,size);
free(temp);
for (int i = 0; i < *size; i++)
ind[i] += offset;
return ind;
}
const GLOBAL_STRING_OBJECT String =
{
getstring,
substring,
trimleft,
trimright,
trim,
tobinarystring,
occur,
indexof,
indexofall,
lastindexof,
indexofchar,
lastindexofchar,
indexofallchar,
split_array,
//split_link,
indexoffrom,
indexofupto,
indexofbetween,
lastindexoffrom,
lastindexofupto,
lastindexofbetween,
allindexoffrom,
allindexofupto,
allindexofbetween,
indexofcharfrom,
indexofcharupto,
indexofcharbetween,
lastindexofcharfrom,
lastindexofcharupto,
lastindexofcharbetween,
allindexofcharfrom,
allindexofcharupto,
allindexofcharbetween
};