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