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