Annotation of parser3/src/classes/hash.C, revision 1.26
1.1 paf 1: /** @file
2: Parser: @b hash parser class.
3:
4: Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
1.19 parser 5: Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
1.1 paf 6:
1.26 ! paf 7: $Id: hash.C,v 1.25 2001/11/01 10:59:25 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: }
98:
1.22 parser 99: static void _create_or_add(Request& r, const String& method_name, MethodParams *params) {
1.20 parser 100: Pool& pool=r.pool();
101:
102: if(params->size()) {
1.22 parser 103: Value& vb=params->as_no_junction(0, "param must be hash");
1.24 parser 104: if(Hash *b=vb.get_hash(&method_name))
1.22 parser 105: b->for_each(copy_all_overwrite_to, &static_cast<VHash *>(r.self)->hash());
1.20 parser 106: }
107: }
108:
1.22 parser 109: static void remove_key_from(const Hash::Key& key, Hash::Val *value, void *info) {
110: Hash& dest=*static_cast<Hash *>(info);
1.25 paf 111: dest.remove(key);
1.22 parser 112: }
113:
114: static void _sub(Request& r, const String& method_name, MethodParams *params) {
115: Pool& pool=r.pool();
116:
117: Value& vb=params->as_no_junction(0, "param must be hash");
1.24 parser 118: if(Hash *b=vb.get_hash(&method_name))
1.22 parser 119: b->for_each(remove_key_from, &static_cast<VHash *>(r.self)->hash());
120: }
121:
122: static void copy_all_dontoverwrite_to(const Hash::Key& key, Hash::Val *value, void *info) {
123: Hash& dest=*static_cast<Hash *>(info);
124: dest.put_dont_replace(key, value);
125: }
126:
127: static void _union(Request& r, const String& method_name, MethodParams *params) {
128: Pool& pool=r.pool();
129:
130: // dest = copy of self
131: Hash& dest=*new(pool) Hash(static_cast<VHash *>(r.self)->hash());
132: // dest += b
133: Value& vb=params->as_no_junction(0, "param must be hash");
1.24 parser 134: if(Hash *b=vb.get_hash(&method_name))
1.22 parser 135: b->for_each(copy_all_dontoverwrite_to, &dest);
136:
137: // return result
138: Value& result=*new(pool) VHash(pool, dest);
139: result.set_name(method_name);
140: r.write_no_lang(result);
141: }
142:
143: #ifndef DOXYGEN
144: struct Copy_intersection_to_info {
145: Hash *b;
146: Hash *dest;
147: };
148: #endif
149:
150: static void copy_intersection_to(const Hash::Key& key, Hash::Val *value, void *info) {
151: Copy_intersection_to_info& i=*static_cast<Copy_intersection_to_info *>(info);
152:
153: if(i.b->get(key))
154: i.dest->put_dont_replace(key, value);
155: }
156:
157: static void _intersection(Request& r, const String& method_name, MethodParams *params) {
158: Pool& pool=r.pool();
159:
160: // dest = copy of self
161: Hash& dest=*new(pool) Hash(pool);
162: // dest += b
163: Value& vb=params->as_no_junction(0, "param must be hash");
1.24 parser 164: if(Hash *b=vb.get_hash(&method_name)) {
1.22 parser 165: Copy_intersection_to_info info={
166: b,
167: &dest
168: };
169: static_cast<VHash *>(r.self)->hash().for_each(copy_intersection_to, &info);
170: }
171:
172: // return result
173: Value& result=*new(pool) VHash(pool, dest);
174: result.set_name(method_name);
175: r.write_no_lang(result);
176: }
177:
178: static void *intersects(const Hash::Key& key, Hash::Val *value, void *info) {
179: return static_cast<Hash *>(info)->get(key);
180: }
181:
182: static void _intersects(Request& r, const String& method_name, MethodParams *params) {
183: Pool& pool=r.pool();
184:
185: bool yes=false;
186:
187: // dest = copy of self
188: Hash& dest=*new(pool) Hash(pool);
189: // dest += b
190: Value& vb=params->as_no_junction(0, "param must be hash");
1.24 parser 191: if(Hash *b=vb.get_hash(&method_name))
1.22 parser 192: yes=static_cast<VHash *>(r.self)->hash().first_that(intersects, b)!=0;
193:
194: // return result
195: Value& result=*new(pool) VBool(pool, yes);
196: result.set_name(method_name);
197: r.write_no_lang(result);
198: }
199:
200:
1.2 parser 201: static void _sql(Request& r, const String& method_name, MethodParams *params) {
202: Pool& pool=r.pool();
203:
204: if(!r.connection)
1.23 parser 205: throw Exception(0, 0,
1.2 parser 206: &method_name,
207: "without connect");
208:
1.10 parser 209: Value& statement=params->as_junction(0, "statement must be code");
1.2 parser 210:
211: ulong limit=0;
212: if(params->size()>1) {
1.10 parser 213: Value& limit_code=params->as_junction(1, "limit must be expression");
1.2 parser 214: limit=(uint)r.process(limit_code).as_double();
215: }
216:
217: ulong offset=0;
218: if(params->size()>2) {
1.10 parser 219: Value& offset_code=params->as_junction(2, "offset must be expression");
1.2 parser 220: offset=(ulong)r.process(offset_code).as_double();
221: }
222:
223: Temp_lang temp_lang(r, String::UL_SQL);
224: const String& statement_string=r.process(statement).as_string();
225: const char *statement_cstr=
226: statement_string.cstr(String::UL_UNSPECIFIED, r.connection);
1.11 parser 227: Hash& hash=static_cast<VHash *>(r.self)->hash();
228: hash.clear();
229: Hash_sql_event_handlers handlers(pool, method_name,
230: statement_string, statement_cstr, hash);
1.23 parser 231:
232: r.connection->query(
233: statement_cstr, offset, limit,
234: handlers);
1.2 parser 235: }
236:
1.9 parser 237: static void keys_collector(const Hash::Key& key, Hash::Val *value, void *info) {
238: Table& table=*static_cast<Table *>(info);
239: Pool& pool=table.pool();
240:
241: Array& row=*new(pool) Array(pool);
242: row+=&key;
243: table+=&row;
244: }
245: static void _keys(Request& r, const String& method_name, MethodParams *) {
246: Pool& pool=r.pool();
247:
248: Array& columns=*new(pool) Array(pool);
249: columns+=new(pool) String(pool, "key");
250: Table& table=*new(pool) Table(pool, &method_name, &columns);
251:
252: static_cast<VHash *>(r.self)->hash().for_each(keys_collector, &table);
253:
254: VTable& result=*new(pool) VTable(pool, &table);
255: result.set_name(method_name);
256: r.write_no_lang(result);
257: }
258:
1.16 parser 259: static void _count(Request& r, const String& method_name, MethodParams *) {
260: Pool& pool=r.pool();
261:
1.22 parser 262: Value& result=*new(pool) VInt(pool, static_cast<VHash *>(r.self)->hash().size());
263: result.set_name(method_name);
264: r.write_no_lang(result);
1.16 parser 265: }
266:
1.25 paf 267: static void _delete(Request& r, const String& method_name, MethodParams *params) {
268: Pool& pool=r.pool();
269:
270: static_cast<VHash *>(r.self)->hash().remove(params->as_string(0, "key must be string"));
271: }
272:
1.26 ! paf 273: #ifndef DOXYGEN
! 274: struct Foreach_info {
! 275: Request *r;
! 276: const String* key_var_name;
! 277: const String* value_var_name;
! 278: Value *body_code;
! 279: Value *delim_maybe_code;
! 280:
! 281: Value *var_context;
! 282: VString *vkey;
! 283: bool need_delim;
! 284: };
! 285: #endif
! 286:
! 287: static void one_foreach_cycle(const Hash::Key& akey, Hash::Val *avalue,
! 288: void *info) {
! 289: Foreach_info& i=*static_cast<Foreach_info *>(info);
! 290:
! 291: i.vkey->set_string(akey);
! 292: i.var_context->put_element(*i.key_var_name, i.vkey);
! 293: i.var_context->put_element(*i.value_var_name, static_cast<Value *>(avalue));
! 294:
! 295: Value& processed_body=i.r->process(*i.body_code);
! 296: if(i.delim_maybe_code) { // delimiter set?
! 297: const String *string=processed_body.get_string();
! 298: if(i.need_delim && string && string->size()) // need delim & iteration produced string?
! 299: i.r->write_pass_lang(i.r->process(*i.delim_maybe_code));
! 300: i.need_delim=true;
! 301: }
! 302: i.r->write_pass_lang(processed_body);
! 303: }
! 304: static void _foreach(Request& r, const String& method_name, MethodParams *params) {
! 305: Pool& pool=r.pool();
! 306: const String& key_var_name=params->as_string(0, "key-var name must be string");
! 307: const String& value_var_name=params->as_string(1, "value-var name must be string");
! 308: Value& body_code=params->as_junction(2, "body must be code");
! 309: Value *delim_maybe_code=params->size()>3?¶ms->get(3):0;
! 310:
! 311: Foreach_info info={
! 312: &r,
! 313: &key_var_name, &value_var_name,
! 314: &body_code,
! 315: delim_maybe_code,
! 316:
! 317: body_code.get_junction()->wcontext,
! 318: new(pool) VString(pool),
! 319: false
! 320: };
! 321: static_cast<VHash *>(r.self)->hash().for_each(one_foreach_cycle, &info);
! 322: }
! 323:
1.1 paf 324: // constructor
325:
326: MHash::MHash(Pool& apool) : Methoded(apool) {
1.2 parser 327: set_name(*NEW String(pool(), HASH_CLASS_NAME));
1.20 parser 328:
1.21 parser 329: // ^hash::create[[copy_from]]
1.22 parser 330: add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1);
331: // ^hash.add[add_from]
332: add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1);
333: // ^hash.sub[sub_from]
334: add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1);
335: // ^a.union[b] = hash
336: add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1);
337: // ^a.intersection[b] = hash
338: add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 1);
339: // ^a.intersects[b] = bool
340: add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1);
1.25 paf 341:
342: // ^a.delete[key]
343: add_native_method("delete", Method::CT_DYNAMIC, _delete, 1, 1);
1.2 parser 344:
345: // ^hash:sql[query][(count[;offset])]
346: add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 3);
347:
1.14 parser 348: // ^hash._keys[]
1.13 parser 349: add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 0);
1.16 parser 350:
351: // ^hash._count[]
352: add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0);
1.26 ! paf 353:
! 354: // ^hash.foreach[key;value]{code}[delim]
! 355: Array *for_each_locals=NEW Array(pool(), 2);
! 356: *for_each_locals += NEW String(pool(), "key");
! 357:
! 358: add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1);
1.1 paf 359: }
360:
361: // global variable
362:
363: Methoded *hash_base_class;
364:
365: // creator
366:
367: Methoded *MHash_create(Pool& pool) {
368: return hash_base_class=new(pool) MHash(pool);
369: }
E-mail: