-
Notifications
You must be signed in to change notification settings - Fork 0
/
string_utils.h
244 lines (224 loc) · 10.8 KB
/
string_utils.h
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
#pragma once
#ifndef KIGU_STRING_UTILS_H
#define KIGU_STRING_UTILS_H
#include "arrayT.h"
#include "cstring.h"
#include "color.h"
#include "common.h"
#include "unicode.h"
#include <cstdarg>
#include <string>
#include <type_traits>
///////////////
//// @stox ////
///////////////
global s32
stoi(char* s){
s32 x;
(void)sscanf(s, "%d", &x);
return x;
}
FORCE_INLINE s32 stoi(cstring s){ return stoi(s.str); }
FORCE_INLINE s32 stoi(str8 s){return stoi((char*)s.str);}
global s64
stolli(char* s){
s64 x;
(void)sscanf(s, "%lli", &x);
return x;
}
FORCE_INLINE s64 stolli(cstring s){ return stolli(s.str); }
FORCE_INLINE s64 stolli(str8 s) { return stolli((char*)s.str); }
global f64
stod(char* s) {
return strtod(s, 0);
}
FORCE_INLINE f64 stod(cstring s){ return stod(s.str); }
FORCE_INLINE f64 stod(str8 s){ return stod((char*)s.str); }
// https://stackoverflow.com/questions/301330/determine-if-type-is-a-pointer-in-a-template-function
template<typename T> struct is_ptr { static const bool value = false; };
template<typename T> struct is_ptr<T*> { static const bool value = true; };
/////////////////////
//// @to_string8 ////
/////////////////////
template<typename T> global dstr8
to_dstr8(T x, Allocator* a = KIGU_STRING_ALLOCATOR){DPZoneScoped;
dstr8 builder = {};
builder.allocator = a;
if constexpr(std::is_same_v<T, char*> || std::is_same_v<T, const char*>){
dstr8_init(&builder, {(u8*)x, (s64)strlen(x)}, a);
}else if constexpr(std::is_same_v<T, str8> || std::is_same_v<T, const str8&>){
dstr8_init(&builder, x, a);
}else if constexpr(std::is_same_v<T, dstr8>) {
dstr8_init(&builder, x.fin, a);
}else if constexpr(std::is_same_v<T, const std::string&>){
dstr8_init(&builder, {(u8*)x.c_str(), (s64)x.size()}, a);
}else if constexpr(std::is_same_v<T, char>){
dstr8_init(&builder, {(u8*)&x, 1}, a);
}else if constexpr(std::is_same_v<T, unsigned char>) {
dstr8_init(&builder, {(u8*)&x, 1}, a);
}else if constexpr(std::is_same_v<T, s32>){
builder.count = snprintf(nullptr, 0, "%d", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%d", x);
}else if constexpr(std::is_same_v<T, long>){
builder.count = snprintf(nullptr, 0, "%ld", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%ld", x);
}else if constexpr(std::is_same_v<T, s64>){
builder.count = snprintf(nullptr, 0, "%lld", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%lld", x);
}else if constexpr(std::is_same_v<T, u32>){
builder.count = snprintf(nullptr, 0, "%u", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%u", x);
}else if constexpr(std::is_same_v<T, u64>){
builder.count = snprintf(nullptr, 0, "%llu", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%llu", x);
}else if constexpr(std::is_same_v<T, f32> || std::is_same_v<T, f64>){
builder.count = snprintf(nullptr, 0, "%g", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%g", x);
}else if constexpr(std::is_same_v<T, upt>){
builder.count = snprintf(nullptr, 0, "%zu", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%zu", x);
}else if constexpr(std::is_same_v<T, color> || std::is_same_v<T, const color&>){
builder.count = snprintf(nullptr, 0, "{r:%u, g:%u, b:%u, a:%u}", x.r, x.g, x.b, x.a);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "{r:%u, g:%u, b:%u, a:%u}", x.r, x.g, x.b, x.a);
}else if constexpr(std::is_pointer_v<T>){
builder.count = snprintf(nullptr, 0, "%p", x);
builder.space = builder.count+1;
builder.str = (u8*)a->reserve(builder.count+1);
Assert(builder.str, "Failed to allocate memory");
snprintf((char*)builder.str, builder.count+1, "%p", x);
}else{
Assert(0, "unhandled to_dstr8 case");
}
return builder;
}
template<class... T> global dstr8
to_dstr8v(Allocator* allocator, T... args){DPZoneScoped;
dstr8 str; dstr8_init(&str, {0}, allocator);
constexpr auto arg_count{sizeof...(T)};
dstr8 arr[arg_count] = { to_dstr8(args, allocator)... };
forI(arg_count){
dstr8_append(&str, arr[i].fin);
dstr8_deinit(&arr[i]);
}
return str;
}
///////////////
//// @find ////
///////////////
//NOTE these functions do not do any safety/bounds checking
//TODO decide if we should do that here
global u32
find_first_char(const char* str, u32 strsize, char c, u32 offset = 0) {
for (u32 i = offset; i < strsize; ++i)
if (str[i] == c) return i;
return npos;
}
global u32 find_first_char(const char* str, char c, u32 offset = 0) { return find_first_char(str, strlen(str), c, offset); }
global u32 find_first_char(const cstring& str, char c, u32 offset = 0) { return find_first_char(str.str, str.count, c, offset); }
global u32
find_first_char_not(const char* str, u32 strsize, char c, u32 offset = 0) {
for (u32 i = 0; i < strsize; ++i)
if (str[i] != c) return i;
return npos;
}
global u32 find_first_char_not(const char* str, char c, u32 offset = 0) { return find_first_char_not(str, strlen(str), c, offset); }
global u32 find_first_char_not(const cstring& str, char c, u32 offset = 0) { return find_first_char_not(str.str, str.count, c, offset); }
global u32
find_last_char(const char* str, u32 strsize, char c, u32 offset = 0) {
for (u32 i = (offset != 0 ? offset : strsize - 1); i != 0; --i)
if (str[i] == c) return i;
return npos;
}
global u32 find_last_char(const char* str, char c, u32 offset = 0) { return find_last_char(str, strlen(str), c, offset); }
global u32 find_last_char(const cstring& str, char c, u32 offset = 0) { return find_last_char(str.str, str.count, c, offset); }
global u32
find_last_char_not(const char* str, u32 strsize, char c, u32 offset = 0) {
for (u32 i = strsize - 1; i != 0; --i)
if (str[i] != c) return i;
return npos;
}
global u32 find_last_char_not(const char* str, char c, u32 offset = 0) { return find_last_char_not(str, strlen(str), c, offset); }
global u32 find_last_char_not(const cstring& str, char c, u32 offset = 0) { return find_last_char_not(str.str, str.count, c, offset); }
global u32
find_first_string(const char* str, u32 strsize, const char* str2, u32 str2size, u32 offset = 0) {
if (str2size > strsize) return npos;
for (u32 i = offset; i < strsize - str2size; i++)
if (!memcmp(str + i, str2, str2size)) return i;
return npos;
}
global u32 find_first_string(const cstring& buf1, const cstring& buf2, u32 offset = 0) { return find_first_string(buf1.str, buf1.count, buf2.str, buf2.count, offset); }
global u32 find_first_string(const char* buf1, const cstring& buf2, u32 offset = 0) { return find_first_string(buf1, strlen(buf1), buf2.str, buf2.count, offset); }
global u32 find_first_string(const cstring& buf1, const char* buf2, u32 offset = 0) { return find_first_string(buf1.str, buf1.count, buf2, strlen(buf2), offset); }
global u32 find_first_string(const char* buf1, const char* buf2, u32 offset = 0) { return find_first_string(buf1, strlen(buf1), buf2, strlen(buf2), offset); }
FORCE_INLINE global b32
str_begins_with(const char* buf1, const char* buf2, u32 buf2len) {return !memcmp(buf1, buf2, buf2len);}
global b32 str_begins_with(const cstring& buf1, const cstring& buf2) { return str_begins_with(buf1.str, buf2.str, buf2.count); }
global b32 str_begins_with(const char* buf1, const cstring& buf2) { return str_begins_with(buf1, buf2.str, buf2.count); }
global b32 str_begins_with(const cstring& buf1, const char* buf2) { return str_begins_with(buf1.str, buf2, strlen(buf2)); }
global b32 str_begins_with(const char* buf1, const char* buf2) { return str_begins_with(buf1, buf2, strlen(buf2)); }
FORCE_INLINE global b32
str_ends_with(const char* buf1, u32 buf1len, const char* buf2, u32 buf2len) {return (buf2len > buf1len ? 0 : !memcmp(buf1 + (buf1len - buf2len), buf2, buf2len));}
global b32 str_ends_with(const cstring& buf1, const cstring& buf2) { return str_ends_with(buf1.str, buf1.count, buf2.str, buf2.count); }
global b32 str_ends_with(const char* buf1, const cstring& buf2) { return str_ends_with(buf1, strlen(buf1), buf2.str, buf2.count); }
global b32 str_ends_with(const cstring& buf1, const char* buf2) { return str_ends_with(buf1.str, buf1.count, buf2, strlen(buf2)); }
global b32 str_ends_with(const char* buf1, const char* buf2) { return str_ends_with(buf1, strlen(buf1), buf2, strlen(buf2)); }
global b32
str_contains(const char* buf1, u32 buf1len, const char* buf2, u32 buf2len) {
if (buf2len > buf1len) return false;
for (u32 i = 0; i < buf2len - buf1len; i++) {
if (!memcmp(buf2, buf1 + i, buf2len)) return true;
}
return false;
}
global b32 str_contains(const cstring& buf1, const cstring& buf2) { return str_contains(buf1.str, buf1.count, buf2.str, buf2.count); }
global b32 str_contains(const char* buf1, const cstring& buf2) { return str_contains(buf1, strlen(buf1), buf2.str, buf2.count); }
global b32 str_contains(const cstring& buf1, const char* buf2) { return str_contains(buf1.str, buf1.count, buf2, strlen(buf2)); }
global b32 str_contains(const char* buf1, const char* buf2) { return str_contains(buf1, strlen(buf1), buf2, strlen(buf2)); }
//includes start and end indexes
global cstring
substr(char* buf, u32 buflen, u32 start, u32 end = npos){
return cstring{buf+start, (end==npos ? buflen-start : (end-start)+1)};
}
global cstring substr(const cstring& buf, u32 start, u32 end = npos){return substr(buf.str, buf.count, start,end);}
global cstring substr(const char* buf, u32 start, u32 end = npos){return substr((char*)buf, strlen(buf), start,end);}
global arrayT<cstring>
chunkstr(char* buf, u32 buflen, char delimiter){
arrayT<cstring> chunks;
char* start = buf;
forI(buflen){
if(buf[i]==delimiter){
chunks.add({start, upt((buf+i)-start)});
start=buf+i+1;
}else if(i==buflen-1){
chunks.add({start, upt((buf+i+1)-start)});
}
}
return chunks;
}
global arrayT<cstring> chunkstr(const cstring& buf, char delimiter) {return chunkstr(buf.str, buf.count, delimiter);}
global arrayT<cstring> chunkstr(const char* buf, char delimiter) {return chunkstr((char*)buf, strlen(buf), delimiter);}
#endif //KIGU_STRING_UTILS_H