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
|
#pragma once
namespace nall {
inline auto string::downcase() -> string& {
char* p = get();
for(u32 n = 0; n < size(); n++) {
if(p[n] >= 'A' && p[n] <= 'Z') p[n] += 0x20;
}
return *this;
}
inline auto string::qdowncase() -> string& {
char* p = get();
for(u32 n = 0, quoted = 0; n < size(); n++) {
if(p[n] == '\"') quoted ^= 1;
if(!quoted && p[n] >= 'A' && p[n] <= 'Z') p[n] += 0x20;
}
return *this;
}
inline auto string::upcase() -> string& {
char* p = get();
for(u32 n = 0; n < size(); n++) {
if(p[n] >= 'a' && p[n] <= 'z') p[n] -= 0x20;
}
return *this;
}
inline auto string::qupcase() -> string& {
char* p = get();
for(u32 n = 0, quoted = 0; n < size(); n++) {
if(p[n] == '\"') quoted ^= 1;
if(!quoted && p[n] >= 'a' && p[n] <= 'z') p[n] -= 0x20;
}
return *this;
}
inline auto string::transform(string_view from, string_view to) -> string& {
if(from.size() != to.size() || from.size() == 0) return *this; //patterns must be the same length
char* p = get();
for(u32 n = 0; n < size(); n++) {
for(u32 s = 0; s < from.size(); s++) {
if(p[n] == from[s]) {
p[n] = to[s];
break;
}
}
}
return *this;
}
}
|
