Annotation of parser3/src/main/pa_string.C, revision 1.184
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.184 ! paf 8: static const char* IDENT_STRING_C="$Date: 2003/09/30 05:20:16 $";
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.183 paf 170: size_t substr_length=substr.length();
171: while(true) {
172: size_t substr_begin=body.pos(substr, this_offset);
173:
174: if(substr_begin==CORD_NOT_FOUND)
175: return STRING_NOT_FOUND;
1.174 paf 176:
1.183 paf 177: if(langs.check_lang(lang, substr_begin, substr_length))
178: return substr_begin;
179:
180: this_offset=substr_begin+substr_length;
181: }
1.58 paf 182: }
183:
1.174 paf 184: size_t String::pos(const String& substr,
185: size_t this_offset, Language lang) const {
186: return pos(substr.body, this_offset, lang);
1.60 paf 187: }
188:
1.174 paf 189: void String::split(ArrayString& result,
190: size_t& pos_after,
191: const char* delim,
192: Language lang, int limit) const {
193: size_t self_length=length();
194: if(size_t delim_length=strlen(delim)) {
1.60 paf 195: int pos_before;
196: // while we have 'delim'...
1.174 paf 197: for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) {
1.69 paf 198: result+=&mid(pos_after, pos_before);
1.174 paf 199: pos_after=pos_before+delim_length;
1.60 paf 200: }
201: // last piece
1.174 paf 202: if(pos_after<self_length && limit) {
203: result+=&mid(pos_after, self_length);
204: pos_after=self_length;
1.60 paf 205: }
206: } else { // empty delim
207: result+=this;
1.174 paf 208: pos_after+=self_length;
1.60 paf 209: }
210: }
211:
1.174 paf 212: void String::split(ArrayString& result,
213: size_t& pos_after,
214: const String& delim, Language lang,
215: int limit) const {
1.140 paf 216: if(!delim.is_empty()) {
1.60 paf 217: int pos_before;
218: // while we have 'delim'...
1.174 paf 219: for(; (pos_before=pos(delim, pos_after, lang))!=STRING_NOT_FOUND && limit; limit--) {
1.69 paf 220: result+=&mid(pos_after, pos_before);
1.174 paf 221: pos_after=pos_before+delim.length();
1.60 paf 222: }
223: // last piece
1.174 paf 224: if(pos_after<length() && limit) {
225: result+=&mid(pos_after, length());
226: pos_after=length();
1.60 paf 227: }
228: } else { // empty delim
229: result+=this;
1.174 paf 230: pos_after+=length();
1.60 paf 231: }
1.61 paf 232: }
233:
1.174 paf 234: static void regex_options(const String* options, int *result, bool& need_pre_post_match){
1.63 paf 235: struct Regex_option {
1.174 paf 236: const char* keyL;
237: const char* keyU;
1.63 paf 238: int clear, set;
239: int *result;
1.154 paf 240: bool *flag;
1.63 paf 241: } regex_option[]={
1.153 paf 242: {"i", "I", 0, PCRE_CASELESS, result}, // a=A
243: {"s", "S", 0, PCRE_DOTALL, result}, // \n\n$ [default]
244: {"x", "U", 0, PCRE_EXTENDED, result}, // whitespace in regex ignored
245: {"m", "M", PCRE_DOTALL, PCRE_MULTILINE, result}, // ^aaa\n$^bbb\n$
246: {"g", "G", 0, true, result+1}, // many rows
1.154 paf 247: {"'", 0, 0, 0, 0, &need_pre_post_match},
248: {0}
1.63 paf 249: };
1.171 paf 250: result[0]=PCRE_EXTRA | PCRE_DOTALL | PCRE_DOLLAR_ENDONLY;
1.63 paf 251: result[1]=0;
252:
1.174 paf 253: if(options && !options->is_empty())
1.153 paf 254: for(Regex_option *o=regex_option; o->keyL; o++)
1.174 paf 255: if(options->pos(o->keyL)!=STRING_NOT_FOUND
256: || (o->keyU && options->pos(o->keyU)!=STRING_NOT_FOUND)) {
1.154 paf 257: if(o->flag)
258: *o->flag=true;
259: else { // result
260: *o->result &= ~o->clear;
261: *o->result |= o->set;
262: }
1.63 paf 263: }
264: }
265:
1.174 paf 266: Table* String::match(Charset& source_charset,
267: const String& regexp,
268: const String* options,
269: Row_action row_action, void *info,
270: bool& just_matched) const {
1.140 paf 271: if(regexp.is_empty())
1.149 paf 272: throw Exception(0,
1.174 paf 273: 0,
1.73 paf 274: "regexp is empty");
1.154 paf 275:
1.174 paf 276: const char* pattern=regexp.cstr();
277: const char* errptr;
1.62 paf 278: int erroffset;
1.173 paf 279: bool need_pre_post_match=false;
1.174 paf 280: int option_bits[2]={0}; regex_options(options, option_bits, need_pre_post_match);
281: bool global=option_bits[1]!=0;
1.63 paf 282: pcre *code=pcre_compile(pattern, option_bits[0],
1.62 paf 283: &errptr, &erroffset,
1.174 paf 284: source_charset.pcre_tables);
1.62 paf 285:
1.67 paf 286: if(!code)
1.149 paf 287: throw Exception(0,
1.174 paf 288: ®exp.mid(erroffset, regexp.length()),
1.74 paf 289: "regular expression syntax error - %s", errptr);
1.62 paf 290:
1.174 paf 291: int subpatterns=pcre_info(code, 0, 0);
292: if(subpatterns<0) {
1.100 parser 293: pcre_free(code);
1.149 paf 294: throw Exception(0,
1.174 paf 295: ®exp,
1.76 paf 296: "pcre_info error (%d)",
1.174 paf 297: subpatterns);
1.63 paf 298: }
299:
1.174 paf 300: const char* subject=cstr();
301: size_t subject_length=strlen(subject);
302: const int oveclength=(1/*match*/+MAX_MATCH_GROUPS)*3;
303: int ovector[oveclength];
1.155 paf 304:
305: // create table
1.173 paf 306: Table::Action_options table_options;
1.174 paf 307: Table& table=*new Table(string_match_table_template, table_options);
1.63 paf 308:
1.64 paf 309: int exec_option_bits=0;
1.154 paf 310: int prestart=0;
311: int poststart=0;
1.174 paf 312: int postfinish=length();
1.63 paf 313: while(true) {
314: int exec_substrings=pcre_exec(code, 0,
1.174 paf 315: subject, subject_length, prestart,
316: exec_option_bits, ovector, oveclength);
1.63 paf 317:
318: if(exec_substrings==PCRE_ERROR_NOMATCH) {
1.100 parser 319: pcre_free(code);
1.174 paf 320: row_action(table, 0/*last time, no raw*/, 0, 0, poststart, postfinish, info);
321: if(global || subpatterns)
322: return &table; // global or with subpatterns=true+result
323: else {
324: just_matched=false; return 0; // not global=no result
325: }
1.63 paf 326: }
327:
328: if(exec_substrings<0) {
1.100 parser 329: pcre_free(code);
1.149 paf 330: throw Exception(0,
1.174 paf 331: ®exp,
1.76 paf 332: "regular expression execute error (%d)",
1.63 paf 333: exec_substrings);
334: }
335:
1.154 paf 336: int prefinish=ovector[0];
337: poststart=ovector[1];
1.174 paf 338: ArrayString* row=new ArrayString;
339: if(need_pre_post_match) {
340: *row+=&mid(0, prefinish); // .prematch column value
341: *row+=&mid(prefinish, poststart); // .match
342: *row+=&mid(poststart, postfinish); // .postmatch
343: } else {
344: *row+=0; // .prematch column value
345: *row+=0; // .match
346: *row+=0; // .postmatch
347: }
1.63 paf 348:
349: for(int i=1; i<exec_substrings; i++) {
1.69 paf 350: // -1:-1 case handled peacefully by mid() itself
1.174 paf 351: *row+=&mid(ovector[i*2+0], ovector[i*2+1]); // .i column value
1.63 paf 352: }
353:
1.174 paf 354: row_action(table, row, prestart, prefinish, poststart, postfinish, info);
1.63 paf 355:
1.174 paf 356: if(!global || prestart==poststart) { // not global | going to hang
1.100 parser 357: pcre_free(code);
1.174 paf 358: row_action(table, 0/*last time, no row*/, 0, 0, poststart, postfinish, info);
359: return &table;
1.63 paf 360: }
1.154 paf 361: prestart=poststart;
1.63 paf 362:
363: /*
364: if(option_bits[0] & PCRE_MULTILINE)
1.64 paf 365: exec_option_bits|=PCRE_NOTBOL; // start of subject+startoffset not BOL
1.63 paf 366: */
367: }
1.82 parser 368: }
369:
1.174 paf 370: String& String::change_case(Charset& source_charset, Change_case_kind kind) const {
371: String& result=*new String();
372: if(is_empty())
373: return result;
374:
375: char* new_cstr=cstrm();
376: char *dest=new_cstr;
1.181 paf 377: if(source_charset.isUTF8()) {
378: switch(kind) {
379: case CC_UPPER:
380: change_case_UTF8((const XMLByte*)new_cstr, (XMLByte*)new_cstr, UTF8CaseToUpper);
381: break;
382: case CC_LOWER:
383: change_case_UTF8((const XMLByte*)new_cstr, (XMLByte*)new_cstr, UTF8CaseToLower);
384: break;
385: default:
386: assert(!"unknown change case kind");
387: break; // never
388: }
389:
390: } else {
391: const unsigned char *tables=source_charset.pcre_tables;
1.82 parser 392:
1.181 paf 393: const unsigned char *a;
394: const unsigned char *b;
395: switch(kind) {
396: case CC_UPPER:
397: a=tables+lcc_offset;
398: b=tables+fcc_offset;
399: break;
400: case CC_LOWER:
401: a=tables+lcc_offset;
402: b=0;
403: break;
404: default:
405: assert(!"unknown change case kind");
406: a=b=0; // calm, compiler
407: break; // never
408: }
409:
410: unsigned char index;
411: for(const char* current=new_cstr; index=(unsigned char)*current; current++) {
412: unsigned char c=a[index];
413: if(b)
414: c=b[c];
415:
416: *dest++=(char)c;
417: }
1.174 paf 418: }
1.176 paf 419: result.langs=langs;
1.174 paf 420: result.body=new_cstr;
1.89 parser 421:
1.101 parser 422: return result;
423: }
424:
1.174 paf 425: const String& String::replace(const Dictionary& dict) const {
426: String& result=*new String();
427: const char* old_cstr=cstr();
428: const char* prematch_begin=old_cstr;
429:
430: const char* current=old_cstr;
431: while(*current) {
1.184 ! paf 432: if(Dictionary::Subst subst=dict.first_that_begins(current)) {
1.174 paf 433: // prematch
434: if(size_t prematch_length=current-prematch_begin) {
1.179 paf 435: result.langs.append(result.body, langs, prematch_begin-old_cstr, prematch_length);
1.174 paf 436: result.body.append_strdup_know_length(prematch_begin, prematch_length);
1.101 parser 437: }
438:
1.174 paf 439: // match
440: // skip 'a' in 'current'; move prematch_begin
1.184 ! paf 441: current+=subst.from_length; prematch_begin=current;
1.174 paf 442:
1.184 ! paf 443: if(const String* b=subst.to) // are there any b?
1.174 paf 444: result<<*b;
445: } else // simply advance
446: current++;
447: }
1.156 paf 448:
1.174 paf 449: // postmatch
450: if(size_t postmatch_length=current-prematch_begin) {
1.179 paf 451: result.langs.append(result.body, langs, prematch_begin-old_cstr, postmatch_length);
1.174 paf 452: result.body.append_strdup_know_length(prematch_begin, postmatch_length);
453: }
1.156 paf 454:
1.174 paf 455: ASSERT_STRING_INVARIANT(result);
1.89 parser 456: return result;
457: }
458:
1.90 parser 459: double String::as_double() const {
1.89 parser 460: double result;
1.174 paf 461: const char *str=cstr();
462:
463: while(*str && isspace(*str))
464: str++;
465: if(!*str)
1.162 paf 466: return 0;
1.161 paf 467:
1.102 parser 468: char *error_pos;
1.89 parser 469: // 0xABC
1.174 paf 470: if(str[0]=='0')
471: if(str[1]=='x' || str[1]=='X')
472: result=(double)(unsigned long)strtol(str, &error_pos, 0);
1.99 parser 473: else
1.174 paf 474: result=(double)strtod(str+1/*skip leading 0*/, &error_pos);
1.89 parser 475: else
1.174 paf 476: result=(double)strtod(str, &error_pos);
1.89 parser 477:
1.159 paf 478: while(char c=*error_pos++)
479: if(!isspace(c))
480: throw Exception("number.format",
481: this,
482: "invalid number (double)");
1.89 parser 483:
484: return result;
485: }
1.90 parser 486: int String::as_int() const {
1.89 parser 487: int result;
1.174 paf 488: const char *str=cstr();
489:
490: while(*str && isspace(*str))
491: str++;
492: if(!*str)
1.162 paf 493: return 0;
1.161 paf 494:
1.102 parser 495: char *error_pos;
1.89 parser 496: // 0xABC
1.174 paf 497: if(str[0]=='0')
498: if(str[1]=='x' || str[1]=='X')
499: result=(int)(unsigned long)strtol(str, &error_pos, 0);
1.99 parser 500: else
1.174 paf 501: result=(int)strtol(str+1/*skip leading 0*/, &error_pos, 0);
1.89 parser 502: else
1.174 paf 503: result=(int)strtol(str, &error_pos, 0);
1.89 parser 504:
1.159 paf 505: while(char c=*error_pos++)
506: if(!isspace(c))
507: throw Exception("number.format",
508: this,
509: "invalid number (int)");
1.82 parser 510:
511: return result;
1.61 paf 512: }
1.113 parser 513:
1.180 paf 514: static int serialize_body_char(char c, char** cur) {
515: *((*cur)++)=c;
516: return 0; // 0=continue
517: };
1.174 paf 518: static int serialize_body_piece(const char* s, char** cur) {
519: size_t length=strlen(s);
520: memcpy(*cur, s, length); *cur+=length;
1.178 paf 521: return 0; // 0=continue
1.174 paf 522: };
1.178 paf 523: static int serialize_lang_piece(char alang, size_t asize, char** cur) {
524: // lang
525: memcpy(*cur, &alang, sizeof(alang)); *cur+=sizeof(alang);
526: // length
527: memcpy(*cur, &asize, sizeof(asize)); *cur+=sizeof(asize);
528:
529: return 0; // 0=continue
530: }
1.174 paf 531: String::Cm String::serialize(size_t prolog_length) const {
1.178 paf 532: size_t fragments_count=langs.count();
1.174 paf 533: size_t buf_length=
1.178 paf 534: prolog_length //1
535: +sizeof(size_t) //2
536: +fragments_count*(sizeof(char)+sizeof(size_t)) //3
537: +body.length() //4
538: +1; // for zero terminator used in deserialize
1.174 paf 539: String::Cm result(new(PointerFreeGC) char[buf_length], buf_length);
540:
541: // 1: prolog
542: char *cur=result.str+prolog_length;
1.176 paf 543: // 2: langs.count
1.174 paf 544: memcpy(cur, &fragments_count, sizeof(fragments_count)); cur+=sizeof(fragments_count);
545: // 3: lang info
1.178 paf 546: langs.for_each(body, serialize_lang_piece, &cur);
1.174 paf 547: // 4: letters
1.180 paf 548: body.for_each(serialize_body_char, serialize_body_piece, &cur);
1.182 paf 549: // 5: zero terminator
550: *cur=0;
1.113 parser 551:
1.174 paf 552: return result;
1.113 parser 553: }
1.174 paf 554: bool String::deserialize(size_t prolog_length, void *buf, size_t buf_length) {
555: if(buf_length<=prolog_length)
1.148 paf 556: return false;
1.174 paf 557: buf_length-=prolog_length;
1.178 paf 558: buf_length-=1; // 5: zero terminator
1.135 paf 559:
1.174 paf 560: // 1: prolog
561: const char* cur=(const char* )buf+prolog_length;
1.113 parser 562:
1.176 paf 563: // 2: langs.count
564: if(buf_length<sizeof(size_t)) // langs.count don't fit?
1.174 paf 565: return false;
566: size_t fragments_count=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t);
567: buf_length-=sizeof(size_t);
568:
569: if(fragments_count) {
570: // 3: lang info
571: size_t total_length=0;
572: for(size_t f=0; f<fragments_count; f++) {
1.178 paf 573: size_t piece_length=sizeof(char)+sizeof(size_t);
1.174 paf 574: if(buf_length<piece_length) // lang+length
575: return false;
576:
1.178 paf 577: Language lang=*reinterpret_cast<const Language *>(cur); cur+=sizeof(char);
1.174 paf 578: size_t fragment_length=*reinterpret_cast<const size_t*>(cur); cur+=sizeof(size_t);
1.178 paf 579: langs.append(total_length, lang, fragment_length);
1.174 paf 580: total_length+=fragment_length;
1.148 paf 581:
1.174 paf 582: buf_length-=piece_length;
583: }
1.128 paf 584:
1.174 paf 585: // 4: letters
586: if(buf_length!=total_length)
1.148 paf 587: return false;
588:
1.178 paf 589: // serialize wrote extra zero byte there, we can rely on that
1.176 paf 590: body=String::Body(cur, buf_length);
1.174 paf 591: }
1.113 parser 592:
1.174 paf 593: ASSERT_STRING_INVARIANT(*this);
1.148 paf 594: return true;
1.176 paf 595: }
596:
597: const char* String::Body::v() const {
598: return CORD_to_const_char_star(body);
599: }
600: const char* String::Languages::v() const {
1.177 paf 601: if(opt.is_not_just_lang)
1.176 paf 602: return CORD_to_const_char_star(langs);
603: else
604: return (const char*)&langs;
605: }
606: const char* String::v() const {
607: #define LIMIT_VIEW 20
608: char* buf=(char*)malloc(MAX_STRING);
609: const char*body_view=body.v();
610: const char*langs_view=langs.v();
611: snprintf(buf, MAX_STRING,
1.178 paf 612: "%d:%.*s%s} "
1.176 paf 613: "{%d:%s",
1.178 paf 614: langs.count(), LIMIT_VIEW, langs_view, strlen(langs_view)>LIMIT_VIEW?"...":"",
1.176 paf 615: strlen(body_view), body_view
616: );
617:
618: return buf;
619: #undef LIMIT_VIEW
1.113 parser 620: }
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