Annotation of parser3/src/include/pa_string.h, revision 1.185
1.41 paf 1: /** @file
1.43 paf 2: Parser: string class decl.
3:
1.179 misha 4: Copyright (c) 2001-2009 ArtLebedev Group (http://www.artlebedev.com)
1.124 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.1 paf 6: */
7:
8: #ifndef PA_STRING_H
9: #define PA_STRING_H
1.140 paf 10:
1.185 ! misha 11: static const char * const IDENT_STRING_H="$Date: 2009-05-14 11:50:38 $";
1.145 paf 12:
13: // includes
1.4 paf 14: #include "pa_types.h"
1.145 paf 15: #include "pa_array.h"
16:
17: extern "C" { // cord's author forgot to do that
18: #define CORD_NO_IO
19: #include "cord.h"
20: };
1.4 paf 21:
1.164 paf 22: // defines
23:
1.183 misha 24: // cache hash code in String::Body for faster hash access
25: #define HASH_CODE_CACHING
26:
1.146 paf 27: // cord extension
28: /* Returns true if x does contain */
29: /* char not_c at positions i..i+n. Value i,i+n must be < CORD_len(x). */
30: int CORD_range_contains_chr_greater_then(CORD x, size_t i, size_t n, int c);
1.148 paf 31: size_t CORD_block_count(CORD x);
1.146 paf 32:
1.145 paf 33: // forwards
1.9 paf 34:
1.145 paf 35: class Charset;
1.135 paf 36: class Table;
1.71 paf 37: class SQL_Connection;
1.101 parser 38: class Dictionary;
1.145 paf 39: class Request_charsets;
40: class String;
41: typedef Array<const String*> ArrayString;
1.178 misha 42: class VRegex;
1.145 paf 43:
1.155 paf 44: // generally useful
45:
46: int pa_atoi(const char* str, const String* problem_source=0);
47: double pa_atod(const char* str, const String* problem_source=0);
48:
1.145 paf 49: /// this is result of pos functions which mean that substr were not found
50: #define STRING_NOT_FOUND ((size_t)-1)
51:
1.146 paf 52: template<typename T>
53: inline size_t get_length(T current) {
54: return current;
55: }
1.147 paf 56:
1.42 paf 57: /**
1.146 paf 58: String which knows the lang of all it's langs.
1.41 paf 59:
60: All pieces remember
61: - whether they are tainted or not,
1.146 paf 62: and the lang which should be used to detaint them
1.41 paf 63: */
1.176 misha 64:
65:
1.145 paf 66: class String: public PA_Object {
1.1 paf 67: public:
1.48 paf 68:
1.146 paf 69: /** piece is tainted or not. the lang to use when detaint
1.106 parser 70: remember to change String_Untaint_lang_name @ untaint.C along
1.148 paf 71:
72: WARNING WARNING WARNING WARNING WARNING WARNING
73:
74: pos function compares(<=) languages, that is used in searching
75: for table column separator being L_CLEAN or L_AS_IS.
76: they search for AS_IS, meaning AS_IS|CLEAN [doing <=L_AS_IS check].
77:
78: letters assigned for debugging, but it's important for no language-letter
79: come before L_AS_IS other then L_CLEAN
80:
81: WARNING WARNING WARNING WARNING WARNING WARNING
1.106 parser 82: */
1.145 paf 83: enum Language {
1.146 paf 84: L_UNSPECIFIED=0, ///< no real string has parts of this lange: it's just convinient to check when string's empty
1.145 paf 85: // these two must go before others, there are checks for >L_AS_IS
1.170 misha 86: L_CLEAN='0', ///< clean WARNING: read above warning before changing
87: L_AS_IS='A', ///< leave all characters intact WARNING: read above warning before changing
1.122 paf 88:
1.148 paf 89: L_PASS_APPENDED='P',
1.41 paf 90: /**<
1.146 paf 91: leave lang built into string being appended.
1.41 paf 92: just a flag, that value not stored
93: */
1.170 misha 94: L_TAINTED='T', ///< tainted, untaint lang as assigned later
1.146 paf 95: // untaint langs. assigned by ^untaint[lang]{...}
1.170 misha 96: L_FILE_SPEC='F', ///< file specification
97: L_HTTP_HEADER='h', ///< text in HTTP response header
98: L_MAIL_HEADER='m', ///< text in mail header
99: L_URI='U', ///< text in uri
100: L_SQL='Q', ///< ^table:sql body
101: L_JS='J', ///< JavaScript code
1.148 paf 102: L_XML='X', ///< ^dom:set xml
1.170 misha 103: L_HTML='H', ///< HTML code
104: L_REGEX='R', ///< RegEx expression
105: L_HTTP_COOKIE='C', ///< cookies encoded as %uXXXX for compartibility with js functions encode/decode
1.175 misha 106: L_FILE_POST='f', ///temporary escaping zero-char
1.148 paf 107: // READ WARNING ABOVE BEFORE ADDING ANYTHING
1.146 paf 108: L_OPTIMIZE_BIT = 0x80 ///< flag, requiring cstr whitespace optimization
1.27 paf 109: };
110:
1.157 paf 111: enum Trim_kind {
112: TRIM_BOTH,
113: TRIM_START,
114: TRIM_END
115: };
116:
1.176 misha 117:
1.147 paf 118: union Languages {
1.146 paf 119:
1.147 paf 120: struct {
1.160 paf 121: #ifdef PA_LITTLE_ENDIAN
1.147 paf 122: Language lang:8;
1.179 misha 123: size_t is_not_just_lang:sizeof(CORD)*8-8;
1.160 paf 124: #elif defined(PA_BIG_ENDIAN)
1.179 misha 125: size_t is_not_just_lang:sizeof(CORD)*8-8;
1.160 paf 126: Language lang:8;
127: #else
128: # error word endianness not determined for some obscure reason
129: #endif
1.147 paf 130: } opt;
131: CORD langs;
1.146 paf 132:
133: template<typename C>
134: CORD make_langs(C current) const {
1.147 paf 135: return opt.is_not_just_lang?
1.146 paf 136: langs
1.162 paf 137: :CORD_chars((char)opt.lang, get_length(current));
1.146 paf 138: }
139:
140: CORD make_langs(size_t aoffset, size_t alength) const {
1.147 paf 141: return opt.is_not_just_lang?
1.146 paf 142: CORD_substr(langs, aoffset, alength)
1.162 paf 143: :CORD_chars((char)opt.lang, alength);
1.145 paf 144: }
145:
1.157 paf 146: /// appending when 'langs' already contain something [simple cases handled elsewhere]
1.146 paf 147: template<typename C>
148: void append(C current,
149: const CORD to_nonempty_target_langs) {
150: assert(langs);
151:
1.147 paf 152: if(opt.is_not_just_lang)
1.146 paf 153: langs=CORD_cat(langs, to_nonempty_target_langs);
154: else { // we were "just lang"
155: size_t current_size=get_length(current);
156: assert(current_size);
157: langs=CORD_cat(
1.162 paf 158: CORD_chars((char)opt.lang, current_size), // first piece [making from just 'lang']
1.146 paf 159: to_nonempty_target_langs); // new piece
160: }
1.145 paf 161: }
1.146 paf 162:
1.145 paf 163: public:
1.146 paf 164:
165: const char* v() const;
1.164 paf 166: void dump() const;
1.146 paf 167:
168: Languages(): langs(0) {}
1.147 paf 169: Languages(Language alang) {
170: opt.lang=alang;
171: opt.is_not_just_lang=0;
172: }
1.146 paf 173:
174: /// MUST be called exactly prior to modification of current [uses it's length]
175: template<typename C>
176: void append(C current, Language alang, size_t asize) {
177: assert(alang);
178: assert(asize);
179:
1.147 paf 180: if(!opt.is_not_just_lang)
181: if(opt.lang) {
1.181 misha 182: if(opt.lang==alang) // same language? ignoring
1.146 paf 183: return;
184: } else {
1.147 paf 185: opt.lang=alang; // to uninitialized
1.146 paf 186: return;
1.145 paf 187: }
1.146 paf 188:
1.162 paf 189: append(current, CORD_chars((char)alang, asize));
1.146 paf 190: }
191:
1.176 misha 192: template<typename C>
193: void appendHelper(C current, Language alang, C asize_helper) {
194: assert(alang);
195:
196: if(!opt.is_not_just_lang)
197: if(opt.lang) {
1.183 misha 198: if(opt.lang==alang) // same language? ignoring
1.176 misha 199: return;
200: } else {
201: opt.lang=alang; // to uninitialized
202: return;
203: }
204:
205: append(current, CORD_chars((char)alang, asize_helper.length()));
206: }
207:
208: template<typename C>
209: void appendHelper(C current, C length_helper, const Languages src) {
210:
211: if(!langs)
212: langs=src.langs; // to uninitialized
213: else if(!src.opt.is_not_just_lang)
214: appendHelper(current, src.opt.lang, length_helper); // simplifying when simple source
215: else
216: append(current, src.make_langs(length_helper));
217: }
218:
219:
1.146 paf 220: /// MUST be called exactly prior to modification of current [uses it's length]
221: template<typename C>
222: void append(C current,
223: const Languages src, size_t aoffset, size_t alength) {
224: assert(alength);
225:
226: if(!langs) // to uninitialized?
1.147 paf 227: if(src.opt.is_not_just_lang)
1.146 paf 228: langs=CORD_substr(src.langs, aoffset, alength); // to uninitialized complex
229: else
1.147 paf 230: opt.lang=src.opt.lang; // to uninitialized simple
1.146 paf 231: else
1.147 paf 232: if(!opt.is_not_just_lang && !src.opt.is_not_just_lang && opt.lang==src.opt.lang) // both simple & of same language?
1.146 paf 233: return; // ignoring
234: else
235: append(current, src.make_langs(aoffset, alength));
236: }
237:
238: /// checks if we have lang<=alang all from aoffset to aoffset+alength
239: bool check_lang(Language alang, size_t aoffset, size_t alength) const {
240: if(alang==L_UNSPECIFIED) // ignore lang?
241: return true;
242:
1.147 paf 243: if(opt.is_not_just_lang)
1.146 paf 244: return CORD_range_contains_chr_greater_then(langs, aoffset, alength, (unsigned)alang)==0;
245: else
1.169 misha 246: return (unsigned)opt.lang<=(unsigned)alang;
1.146 paf 247: }
248:
1.148 paf 249: /// @returns count of blocks
250: /// @todo currently there can be adjucent blocks of same language. someday merge them
251: size_t count() const {
252: return opt.is_not_just_lang?
253: CORD_block_count(langs)
254: : opt.lang?
255: 1
256: : 0;
257: };
258:
1.146 paf 259: template<typename C, typename I>
260: void for_each(C current,
261: int callback(char, size_t, I), I info) const {
262:
1.147 paf 263: if(opt.is_not_just_lang)
1.146 paf 264: CORD_block_iter(langs, 0, (CORD_block_iter_fn)callback, info);
265: else
1.147 paf 266: callback(opt.lang, get_length(current), info);
1.146 paf 267: }
268:
1.164 paf 269: bool invariant(size_t current_length) const {
1.146 paf 270: if(!langs)
271: return current_length==0;
1.147 paf 272: if(opt.is_not_just_lang)
1.146 paf 273: return CORD_len(langs)==current_length;
274: return true; // uncheckable, actually
275: }
276: };
277:
278: class Body {
279:
280: CORD body;
281:
1.183 misha 282: #ifdef HASH_CODE_CACHING
283: // cached hash code is not reseted on write operations as test shows
284: // that string body does not change after it is stored as a hash key
285: mutable uint hash_code;
286: #endif
287:
1.146 paf 288: public:
289:
290: const char* v() const;
1.164 paf 291: void dump() const;
1.146 paf 292:
1.183 misha 293: #ifdef HASH_CODE_CACHING
294: Body(): body(CORD_EMPTY), hash_code(0) {}
295: Body(CORD abody, uint ahash_code): body(abody), hash_code(ahash_code) {}
296: Body(CORD abody): body(abody), hash_code(0) {
297: #else
1.146 paf 298: Body(): body(CORD_EMPTY) {}
299: Body(CORD abody): body(abody) {
1.183 misha 300: #endif
1.146 paf 301: assert(!body // no body
302: || *body // ordinary string
303: || body[1]==1 // CONCAT_HDR
304: || body[1]==4 // FN_HDR
305: || body[1]==6 // SUBSTR_HDR
306: );
307: }
1.181 misha 308:
1.146 paf 309: static Body Format(int value);
310:
311: void clear() { body=CORD_EMPTY; }
312:
313: bool operator! () const { return is_empty(); }
314:
1.183 misha 315: CORD get_cord() const { return body; }
316: uint get_hash_code() const;
1.146 paf 317:
318: const char* cstr() const { return CORD_to_const_char_star(body); }
319: char* cstrm() const { return CORD_to_char_star(body); }
320:
321: size_t length() const { return CORD_len(body); }
322:
323: bool is_empty() const { return body==CORD_EMPTY; }
324:
325: void append_know_length(const char *str, size_t known_length) {
326: if(known_length)
327: body=CORD_cat_char_star(body, str, known_length);
328: }
329: void append_strdup_know_length(const char* str, size_t known_length) {
330: if(known_length)
331: append_know_length(pa_strdup(str, known_length), known_length);
332: }
333: void append(char c) { body=CORD_cat_char(body, c); }
334: Body& operator << (const Body src) { body=CORD_cat(body, src.body); return *this; }
335: Body& operator << (const char* str) { append_know_length(str, strlen(str)); return *this; }
336:
337: // could not figure out why this operator is needed [should do this chain: string->simple->==]
338: bool operator < (const Body src) const { return CORD_cmp(body, src.body)<0; }
339: bool operator > (const Body src) const { return CORD_cmp(body, src.body)>0; }
340: bool operator <= (const Body src) const { return CORD_cmp(body, src.body)<=0; }
341: bool operator >= (const Body src) const { return CORD_cmp(body, src.body)>=0; }
342: bool operator != (const Body src) const { return CORD_cmp(body, src.body)!=0; }
343: bool operator == (const Body src) const { return CORD_cmp(body, src.body)==0; }
344:
345: int ncmp(size_t x_begin, const Body y, size_t y_begin, size_t size) const {
346: return CORD_ncmp(body, x_begin, y.body, y_begin, size);
1.145 paf 347: }
348:
1.146 paf 349: char fetch(size_t index) const { return CORD_fetch(body, index); }
350: Body mid(size_t index, size_t length) const { return CORD_substr(body, index, length); }
351: size_t pos(const char* substr, size_t offset=0) const { return CORD_str(body, offset, substr); }
352: size_t pos(const Body substr, size_t offset=0) const {
1.180 misha 353: if(substr.is_empty())
1.146 paf 354: return STRING_NOT_FOUND; // in this case CORD_str returns 0 [parser users got used to -1]
1.150 paf 355:
356: // CORD_str checks for bad offset [CORD_chr does not]
1.146 paf 357: return CORD_str(body, offset, substr.body);
358: }
359: size_t pos(char c,
360: size_t offset=0) const {
1.150 paf 361: if(offset>=length()) // CORD_chr does not check that [and ABORT's in that case]
362: return STRING_NOT_FOUND;
363:
1.146 paf 364: return CORD_chr(body, offset, c);
1.145 paf 365: }
1.146 paf 366:
1.159 paf 367: template<typename I> int for_each(
368: int (*f)(char c, I),
369: I info) const {
370: return CORD_iter(body, (CORD_iter_fn)f, (void*)info);
371: }
372:
373: template<typename I> int for_each(
1.149 paf 374: int (*f1)(char c, I),
375: int (*f2)(const char* s, I),
376: I info) const {
1.159 paf 377: return CORD_iter5(body, 0, (CORD_iter_fn)f1, (CORD_batched_iter_fn)f2, info);
1.148 paf 378: }
1.146 paf 379:
380: void set_pos(CORD_pos& pos, size_t index) const { CORD_set_pos(pos, body, index); }
381:
382: /*Body normalize() const {
383: return Body(CORD_balance(body));
384: }*/
1.157 paf 385:
386: /// @returns this or 0 or mid. if returns this or 0 out_* are not filled
387: Body trim(Trim_kind kind=TRIM_BOTH, const char* chars=0,
388: size_t* out_start=0, size_t* out_length=0) const;
1.145 paf 389: };
390:
391: struct C {
392: const char *str;
393: size_t length;
394: operator const char *() { return str; }
1.158 paf 395: C(): str(0), length(0) {}
1.145 paf 396: C(const char *astr, size_t asize): str(astr), length(asize) {}
397: };
398:
399: struct Cm {
400: char *str;
401: size_t length;
402: //operator char *() { return str; }
1.158 paf 403: Cm(): str(0), length(0) {}
1.145 paf 404: Cm(char *astr, size_t asize): str(astr), length(asize) {}
405: };
406:
407: private:
408:
1.152 paf 409: Body body; ///< all characters of string
1.146 paf 410: Languages langs; ///< string characters lang
411:
412: const char* v() const;
1.164 paf 413: void dump() const;
414: #define ASSERT_STRING_INVARIANT(string) \
415: assert((string).langs.invariant((string).body.length()))
1.145 paf 416:
1.8 paf 417: public:
1.151 paf 418:
419: static const String Empty;
1.8 paf 420:
1.181 misha 421: explicit String(){};
1.182 misha 422: explicit String(const char* cstr, Language alang=L_CLEAN){
1.181 misha 423: if(cstr && *cstr){
424: body=cstr;
1.182 misha 425: langs=alang;
1.181 misha 426: }
427: }
1.182 misha 428: explicit String(const String::C cstr, Language alang=L_CLEAN){
1.181 misha 429: if(cstr.length){
430: body=cstr.str;
1.182 misha 431: langs=alang;
1.181 misha 432: }
433: }
1.185 ! misha 434: String(int value, char *format);
1.146 paf 435: String(Body abody, Language alang): body(abody), langs(alang) {
436: ASSERT_STRING_INVARIANT(*this);
437: }
438: String(const String& src): body(src.body), langs(src.langs) {
439: ASSERT_STRING_INVARIANT(*this);
1.145 paf 440: }
441:
442: /// for convinient hash lookup
1.183 misha 443: #ifdef HASH_CODE_CACHING
444: operator const Body&() const { return body; }
445: #else
1.146 paf 446: operator const Body() const { return body; }
1.183 misha 447: #endif
1.145 paf 448:
449: bool is_empty() const { return body.is_empty(); }
450: size_t length() const { return body.length(); }
1.171 misha 451: size_t length(Charset& charset) const;
1.145 paf 452:
453: /// convert to CORD. if 'lang' known, forcing 'lang' to it
1.146 paf 454: Body cstr_to_string_body(Language lang=L_AS_IS,
1.145 paf 455: SQL_Connection* connection=0,
456: const Request_charsets *charsets=0) const;
457:
458: /// convert to constant C string. if 'lang' known, forcing 'lang' to it
459: const char* cstr(Language lang=L_AS_IS,
460: SQL_Connection* connection=0,
461: const Request_charsets *charsets=0) const {
462: return cstr_to_string_body(lang, connection, charsets).cstr();
463: }
464: /// convert to Modifiable C string. if 'lang' known, forcing 'lang' to it
465: char *cstrm(Language lang=L_AS_IS,
466: SQL_Connection* connection=0,
467: const Request_charsets *charsets=0) const {
468: return cstr_to_string_body(lang, connection, charsets).cstrm();
1.50 paf 469: }
1.108 parser 470: /// puts pieces to buf
1.145 paf 471: Cm serialize(size_t prolog_size) const;
1.108 parser 472: /// appends pieces from buf to self
1.145 paf 473: bool deserialize(size_t prolog_size, void *buf, size_t buf_size);
1.146 paf 474: /// @see Body::append_know_length
1.145 paf 475: String& append_know_length(const char* str, size_t known_length, Language lang);
1.146 paf 476: /// @see Body::append_help_length
1.145 paf 477: String& append_help_length(const char* str, size_t helper_length, Language lang);
478: String& append_strdup(const char* str, size_t helper_length, Language lang);
479:
1.146 paf 480: bool operator == (const char* y) const { return body==Body(y); }
481: bool operator != (const char* y) const { return body!=Body(y); }
1.145 paf 482:
483: /// this starts with y
484: bool starts_with(const char* y) const {
1.146 paf 485: return body.ncmp(0/*x_begin*/, Body(y), 0/*y_begin*/, strlen(y))==0;
1.145 paf 486: }
487: /// x starts with this
488: bool this_starts(const char* x) const {
1.146 paf 489: return Body(x).ncmp(0/*x_begin*/, body, 0/*y_begin*/, length())==0;
1.26 paf 490: }
491:
1.145 paf 492: String& append_to(String& dest, Language lang, bool forced) const;
493: String& append(const String& src, Language lang, bool forced=false) {
494: return src.append_to(*this, lang, forced);
495: }
496: String& operator << (const String& src) { return append(src, L_PASS_APPENDED); }
497: String& operator << (const char* src) { return append_help_length(src, 0, L_AS_IS); }
1.147 paf 498: String& operator << (const Body src);
1.100 parser 499:
1.142 paf 500: /// extracts first char of a string, if any
501: char first_char() const {
1.145 paf 502: return is_empty()?0:body.fetch(0);
1.142 paf 503: }
1.54 paf 504:
1.145 paf 505: bool operator < (const String& src) const { return body<src.body; }
506: bool operator > (const String& src) const { return body>src.body; }
507: bool operator <= (const String& src) const { return body<=src.body; }
508: bool operator >= (const String& src) const { return body>=src.body; }
509: bool operator != (const String& src) const { return body!=src.body; }
510: bool operator == (const String& src) const { return body==src.body; }
511:
1.54 paf 512: /// extracts [start, finish) piece of string
1.145 paf 513: String& mid(size_t substr_begin, size_t substr_end) const;
1.172 misha 514: String& mid(Charset& charset, size_t from, size_t to, size_t helper_length=0) const;
1.145 paf 515:
516: /**
517: ignore lang if it's L_UNSPECIFIED
518: but when specified: look for substring that lies in ONE fragment in THAT lang
519: @return position of substr in string, -1 means "not found" [const char* version]
520: */
1.146 paf 521: size_t pos(const Body substr,
1.145 paf 522: size_t this_offset=0, Language lang=L_UNSPECIFIED) const;
523: /// String version of @see pos(const char*, int, Language)
524: size_t pos(const String& substr,
525: size_t this_offset=0, Language lang=L_UNSPECIFIED) const;
526: size_t pos(char c,
527: size_t this_offset=0) const {
528: return body.pos(c, this_offset);
529: }
1.173 misha 530: size_t pos(Charset& charset,
1.171 misha 531: const String& substr,
532: size_t this_offset=0, Language lang=L_UNSPECIFIED) const;
1.55 paf 533:
1.145 paf 534: void split(ArrayString& result,
535: size_t& pos_after,
536: const char* delim,
537: Language lang=L_UNSPECIFIED, int limit=-1) const;
538: void split(ArrayString& result,
539: size_t& pos_after,
1.62 paf 540: const String& delim,
1.145 paf 541: Language lang=L_UNSPECIFIED, int limit=-1) const;
1.62 paf 542:
1.145 paf 543: typedef void (*Row_action)(Table& table, ArrayString* row,
1.136 paf 544: int prestart, int prefinish,
545: int poststart, int postfinish,
1.68 paf 546: void *info);
1.87 parser 547: /**
1.145 paf 548: @return table of found items, if any.
1.87 parser 549: table format is defined and fixed[can be used by others]:
550: @verbatim
551: prematch/match/postmatch/1/2/3/...
552: @endverbatim
553: */
1.178 misha 554: Table* match(VRegex* vregex,
1.99 parser 555: Row_action row_action, void *info,
1.168 misha 556: int& matches_count) const;
1.87 parser 557: enum Change_case_kind {
558: CC_UPPER,
559: CC_LOWER
560: };
1.145 paf 561: String& change_case(Charset& source_charset,
1.87 parser 562: Change_case_kind kind) const;
1.145 paf 563: const String& replace(const Dictionary& dict) const;
1.157 paf 564: const String& trim(Trim_kind kind=TRIM_BOTH, const char* chars=0) const;
1.155 paf 565: double as_double() const { return pa_atod(cstr(), this); }
566: int as_int() const { return pa_atoi(cstr(), this); }
1.167 misha 567: bool as_bool() const { return as_int()!=0; }
1.174 misha 568: const String& escape(Charset& source_charset) const;
1.137 paf 569:
1.7 paf 570: private: //disabled
571:
1.12 paf 572: String& operator = (const String&) { return *this; }
1.7 paf 573:
1.1 paf 574: };
1.119 paf 575:
1.146 paf 576: template<>
577: inline size_t get_length<String::Body>(String::Body body) {
578: return body.length();
579: }
580:
1.183 misha 581: #ifndef HASH_CODE_CACHING
1.145 paf 582: /// simple hash code of string. used by Hash
1.146 paf 583: inline uint hash_code(const String::Body self) {
1.184 misha 584: return self.get_hash_code();
1.119 paf 585: }
1.183 misha 586: #endif
1.147 paf 587:
588:
589: /// now that we've declared specialization we can use it
590: inline String& String::operator << (const String::Body src) {
591: langs.append(body, L_AS_IS, src.length());
592: body<<src;
593: return *this;
594: }
595:
1.1 paf 596:
597: #endif
E-mail: