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
|
/**
* vim: set ts=4 :
* =============================================================================
* sm-json
* Provides a pure SourcePawn implementation of JSON encoding and decoding.
* https://github.com/clugg/sm-json
*
* sm-json (C)2019 James Dickens. (clug)
* SourceMod (C)2004-2008 AlliedModders LLC. All rights reserved.
* =============================================================================
*
* This program is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License, version 3.0, as published by the
* Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* this program. If not, see <http://www.gnu.org/licenses/>.
*
* As a special exception, AlliedModders LLC gives you permission to link the
* code of this program (as well as its derivative works) to "Half-Life 2," the
* "Source Engine," the "SourcePawn JIT," and any Game MODs that run on software
* by the Valve Corporation. You must obey the GNU General Public License in
* all respects for all other code used. Additionally, AlliedModders LLC grants
* this exception to all derivative works. AlliedModders LLC defines further
* exceptions, found in LICENSE.txt (as of this writing, version JULY-31-2007),
* or <http://www.sourcemod.net/license.php>.
*/
#if defined _json_helpers_string_included
#endinput
#endif
#define _json_helpers_string_included
/**
* Mapping characters to their escaped form.
*/
char JSON_STRING_NORMAL[][] = {
"\\", "\"", "/", "\b", "\f", "\n", "\r", "\t"
};
char JSON_STRING_ESCAPED[][] = {
"\\\\", "\\\"", "\\/", "\\b", "\\f", "\\n", "\\r", "\\t"
};
/**
* Escapes a string in-place in a buffer.
*
* @param buffer String buffer.
* @param max_size Maximum size of string buffer.
*/
stock void json_escape_string(char[] buffer, int max_size)
{
for (int i = 0; i < sizeof(JSON_STRING_NORMAL); ++i) {
ReplaceString(
buffer,
max_size,
JSON_STRING_NORMAL[i],
JSON_STRING_ESCAPED[i]
);
}
}
/**
* Unescapes a string in-place in a buffer.
*
* @param buffer String buffer.
* @param max_size Maximum size of string buffer.
*/
stock void json_unescape_string(char[] buffer, int max_size)
{
for (int i = 0; i < sizeof(JSON_STRING_NORMAL); ++i) {
ReplaceString(
buffer,
max_size,
JSON_STRING_ESCAPED[i],
JSON_STRING_NORMAL[i]
);
}
}
/**
* Checks if a string starts with another string.
*
* @param haystack String to check that starts with needle.
* @param max_size Maximum size of string buffer.
* @param needle String to check that haystack starts with.
* @returns True if haystack begins with needle, false otherwise.
*/
stock bool json_string_startswith(const char[] haystack, const char[] needle)
{
int haystack_length = strlen(haystack);
int needle_length = strlen(needle);
if (needle_length > haystack_length) {
return false;
}
for (int i = 0; i < needle_length; ++i) {
if (haystack[i] != needle[i]) {
return false;
}
}
return true;
}
/**
* Checks if a string ends with another string.
*
* @param haystack String to check that ends with needle.
* @param max_size Maximum size of string buffer.
* @param needle String to check that haystack ends with.
* @returns True if haystack ends with needle, false otherwise.
*/
stock bool json_string_endswith(const char[] haystack, const char[] needle)
{
int haystack_length = strlen(haystack);
int needle_length = strlen(needle);
if (needle_length > haystack_length) {
return false;
}
for (int i = 0; i < needle_length; ++i) {
if (haystack[haystack_length - needle_length + i] != needle[i]) {
return false;
}
}
return true;
}
|
