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
|
/* TextReplacements.cpp
Copyright (c) 2021 by Amazinite
Endless Sky 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.
Endless Sky 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 <https://www.gnu.org/licenses/>.
*/
#include "TextReplacements.h"
#include "ConditionSet.h"
#include "DataNode.h"
#include <set>
using namespace std;
// Load a substitutions node.
void TextReplacements::Load(const DataNode &node, const ConditionsStore *playerConditions)
{
// Check for reserved keys. Only some hardcoded replacement keys are
// reserved, as these ones are done on the fly after all other replacements
// have been done.
const set<string> reserved = {"<first>", "<last>", "<ship>", "<model>", "<flagship>", "<flagship model>"};
for(const DataNode &child : node)
{
if(child.Size() < 2)
{
child.PrintTrace("Skipping substitution key with no replacement:");
continue;
}
string key = child.Token(0);
if(key.empty())
{
child.PrintTrace("Error: Cannot replace the empty string:");
continue;
}
if(key.front() != '<')
{
key = "<" + key;
child.PrintTrace("Warning: text replacements must be prefixed by \"<\":");
}
if(key.back() != '>')
{
key += ">";
child.PrintTrace("Warning: text replacements must be suffixed by \">\":");
}
if(reserved.contains(key))
{
child.PrintTrace("Skipping reserved substitution key:");
continue;
}
ConditionSet toSubstitute;
if(child.HasChildren())
toSubstitute.Load(child, playerConditions);
substitutions.emplace_back(key, make_pair(std::move(toSubstitute), child.Token(1)));
}
}
// Clear this TextReplacement's substitutions and insert the substitutions of other.
void TextReplacements::Revert(TextReplacements &other)
{
substitutions.clear();
substitutions.insert(substitutions.begin(), other.substitutions.begin(), other.substitutions.end());
}
// Add new text replacements to the given map after evaluating all possible replacements.
// This text replacement will overwrite the value of any existing keys in the given map
// if the map and this TextReplacements share a key.
void TextReplacements::Substitutions(map<string, string> &subs) const
{
for(const auto &sub : substitutions)
{
const string &key = sub.first;
const ConditionSet &toSub = sub.second.first;
const string &replacement = sub.second.second;
if(toSub.Test())
subs[key] = replacement;
}
}
|
