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
|
/*
* Copyright 2012 Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License version 3, 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 warranties of
* MERCHANTABILITY, SATISFACTORY QUALITY or FITNESS FOR A PARTICULAR
* PURPOSE. See the applicable version of the GNU Lesser General Public
* License for more details.
*
* You should have received a copy of both the GNU Lesser General Public
* License version 3 along with this program. If not, see
* <http://www.gnu.org/licenses/>
*
* Authored by: Andrea Azzarone <azzaronea@gmail.com>
* Tim Penhey <tim.penhey@canonical.com>
*
*/
#include "HudPrivate.h"
namespace unity
{
namespace hud
{
namespace impl
{
std::vector<std::pair<std::string, bool>> RefactorText(std::string const& text)
{
std::vector<std::pair<std::string, bool>> ret;
static const std::string bold_start("<b>");
static const std::string bold_end("</b>");
std::string::size_type last = 0;
std::string::size_type len = text.length();
std::string::size_type pos = text.find(bold_start);
while (pos != std::string::npos)
{
if (pos != last)
{
ret.push_back(std::pair<std::string, bool>(text.substr(last, pos - last), false));
}
// Look for the end
pos += 3; // // to skip the "<b>"
std::string::size_type end_pos = text.find(bold_end, pos);
// We hope we find it, if we don't, just output everything...
if (end_pos != std::string::npos)
{
ret.push_back(std::pair<std::string, bool>(text.substr(pos, end_pos - pos), true));
last = end_pos + 4; // the length of "</b>"
pos = text.find(bold_start, last);
}
else
{
ret.push_back(std::pair<std::string, bool>(text.substr(pos), true));
pos = std::string::npos;
last = len;
}
}
if (last < len)
{
ret.push_back(std::pair<std::string, bool>(text.substr(last), false));
}
return ret;
}
} // namespace unity
} // namespace hud
} // namespace impl
|