Annotation of parser3/src/main/pa_string.C, revision 1.181
1.45 paf 1: /** @file
1.174 paf 2: Parser: string class. @see untalength_t.C.
1.46 paf 3:
1.174 paf 4: Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)
1.138 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.164 paf 6: */
1.46 paf 7:
1.181 ! paf 8: static const char* IDENT_STRING_C="$Date: 2003/09/26 13:36:35 $";
1.4 paf 9:
1.70 paf 10: #include "pcre.h"
11:
1.12 paf 12: #include "pa_string.h"
1.22 paf 13: #include "pa_exception.h"
1.61 paf 14: #include "pa_table.h"
1.101 parser 15: #include "pa_dictionary.h"
1.132 paf 16: #include "pa_charset.h"
1.60 paf 17:
1.176 paf 18: // cord lib extension
19:
20: #ifndef DOXYGEN
21: typedef struct {
22: ssize_t countdown;
23: char target; /* Character we're looking for */
24: } chr_data;
25: #endif
26: static int CORD_range_contains_chr_greater_then_proc(char c, size_t size, void* client_data)
27: {
28: register chr_data * d = (chr_data *)client_data;
29:
30: if (d -> countdown<=0) return(2);
31: d -> countdown -= size;
32: if (c > d -> target) return(1);
33: return(0);
34: }
35: int CORD_range_contains_chr_greater_then(CORD x, size_t i, size_t n, int c)
36: {
37: chr_data d;
38:
39: d.countdown = n;
40: d.target = c;
41: return(CORD_block_iter(x, i, CORD_range_contains_chr_greater_then_proc, &d) == 1/*alternatives: 0 normally ended, 2=struck 'n'*/);
42: }
43:
1.178 paf 44: static int CORD_block_count_proc(char c, size_t size, void* client_data)
45: {
46: int* result=(int*)client_data;
47: (*result)++;
48: return(0); // 0=continue
49: }
50: size_t CORD_block_count(CORD x)
51: {
52: size_t result=0;
53: CORD_block_iter(x, 0, CORD_block_count_proc, &result);
54: return result;
55: }
56:
1.174 paf 57: // helpers
1.139 paf 58:
1.174 paf 59: /// String::match uses this as replace & global search table columns
1.139 paf 60:
1.174 paf 61: const int MAX_MATCH_GROUPS=100;
1.139 paf 62:
1.174 paf 63: class String_match_table_template_columns: public ArrayString {
64: public:
65: String_match_table_template_columns() {
66: *this+=new String("prematch");
67: *this+=new String("match");
68: *this+=new String("postmatch");
69: for(int i=0; i<MAX_MATCH_GROUPS; i++) {
1.176 paf 70: *this+=new String(String::Body::Format(1+i), String::L_CLEAN);
1.174 paf 71: }
72: }
73: };
74:
75: Table string_match_table_template(new String_match_table_template_columns);
76:
1.176 paf 77: // String::Body methods
1.140 paf 78:
1.176 paf 79: String::Body String::Body::Format(int value) {
1.174 paf 80: char local[MAX_NUMBER];
81: size_t length=snprintf(local, MAX_NUMBER, "%d", value);
1.176 paf 82: return String::Body(pa_strdup(local, length), length);
1.120 paf 83: }
84:
1.174 paf 85: static int CORD_batched_iter_fn_generic_hash_code(char c, void * client_data) {
86: uint& result=*static_cast<uint*>(client_data);
87: generic_hash_code(result, c);
88: return 0;
89: }
90: static int CORD_batched_iter_fn_generic_hash_code(const char* s, void * client_data) {
91: uint& result=*static_cast<uint*>(client_data);
92: generic_hash_code(result, s);
93: return 0;
94: };
1.176 paf 95: uint String::Body::hash_code() const {
1.174 paf 96: uint result=0;
97: CORD_iter5(body, 0,
98: CORD_batched_iter_fn_generic_hash_code,
99: CORD_batched_iter_fn_generic_hash_code, &result);
1.120 paf 100: return result;
1.94 parser 101: }
102:
1.174 paf 103: // String methods
104:
105: String::String(const char* cstr, size_t helper_length, bool tainted): body(CORD_EMPTY) {
106: append_help_length(cstr, helper_length, tainted?L_TAINTED:L_CLEAN);
1.115 paf 107: }
1.174 paf 108: String::String(const String::C cstr, bool tainted): body(CORD_EMPTY) {
109: append_know_length(cstr.str, cstr.length, tainted?L_TAINTED:L_CLEAN);
1.5 paf 110: }
1.28 paf 111:
1.174 paf 112: String& String::append_know_length(const char* str, size_t known_length, Language lang) {
113: if(!known_length)
1.9 paf 114: return *this;
1.122 paf 115:
1.176 paf 116: // first: langs
117: langs.append(body, lang, known_length);
118: // next: letters themselves
1.174 paf 119: body.append_know_length(str, known_length);
1.1 paf 120:
1.174 paf 121: ASSERT_STRING_INVARIANT(*this);
1.1 paf 122: return *this;
123: }
1.174 paf 124: String& String::append_help_length(const char* str, size_t helper_length, Language lang) {
125: if(!str)
126: return *this;
127: size_t known_length=helper_length?helper_length:strlen(str);
128: if(!known_length)
129: return *this;
1.1 paf 130:
1.174 paf 131: return append_know_length(str, known_length, lang);
1.5 paf 132: }
1.174 paf 133: String& String::append_strdup(const char* str, size_t helper_length, Language lang) {
134: size_t known_length=helper_length?helper_length:strlen(str);
135: if(!known_length)
136: return *this;
1.5 paf 137:
1.176 paf 138: // first: langs
139: langs.append(body, lang, known_length);
140: // next: letters themselves
1.174 paf 141: body.append_strdup_know_length(str, known_length);
1.33 paf 142:
1.174 paf 143: ASSERT_STRING_INVARIANT(*this);
144: return *this;
1.5 paf 145: }
1.46 paf 146:
1.174 paf 147: /// @todo check in doc: whether it documents NOW bad situation "abc".mid(-1, 3) =were?="ab"
148: String& String::mid(size_t substr_begin, size_t substr_end) const {
149: String& result=*new String;
150:
151: size_t self_length=length();
152: substr_begin=min(substr_begin, self_length);
153: substr_end=min(max(substr_end, substr_begin), self_length);
1.176 paf 154: size_t substr_length=substr_end-substr_begin;
155: if(!substr_length)
1.107 parser 156: return result;
1.53 paf 157:
1.176 paf 158: // first: their langs
159: result.langs.append(result.body, langs, substr_begin, substr_length);
160: // next: letters themselves
161: result.body=body.mid(substr_begin, substr_length);
1.174 paf 162:
163: // SAPI::log("piece of '%s' from %d to %d is '%s'",
164: //cstr(), substr_begin, substr_end, result.cstr());
165: ASSERT_STRING_INVARIANT(result);
1.53 paf 166: return result;
1.54 paf 167: }
168:
1.176 paf 169: size_t String::pos(const String::Body substr, size_t this_offset, Language lang) const {
1.174 paf 170: size_t substr_begin=body.pos(substr, this_offset);
1.176 paf 171: if(substr_begin==CORD_NOT_FOUND || !langs.check_lang(lang, substr_begin, substr.length()))
1.174 paf 172: return STRING_NOT_FOUND;
173:
1.176 paf 174: return substr_begin;
1.58 paf 175: }
176:
1.174 paf 177: size_t String::pos(const String& substr,
178: size_t this_offset, Language lang) const {
179: return pos(substr.body, this_offset, lang);
1.60 paf 180: }
181:
1.174 paf 182: void String::split(ArrayString& result,
183: size_t& pos_after,
184: const char* delim,
185: Language lang, int limit) const {
186: size_t self_length=length();
187: if(size_t delim_length=strlen(delim)) {
1.60 paf 188: int pos_before;
189: // while we have 'delim'...
1.174 paf 190: for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) {
1.69 paf 191: result+=&mid(pos_after, pos_before);
1.174 paf 192: pos_after=pos_before+delim_length;
1.60 paf 193: }
194: // last piece
1.174 paf 195: if(pos_after<self_length && limit) {
196: result+=&mid(pos_after, self_length);
197: pos_after=self_length;
1.60 paf 198: }
199: } else { // empty delim
200: result+=this;
1.174 paf 201: pos_after+=self_length;
1.60 paf 202: }
203: }
204:
1.174 paf 205: void String::split(ArrayString& result,
206: size_t& pos_after,
207: const String& delim, Language lang,
208: int limit) const {
1.140 paf 209: if(!delim.is_empty()) {
1.60 paf 210: int pos_before;
211: // while we have 'delim'...
1.174 paf 212: for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) {
1.69 paf 213: result+=&mid(pos_after, pos_before);
1.174 paf 214: pos_after=pos_before+delim.length();
1.60 paf 215: }
216: // last piece
1.174 paf 217: if(pos_after<length() && limit) {
218: result+=&mid(pos_after, length());
219: pos_after=length();
1.60 paf 220: }
221: } else { // empty delim
222: result+=this;
1.174 paf 223: pos_after+=length();
1.60 paf 224: }
1.61 paf 225: }
226:
1.174 paf 227: static void regex_options(const String* options, int *result, bool& need_pre_post_match){
1.63 paf 228: struct Regex_option {
1.174 paf 229: const char* keyL;
230: const char* keyU;
1.63 paf 231: int clear, set;
232: int *result;
1.154 paf 233: bool *flag;
1.63 paf 234: } regex_option[]={
1.153 paf 235: {"i", "I", 0, PCRE_CASELESS, result}, // a=A
236: {"s", "S", 0, PCRE_DOTALL, result}, // \n\n$ [default]
237: {"x", "U", 0, PCRE_EXTENDED, result}, // whitespace in regex ignored
238: {"m", "M", PCRE_DOTALL, PCRE_MULTILINE, result}, // ^aaa\n$^bbb\n$
239: {"g", "G", 0, true, result+1}, // many rows
1.154 paf 240: {"'", 0, 0, 0, 0, &need_pre_post_match},
241: {0}
1.63 paf 242: };
1.171 paf 243: result[0]=PCRE_EXTRA | PCRE_DOTALL | PCRE_DOLLAR_ENDONLY;
1.63 paf 244: result[1]=0;
245:
1.174 paf 246: if(options && !options->is_empty())
1.153 paf 247: for(Regex_option *o=regex_option; o->keyL; o++)
1.174 paf 248: if(options->pos(o->keyL)!=STRING_NOT_FOUND
249: || (o->keyU && options->pos(o->keyU)!=STRING_NOT_FOUND)) {
1.154 paf 250: if(o->flag)
251: *o->flag=true;
252: else { // result
253: *o->result &= ~o->clear;
254: *o->result |= o->set;
255: }
1.63 paf 256: }
257: }
258:
1.174 paf 259: Table* String::match(Charset& source_charset,
260: const String& regexp,
261: const String* options,
262: Row_action row_action, void *info,
263: bool& just_matched) const {
1.140 paf 264: if(regexp.is_empty())
1.149 paf 265: throw Exception(0,
1.174 paf 266: 0,
1.73 paf 267: "regexp is empty");
1.154 paf 268:
1.174 paf 269: const char* pattern=regexp.cstr();
270: const char* errptr;
1.62 paf 271: int erroffset;
1.173 paf 272: bool need_pre_post_match=false;
1.174 paf 273: int option_bits[2]={0}; regex_options(options, option_bits, need_pre_post_match);
274: bool global=option_bits[1]!=0;
1.63 paf 275: pcre *code=pcre_compile(pattern, option_bits[0],
1.62 paf 276: &errptr, &erroffset,
1.174 paf 277: source_charset.pcre_tables);
1.62 paf 278:
1.67 paf 279: if(!code)
1.149 paf 280: throw Exception(0,
1.174 paf 281: ®exp.mid(erroffset, regexp.length()),
1.74 paf 282: "regular expression syntax error - %s", errptr);
1.62 paf 283:
1.174 paf 284: int subpatterns=pcre_info(code, 0, 0);
285: if(subpatterns<0) {
1.100 parser 286: pcre_free(code);
1.149 paf 287: throw Exception(0,
1.174 paf 288: ®exp,
1.76 paf 289: "pcre_info error (%d)",
1.174 paf 290: subpatterns);
1.63 paf 291: }
292:
1.174 paf 293: const char* subject=cstr();
294: size_t subject_length=strlen(subject);
295: const int oveclength=(1/*match*/+MAX_MATCH_GROUPS)*3;
296: int ovector[oveclength];
1.155 paf 297:
298: // create table
1.173 paf 299: Table::Action_options table_options;
1.174 paf 300: Table& table=*new Table(string_match_table_template, table_options);
1.63 paf 301:
1.64 paf 302: int exec_option_bits=0;
1.154 paf 303: int prestart=0;
304: int poststart=0;
1.174 paf 305: int postfinish=length();
1.63 paf 306: while(true) {
307: int exec_substrings=pcre_exec(code, 0,
1.174 paf 308: subject, subject_length, prestart,
309: exec_option_bits, ovector, oveclength);
1.63 paf 310:
311: if(exec_substrings==PCRE_ERROR_NOMATCH) {
1.100 parser 312: pcre_free(code);
1.174 paf 313: row_action(table, 0/*last time, no raw*/, 0, 0, poststart, postfinish, info);
314: if(global || subpatterns)
315: return &table; // global or with subpatterns=true+result
316: else {
317: just_matched=false; return 0; // not global=no result
318: }
1.63 paf 319: }
320:
321: if(exec_substrings<0) {
1.100 parser 322: pcre_free(code);
1.149 paf 323: throw Exception(0,
1.174 paf 324: ®exp,
1.76 paf 325: "regular expression execute error (%d)",
1.63 paf 326: exec_substrings);
327: }
328:
1.154 paf 329: int prefinish=ovector[0];
330: poststart=ovector[1];
1.174 paf 331: ArrayString* row=new ArrayString;
332: if(need_pre_post_match) {
333: *row+=&mid(0, prefinish); // .prematch column value
334: *row+=&mid(prefinish, poststart); // .match
335: *row+=&mid(poststart, postfinish); // .postmatch
336: } else {
337: *row+=0; // .prematch column value
338: *row+=0; // .match
339: *row+=0; // .postmatch
340: }
1.63 paf 341:
342: for(int i=1; i<exec_substrings; i++) {
1.69 paf 343: // -1:-1 case handled peacefully by mid() itself
1.174 paf 344: *row+=&mid(ovector[i*2+0], ovector[i*2+1]); // .i column value
1.63 paf 345: }
346:
1.174 paf 347: row_action(table, row, prestart, prefinish, poststart, postfinish, info);
1.63 paf 348:
1.174 paf 349: if(!global || prestart==poststart) { // not global | going to hang
1.100 parser 350: pcre_free(code);
1.174 paf 351: row_action(table, 0/*last time, no row*/, 0, 0, poststart, postfinish, info);
352: return &table;
1.63 paf 353: }
1.154 paf 354: prestart=poststart;
1.63 paf 355:
356: /*
357: if(option_bits[0] & PCRE_MULTILINE)
1.64 paf 358: exec_option_bits|=PCRE_NOTBOL; // start of subject+startoffset not BOL
1.63 paf 359: */
360: }
1.82 parser 361: }
362:
1.174 paf 363: String& String::change_case(Charset& source_charset, Change_case_kind kind) const {
364: String& result=*new String();
365: if(is_empty())
366: return result;
367:
368: char* new_cstr=cstrm();
369: char *dest=new_cstr;
1.181 ! paf 370: if(source_charset.isUTF8()) {
! 371: switch(kind) {
! 372: case CC_UPPER:
! 373: change_case_UTF8((const XMLByte*)new_cstr, (XMLByte*)new_cstr, UTF8CaseToUpper);
! 374: break;
! 375: case CC_LOWER:
! 376: change_case_UTF8((const XMLByte*)new_cstr, (XMLByte*)new_cstr, UTF8CaseToLower);
! 377: break;
! 378: default:
! 379: assert(!"unknown change case kind");
! 380: break; // never
! 381: }
! 382:
! 383: } else {
! 384: const unsigned char *tables=source_charset.pcre_tables;
1.82 parser 385:
1.181 ! paf 386: const unsigned char *a;
! 387: const unsigned char *b;
! 388: switch(kind) {
! 389: case CC_UPPER:
! 390: a=tables+lcc_offset;
! 391: b=tables+fcc_offset;
! 392: break;
! 393: case CC_LOWER:
! 394: a=tables+lcc_offset;
! 395: b=0;
! 396: break;
! 397: default:
! 398: assert(!"unknown change case kind");
! 399: a=b=0; // calm, compiler
! 400: break; // never
! 401: }
! 402:
! 403: unsigned char index;
! 404: for(const char* current=new_cstr; index=(unsigned char)*current; current++) {
! 405: unsigned char c=a[index];
! 406: if(b)
! 407: c=b[c];
! 408:
! 409: *dest++=(char)c;
! 410: }
1.174 paf 411: }
1.176 paf 412: result.langs=langs;
1.174 paf 413: result.body=new_cstr;
1.89 parser 414:
1.101 parser 415: return result;
416: }
417:
1.174 paf 418: const String& String::replace(const Dictionary& dict) const {
419: String& result=*new String();
420: const char* old_cstr=cstr();
421: const char* prematch_begin=old_cstr;
422:
423: const char* current=old_cstr;
424: while(*current) {
425: if(Table::element_type row=dict.first_that_begins(current)) {
426: // prematch
427: if(size_t prematch_length=current-prematch_begin) {
1.179 paf 428: result.langs.append(result.body, langs, prematch_begin-old_cstr, prematch_length);
1.174 paf 429: result.body.append_strdup_know_length(prematch_begin, prematch_length);
1.101 parser 430: }
431:
1.174 paf 432: // match
1.170 paf 433:
1.174 paf 434: const String* a=row->get(0);
435: // skip 'a' in 'current'; move prematch_begin
436: current+=a->length(); prematch_begin=current;
437:
438: if(row->count()>1) { // are there any b?
439: const String* b=row->get(1);
440: result<<*b;
441: }
442: } else // simply advance
443: current++;
444: }
1.156 paf 445:
1.174 paf 446: // postmatch
447: if(size_t postmatch_length=current-prematch_begin) {
1.179 paf 448: result.langs.append(result.body, langs, prematch_begin-old_cstr, postmatch_length);
1.174 paf 449: result.body.append_strdup_know_length(prematch_begin, postmatch_length);
450: }
1.156 paf 451:
1.174 paf 452: ASSERT_STRING_INVARIANT(result);
1.89 parser 453: return result;
454: }
455:
1.90 parser 456: double String::as_double() const {
1.89 parser 457: double result;
1.174 paf 458: const char *str=cstr();
459:
460: while(*str && isspace(*str))
461: str++;
462: if(!*str)
1.162 paf 463: return 0;
1.161 paf 464:
1.102 parser 465: char *error_pos;
1.89 parser 466: // 0xABC
1.174 paf 467: if(str[0]=='0')
468: if(str[1]=='x' || str[1]=='X')
469: result=(double)(unsigned long)strtol(str, &error_pos, 0);
1.99 parser 470: else
1.174 paf 471: result=(double)strtod(str+1/*skip leading 0*/, &error_pos);
1.89 parser 472: else
1.174 paf 473: result=(double)strtod(str, &error_pos);
1.89 parser 474:
1.159 paf 475: while(char c=*error_pos++)
476: if(!isspace(c))
477: throw Exception("number.format",
478: this,
479: "invalid number (double)");
1.89 parser 480:
481: return result;
482: }
1.90 parser 483: int String::as_int() const {
1.89 parser 484: int result;
1.174 paf 485: const char *str=cstr();
486:
487: while(*str && isspace(*str))
488: str++;
489: if(!*str)
1.162 paf 490: return 0;
1.161 paf 491:
1.102 parser 492: char *error_pos;
1.89 parser 493: // 0xABC
1.174 paf 494: if(str[0]=='0')
495: if(str[1]=='x' || str[1]=='X')
496: result=(int)(unsigned long)strtol(str, &error_pos, 0);
1.99 parser 497: else
1.174 paf 498: result=(int)strtol(str+1/*skip leading 0*/, &error_pos, 0);
1.89 parser 499: else
1.174 paf 500: result=(int)strtol(str, &error_pos, 0);
1.89 parser 501:
1.159 paf 502: while(char c=*error_pos++)
503: if(!isspace(c))
504: throw Exception("number.format",
505: this,
506: "invalid number (int)");
1.82 parser 507:
508: return result;
1.61 paf 509: }
1.113 parser 510:
1.180 paf 511: static int serialize_body_char(char c, char** cur) {
512: *((*cur)++)=c;
513: return 0; // 0=continue
514: };
1.174 paf 515: static int serialize_body_piece(const char* s, char** cur) {
516: size_t length=strlen(s);
517: memcpy(*cur, s, length); *cur+=length;
1.178 paf 518: return 0; // 0=continue
1.174 paf 519: };
1.178 paf 520: static int serialize_lang_piece(char alang, size_t asize, char** cur) {
521: // lang
522: memcpy(*cur, &alang, sizeof(alang)); *cur+=sizeof(alang);
523: // length
524: memcpy(*cur, &asize, sizeof(asize)); *cur+=sizeof(asize);
525:
526: return 0; // 0=continue
527: }
1.174 paf 528: String::Cm String::serialize(size_t prolog_length) const {
1.178 paf 529: size_t fragments_count=langs.count();
1.174 paf 530: size_t buf_length=
1.178 paf 531: prolog_length //1
532: +sizeof(size_t) //2
533: +fragments_count*(sizeof(char)+sizeof(size_t)) //3
534: +body.length() //4
535: +1; // for zero terminator used in deserialize
1.174 paf 536: String::Cm result(new(PointerFreeGC) char[buf_length], buf_length);
537:
538: // 1: prolog
539: char *cur=result.str+prolog_length;
1.176 paf 540: // 2: langs.count
1.174 paf 541: memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count);
542: // 3: lang info
1.178 paf 543: langs.for_each(body, serialize_lang_piece, &cur);
1.174 paf 544: // 4: letters
1.180 paf 545: body.for_each(serialize_body_char, serialize_body_piece, &cur);
1.178 paf 546: // 5: zero terminator already there put by new(PointerFreeGC)
1.113 parser 547:
1.174 paf 548: return result;
1.113 parser 549: }
1.174 paf 550: bool String::deserialize(size_t prolog_length, void *buf, size_t buf_length) {
551: if(buf_length<=prolog_length)
1.148 paf 552: return false;
1.174 paf 553: buf_length-=prolog_length;
1.178 paf 554: buf_length-=1; // 5: zero terminator
1.135 paf 555:
1.174 paf 556: // 1: prolog
557: const char* cur=(const char* )buf+prolog_length;
1.113 parser 558:
1.176 paf 559: // 2: langs.count
560: if(buf_length<sizeof(size_t)) // langs.count don't fit?
1.174 paf 561: return false;
562: size_t fragments_count=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t);
563: buf_length-=sizeof(size_t);
564:
565: if(fragments_count) {
566: // 3: lang info
567: size_t total_length=0;
568: for(size_t f=0; f<fragments_count; f++) {
1.178 paf 569: size_t piece_length=sizeof(char)+sizeof(size_t);
1.174 paf 570: if(buf_length<piece_length) // lang+length
571: return false;
572:
1.178 paf 573: Language lang=*reinterpret_cast<const Language *>(cur); cur+=sizeof(char);
1.174 paf 574: size_t fragment_length=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t);
1.178 paf 575: langs.append(total_length, lang, fragment_length);
1.174 paf 576: total_length+=fragment_length;
1.148 paf 577:
1.174 paf 578: buf_length-=piece_length;
579: }
1.128 paf 580:
1.174 paf 581: // 4: letters
582: if(buf_length!=total_length)
1.148 paf 583: return false;
584:
1.178 paf 585: // serialize wrote extra zero byte there, we can rely on that
1.176 paf 586: body=String::Body(cur, buf_length);
1.174 paf 587: }
1.113 parser 588:
1.174 paf 589: ASSERT_STRING_INVARIANT(*this);
1.148 paf 590: return true;
1.176 paf 591: }
592:
593: const char* String::Body::v() const {
594: return CORD_to_const_char_star(body);
595: }
596: const char* String::Languages::v() const {
1.177 paf 597: if(opt.is_not_just_lang)
1.176 paf 598: return CORD_to_const_char_star(langs);
599: else
600: return (const char*)&langs;
601: }
602: const char* String::v() const {
603: #define LIMIT_VIEW 20
604: char* buf=(char*)malloc(MAX_STRING);
605: const char*body_view=body.v();
606: const char*langs_view=langs.v();
607: snprintf(buf, MAX_STRING,
1.178 paf 608: "%d:%.*s%s} "
1.176 paf 609: "{%d:%s",
1.178 paf 610: langs.count(), LIMIT_VIEW, langs_view, strlen(langs_view)>LIMIT_VIEW?"...":"",
1.176 paf 611: strlen(body_view), body_view
612: );
613:
614: return buf;
615: #undef LIMIT_VIEW
1.113 parser 616: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to pa_string.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main