Annotation of parser3/src/classes/hash.C, revision 1.66
1.1 paf 1: /** @file
2: Parser: @b hash parser class.
3:
1.65 paf 4: Copyright (c) 2001-2004 ArtLebedev Group (http://www.artlebedev.com)
1.35 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.41 paf 6: */
1.1 paf 7:
1.66 ! paf 8: static const char * const IDENT_HASH_C="$Date: 2004/02/11 15:33:12 $";
1.1 paf 9:
10: #include "classes.h"
1.57 paf 11: #include "pa_vmethod_frame.h"
12:
1.1 paf 13: #include "pa_request.h"
14: #include "pa_vhash.h"
1.6 parser 15: #include "pa_vvoid.h"
1.2 parser 16: #include "pa_sql_connection.h"
1.9 parser 17: #include "pa_vtable.h"
1.22 parser 18: #include "pa_vbool.h"
1.26 paf 19: #include "pa_vmethod_frame.h"
1.2 parser 20:
1.1 paf 21: // class
22:
1.57 paf 23: class MHash: public Methoded {
1.2 parser 24: public: // VStateless_class
1.61 paf 25: Value* create_new_value(Pool&) { return new VHash(); }
1.2 parser 26:
1.1 paf 27: public:
1.57 paf 28: MHash();
1.1 paf 29: public: // Methoded
1.2 parser 30: bool used_directly() { return true; }
1.1 paf 31: };
32:
1.57 paf 33: // global variable
34:
35: DECLARE_CLASS_VAR(hash, new MHash, 0);
36:
1.1 paf 37: // methods
38:
1.11 parser 39: #ifndef DOXYGEN
1.52 paf 40: class Hash_sql_event_handlers: public SQL_Driver_query_event_handlers {
1.57 paf 41: const String& statement_string; const char* statement_cstr;
42: bool distinct;
43: HashStringValue& rows_hash;
44: HashStringValue* row_hash;
45: int column_index;
46: ArrayString columns;
1.11 parser 47: public:
1.57 paf 48: Hash_sql_event_handlers(
49: const String& astatement_string, const char* astatement_cstr,
1.49 paf 50: bool adistinct,
1.57 paf 51: HashStringValue& arows_hash):
52: statement_string(astatement_string), statement_cstr(astatement_cstr),
1.49 paf 53: distinct(adistinct),
1.11 parser 54: rows_hash(arows_hash),
1.57 paf 55: row_hash(0),
56: column_index(0) {
1.11 parser 57: }
1.57 paf 58: bool add_column(SQL_Error& error, const char* str, size_t length) {
1.53 paf 59: try {
1.57 paf 60: columns+=new String(str, length, true);
1.53 paf 61: return false;
62: } catch(...) {
63: error=SQL_Error("exception occured in Hash_sql_event_handlers::add_column");
64: return true;
65: }
1.11 parser 66: }
1.53 paf 67: bool before_rows(SQL_Error& error) {
1.57 paf 68: if(columns.count()<=1) {
1.53 paf 69: error=SQL_Error("parser.runtime",
1.57 paf 70: /*method_name,*/
1.11 parser 71: "column count must be more than 1 to create a hash");
1.53 paf 72: return true;
73: }
74:
75: return false;
1.11 parser 76: }
1.53 paf 77: bool add_row(SQL_Error& /*error*/) {
1.11 parser 78: column_index=0;
1.53 paf 79: return false;
1.11 parser 80: }
1.57 paf 81: bool add_row_cell(SQL_Error& error, const char *ptr, size_t length) {
1.53 paf 82: try {
1.57 paf 83: String& cell=*new String;
84: if(length)
85: cell.append_know_length(ptr, length, String::L_TAINTED);
1.53 paf 86: if(column_index==0) {
1.57 paf 87: VHash* row_vhash=new VHash;
88: row_hash=&row_vhash->hash();
89: if(rows_hash.put_dont_replace(cell, row_vhash)) // put. existed?
1.53 paf 90: if(!distinct) {
91: error=SQL_Error("parser.runtime",
1.57 paf 92: /*cell,*/
1.53 paf 93: "duplicate key");
94: return true;
95: }
96: } else
1.57 paf 97: row_hash->put(*columns[column_index], new VString(cell));
1.53 paf 98: column_index++;
99:
100: return false;
101: } catch(...) {
102: error=SQL_Error("exception occured in Hash_sql_event_handlers::add_row_cell");
103: return true;
104: }
1.11 parser 105: }
106:
107: };
108: #endif
109:
1.57 paf 110: static void copy_all_overwrite_to(
111: HashStringValue::key_type key,
112: HashStringValue::value_type value,
113: HashStringValue* dest) {
114: dest->put(key, value);
115: }
116: static void _create_or_add(Request& r, MethodParams& params) {
117: if(params.count()) {
1.66 ! paf 118: Value& vsrc=params.as_no_junction(0, "param must be hash");
! 119: if(HashStringValue* src=vsrc.get_hash()) {
! 120: HashStringValue* self=&(GET_SELF(r, VHash).hash());
! 121: if(src==self) // same: doing nothing
! 122: return;
! 123: src->for_each(copy_all_overwrite_to, self);
! 124: }
1.20 parser 125: }
126: }
1.22 parser 127:
1.57 paf 128: static void remove_key_from(
129: HashStringValue::key_type key,
130: HashStringValue::value_type /*value*/,
131: HashStringValue* dest) {
132: dest->remove(key);
133: }
134: static void _sub(Request& r, MethodParams& params) {
1.66 ! paf 135: Value& vsrc=params.as_no_junction(0, "param must be hash");
! 136: if(HashStringValue* src=vsrc.get_hash()) {
! 137: HashStringValue* self=&(GET_SELF(r, VHash).hash());
! 138: if(src==self) { // same: clearing
! 139: self->clear();
! 140: return;
! 141: }
! 142: src->for_each(remove_key_from, self);
! 143: }
1.57 paf 144: }
145:
146: static void copy_all_dontoverwrite_to(
147: HashStringValue::key_type key,
148: HashStringValue::value_type value,
149: HashStringValue* dest) {
150: dest->put_dont_replace(key, value);
1.22 parser 151: }
1.57 paf 152: static void _union(Request& r, MethodParams& params) {
1.22 parser 153: // dest = copy of self
1.57 paf 154: Value& result=*new VHash(GET_SELF(r, VHash).hash());
1.22 parser 155: // dest += b
1.66 ! paf 156: Value& vsrc=params.as_no_junction(0, "param must be hash");
! 157: if(HashStringValue* src=vsrc.get_hash())
! 158: src->for_each(copy_all_dontoverwrite_to, result.get_hash());
1.22 parser 159:
160: // return result
161: r.write_no_lang(result);
162: }
163:
164: #ifndef DOXYGEN
165: struct Copy_intersection_to_info {
1.57 paf 166: HashStringValue* b;
167: HashStringValue* dest;
1.22 parser 168: };
169: #endif
1.57 paf 170: static void copy_intersection_to(
171: HashStringValue::key_type key,
172: HashStringValue::value_type value,
173: Copy_intersection_to_info *info) {
174: if(info->b->get(key))
175: info->dest->put_dont_replace(key, value);
1.22 parser 176: }
1.57 paf 177: static void _intersection(Request& r, MethodParams& params) {
178: Value& result=*new VHash;
1.22 parser 179: // dest += b
1.57 paf 180: Value& vb=params.as_no_junction(0, "param must be hash");
181: if(HashStringValue* b=vb.get_hash()) {
182: Copy_intersection_to_info info={b, result.get_hash()};
183: GET_SELF(r, VHash).hash().for_each(copy_intersection_to, &info);
1.22 parser 184: }
185:
186: // return result
1.57 paf 187: r.write_no_lang(result);
1.22 parser 188: }
189:
1.57 paf 190: static bool intersects(
191: HashStringValue::key_type key,
192: HashStringValue::value_type /*value*/,
193: HashStringValue* b) {
194: return b->get(key)!=0;
1.22 parser 195: }
196:
1.57 paf 197: static void _intersects(Request& r, MethodParams& params) {
198: bool result=false;
199:
200: Value& vb=params.as_no_junction(0, "param must be hash");
201: if(HashStringValue* b=vb.get_hash())
202: result=GET_SELF(r, VHash).hash().first_that(intersects, b)!=0;
1.22 parser 203:
204: // return result
1.57 paf 205: r.write_no_lang(*new VBool(result));
1.22 parser 206: }
207:
208:
1.57 paf 209: extern String sql_limit_name;
210: extern String sql_offset_name;
211: extern String sql_default_name;
212: extern String sql_distinct_name;
213: static void _sql(Request& r, MethodParams& params) {
214: Value& statement=params.as_junction(0, "statement must be code");
1.2 parser 215:
216: ulong limit=0;
1.33 paf 217: ulong offset=0;
1.49 paf 218: bool distinct=false;
1.57 paf 219: if(params.count()>1) {
220: Value& voptions=params.as_no_junction(1, "options must be hash, not code");
1.43 paf 221: if(!voptions.is_string())
1.57 paf 222: if(HashStringValue* options=voptions.get_hash()) {
1.49 paf 223: int valid_options=0;
1.57 paf 224: if(Value* vlimit=options->get(sql_limit_name)) {
1.49 paf 225: valid_options++;
1.37 paf 226: limit=(ulong)r.process_to_value(*vlimit).as_double();
1.49 paf 227: }
1.57 paf 228: if(Value* voffset=options->get(sql_offset_name)) {
1.49 paf 229: valid_options++;
1.37 paf 230: offset=(ulong)r.process_to_value(*voffset).as_double();
1.49 paf 231: }
1.57 paf 232: if(Value* vdistinct=options->get(sql_distinct_name)) {
1.49 paf 233: valid_options++;
234: distinct=r.process_to_value(*vdistinct).as_bool();
235: }
1.57 paf 236: if(valid_options!=options->count())
1.49 paf 237: throw Exception("parser.runtime",
1.57 paf 238: 0,
1.49 paf 239: "called with invalid option");
1.33 paf 240: } else
1.36 paf 241: throw Exception("parser.runtime",
1.57 paf 242: 0,
1.33 paf 243: "options must be hash");
1.2 parser 244: }
245:
1.57 paf 246: Temp_lang temp_lang(r, String::L_SQL);
1.37 paf 247: const String& statement_string=r.process_to_string(statement);
1.57 paf 248: const char* statement_cstr=
249: statement_string.cstr(String::L_UNSPECIFIED, r.connection());
250: HashStringValue& hash=GET_SELF(r, VHash).hash();
1.11 parser 251: hash.clear();
1.57 paf 252: Hash_sql_event_handlers handlers(
1.49 paf 253: statement_string, statement_cstr,
254: distinct,
255: hash);
1.57 paf 256: r.connection()->query(
1.23 parser 257: statement_cstr, offset, limit,
1.45 paf 258: handlers,
259: statement_string);
1.2 parser 260: }
261:
1.57 paf 262: static void keys_collector(
263: HashStringValue::key_type key,
1.61 paf 264: HashStringValue::value_type,
1.57 paf 265: Table *table) {
266: Table::element_type row(new ArrayString);
267: *row+=new String(key, String::L_TAINTED);
268: *table+=row;
1.9 parser 269: }
1.57 paf 270: static void _keys(Request& r, MethodParams&) {
271: Table::columns_type columns(new ArrayString);
272: *columns+=new String("key");
273: Table* table=new Table(columns);
1.9 parser 274:
1.57 paf 275: GET_SELF(r, VHash).hash().for_each(keys_collector, table);
1.9 parser 276:
1.57 paf 277: r.write_no_lang(*new VTable(table));
1.9 parser 278: }
279:
1.57 paf 280: static void _count(Request& r, MethodParams&) {
281: r.write_no_lang(*new VInt(GET_SELF(r, VHash).hash().count()));
1.16 parser 282: }
283:
1.57 paf 284: static void _delete(Request& r, MethodParams& params) {
1.25 paf 285:
1.57 paf 286: GET_SELF(r, VHash).hash().remove(params.as_string(0, "key must be string"));
1.25 paf 287: }
288:
1.26 paf 289: #ifndef DOXYGEN
1.59 paf 290: struct Foreach_info {
1.26 paf 291: Request *r;
292: const String* key_var_name;
293: const String* value_var_name;
1.57 paf 294: Value* body_code;
295: Value* delim_maybe_code;
1.26 paf 296:
1.57 paf 297: VString* vkey;
1.26 paf 298: bool need_delim;
299: };
300: #endif
1.57 paf 301: static void one_foreach_cycle(
302: HashStringValue::key_type akey,
303: HashStringValue::value_type avalue,
1.59 paf 304: Foreach_info *info) {
1.57 paf 305: info->vkey->set_string(*new String(akey, String::L_TAINTED));
306: Value& ncontext=*info->r->get_method_frame()->caller();
307: ncontext.put_element(*info->key_var_name, info->vkey, false);
308: ncontext.put_element(*info->value_var_name, avalue, false);
309:
310: StringOrValue sv_processed=info->r->process(*info->body_code);
311: const String* s_processed=sv_processed.get_string();
312: if(info->delim_maybe_code && s_processed && s_processed->length()) { // delimiter set and we have body
313: if(info->need_delim) // need delim & iteration produced string?
314: info->r->write_pass_lang(info->r->process(*info->delim_maybe_code));
315: info->need_delim=true;
1.26 paf 316: }
1.57 paf 317: info->r->write_pass_lang(sv_processed);
1.26 paf 318: }
1.57 paf 319: static void _foreach(Request& r, MethodParams& params) {
1.63 paf 320: Foreach_info info={
321: &r,
322: ¶ms.as_string(0, "key-var name must be string"),
323: ¶ms.as_string(1, "value-var name must be string"),
324: ¶ms.as_junction(2, "body must be code"),
325: params.count()>3?params.get(3):0,
1.64 paf 326: /*vkey=*/new VString,
1.63 paf 327: false
328: };
1.57 paf 329:
330: VHash& self=GET_SELF(r, VHash);
331: HashStringValue& hash=self.hash();
1.28 paf 332: VHash_lock lock(self);
333: hash.for_each(one_foreach_cycle, &info);
1.26 paf 334: }
335:
1.1 paf 336: // constructor
337:
1.57 paf 338: MHash::MHash(): Methoded("hash")
1.39 paf 339: {
1.21 parser 340: // ^hash::create[[copy_from]]
1.57 paf 341: add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1);
1.22 parser 342: // ^hash.add[add_from]
1.57 paf 343: add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1);
1.22 parser 344: // ^hash.sub[sub_from]
345: add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1);
346: // ^a.union[b] = hash
347: add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1);
348: // ^a.intersection[b] = hash
349: add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 1);
350: // ^a.intersects[b] = bool
351: add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1);
1.25 paf 352:
353: // ^a.delete[key]
354: add_native_method("delete", Method::CT_DYNAMIC, _delete, 1, 1);
1.2 parser 355:
1.33 paf 356: // ^hash:sql[query][$.limit(1) $.offset(2)]
357: add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2);
1.2 parser 358:
1.14 parser 359: // ^hash._keys[]
1.13 parser 360: add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 0);
1.16 parser 361:
362: // ^hash._count[]
363: add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0);
1.26 paf 364:
365: // ^hash.foreach[key;value]{code}[delim]
366: add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1);
1.1 paf 367: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to hash.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / classes