Spool/spool.cpp at master · nickcharles/Spool · GitHub

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
#include "spool.h"

using std::size_t;
using std::string;

bool sp_contains(const string& input, const string& phrase) {
    if (input.find(phrase) == string::npos) {
        return false;
    }
    return true;
}

bool sp_containsAfter(const string& input, const string& phrase, size_t offset) {
    if (input.find(phrase, offset) == string::npos) {
        return false;
    }
    return true;
}

bool sp_containsBefore(const string& input, const string& phrase, size_t offset) {
    if (input.rfind(phrase, offset) == string::npos) {
        return false;
    }
    return true;
}

bool sp_startsWith(const string& input, const string& phrase) {
    if (phrase.size() > input.size()) {
        return false;
    }
    for (size_t i = 0; i < phrase.size(); ++i) {
        if (input[i] != phrase[i]) {
            return false;
        }
    }
    return true;
}

bool sp_startsWith(const string& input, const string& phrase, size_t offset) {
    if (phrase.size() > input.size() - offset) {
        return false;
    }
    for (size_t  i = 0; i < phrase.size(); ++i) {
        if (input[offset + i] != phrase[i]) {
            return false;
        }
    }
    return true;
}

bool sp_startsWithIgnoreCase(const string& input, const string& phrase) {
    if (phrase.size() > input.size()) {
        return false;
    }
    for (size_t i = 0; i < phrase.size(); ++i) {
        if (tolower(input[i]) != tolower(phrase[i])) {
            return false;
        }
    }
    return true;
}

bool sp_startsWithIgnoreCase(const string& input, const string& phrase, size_t offset) {
    if (phrase.size() > input.size() - offset) {
        return false;
    }
    for (size_t  i = 0; i < phrase.size(); ++i) {
        if (tolower(input[offset + i]) != tolower(phrase[i])) {
            return false;
        }
    }
    return true;
}

bool sp_endsWith(const string& input, const string& phrase) {
    if (phrase.size() > input.size()) {
        return false;
    }
    for (size_t i = 0; i < phrase.size(); ++i) {
        if (input[input.size() - i] != phrase[phrase.size() - i]) {
            return false;
        }
    }
    return true;
}

bool sp_endsWith(const string& input, const string& phrase, size_t offset) {
    if (phrase.size() > input.size() - offset) {
        return false;
    }
    for (size_t i = 0; i < phrase.size(); ++i) {
        if (input[input.size() - offset - i] != phrase[phrase.size() - i]) {
            return false;
        }
    }
    return true;
}

bool sp_endsWithIgnoreCase(const string& input, const string& phrase) {
    if (phrase.size() > input.size()) {
        return false;
    }
    for (size_t i = 0; i < phrase.size(); ++i) {
        if (tolower(input[input.size() - i]) != tolower(phrase[phrase.size() - i])) {
            return false;
        }
    }
    return true;
}

bool sp_endsWithIgnoreCase(const string& input, const string& phrase, size_t offset) {
    if (phrase.size() > input.size() - offset) {
        return false;
    }
    for (size_t i = 0; i < phrase.size(); ++i) {
        if (tolower(input[input.size() - offset - i]) != tolower(phrase[phrase.size() - i])) {
            return false;
        }
    }
    return true;
}


bool sp_equalsIgnoreCase(const string& first, const string& second) {
    if (first.size() != second.size()) {
        return false;
    }
    for (size_t i = 0; i < first.size(); ++i) {
        if (tolower(first[i]) != tolower(second[i])) {
            return false;
        }
    }
    return true;
}

bool sp_isAlnum(const string& input) {
    if (input.empty()) {
        return false;
    }
    for (size_t i = 0; i < input.size(); ++i) {
        if (!isalnum(input[i])) {
            return false;
        }
    }
    return true;
}

bool sp_isAlpha(const string& input) {
    if (input.empty()) {
        return false;
    }
    for (size_t i = 0; i < input.size(); ++i) {
        if (!isalpha(input[i])) {
            return false;
        }
    }
    return true;
}

bool sp_isDigit(const string& input) {
    if (input.empty()) {
        return false;
    }
    for (size_t i = 0; i < input.size(); ++i) {
        if (!isdigit(input[i])) {
            return false;
        }
    }
    return true;
}

bool sp_isLower(const string& input) {
    if (input.empty()) {
        return false;
    }
    for (size_t i = 0; i < input.size(); ++i) {
        if (!islower(input[i])) {
            return false;
        }
    }
    return true;
}

bool sp_isUpper(const string& input) {
    if (input.empty()) {
        return false;
    }
    for (size_t i = 0; i < input.size(); ++i) {
        if (!isupper(input[i])) {
            return false;
        }
    }
    return true;
}

string sp_replace(string input, const string& target, const string& replacement) {
    if (target.size() > input.size()) {
        return input;
    }
    size_t pos = input.find(target);
    while (pos != string::npos) {
        input = input.replace(pos, target.size(), replacement);
        pos = input.find(target);
    }
    return input;
}

string sp_replaceFirst(string input, const string& target, const string& replacement) {
    if (target.size() > input.size()) {
        return input;
    }
    return input.replace(input.find(target), target.size(), replacement);
}

string sp_replaceLast(string input, const string& target, const string& replacement) {
    if (target.size() > input.size()) {
        return input;
    }
    return input.replace(input.rfind(target), target.size(), replacement);
}

string sp_substringBeforeChar(const string& input, const string& character) {
    size_t pos = input.find(character);
    if (pos == string::npos) {
        return input;
    }
    return input.substr(0, pos + 1);
}

string sp_substringAfterChar(const string& input, const string& character) {
    size_t pos = input.rfind(character);
    if (pos == string::npos) {
        return input;
    }
    return input.substr(pos, string::npos);
}

string sp_toLowerCase(string input) {
    for (size_t i = 0; i < input.size(); ++i) {
        input[i] = tolower(input[i]);
    }
    return input;
}

string sp_toUpperCase(string input) {
    for (size_t i = 0; i < input.size(); ++i) {
        input[i] = toupper(input[i]);
    }
    return input;
}

string sp_capitalize(string input) {
    input[0] = toupper(input[0]);
    return input;
}

string sp_swapCase(string input) {
    for (size_t i = 0; i < input.size(); ++i) {
        if (input[i] == tolower(input[i])) {
            input[i] = toupper(input[i]);
        }
        else if (input[i] == toupper(input[i])) {
            input[i] = tolower(input[i]);
        }
    }
    return input;
}

string sp_trimWhitespace(const string& input) {
    size_t i = 0;
    size_t j = input.size() - 1;
    while (isspace(input[i])) ++i;
    if (i == input.size()) {
        return "";
    }
    while (isspace(input[j])) --j;
    return input.substr(i, j-i);
}

string sp_trimWhitespaceLeft(const string& input) {
    size_t i = 0;
    while (isspace(input[i])) ++i;
    if (i == input.size()) {
        return "";
    }
    return input.substr(i, string::npos);
}

string sp_trimWhitespaceRight(const string& input) {
    size_t i = input.size() - 1;
    while (isspace(input[i])) {
        if (i == 0) {
            return "";
        }
        --i;
    }
    return input.substr(0, i);
}

string sp_singleQuote(string input) {
    input.insert(0, "\'");
    input.append("\'");
    return input;
}

string sp_doubleQuote(string input) {
    input.insert(0, "\"");
    input.append("\"");
    return input;
}

string sp_repeat(string input, unsigned int count) {
    for (unsigned int i; i < count; ++i) {
        input.append(input);
    }
    return input;
}