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