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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* 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/>.
*
*/
#include "common/array.h"
#include "common/file.h"
#include "mm/shared/utils/strings_data.h"
#include "mm/shared/utils/strings.h"
namespace MM {
bool StringsData::load(const Common::Path &filename) {
Common::File f;
Common::Array<Common::String> prefixKeys;
Common::String key, value, fullKey;
size_t p;
if (!f.open(filename))
return false;
while (!f.eos()) {
// Get the next line
Common::String line = f.readLine();
// Check for blank or comment lines
Common::String lineTrimmed = line;
lineTrimmed.trim();
if (lineTrimmed.empty() || lineTrimmed.hasPrefix("#"))
continue;
// Count number of tabs for identation amount
size_t numTabs = 0;
while (line.hasPrefix("\t")) {
line.deleteChar(0);
++numTabs;
}
// Split key and value if present
p = line.findFirstOf(":");
if (p == Common::String::npos)
error("Line encountered without colon");
key = Common::String(line.c_str(), line.c_str() + p);
value = Common::String(line.c_str() + p + 1);
key.trim();
value.trim();
// Strip quotes from start and end of string
if (value.hasPrefix("\"") && value.hasSuffix("\"")) {
value.deleteChar(0);
value.deleteLastChar();
value = searchAndReplace(value, "\"\"", "");
value = searchAndReplace(value, "\\\"", "\"");
}
// Replace any sequences
for (uint i = 0; i < value.size(); ++i) {
if (value[i] == '\\' && (value[i + 1] == 'n' ||
value[i + 1] == 'r')) {
value.deleteChar(i);
value.setChar('\n', i);
} else if (!strncmp(value.c_str() + i, "\\x", 2)) {
Common::String hex(value.c_str() + i + 2,
value.c_str() + i + 4);
value.deleteChar(i);
value.deleteChar(i);
value.deleteChar(i);
value.setChar((char)hexToInt(hex), i);
} else if (value[i] == '"' && i < (value.size() - 1) &&
value[i + 1] == '"') {
value.deleteChar(i);
}
}
// Handle the entries
if (numTabs == prefixKeys.size()) {
// Do nothing
} else if (numTabs < prefixKeys.size()) {
// Drop off prefixes to the desired indentation
prefixKeys.resize(numTabs);
} else {
error("Incorrect indentation");
}
if (value.empty()) {
prefixKeys.push_back(key);
} else {
// Form a key from the prefix and current key
fullKey = "";
for (size_t i = 0; i < prefixKeys.size(); ++i) {
fullKey += prefixKeys[i];
fullKey += ".";
}
fullKey = fullKey + key;
(*this)[fullKey] = value;
}
}
return true;
}
} // namespace MM
|
