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 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628
|
/*
* File: format.cc
* Created by: haranp on Sat Feb 17 13:35:54 2007 UTC
*/
#include <limits.h>
#include "AppHdr.h"
#include "colour.h"
#include "format.h"
#include "libutil.h"
#include "showsymb.h"
#include "viewchar.h"
formatted_string::formatted_string(int init_colour)
: ops()
{
if (init_colour)
textcolor(init_colour);
}
formatted_string::formatted_string(const std::string &s, int init_colour)
: ops()
{
if (init_colour)
textcolor(init_colour);
cprintf(s);
}
int formatted_string::get_colour(const std::string &tag)
{
if (tag == "h")
return (YELLOW);
if (tag == "w")
return (WHITE);
const int colour = str_to_colour(tag);
return (colour != -1? colour : LIGHTGREY);
}
// Display a formatted string without printing literal \n.
// This is important if the text is not supposed
// to clobber existing text to the right of the lines being displayed
// (some of the tutorial messages need this).
void display_tagged_block(const std::string &s)
{
std::vector<formatted_string> lines;
formatted_string::parse_string_to_multiple(s, lines);
int x = wherex();
int y = wherey();
for (int i = 0, size = lines.size(); i < size; ++i)
{
cgotoxy(x, y);
lines[i].display();
y++;
}
}
formatted_string formatted_string::parse_string(
const std::string &s,
bool eot_ends_format,
bool (*process)(const std::string &tag),
int main_colour)
{
// main_colour will usually be LIGHTGREY (default).
std::vector<int> colour_stack;
colour_stack.push_back(main_colour);
formatted_string fs;
parse_string1(s, fs, colour_stack, process);
if (eot_ends_format)
{
if (colour_stack.back() != colour_stack.front())
fs.textcolor(colour_stack.front());
}
return fs;
}
// Parses a formatted string in much the same way as parse_string, but
// handles \n by creating a new formatted_string.
void formatted_string::parse_string_to_multiple(
const std::string &s,
std::vector<formatted_string> &out)
{
std::vector<int> colour_stack;
colour_stack.push_back(LIGHTGREY);
std::vector<std::string> lines = split_string("\n", s, false, true);
for (int i = 0, size = lines.size(); i < size; ++i)
{
out.push_back(formatted_string());
formatted_string& fs = out.back();
fs.textcolor(colour_stack.back());
parse_string1(lines[i], fs, colour_stack, NULL);
if (colour_stack.back() != colour_stack.front())
fs.textcolor(colour_stack.front());
}
}
// Helper for the other parse_ methods.
void formatted_string::parse_string1(
const std::string &s,
formatted_string &fs,
std::vector<int> &colour_stack,
bool (*process)(const std::string &tag))
{
// FIXME: This is a lame mess, just good enough for the task on hand
// (keyboard help).
std::string::size_type tag = std::string::npos;
std::string::size_type length = s.length();
std::string currs;
bool masked = false;
for (tag = 0; tag < length; ++tag)
{
bool revert_colour = false;
std::string::size_type endpos = std::string::npos;
// Break string up if it gets too big.
if (currs.size() >= 999)
{
// Break the string at the end of a line, if possible, so
// that none of the broken string ends up overwritten.
std::string::size_type bound = currs.rfind("\n", 999);
if (bound != endpos)
bound++;
else
bound = 999;
fs.cprintf(currs.substr(0, bound));
if (currs.size() > bound)
currs = currs.substr(bound);
else
currs.clear();
tag--;
continue;
}
if (s[tag] != '<' || tag >= length - 2)
{
if (!masked)
currs += s[tag];
continue;
}
// Is this a << escape?
if (s[tag + 1] == '<')
{
if (!masked)
currs += s[tag];
tag++;
continue;
}
endpos = s.find('>', tag + 1);
// No closing >?
if (endpos == std::string::npos)
{
if (!masked)
currs += s[tag];
continue;
}
std::string tagtext = s.substr(tag + 1, endpos - tag - 1);
if (tagtext.empty() || tagtext == "/")
{
if (!masked)
currs += s[tag];
continue;
}
if (tagtext[0] == '/')
{
revert_colour = true;
tagtext = tagtext.substr(1);
tag++;
}
if (tagtext[0] == '?')
{
if (tagtext.length() == 1)
masked = false;
else if (process && !process(tagtext.substr(1)))
masked = true;
tag += tagtext.length() + 1;
continue;
}
if (!currs.empty())
{
fs.cprintf(currs);
currs.clear();
}
if (revert_colour)
{
colour_stack.pop_back();
if (colour_stack.size() < 1)
{
ASSERT(false);
colour_stack.push_back(LIGHTRED);
}
}
else
{
colour_stack.push_back(get_colour(tagtext));
}
// fs.cprintf("%d%d", colour_stack.size(), colour_stack.back());
fs.textcolor(colour_stack.back());
tag += tagtext.length() + 1;
}
if (currs.length())
fs.cprintf(currs);
}
formatted_string::operator std::string() const
{
std::string s;
for (unsigned i = 0, size = ops.size(); i < size; ++i)
{
if (ops[i] == FSOP_TEXT)
s += ops[i].text;
}
return (s);
}
void replace_all_in_string(std::string& s, const std::string& search,
const std::string& replace)
{
std::string::size_type pos = 0;
while ( (pos = s.find(search, pos)) != std::string::npos )
{
s.replace(pos, search.size(), replace);
pos += replace.size();
}
}
std::string formatted_string::html_dump() const
{
std::string s;
for (unsigned i = 0; i < ops.size(); ++i)
{
std::string tmp;
switch (ops[i].type)
{
case FSOP_TEXT:
tmp = ops[i].text;
// (very) crude HTMLification
replace_all_in_string(tmp, "&", "&");
replace_all_in_string(tmp, " ", " ");
replace_all_in_string(tmp, "<", "<");
replace_all_in_string(tmp, ">", ">");
replace_all_in_string(tmp, "\n", "<br>");
s += tmp;
break;
case FSOP_COLOUR:
s += "<font color=";
s += colour_to_str(ops[i].x);
s += ">";
break;
}
}
return s;
}
bool formatted_string::operator < (const formatted_string &other) const
{
return std::string(*this) < std::string(other);
}
const formatted_string &
formatted_string::operator += (const formatted_string &other)
{
ops.insert(ops.end(), other.ops.begin(), other.ops.end());
return (*this);
}
std::string::size_type formatted_string::length() const
{
// Just add up the individual string lengths.
std::string::size_type len = 0;
for (unsigned i = 0, size = ops.size(); i < size; ++i)
if (ops[i] == FSOP_TEXT)
len += ops[i].text.length();
return (len);
}
inline void cap(int &i, int max)
{
if (i < 0 && -i <= max)
i += max;
if (i >= max)
i = max - 1;
if (i < 0)
i = 0;
}
char &formatted_string::operator [] (size_t idx)
{
size_t rel_idx = idx;
int size = ops.size();
for (int i = 0; i < size; ++i)
{
if (ops[i] != FSOP_TEXT)
continue;
size_t len = ops[i].text.length();
if (rel_idx >= len)
rel_idx -= len;
else
return ops[i].text[rel_idx];
}
ASSERT(!"Invalid index");
char *invalid = NULL;
return *invalid;
}
std::string formatted_string::tostring(int s, int e) const
{
std::string st;
int size = ops.size();
cap(s, size);
cap(e, size);
for (int i = s; i <= e && i < size; ++i)
{
if (ops[i] == FSOP_TEXT)
st += ops[i].text;
}
return st;
}
std::string formatted_string::to_colour_string() const
{
std::string st;
const int size = ops.size();
for (int i = 0; i < size; ++i)
{
if (ops[i] == FSOP_TEXT)
{
// gotta double up those '<' chars ...
size_t start = st.size();
st += ops[i].text;
while (true)
{
const size_t left_angle = st.find('<', start);
if (left_angle == std::string::npos)
break;
st.insert(left_angle, "<");
start = left_angle + 2;
}
}
else if (ops[i] == FSOP_COLOUR)
{
st += "<";
st += colour_to_str(ops[i].x);
st += ">";
}
}
return st;
}
void formatted_string::display(int s, int e) const
{
int size = ops.size();
if (!size)
return;
cap(s, size);
cap(e, size);
for (int i = s; i <= e && i < size; ++i)
ops[i].display();
}
int formatted_string::find_last_colour() const
{
if (!ops.empty())
{
for (int i = ops.size() - 1; i >= 0; --i)
if (ops[i].type == FSOP_COLOUR)
return (ops[i].x);
}
return (LIGHTGREY);
}
formatted_string formatted_string::substr(size_t start, size_t substr_length) const
{
const unsigned int NONE = UINT_MAX; // from limits.h
unsigned int last_FSOP_COLOUR = NONE;
// Find the first string to copy
unsigned int i;
for (i = 0; i < ops.size(); ++i)
{
const fs_op& op = ops[i];
if (op.type == FSOP_COLOUR)
last_FSOP_COLOUR = i;
else if (op.type == FSOP_TEXT)
{
if (op.text.length() > start)
break;
else
start -= op.text.length();
}
}
if (i == ops.size())
return formatted_string();
formatted_string result;
// set up the state
if (last_FSOP_COLOUR != NONE)
result.ops.push_back(ops[last_FSOP_COLOUR]);
// Copy the text
for ( ; i<ops.size(); i++)
{
const fs_op& op = ops[i];
if (op.type == FSOP_TEXT)
{
result.ops.push_back(op);
std::string& new_string = result.ops[result.ops.size()-1].text;
if (start > 0 || op.text.length() > substr_length)
new_string = new_string.substr(start, substr_length);
substr_length -= new_string.length();
if (substr_length == 0)
break;
}
else
{
result.ops.push_back(op);
}
}
return result;
}
void formatted_string::add_glyph(glyph g)
{
const int last_col = find_last_colour();
this->textcolor(g.col);
this->cprintf("%s", stringize_glyph(g.ch).c_str());
this->textcolor(last_col);
}
void formatted_string::textcolor(int color)
{
if (!ops.empty() && ops[ ops.size() - 1 ].type == FSOP_COLOUR)
ops.erase( ops.end() - 1 );
ops.push_back(color);
}
void formatted_string::clear()
{
ops.clear();
}
bool formatted_string::empty()
{
return (ops.empty());
}
void formatted_string::cprintf(const char *s, ...)
{
va_list args;
va_start(args, s);
cprintf(vmake_stringf(s, args));
va_end(args);
}
void formatted_string::cprintf(const std::string &s)
{
ops.push_back(s);
}
void formatted_string::fs_op::display() const
{
switch (type)
{
case FSOP_COLOUR:
::textattr(x);
break;
case FSOP_TEXT:
::cprintf("%s", text.c_str());
break;
}
}
void formatted_string::swap(formatted_string& other)
{
ops.swap(other.ops);
}
void formatted_string::all_caps()
{
for (unsigned int i = 0; i < ops.size(); i++)
if (ops[i].type == FSOP_TEXT)
uppercase(ops[i].text);
}
int count_linebreaks(const formatted_string& fs)
{
std::string::size_type where = 0;
const std::string s = fs;
int count = 0;
while ( 1 )
{
where = s.find("\n", where);
if ( where == std::string::npos )
break;
else
{
++count;
++where;
}
}
return count;
}
// Return the actual (string) offset of character #loc to be printed,
// i.e. ignoring tags. So for instance, if s == "<tag>ab</tag>", then
// _find_string_location(s, 2) == 6.
static int _find_string_location(const std::string& s, int loc)
{
int real_offset = 0;
bool in_tag = false;
int last_taglen = 0;
int offset = 0;
for (std::string::const_iterator ci = s.begin();
ci != s.end() && real_offset < loc;
++ci, ++offset)
{
if (in_tag)
{
if (*ci == '<' && last_taglen == 1)
{
++real_offset;
in_tag = false;
}
else if (*ci == '>')
{
in_tag = false;
}
else
{
++last_taglen;
}
}
else if (*ci == '<')
{
in_tag = true;
last_taglen = 1;
}
else
{
++real_offset;
}
}
return (offset);
}
// Return the substring of s from character start to character end,
// where tags count as length 0.
std::string tagged_string_substr(const std::string& s, int start, int end)
{
return (s.substr(_find_string_location(s, start),
_find_string_location(s, end)));
}
int tagged_string_printable_length(const std::string& s)
{
int len = 0;
bool in_tag = false;
int last_taglen = 0;
for (std::string::const_iterator ci = s.begin(); ci != s.end(); ++ci)
{
if (in_tag)
{
if (*ci == '<' && last_taglen == 1) // "<<" sequence
{
in_tag = false; // this is an escape for '<'
++len; // len wasn't incremented before
}
else if (*ci == '>') // tag close, still nothing printed
{
in_tag = false;
}
else // tag continues
{
++last_taglen;
}
}
else if (*ci == '<') // tag starts
{
in_tag = true;
last_taglen = 1;
}
else // normal, printable character
{
++len;
}
}
return (len);
}
// Count the length of the tags in the string.
int tagged_string_tag_length(const std::string& s)
{
return s.size() - tagged_string_printable_length(s);
}
|