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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/*
* Copyright (c) 2003-2023, John Wiegley. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* - Neither the name of New Artisans LLC nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* @addtogroup util
*/
/**
* @file unistring.h
* @author John Wiegley
*
* @ingroup utils
*/
#pragma once
namespace ledger {
int mk_wcwidth(boost::uint32_t ucs);
/**
* @class unistring
*
* @brief Abstract working with UTF-32 encoded Unicode strings
*
* The input to the string is a UTF8 encoded ledger::string, which can
* then have its true length be taken, or characters extracted.
*/
class unistring
{
public:
static const std::size_t npos = static_cast<std::size_t>(-1);
std::vector<boost::uint32_t> utf32chars;
unistring() {
TRACE_CTOR(unistring, "");
}
unistring(const std::string& input)
{
const char * p = input.c_str();
std::size_t len = input.length();
// This size should be at least as large as MAX_LINE in context.h
assert(len < 4096);
VERIFY(utf8::is_valid(p, p + len));
utf8::unchecked::utf8to32(p, p + len, std::back_inserter(utf32chars));
TRACE_CTOR(unistring, "std::string");
}
~unistring() {
TRACE_DTOR(unistring);
}
std::size_t length() const {
return utf32chars.size();
}
std::size_t width() const {
std::size_t width = 0;
foreach (const boost::uint32_t& ch, utf32chars) {
width += mk_wcwidth(ch);
}
return width;
}
std::string extract(const std::string::size_type begin = 0,
const std::string::size_type len = 0) const
{
std::string utf8result;
std::string::size_type this_len = length();
assert(begin <= this_len);
assert(begin + len <= this_len);
if (this_len)
utf8::unchecked::utf32to8
(utf32chars.begin() + static_cast<std::string::difference_type>(begin),
utf32chars.begin() + static_cast<std::string::difference_type>(begin) +
static_cast<std::string::difference_type>
(len ? (len > this_len ? this_len : len) : this_len),
std::back_inserter(utf8result));
return utf8result;
}
std::string extract_by_width(std::string::size_type begin,
std::size_t len) const
{
std::string utf8result;
std::size_t this_width = width();
std::string::size_type this_len = length();
assert(begin <= this_width);
if (begin + len > this_width)
len = this_width - begin;
std::size_t pos = 0;
std::size_t begin_idx = 0, end_idx = 0;
std::size_t head = 0, tail = 0;
for (std::size_t idx = 0; idx < this_len; ++idx) {
std::size_t w = mk_wcwidth(utf32chars[idx]);
if (pos < begin) {
if (pos + w >= begin) {
head = std::min(pos + w, begin + len) - begin;
begin_idx = idx + 1;
}
} else if (pos < begin + len) {
if (pos + w > begin + len) {
tail = begin + len - pos;
end_idx = idx;
}
if (pos + w == begin + len) {
tail = 0;
end_idx = idx + 1;
}
}
pos += w;
}
utf8result += std::string(head, '.');
if (begin_idx < end_idx)
utf8::unchecked::utf32to8
(utf32chars.begin() + static_cast<std::string::difference_type>(begin_idx),
utf32chars.begin() + static_cast<std::string::difference_type>(end_idx),
std::back_inserter(utf8result));
utf8result += std::string(tail, '.');
return utf8result;
}
std::size_t find(const boost::uint32_t __s, std::size_t __pos = 0) const {
std::size_t idx = 0;
foreach (const boost::uint32_t& ch, utf32chars) {
if (idx >= __pos && ch == __s)
return idx;
idx++;
}
return npos;
}
boost::uint32_t& operator[](const std::size_t index) {
return utf32chars[index];
}
const boost::uint32_t& operator[](const std::size_t index) const {
return utf32chars[index];
}
};
inline void justify(std::ostream& out,
const std::string& str,
int width,
bool right = false,
bool redden = false)
{
if (! right) {
if (redden) out << "\033[31m";
out << str;
if (redden) out << "\033[0m";
}
unistring temp(str);
int spacing = width - int(temp.width());
while (spacing-- > 0)
out << ' ';
if (right) {
if (redden) out << "\033[31m";
out << str;
if (redden) out << "\033[0m";
}
}
} // namespace ledger
|
