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
|
/**
* Copyright (c) 2013, Timothy Stack
*
* 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 Timothy Stack 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 REGENTS 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 REGENTS 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.
*
* @file test_ansi_scrubber.cc
*
* Test for the scrub_ansi_string function.
*
* TODO: Add a test for the ansi-colors.0.in file. It has a matrix of all the
* color/style combinations.
*/
#include <assert.h>
#include "base/ansi_scrubber.hh"
#include "base/attr_line.builder.hh"
#include "config.h"
#include "view_curses.hh"
using namespace std;
int
main(int argc, char* argv[])
{
printf("BEGIN test\n");
{
std::string zero_width = "\x16 1 \x16 2 \x16";
string_attrs_t sa;
scrub_ansi_string(zero_width, &sa);
printf("zero width: '%s'\n",
fmt::format(FMT_STRING("{:?}"), zero_width).c_str());
assert(zero_width == " 1 2 ");
for (const auto& attr : sa) {
printf("attr %d:%d %s\n",
attr.sa_range.lr_start,
attr.sa_range.lr_end,
attr.sa_type->sat_name);
if (attr.sa_type == &VC_HYPERLINK) {
printf(" value: %s\n",
attr.sa_value.get<std::string>().c_str());
}
if (attr.sa_type == &SA_ORIGIN_OFFSET) {
printf(" value: %lld\n", attr.sa_value.get<int64_t>());
}
}
}
{
std::string bad_bold = "That is not\b\b\ball\n";
string_attrs_t sa;
scrub_ansi_string(bad_bold, &sa);
printf("bad bold1: '%s'\n",
fmt::format(FMT_STRING("{:?}"), bad_bold).c_str());
assert(bad_bold == "That is not\b\b\ball\n");
}
{
std::string bad_bold = "test r\bra\bc not\b\b\ball \x16";
string_attrs_t sa;
scrub_ansi_string(bad_bold, &sa);
printf("bad bold2: '%s'\n",
fmt::format(FMT_STRING("{:?}"), bad_bold).c_str());
assert(bad_bold == "test ra\bc not\b\b\ball ");
}
{
char input[] = "Hello, \x1b[33;mWorld\x1b[0;m!";
auto new_len = erase_ansi_escapes(string_fragment::from_const(input));
printf("result '%s'\n", input);
assert(new_len == 13);
}
{
std::string bad_bold = "^_\x8b\b ";
string_attrs_t sa;
scrub_ansi_string(bad_bold, &sa);
}
{
std::string boldish
= "\u2022\b\u2022\u2023\b\u2023 h\bhe\bel\blo\bo _\ba_\bb_\bc a\b_ "
"b";
auto boldish2 = boldish;
string_attrs_t sa;
sa.clear();
scrub_ansi_string(boldish, &sa);
printf("boldish %s\n", boldish.c_str());
assert(boldish == "\u2022\u2023 helo abc a b");
auto new_len = erase_ansi_escapes(boldish2);
boldish2.resize(new_len);
printf("boldish2 %s\n", boldish2.c_str());
assert(boldish2 == "\u2022\u2023 helo abc a b");
for (const auto& attr : sa) {
printf("attr %d:%d %s\n",
attr.sa_range.lr_start,
attr.sa_range.lr_end,
attr.sa_type->sat_name);
if (attr.sa_type == &SA_ORIGIN_OFFSET) {
printf(" value: %d\n", attr.sa_value.get<int64_t>());
}
}
}
{
string_attrs_t sa;
string str_cp;
str_cp = "Hello, World!";
scrub_ansi_string(str_cp, &sa);
assert(str_cp == "Hello, World!");
assert(sa.empty());
str_cp = "Hello\x1b[44;m, \x1b[33;mWorld\x1b[0;m!";
scrub_ansi_string(str_cp, &sa);
assert(str_cp == "Hello, World!");
printf("%s\n", str_cp.c_str());
for (const auto& attr : sa) {
printf(" attr %d:%d %s %s\n",
attr.sa_range.lr_start,
attr.sa_range.lr_end,
attr.sa_type->sat_name,
string_fragment::from_str_range(
str_cp, attr.sa_range.lr_start, attr.sa_range.lr_end)
.to_string()
.c_str());
}
}
{
// "•]8;;http://example.com•\This_is_a_link•]8;;•\_"
auto hlink = std::string(
"\033]8;;http://example.com\033\\This is a "
"link\033]8;;\033\\\n");
auto al = attr_line_t();
attr_line_builder alb(al);
alb.append_as_hexdump(hlink);
printf("%s\n", al.get_string().c_str());
string_attrs_t sa;
scrub_ansi_string(hlink, &sa);
printf("hlink %d %d %s", hlink.size(), sa.size(), hlink.c_str());
assert(sa.size() == 3);
for (const auto& attr : sa) {
printf("attr %d:%d %s\n",
attr.sa_range.lr_start,
attr.sa_range.lr_end,
attr.sa_type->sat_name);
if (attr.sa_type == &VC_HYPERLINK) {
printf(" value: %s\n",
attr.sa_value.get<std::string>().c_str());
}
if (attr.sa_type == &SA_ORIGIN_OFFSET) {
printf(" value: %lld\n", attr.sa_value.get<int64_t>());
}
}
}
}
|
