Annotation of parser3/src/classes/hash.C, revision 1.31
1.1 paf 1: /** @file
2: Parser: @b hash parser class.
3:
4: Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
1.30 paf 5: Author: Alexander Petrosyan <paf@design.ru> (http://paf.design.ru)
1.1 paf 6:
1.31 ! paf 7: $Id: hash.C,v 1.30 2001/11/05 11:46:20 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.23 parser 60: throw Exception(0, 0,
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:
200: if(!r.connection)
1.23 parser 201: throw Exception(0, 0,
1.2 parser 202: &method_name,
203: "without connect");
204:
1.10 parser 205: Value& statement=params->as_junction(0, "statement must be code");
1.2 parser 206:
207: ulong limit=0;
208: if(params->size()>1) {
1.10 parser 209: Value& limit_code=params->as_junction(1, "limit must be expression");
1.2 parser 210: limit=(uint)r.process(limit_code).as_double();
211: }
212:
213: ulong offset=0;
214: if(params->size()>2) {
1.10 parser 215: Value& offset_code=params->as_junction(2, "offset must be expression");
1.2 parser 216: offset=(ulong)r.process(offset_code).as_double();
217: }
218:
219: Temp_lang temp_lang(r, String::UL_SQL);
220: const String& statement_string=r.process(statement).as_string();
221: const char *statement_cstr=
222: statement_string.cstr(String::UL_UNSPECIFIED, r.connection);
1.28 paf 223: Hash& hash=static_cast<VHash *>(r.self)->hash(&method_name);
1.11 parser 224: hash.clear();
225: Hash_sql_event_handlers handlers(pool, method_name,
226: statement_string, statement_cstr, hash);
1.23 parser 227:
228: r.connection->query(
229: statement_cstr, offset, limit,
230: handlers);
1.2 parser 231: }
232:
1.9 parser 233: static void keys_collector(const Hash::Key& key, Hash::Val *value, void *info) {
234: Table& table=*static_cast<Table *>(info);
235: Pool& pool=table.pool();
236:
237: Array& row=*new(pool) Array(pool);
238: row+=&key;
239: table+=&row;
240: }
241: static void _keys(Request& r, const String& method_name, MethodParams *) {
242: Pool& pool=r.pool();
243:
244: Array& columns=*new(pool) Array(pool);
245: columns+=new(pool) String(pool, "key");
246: Table& table=*new(pool) Table(pool, &method_name, &columns);
247:
1.28 paf 248: static_cast<VHash *>(r.self)->hash(&method_name).for_each(keys_collector, &table);
1.9 parser 249:
250: VTable& result=*new(pool) VTable(pool, &table);
251: result.set_name(method_name);
252: r.write_no_lang(result);
253: }
254:
1.16 parser 255: static void _count(Request& r, const String& method_name, MethodParams *) {
256: Pool& pool=r.pool();
257:
1.28 paf 258: Value& result=*new(pool) VInt(pool, static_cast<VHash *>(r.self)->hash(&method_name).size());
1.22 parser 259: result.set_name(method_name);
260: r.write_no_lang(result);
1.16 parser 261: }
262:
1.25 paf 263: static void _delete(Request& r, const String& method_name, MethodParams *params) {
264: Pool& pool=r.pool();
265:
1.28 paf 266: static_cast<VHash *>(r.self)->hash(&method_name).remove(params->as_string(0, "key must be string"));
1.25 paf 267: }
268:
1.26 paf 269: #ifndef DOXYGEN
270: struct Foreach_info {
271: Request *r;
272: const String* key_var_name;
273: const String* value_var_name;
274: Value *body_code;
275: Value *delim_maybe_code;
276:
277: VString *vkey;
278: bool need_delim;
279: };
280: #endif
281:
282: static void one_foreach_cycle(const Hash::Key& akey, Hash::Val *avalue,
283: void *info) {
284: Foreach_info& i=*static_cast<Foreach_info *>(info);
285:
286: i.vkey->set_string(akey);
1.29 paf 287: i.r->root->put_element(*i.key_var_name, i.vkey);
288: i.r->root->put_element(*i.value_var_name, static_cast<Value *>(avalue));
1.26 paf 289:
290: Value& processed_body=i.r->process(*i.body_code);
291: if(i.delim_maybe_code) { // delimiter set?
292: const String *string=processed_body.get_string();
293: if(i.need_delim && string && string->size()) // need delim & iteration produced string?
294: i.r->write_pass_lang(i.r->process(*i.delim_maybe_code));
295: i.need_delim=true;
296: }
297: i.r->write_pass_lang(processed_body);
298: }
299: static void _foreach(Request& r, const String& method_name, MethodParams *params) {
300: Pool& pool=r.pool();
301: const String& key_var_name=params->as_string(0, "key-var name must be string");
302: const String& value_var_name=params->as_string(1, "value-var name must be string");
303: Value& body_code=params->as_junction(2, "body must be code");
304: Value *delim_maybe_code=params->size()>3?¶ms->get(3):0;
305:
306: Foreach_info info={
307: &r,
308: &key_var_name, &value_var_name,
309: &body_code,
310: delim_maybe_code,
311:
312: new(pool) VString(pool),
313: false
314: };
1.28 paf 315: VHash& self=*static_cast<VHash *>(r.self);
316: Hash& hash=self.hash(&method_name);
317: VHash_lock lock(self);
318: hash.for_each(one_foreach_cycle, &info);
1.26 paf 319: }
320:
1.1 paf 321: // constructor
322:
323: MHash::MHash(Pool& apool) : Methoded(apool) {
1.2 parser 324: set_name(*NEW String(pool(), HASH_CLASS_NAME));
1.20 parser 325:
1.21 parser 326: // ^hash::create[[copy_from]]
1.22 parser 327: add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1);
328: // ^hash.add[add_from]
329: add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1);
330: // ^hash.sub[sub_from]
331: add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1);
332: // ^a.union[b] = hash
333: add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1);
334: // ^a.intersection[b] = hash
335: add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 1);
336: // ^a.intersects[b] = bool
337: add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1);
1.25 paf 338:
339: // ^a.delete[key]
340: add_native_method("delete", Method::CT_DYNAMIC, _delete, 1, 1);
1.2 parser 341:
342: // ^hash:sql[query][(count[;offset])]
343: add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 3);
344:
1.14 parser 345: // ^hash._keys[]
1.13 parser 346: add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 0);
1.16 parser 347:
348: // ^hash._count[]
349: add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0);
1.26 paf 350:
351: // ^hash.foreach[key;value]{code}[delim]
352: add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1);
1.1 paf 353: }
354:
355: // global variable
356:
357: Methoded *hash_base_class;
358:
359: // creator
360:
361: Methoded *MHash_create(Pool& pool) {
362: return hash_base_class=new(pool) MHash(pool);
363: }
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