Annotation of parser3/src/include/pa_string.h, revision 1.144.2.28.2.20
1.41 paf 1: /** @file
1.43 paf 2: Parser: string class decl.
3:
1.144.2.18 paf 4: Copyright (c) 2001-2003 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.144.2.28.2. 0(paf 11:3): static const char* IDENT_STRING_H="$Date: 2003/03/21 15:00:36 $";
1.144.2.10 paf 12:
13: // includes
1.1 paf 14:
1.144.2.12 paf 15: #include "pa_types.h"
16: #include "pa_array.h"
1.4 paf 17:
1.144.2.28.2. (paf 18:): extern "C" { // cord's author forgot to do that
19:): #include "cord.h"
20:): };
21:):
1.144.2.12 paf 22: // forwards
1.144.2.10 paf 23:
1.144.2.28 paf 24: class Charset;
1.144.2.28.2. (paf 25:): class Table;
1.144.2.5 paf 26: class SQL_Connection;
27: class Dictionary;
1.144.2.15 paf 28: class Request_charsets;
1.144.2.28.2. (paf 29:): class String;
7(paf 30:3): typedef Array<const String*> ArrayString;
1.144.2.5 paf 31:
32: // helpers
1.144.2.28.2. 0(paf 33:3): /*
(paf 34:): /// appends clean piece to String @see String::append
7(paf 35:3): #define APPEND_CLEAN(src, length) append(src, length, String::L_CLEAN)
(paf 36:): /// appends piece to String as-is @see String::append
7(paf 37:3): #define APPEND_AS_IS(src, length) append(src, length, String::L_AS_IS)
(paf 38:): /// appends tainted piece to String @see String::append
7(paf 39:3): #define APPEND_TAINTED(src, length) append(src, length, String::L_TAINTED)
(paf 40:): /// handy: appends const char* piece to String @see String::append
41:): #define APPEND_CONST(src) APPEND_AS_IS(src, 0)
0(paf 42:3): */
(paf 43:): /// this is result of pos functions which mean that substr were not found
44:): #define STRING_NOT_FOUND ((size_t)-1)
45:):
7(paf 46:3): class StringBody {
47:3):
48:3): CORD body;
49:3):
50:3): public:
51:3):
52:3): StringBody(): body(CORD_EMPTY) {}
53:3): StringBody(CORD abody): body(abody) {}
54:3):
55:3): void clear() { body=CORD_EMPTY; }
56:3):
57:3): uint hash_code() const;
58:3):
0(paf 59:3): const char* cstr() const { return CORD_to_const_char_star(body); }
60:3): //char* cstrm() const { return CORD_to_char_star(body); }
61:3):
7(paf 62:3): size_t length() const { return CORD_len(body); }
63:3):
64:3): bool is_empty() const { return body==CORD_EMPTY; }
65:3):
66:3): void append(const char *str, size_t length) {
67:3): CORD_cat_char_star(body, str, length);
68:3): }
69:3): void append(char c) { CORD_cat_char(body, c); }
9(paf 70:3): void append(StringBody src) { CORD_cat(body, src.body); }
7(paf 71:3):
72:3): // could not figure out why this operator is needed [should do this chain: string->simple->==]
73:3): bool operator < (const StringBody& src) const { return CORD_cmp(body, src.body)<0; }
74:3): bool operator > (const StringBody& src) const { return CORD_cmp(body, src.body)>0; }
75:3): bool operator <= (const StringBody& src) const { return CORD_cmp(body, src.body)<=0; }
76:3): bool operator >= (const StringBody& src) const { return CORD_cmp(body, src.body)>=0; }
77:3): bool operator != (const StringBody& src) const { return CORD_cmp(body, src.body)!=0; }
78:3): bool operator == (const StringBody& src) const { return CORD_cmp(body, src.body)==0; }
79:3):
80:3): int ncmp(size_t x_begin, const StringBody y, size_t y_begin, size_t size) const {
81:3): return CORD_ncmp(body, x_begin, y.body, y_begin, size);
82:3): }
83:3):
84:3): char fetch(size_t index) const { return CORD_fetch(body, index); }
85:3):
86:3): };
(paf 87:):
1.144.2.2 paf 88: /**
89: String which knows the language of all it's fragments.
1.41 paf 90:
91: All pieces remember
92: - whether they are tainted or not,
93: and the language which should be used to detaint them
94: */
1.144.2.28.2. (paf 95:): class String: public PA_Object {
96:):
7(paf 97:3): friend class StringBody;
98:3):
1.144.2.2 paf 99: public:
1.1 paf 100:
1.106 parser 101: /** piece is tainted or not. the language to use when detaint
102: remember to change String_Untaint_lang_name @ untaint.C along
103: */
1.144.2.28.2. 7(paf 104:3): enum Language {
105:3): L_UNSPECIFIED=0, ///< zero value handy for hash lookup @see untaint_lang_name2enum
106:3): // these two must go before others, there are checks for >L_AS_IS
107:3): L_CLEAN, ///< clean
108:3): L_AS_IS, ///< leave all characters intact
1.122 paf 109:
1.144.2.28.2. 7(paf 110:3): L_PASS_APPENDED,
1.41 paf 111: /**<
112: leave language built into string being appended.
113: just a flag, that value not stored
114: */
1.144.2.28.2. 7(paf 115:3): L_TAINTED, ///< tainted, untaint language as assigned later
1.122 paf 116: // untaint languages. assigned by ^untaint[lang]{...}
1.144.2.28.2. 7(paf 117:3): L_FILE_SPEC, ///< file specification
118:3): L_HTTP_HEADER, ///< text in HTTP response header
119:3): L_MAIL_HEADER, ///< text in mail header
120:3): L_URI, ///< text in uri
121:3): L_TABLE, ///< ^table:set body
122:3): L_SQL, ///< ^table:sql body
123:3): L_JS, ///< JavaScript code
124:3): L_XML, ///< ^dom:set xml
125:3): L_HTML, ///< HTML code (for editing)
126:3): L_OPTIMIZE_BIT = 0x8000 ///< flag, requiring cstr whitespace optimization
1.27 paf 127: };
128:
1.144.2.28.2. (paf 129:): struct Fragment {
7(paf 130:3): Language lang; ///< untaint flag, later untaint language
0(paf 131:3): size_t length; ///< length
7(paf 132:3): Fragment(Language alang, size_t asize): lang(alang), length(asize) {}
(paf 133:): };
134:):
135:): class ArrayFragment: public Array<Fragment> {
6(paf 136:3): void append(element_type src) {
(paf 137:): *static_cast<Array<Fragment> *>(this)+=src;
138:): }
6(paf 139:3): /// hiding from accidental USE, use append_positions
140:3): void append(const ArrayFragment& src, int offset, int limit) {
141:3): static_cast<Array<Fragment> *>(this)->append(src, offset, limit);
142:3): }
(paf 143:): public:
144:): ArrayFragment& operator += (element_type src) {
145:): if(count()) { // not empty?
146:): // try to join with last
147:): Fragment& last=get(count()-1);
148:): if(last.lang==src.lang) {
0(paf 149:3): last.length+=src.length;
(paf 150:): return *this;
151:): }
152:): }
6(paf 153:3): append(src);
(paf 154:): return *this;
155:): }
6(paf 156:3): void append(const ArrayFragment& src) { append(src, 0, 0); }
157:3): void append_positions(const ArrayFragment& src, size_t substr_begin, size_t substr_end);
(paf 158:): };
159:):
160:): struct C {
161:): char *str;
0(paf 162:3): size_t length;
(paf 163:): operator char *() { return str; }
0(paf 164:3): C(char *astr, size_t asize): str(astr), length(asize) {}
(paf 165:): };
166:):
167:): private:
168:):
7(paf 169:3): StringBody body; ///< all characters of string
0(paf 170:3): ArrayFragment fragments; ///< fragment language+length info
(paf 171:):
1.8 paf 172: public:
173:
1.144.2.28.2. 1(paf 174:3): /// @todo check all places for length to be only HELPER length, and never be !=strlen(cstr)
0(paf 175:3): explicit String(const char* cstr=0, size_t helper_length=0, bool tainted=false);
1.14 paf 176: String(const String& src);
1.144.2.28.2. 7(paf 177:3): String(StringBody abody, Language alang): body(abody) {
178:3): fragments+=Fragment(alang, abody.length());
179:3): }
180:3):
181:3): /// for convinient hash lookup
182:3): operator StringBody() const { return body; }
183:3):
184:3): bool is_empty() const { return body.is_empty(); }
185:3): size_t length() const { return body.length(); }
(paf 186:):
2(paf 187:3): /// convert to CORD. if 'lang' known, forcing 'lang' to it
7(paf 188:3): CORD cstr_to_cord(Language lang=L_AS_IS,
189:3): SQL_Connection* connection=0,
(paf 190:): const Request_charsets *charsets=0) const;
191:):
2(paf 192:3): /// convert to constant C string. if 'lang' known, forcing 'lang' to it
7(paf 193:3): const char* cstr(Language lang=L_AS_IS,
194:3): SQL_Connection* connection=0,
1.144.2.14 paf 195: const Request_charsets *charsets=0) const {
1.144.2.28.2. (paf 196:): return CORD_to_const_char_star(cstr_to_cord(lang, connection, charsets));
197:): }
2(paf 198:3): /// convert to Modifiable C string. if 'lang' known, forcing 'lang' to it
7(paf 199:3): char *cstrm(Language lang=L_AS_IS,
200:3): SQL_Connection* connection=0,
(paf 201:): const Request_charsets *charsets=0) const {
202:): return CORD_to_char_star(cstr_to_cord(lang, connection, charsets));
1.144.2.9 paf 203: }
1.108 parser 204: /// puts pieces to buf
1.144.2.28.2. (paf 205:): C serialize(size_t prolog_size) const;
1.108 parser 206: /// appends pieces from buf to self
1.144.2.18 paf 207: bool deserialize(size_t prolog_size, void *buf, size_t buf_size, const char* file);
1.144.2.28.2. 6(paf 208:3): /** append fragment,
9(paf 209:3): @c length can be zero, it will be autocalced
6(paf 210:3): when length<strlen(str) makes heap copy of @c str piece
1.46 paf 211: */
1.144.2.28.2. 9(paf 212:3): String& append(const char* str, size_t length, Language lang);
(paf 213:):
7(paf 214:3): bool operator == (const char* y) const { return body==StringBody(y); }
0(paf 215:3): bool operator != (const char* y) const { return body!=StringBody(y); }
(paf 216:):
217:): /// this starts with y
7(paf 218:3): bool starts_with(const char* y) const {
219:3): return body.ncmp(0/*x_begin*/, StringBody(y), 0/*y_begin*/, strlen(y))==0;
1.80 paf 220: }
1.144.2.28.2. (paf 221:): /// y starts with this
7(paf 222:3): bool this_starts(const char* y) const {
223:3): return body.ncmp(0/*x_begin*/, StringBody(y), 0/*y_begin*/, strlen(y))==0;
(paf 224:): }
1.80 paf 225:
1.144.2.28.2. 7(paf 226:3): String& append_to(String& dest, Language lang, bool forced) const;
227:3): String& append(const String& src, Language lang, bool forced=false) {
1.144.2.11 paf 228: return src.append_to(*this, lang, forced);
229: }
1.144.2.28.2. 7(paf 230:3): String& operator << (const String& src) { return append(src, L_PASS_APPENDED); }
231:3): String& operator << (const char* src) { return append(src, 0, L_AS_IS); }
9(paf 232:3): String& operator << (const StringBody& src) {
233:3): body.append(src);
234:3): fragments+=Fragment(L_AS_IS, src.length());
235:3): return *this;
236:3): }
1.100 parser 237:
1.142 paf 238: /// extracts first char of a string, if any
239: char first_char() const {
1.144.2.28.2. 7(paf 240:3): return is_empty()?0:body.fetch(0);
1.142 paf 241: }
1.144.2.28.2. 8(paf 242:3):
243:3): bool operator < (const String& src) const { return body<src.body; }
244:3): bool operator > (const String& src) const { return body>src.body; }
245:3): bool operator <= (const String& src) const { return body<=src.body; }
246:3): bool operator >= (const String& src) const { return body>=src.body; }
247:3): bool operator != (const String& src) const { return body!=src.body; }
248:3): bool operator == (const String& src) const { return body==src.body; }
1.54 paf 249:
250: /// extracts [start, finish) piece of string
1.144.2.28.2. 4(paf 251:3): const String& mid(size_t substr_begin, size_t substr_end) const;
(paf 252:):
253:): /**
7(paf 254:3): ignore lang if it's L_UNSPECIFIED
(paf 255:): but when specified: look for substring that lies in ONE fragment in THAT lang
256:): @return position of substr in string, -1 means "not found" [const char* version]
257:): */
258:): size_t pos(CORD substr,
7(paf 259:3): size_t this_offset=0, Language lang=L_UNSPECIFIED) const;
260:3): /// String version of @see pos(const char*, int, Language)
(paf 261:): size_t pos(const String& substr,
7(paf 262:3): size_t this_offset=0, Language lang=L_UNSPECIFIED) const;
1.62 paf 263:
1.144.2.22 paf 264: void split(ArrayString& result,
1.144.2.28.2. 5(paf 265:3): size_t& pos_after,
(paf 266:): const char* delim,
7(paf 267:3): Language lang=L_UNSPECIFIED, int limit=-1);
1.144.2.22 paf 268: void split(ArrayString& result,
1.144.2.28.2. 5(paf 269:3): size_t& pos_after,
1.62 paf 270: const String& delim,
1.144.2.28.2. 7(paf 271:3): Language lang=L_UNSPECIFIED, int limit=-1) const;
1.62 paf 272:
1.144.2.28.2. (paf 273:): typedef void (*Row_action)(Table* table, ArrayString* row,
1.136 paf 274: int prestart, int prefinish,
275: int poststart, int postfinish,
1.144.2.9 paf 276: void *info);
1.87 parser 277: /**
1.144.2.5 paf 278: @return table of found items, if any.
1.87 parser 279: table format is defined and fixed[can be used by others]:
280: @verbatim
281: prematch/match/postmatch/1/2/3/...
282: @endverbatim
283: */
1.144.2.28.2. (paf 284:): Table* match(Charset& source_charset,
1.64 paf 285: const String& regexp,
1.144.2.28.2. (paf 286:): const String& options,
1.99 parser 287: Row_action row_action, void *info,
1.144.2.27 paf 288: bool& just_matched) const;
1.87 parser 289: enum Change_case_kind {
290: CC_UPPER,
291: CC_LOWER
292: };
1.144.2.28.2. (paf 293:): String& change_case(Charset& source_charset,
1.144.2.17 paf 294: Change_case_kind kind);
1.144.2.28.2. (paf 295:): const String& replace(const Dictionary& dict) const;
296:): double as_double() const;
297:): int as_int() const;
1.137 paf 298:
1.7 paf 299: private: //disabled
300:
1.12 paf 301: String& operator = (const String&) { return *this; }
1.7 paf 302:
1.1 paf 303: };
1.144.2.7 paf 304:
305: /// simple hash code of string. used by Hash
1.144.2.28.2. 7(paf 306:3): inline uint hash_code(const StringBody& self) {
1.144.2.7 paf 307: return self.hash_code();
308: }
1.1 paf 309:
310: #endif
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to pa_string.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / include