-
Notifications
You must be signed in to change notification settings - Fork 122
/
Common.h
149 lines (128 loc) · 3.11 KB
/
Common.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
#pragma once
// FilePathLength
#define MAX_FILEPATH_LENTGH 256
constexpr char stringDelimiter[] = "#"; // Character used to encapsulate data in linear NVS-strings (don't change)
constexpr char stringOuterDelimiter[] = "^"; // Character used to encapsulate encapsulated data along with RFID-ID in backup-file
inline bool isNumber(const char *str)
{
byte i = 0;
while (*(str + i) != '\0') {
if (!isdigit(*(str + i++))) {
return false;
}
}
if (i > 0) {
return true;
} else{
return false;
}
}
// Checks if string starts with prefix
// Returns true if so
inline bool startsWith(const char *str, const char *pre) {
if (strlen(pre) < 1) {
return false;
}
return !strncmp(str, pre, strlen(pre));
}
// Checks if string ends with suffix
// Returns true if so
inline bool endsWith(const char *str, const char *suf) {
const char *a = str + strlen(str);
const char *b = suf + strlen(suf);
while (a != str && b != suf) {
if (*--a != *--b) {
break;
}
}
return b == suf && *a == *b;
}
inline void convertUtf8ToAscii(String utf8String, char *asciiString) {
int k = 0;
bool f_C3_seen = false;
for (int i = 0; i < utf8String.length() && k < MAX_FILEPATH_LENTGH - 1; i++) {
if (utf8String[i] == 195) { // C3
f_C3_seen = true;
continue;
} else {
if (f_C3_seen == true) {
f_C3_seen = false;
switch (utf8String[i]) {
case 0x84:
asciiString[k++] = 0x8e;
break; // Ä
case 0xa4:
asciiString[k++] = 0x84;
break; // ä
case 0x9c:
asciiString[k++] = 0x9a;
break; // Ü
case 0xbc:
asciiString[k++] = 0x81;
break; // ü
case 0x96:
asciiString[k++] = 0x99;
break; // Ö
case 0xb6:
asciiString[k++] = 0x94;
break; // ö
case 0x9f:
asciiString[k++] = 0xe1;
break; // ß
default:
asciiString[k++] = 0xdb; // Unknown...
}
} else {
asciiString[k++] = utf8String[i];
}
}
}
asciiString[k] = 0;
}
inline void convertAsciiToUtf8(String asciiString, char *utf8String) {
int k = 0;
for (int i = 0; i < asciiString.length() && k < MAX_FILEPATH_LENTGH - 2; i++) {
switch (asciiString[i]) {
case 0x8e:
utf8String[k++] = 0xc3;
utf8String[k++] = 0x84;
break; // Ä
case 0x84:
utf8String[k++] = 0xc3;
utf8String[k++] = 0xa4;
break; // ä
case 0x9a:
utf8String[k++] = 0xc3;
utf8String[k++] = 0x9c;
break; // Ü
case 0x81:
utf8String[k++] = 0xc3;
utf8String[k++] = 0xbc;
break; // ü
case 0x99:
utf8String[k++] = 0xc3;
utf8String[k++] = 0x96;
break; // Ö
case 0x94:
utf8String[k++] = 0xc3;
utf8String[k++] = 0xb6;
break; // ö
case 0xe1:
utf8String[k++] = 0xc3;
utf8String[k++] = 0x9f;
break; // ß
default:
utf8String[k++] = asciiString[i];
}
}
utf8String[k] = 0;
}
// Release previously allocated memory
inline void freeMultiCharArray(char **arr, const uint32_t cnt) {
for (uint32_t i = 0; i <= cnt; i++) {
/*snprintf(Log_Buffer, Log_BufferLength, "%s: %s", (char *) FPSTR(freePtr), *(arr+i));
Log_Println(Log_Buffer, LOGLEVEL_DEBUG);*/
free(*(arr + i));
}
*arr = NULL;
}