-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfuncs.c
More file actions
167 lines (148 loc) · 2.99 KB
/
funcs.c
File metadata and controls
167 lines (148 loc) · 2.99 KB
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
#include "funcs.h"
#include <ctype.h>
#include <stdarg.h>
#include <stdio.h>
#include <string.h>
size_t first_non_empty_char(const char *str)
{
size_t i = 0;
while (str[i] != '\0' && str[i] == ' ') {
i++;
}
if (str[i] == '\0')
return -1;
return i;
}
size_t index_of_char(const char *str, char c)
{
size_t i = -1;
char *ret = strchr(str, c);
if (ret == NULL)
return i;
i = ret - str;
return i;
}
char *replace_sub_str(const char *original, size_t start, size_t end, const char *replacement)
{
size_t o_len = strlen(original) - 1;
size_t r_len = strlen(replacement) - 1;
size_t new_len = o_len - (end - start) + r_len;
char *new_str = malloc(sizeof(char) * new_len + 1);
if (new_str == NULL) {
return NULL;
}
strncpy(new_str, original, start);
new_str[start] = '\0'; // ensure a valid c str
strcat(new_str, replacement);
strcat(new_str, original + end);
return new_str;
}
char *copy_sub_str(const char *source, char delimiter)
{
size_t idx = index_of_char(source, delimiter);
if (idx == -1) {
return strdup(source);
}
char *dest = (char *)malloc((idx + 1));
if (dest == NULL) {
fprintf(stderr, "failed to allocate memory\n");
exit(EXIT_FAILURE);
}
strncpy(dest, source, idx);
dest[idx] = '\0';
return dest;
}
char *copy_sub_str_offset(const char *source, size_t offset)
{
size_t len = strlen(source);
if (offset >= len)
return strdup("");
size_t sub_len = len - offset;
char *sub_str = (char *)malloc(sub_len + 1);
strcpy(sub_str, source + offset);
return sub_str;
}
char *ltrim(char *s)
{
while (isspace(*s))
s++;
return s;
}
char *rtrim(char *s)
{
char *back = s + strlen(s);
while (back > s && isspace(*(back - 1)))
back--;
*back = '\0';
return s;
}
char *trim(char *s)
{
return rtrim(ltrim(s));
}
void print_bits(uint32_t bits)
{
for (int i = 0; i < 32; i++) {
uint8_t mask = 1 << i;
uint8_t bit = (bits & mask) >> i;
printf("%u", bit);
}
}
char *str_tolower(char *str)
{
for (char *p = str; *p; p++)
*p = tolower(*p);
return str;
}
char *str_toupper(char *str)
{
for (char *p = str; *p; p++)
*p = toupper(*p);
return str;
}
int isnewline_or_space(char *str)
{
int isblank = -1;
char *s;
for (s = str; *s != '\0'; s++) {
if (!isspace(*s)) {
isblank = 0;
break;
}
}
return isblank;
}
// HACK: Don't need anything fancy, just assume that digits are reasonable sized
int num_digits(size_t num)
{
if (num < 0) {
fprintf(stderr, "Runner counnt is less than zero\n");
}
if (num < 10)
return 1;
if (num < 100)
return 2;
if (num < 1000)
return 3;
if (num < 10000)
return 4;
if (num < 100000)
return 5;
if (num < 1000000)
return 6;
if (num < 10000000)
return 7;
if (num < 100000000)
return 8;
if (num < 1000000000)
return 9;
return 10;
}
int get_substr_index(const char *str, const char *sub_str)
{
char *result = strstr(str, sub_str);
if (result) {
return result - str;
}
return -1;
}