Annotation of parser3/src/classes/hash.C, revision 1.127
1.1 paf 1: /** @file
2: Parser: @b hash parser class.
3:
1.125 moko 4: Copyright (c) 2001-2015 Art. Lebedev Studio (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:
8: #include "classes.h"
1.57 paf 9: #include "pa_vmethod_frame.h"
10:
1.1 paf 11: #include "pa_request.h"
1.122 moko 12: #include "pa_charsets.h"
1.1 paf 13: #include "pa_vhash.h"
1.6 parser 14: #include "pa_vvoid.h"
1.2 parser 15: #include "pa_sql_connection.h"
1.9 parser 16: #include "pa_vtable.h"
1.22 parser 17: #include "pa_vbool.h"
1.26 paf 18: #include "pa_vmethod_frame.h"
1.2 parser 19:
1.127 ! moko 20: volatile const char * IDENT_HASH_C="$Id: hash.C,v 1.126 2016/03/31 21:46:19 moko Exp $";
1.113 moko 21:
1.1 paf 22: // class
23:
1.57 paf 24: class MHash: public Methoded {
1.2 parser 25: public: // VStateless_class
1.103 misha 26: Value* create_new_value(Pool&) { return new VHash(); }
1.2 parser 27:
1.1 paf 28: public:
1.57 paf 29: MHash();
1.1 paf 30: };
31:
1.57 paf 32: // global variable
33:
1.126 moko 34: DECLARE_CLASS_VAR(hash, new MHash);
1.57 paf 35:
1.1 paf 36: // methods
37:
1.11 parser 38: #ifndef DOXYGEN
1.52 paf 39: class Hash_sql_event_handlers: public SQL_Driver_query_event_handlers {
1.57 paf 40: const String& statement_string; const char* statement_cstr;
41: bool distinct;
42: HashStringValue& rows_hash;
1.86 misha 43: Value* row_value;
1.57 paf 44: int column_index;
1.86 misha 45: ArrayString& columns;
46: bool one_bool_column;
1.67 paf 47: static VBool only_one_column_value;
1.86 misha 48: Table2hash_value_type value_type;
49: int columns_count;
50: public:
51: Table* empty;
1.11 parser 52: public:
1.57 paf 53: Hash_sql_event_handlers(
1.86 misha 54: const String& astatement_string,
55: const char* astatement_cstr,
1.49 paf 56: bool adistinct,
1.86 misha 57: HashStringValue& arows_hash,
58: Table2hash_value_type avalue_type)
59: :
60: statement_string(astatement_string),
61: statement_cstr(astatement_cstr),
1.49 paf 62: distinct(adistinct),
1.11 parser 63: rows_hash(arows_hash),
1.86 misha 64: value_type(avalue_type),
65: row_value(0),
1.67 paf 66: column_index(0),
1.86 misha 67: one_bool_column(false),
68: columns(*new ArrayString),
69: empty(0) {
1.11 parser 70: }
1.86 misha 71:
1.109 misha 72: bool add_column(SQL_Error& error, const char* str, size_t ) {
1.53 paf 73: try {
1.107 moko 74: columns+=new String(str, String::L_TAINTED /* no length as 0x00 can be inside */);
1.53 paf 75: return false;
76: } catch(...) {
77: error=SQL_Error("exception occured in Hash_sql_event_handlers::add_column");
78: return true;
79: }
1.11 parser 80: }
1.86 misha 81:
1.53 paf 82: bool before_rows(SQL_Error& error) {
1.67 paf 83: if(columns.count()<1) {
1.79 misha 84: error=SQL_Error(PARSER_RUNTIME, "no columns");
1.53 paf 85: return true;
86: }
1.86 misha 87: switch(value_type){
88: case C_STRING: {
89: if(columns.count()>2){
90: error=SQL_Error(PARSER_RUNTIME, "only 2 columns allowed for $.type[string].");
91: return true;
92: }
93: }
94: case C_TABLE: {
95: // create empty table which we'll copy later
96: empty=new Table(&columns);
97: columns_count=columns.count();
98: }
99: case C_HASH: {
100: one_bool_column=columns.count()==1;
101: }
102: }
1.53 paf 103: return false;
1.11 parser 104: }
1.86 misha 105:
1.53 paf 106: bool add_row(SQL_Error& /*error*/) {
1.11 parser 107: column_index=0;
1.53 paf 108: return false;
1.11 parser 109: }
1.86 misha 110:
1.116 misha 111: bool add_row_cell(SQL_Error& error, const char *str, size_t ) {
1.53 paf 112: try {
1.116 misha 113: const String& cell=str?*new String(str, String::L_TAINTED /* no length as 0x00 can be inside */):String::Empty;
1.86 misha 114:
1.69 paf 115: bool duplicate=false;
1.86 misha 116: if(one_bool_column) {
1.69 paf 117: duplicate=rows_hash.put_dont_replace(cell, &only_one_column_value); // put. existed?
118: } else if(column_index==0) {
1.86 misha 119: switch(value_type){
120: case C_HASH: {
121: VHash* row_vhash=new VHash;
122: row_value=row_vhash;
123: duplicate=rows_hash.put_dont_replace(cell, row_vhash); // put. existed?
124: break;
125: }
126: case C_STRING: {
127: VString* row_vstring=new VString();
128: row_value=row_vstring;
129: duplicate=rows_hash.put_dont_replace(cell, row_vstring); // put. existed?
130: break;
131: }
132: case C_TABLE: {
133: VTable* vtable=(VTable*)rows_hash.get(cell);
134: Table* table;
135:
136: if(vtable) { // table with this key exist?
137: if(!distinct) {
138: duplicate=true;
139: break;
140: }
141: table=vtable->get_table();
142: } else {
143: // no? creating table of same structure as source
144: Table::Action_options table_options(0, 0);
145: table=new Table(*empty, table_options/*no rows, just structure*/);
146: vtable=new VTable(table);
147: rows_hash.put(cell, vtable); // put
148: }
149: ArrayString* row=new ArrayString(columns_count);
150: row_value=(Value*)row;
151: *row+=&cell;
152: *table+=row;
153: break;
154: }
155: }
156: } else {
157: switch(value_type) {
158: case C_HASH: {
159: row_value->get_hash()->put(*columns[column_index], new VString(cell));
160: break;
161: }
162: case C_STRING: {
163: VString* row_string=(VString*)row_value;
164: row_string->set_string(cell);
165: break;
166: }
167: case C_TABLE: {
168: ArrayString* row=(ArrayString*)row_value;
169: *row+=&cell;
170: break;
171: }
172: }
173: }
1.69 paf 174:
175: if(duplicate & !distinct) {
1.79 misha 176: error=SQL_Error(PARSER_RUNTIME, "duplicate key");
1.69 paf 177: return true;
178: }
179:
1.53 paf 180: column_index++;
181: return false;
182: } catch(...) {
183: error=SQL_Error("exception occured in Hash_sql_event_handlers::add_row_cell");
184: return true;
185: }
1.11 parser 186: }
187:
188: };
1.67 paf 189: VBool Hash_sql_event_handlers::only_one_column_value(true);
190:
1.11 parser 191: #endif
192:
1.57 paf 193: static void _create_or_add(Request& r, MethodParams& params) {
194: if(params.count()) {
1.111 misha 195: Value& vsrc=params.as_no_junction(0, PARAM_MUST_BE_HASH);
1.115 moko 196: VHash& self=GET_SELF(r, VHash);
197: HashStringValue* src_hash;
198: HashStringValue* self_hash=&(self.hash());
199:
200: if(VHash* src=static_cast<VHash*>(vsrc.as(VHASH_TYPE))) {
1.127 ! moko 201: src_hash=&(src->hash());
1.115 moko 202:
203: if(src_hash==self_hash) // same: doing nothing
1.66 paf 204: return;
1.72 paf 205:
1.115 moko 206: if(Value* vdefault=src->get_default())
207: if(vdefault->is_defined())
208: self.set_default(vdefault);
209: } else {
210: src_hash=vsrc.get_hash();
1.66 paf 211: }
1.115 moko 212:
213: if(src_hash)
214: src_hash->for_each<HashStringValue*>(copy_all_overwrite_to, self_hash);
1.20 parser 215: }
216: }
1.22 parser 217:
1.57 paf 218: static void _sub(Request& r, MethodParams& params) {
1.114 misha 219: if(HashStringValue* src=params.as_hash(0, "param")) {
1.66 paf 220: HashStringValue* self=&(GET_SELF(r, VHash).hash());
221: if(src==self) { // same: clearing
222: self->clear();
223: return;
224: }
1.77 paf 225: src->for_each<HashStringValue*>(remove_key_from, self);
1.66 paf 226: }
1.57 paf 227: }
228:
229: static void copy_all_dontoverwrite_to(
1.100 misha 230: HashStringValue::key_type key,
231: HashStringValue::value_type value,
232: HashStringValue* dest) {
1.57 paf 233: dest->put_dont_replace(key, value);
1.22 parser 234: }
1.57 paf 235: static void _union(Request& r, MethodParams& params) {
1.22 parser 236: // dest = copy of self
1.57 paf 237: Value& result=*new VHash(GET_SELF(r, VHash).hash());
1.22 parser 238: // dest += b
1.114 misha 239: if(HashStringValue* src=params.as_hash(0, "param"))
1.77 paf 240: src->for_each<HashStringValue*>(copy_all_dontoverwrite_to, result.get_hash());
1.22 parser 241:
242: // return result
243: r.write_no_lang(result);
244: }
245:
246: #ifndef DOXYGEN
247: struct Copy_intersection_to_info {
1.57 paf 248: HashStringValue* b;
249: HashStringValue* dest;
1.22 parser 250: };
251: #endif
1.57 paf 252: static void copy_intersection_to(
1.100 misha 253: HashStringValue::key_type key,
254: HashStringValue::value_type value,
255: Copy_intersection_to_info *info) {
1.57 paf 256: if(info->b->get(key))
257: info->dest->put_dont_replace(key, value);
1.22 parser 258: }
1.57 paf 259: static void _intersection(Request& r, MethodParams& params) {
260: Value& result=*new VHash;
1.22 parser 261: // dest += b
1.114 misha 262: if(HashStringValue* b=params.as_hash(0, "param")) {
1.57 paf 263: Copy_intersection_to_info info={b, result.get_hash()};
1.77 paf 264: GET_SELF(r, VHash).hash().for_each<Copy_intersection_to_info*>(copy_intersection_to, &info);
1.22 parser 265: }
266:
267: // return result
1.57 paf 268: r.write_no_lang(result);
1.22 parser 269: }
270:
1.57 paf 271: static bool intersects(
1.100 misha 272: HashStringValue::key_type key,
273: HashStringValue::value_type /*value*/,
274: HashStringValue* b) {
1.57 paf 275: return b->get(key)!=0;
1.22 parser 276: }
277:
1.57 paf 278: static void _intersects(Request& r, MethodParams& params) {
279: bool result=false;
280:
1.119 misha 281: if(HashStringValue* b=params.as_hash(0, "param")) {
282: HashStringValue* self=&(GET_SELF(r, VHash).hash());
1.120 misha 283: if(b==self) {
284: r.write_no_lang(VBool::get(true));
285: return;
286: }
1.119 misha 287: result=self->first_that<HashStringValue*>(intersects, b)!=0;
288: }
1.22 parser 289:
290: // return result
1.89 misha 291: r.write_no_lang(VBool::get(result));
1.22 parser 292: }
293:
294:
1.71 paf 295: extern String sql_bind_name;
1.57 paf 296: extern String sql_limit_name;
297: extern String sql_offset_name;
298: extern String sql_default_name;
299: extern String sql_distinct_name;
1.81 misha 300: extern String sql_value_type_name;
301: extern Table2hash_value_type get_value_type(Value& vvalue_type);
1.71 paf 302: extern int marshal_binds(HashStringValue& hash, SQL_Driver::Placeholder*& placeholders);
303: extern void unmarshal_bind_updates(HashStringValue& hash, int placeholder_count, SQL_Driver::Placeholder* placeholders);
304:
1.57 paf 305: static void _sql(Request& r, MethodParams& params) {
306: Value& statement=params.as_junction(0, "statement must be code");
1.2 parser 307:
1.71 paf 308: HashStringValue* bind=0;
1.87 misha 309: ulong limit=SQL_NO_LIMIT;
1.33 paf 310: ulong offset=0;
1.49 paf 311: bool distinct=false;
1.81 misha 312: Table2hash_value_type value_type=C_HASH;
1.110 misha 313: if(params.count()>1)
1.114 misha 314: if(HashStringValue* options=params.as_hash(1, "sql options")) {
1.110 misha 315: int valid_options=0;
316: if(Value* vbind=options->get(sql_bind_name)) {
317: valid_options++;
318: bind=vbind->get_hash();
319: }
320: if(Value* vlimit=options->get(sql_limit_name)) {
321: valid_options++;
322: limit=(ulong)r.process_to_value(*vlimit).as_double();
323: }
324: if(Value* voffset=options->get(sql_offset_name)) {
325: valid_options++;
326: offset=(ulong)r.process_to_value(*voffset).as_double();
327: }
328: if(Value* vdistinct=options->get(sql_distinct_name)) {
329: valid_options++;
330: distinct=r.process_to_value(*vdistinct).as_bool();
331: }
332: if(Value* vvalue_type=options->get(sql_value_type_name)) {
333: valid_options++;
334: value_type=get_value_type(r.process_to_value(*vvalue_type));
335: }
336: if(valid_options!=options->count())
337: throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION);
338: }
1.2 parser 339:
1.71 paf 340: SQL_Driver::Placeholder* placeholders=0;
341: uint placeholders_count=0;
342: if(bind)
343: placeholders_count=marshal_binds(*bind, placeholders);
344:
1.57 paf 345: Temp_lang temp_lang(r, String::L_SQL);
1.37 paf 346: const String& statement_string=r.process_to_string(statement);
1.99 misha 347: const char* statement_cstr=statement_string.untaint_cstr(r.flang, r.connection());
1.97 misha 348:
1.57 paf 349: HashStringValue& hash=GET_SELF(r, VHash).hash();
1.11 parser 350: hash.clear();
1.57 paf 351: Hash_sql_event_handlers handlers(
1.49 paf 352: statement_string, statement_cstr,
353: distinct,
1.86 misha 354: hash,
355: value_type);
1.87 misha 356:
1.57 paf 357: r.connection()->query(
1.70 paf 358: statement_cstr,
1.73 paf 359: placeholders_count, placeholders,
1.70 paf 360: offset, limit,
1.45 paf 361: handlers,
362: statement_string);
1.71 paf 363:
364: if(bind)
365: unmarshal_bind_updates(*bind, placeholders_count, placeholders);
1.2 parser 366: }
367:
1.57 paf 368: static void keys_collector(
1.100 misha 369: HashStringValue::key_type key,
370: HashStringValue::value_type,
371: Table *table) {
372: Table::element_type row(new ArrayString(1));
1.57 paf 373: *row+=new String(key, String::L_TAINTED);
374: *table+=row;
1.9 parser 375: }
1.68 paf 376: static void _keys(Request& r, MethodParams& params) {
377: const String* keys_column_name;
378: if(params.count()>0)
1.81 misha 379: keys_column_name=¶ms.as_string(0, COLUMN_NAME_MUST_BE_STRING);
1.68 paf 380: else
381: keys_column_name=new String("key");
382:
1.101 misha 383: Table::columns_type columns(new ArrayString(1));
1.68 paf 384: *columns+=keys_column_name;
1.57 paf 385: Table* table=new Table(columns);
1.9 parser 386:
1.127 ! moko 387: GET_SELF(r, VHash).hash().for_each<Table*>(keys_collector, table);
1.9 parser 388:
1.57 paf 389: r.write_no_lang(*new VTable(table));
1.9 parser 390: }
391:
1.57 paf 392: static void _count(Request& r, MethodParams&) {
1.127 ! moko 393: r.write_no_lang(*new VInt(GET_SELF(r, VHash).hash().count()));
1.16 parser 394: }
395:
1.57 paf 396: static void _delete(Request& r, MethodParams& params) {
1.119 misha 397: if(params.count()>0)
398: GET_SELF(r, VHash).hash().remove(params.as_string(0, "key must be string"));
399: else
400: GET_SELF(r, VHash).hash().clear();
1.25 paf 401: }
402:
1.82 misha 403: static void _contains(Request& r, MethodParams& params) {
1.127 ! moko 404: bool result=GET_SELF(r, VHash).hash().contains(params.as_string(0, "key must be string"));
1.89 misha 405: r.write_no_lang(VBool::get(result));
1.80 misha 406: }
407:
1.26 paf 408: #ifndef DOXYGEN
1.59 paf 409: struct Foreach_info {
1.26 paf 410: Request *r;
411: const String* key_var_name;
412: const String* value_var_name;
1.57 paf 413: Value* body_code;
414: Value* delim_maybe_code;
1.26 paf 415:
1.84 misha 416: Value* var_context;
1.26 paf 417: bool need_delim;
418: };
419: #endif
1.90 misha 420: static bool one_foreach_cycle(
421: HashStringValue::key_type akey,
422: HashStringValue::value_type avalue,
423: Foreach_info *info) {
1.84 misha 424: Value& var_context=*info->var_context;
1.85 misha 425: if(info->key_var_name){
1.96 misha 426: VString* vkey=new VString(*new String(akey, String::L_TAINTED));
1.118 moko 427: info->r->put_element(var_context, *info->key_var_name, vkey);
1.85 misha 428: }
429: if(info->value_var_name)
1.118 moko 430: info->r->put_element(var_context, *info->value_var_name, avalue);
1.57 paf 431:
1.91 misha 432: if(info->delim_maybe_code){ // delimiter set
1.90 misha 433: StringOrValue sv_processed=info->r->process(*info->body_code);
434: Request::Skip lskip=info->r->get_skip(); info->r->set_skip(Request::SKIP_NOTHING);
435:
436: const String* s_processed=sv_processed.get_string();
1.91 misha 437: if(s_processed && !s_processed->is_empty()) { // we have body
1.90 misha 438: if(info->need_delim) // need delim & iteration produced string?
439: info->r->write_pass_lang(info->r->process(*info->delim_maybe_code));
440: else
441: info->need_delim=true;
442: }
443: info->r->write_pass_lang(sv_processed);
444: return lskip==Request::SKIP_BREAK;
445: } else {
446: info->r->process_write(*info->body_code);
447: Request::Skip lskip=info->r->get_skip(); info->r->set_skip(Request::SKIP_NOTHING);
448: return lskip==Request::SKIP_BREAK;
1.26 paf 449: }
450: }
1.57 paf 451: static void _foreach(Request& r, MethodParams& params) {
1.102 misha 452: InCycle temp(r);
1.77 paf 453:
1.85 misha 454: const String& key_var_name=params.as_string(0, "key-var name must be string");
455: const String& value_var_name=params.as_string(1, "value-var name must be string");
456:
1.63 paf 457: Foreach_info info={
458: &r,
1.85 misha 459: key_var_name.is_empty()? 0 : &key_var_name,
460: value_var_name.is_empty()? 0 : &value_var_name,
1.63 paf 461: ¶ms.as_junction(2, "body must be code"),
1.84 misha 462: /*delimiter*/params.count()>3?params.get(3):0,
463: /*var_context*/r.get_method_frame()->caller(),
1.85 misha 464: false
1.63 paf 465: };
1.57 paf 466:
467: VHash& self=GET_SELF(r, VHash);
1.127 ! moko 468: HashStringValue& hash=self.hash();
1.77 paf 469: hash.first_that<Foreach_info*>(one_foreach_cycle, &info);
1.26 paf 470: }
471:
1.121 misha 472: enum AtResultType {
473: AtResultTypeValue = 0,
474: AtResultTypeKey = 1,
475: AtResultTypeHash = 2
476: };
477:
478: inline Value& SingleElementHash(String::Body akey, Value* avalue) {
479: Value& result=*new VHash;
480: result.put_element(*new String(akey, String::L_TAINTED), avalue);
481: return result;
482: }
483:
1.122 moko 484: #ifndef DOXYGEN
485: struct Hash_seq_item {
486: HashStringValue::Pair *hash_pair;
487: union {
488: const char *c_str;
489: double d;
490: } value;
491: };
492: #endif
493: static int sort_cmp_string(const void *a, const void *b) {
494: return strcmp(
495: static_cast<const Hash_seq_item *>(a)->value.c_str,
496: static_cast<const Hash_seq_item *>(b)->value.c_str
497: );
498: }
499: static int sort_cmp_double(const void *a, const void *b) {
500: double va=static_cast<const Hash_seq_item *>(a)->value.d;
501: double vb=static_cast<const Hash_seq_item *>(b)->value.d;
502: if(va<vb)
503: return -1;
504: else if(va>vb)
505: return +1;
506: else
507: return 0;
508: }
509: static void _sort(Request& r, MethodParams& params){
1.123 moko 510: #ifdef HASH_ORDER
1.122 moko 511: const String& key_var_name=params.as_string(0, "key-var name must be string");
512: const String& value_var_name=params.as_string(1, "value-var name must be string");
513: Value& key_maker=params.as_junction(2, "key-maker must be code");
514: bool reverse=params.count()>3/*..[desc|asc|]*/?
515: reverse=params.as_no_junction(3, "order must not be code").as_string()=="desc":
516: false; // default=asc
517:
518: const String* key_var=key_var_name.is_empty()? 0 : &key_var_name;
519: const String* value_var=value_var_name.is_empty()? 0 : &value_var_name;
520: VMethodFrame* context=r.get_method_frame()->caller();
521:
522: VHash& self=GET_SELF(r, VHash);
1.127 ! moko 523: HashStringValue& hash=self.hash();
1.122 moko 524: int count=hash.count();
525:
526: Hash_seq_item* seq=new(PointerFreeGC) Hash_seq_item[count];
527: int pos=0;
528: bool key_values_are_strings=true;
529:
530: for(HashStringValue::Iterator i(hash); i; i.next(), pos++ ){
531: if(key_var)
532: r.put_element(*context, *key_var, new VString(*new String(i.key(), String::L_TAINTED)));
533: if(value_var)
534: r.put_element(*context, *value_var, i.value());
535:
536: Value& value=r.process_to_value(key_maker);
537: if(pos==0) // determining key values type by first one
538: key_values_are_strings=value.is_string();
539:
540: seq[pos].hash_pair=i.pair();
541: if(key_values_are_strings)
542: seq[pos].value.c_str=value.as_string().cstr();
543: else
544: seq[pos].value.d=value.as_expr_result().as_double();
545: }
546:
547: // @todo: handle this elsewhere
548: if(r.charsets.source().NAME()=="KOI8-R" && key_values_are_strings)
549: for(pos=0; pos<count; pos++)
550: if(*seq[pos].value.c_str)
551: seq[pos].value.c_str=Charset::transcode(seq[pos].value.c_str, r.charsets.source(), UTF8_charset).cstr();
552:
553: // sort keys
554: qsort(seq, count, sizeof(Hash_seq_item), key_values_are_strings?sort_cmp_string:sort_cmp_double);
555:
556: // reorder hash as required in 'seq'
557: hash.order_clear();
558: if(reverse)
559: for(pos=count-1; pos>=0; pos--)
560: hash.order_next(seq[pos].hash_pair);
561: else
562: for(pos=0; pos<count; pos++)
563: hash.order_next(seq[pos].hash_pair);
564:
565: delete[] seq;
1.123 moko 566: #endif
1.122 moko 567: }
568:
1.105 misha 569: static void _at(Request& r, MethodParams& params) {
1.127 ! moko 570: HashStringValue& hash=GET_SELF(r, VHash).hash();
1.105 misha 571: size_t count=hash.count();
572:
573: int pos=0;
574:
1.121 misha 575: // misha@
576: // I do not like that type is checked before whence.
577: // But I do not like the idea to move it after whence (where process_to_value can be called) even more.
578: AtResultType result_type=AtResultTypeValue;
579: if(params.count() > 1) {
580: const String& stype=params.as_string(1, "type must be string");
581: if(stype == "key")
582: result_type=AtResultTypeKey;
583: else if(stype == "hash")
584: result_type=AtResultTypeHash;
585: else if(stype != "value")
586: throw Exception(PARSER_RUNTIME, &stype, "type must be 'key', 'value' or 'hash'");
587: }
588:
1.105 misha 589: Value& vwhence=*params.get(0);
1.121 misha 590: if(vwhence.is_string()) {
1.105 misha 591: const String& swhence=*vwhence.get_string();
592: if(swhence == "last")
593: pos=count-1;
594: else if(swhence != "first")
595: throw Exception(PARSER_RUNTIME,
596: &swhence,
597: "whence must be 'first', 'last' or expression");
598: } else {
599: pos=r.process_to_value(vwhence).as_int();
600: if(pos < 0)
601: pos+=count;
602: }
603:
1.106 misha 604: if(count && pos >= 0 && (size_t)pos < count){
1.121 misha 605: switch(result_type) {
606: case AtResultTypeKey:
607: {
1.123 moko 608: #ifdef HASH_ORDER
1.121 misha 609: if(pos == 0) {
610: r.write_assign_lang(*new VString(*new String(hash.first_key(), String::L_TAINTED)));
611: } else if((size_t)pos == count-1) {
612: r.write_assign_lang(*new VString(*new String(hash.last_key(), String::L_TAINTED)));
1.123 moko 613: } else
614: #endif
615: {
1.121 misha 616: for(HashStringValue::Iterator i(hash); i; i.next(), pos-- )
617: if(!pos){
618: r.write_assign_lang(*new VString(*new String(i.key(), String::L_TAINTED)));
619: break;
620: }
621: }
1.105 misha 622: break;
623: }
1.121 misha 624: case AtResultTypeValue:
625: {
1.123 moko 626: #ifdef HASH_ORDER
1.121 misha 627: if(pos == 0) {
628: r.write_assign_lang(*hash.first_value());
629: } else if((size_t)pos == count-1) {
630: r.write_assign_lang(*hash.last_value());
1.123 moko 631: } else
632: #endif
633: {
1.121 misha 634: for(HashStringValue::Iterator i(hash); i; i.next(), pos-- )
635: if(!pos){
636: r.write_assign_lang(*i.value());
637: break;
638: }
639: }
640: break;
641: }
642: case AtResultTypeHash:
643: {
1.123 moko 644: #ifdef HASH_ORDER
1.121 misha 645: if(pos == 0) {
646: r.write_no_lang(SingleElementHash(hash.first_key(), hash.first_value()));
647: } else if((size_t)pos == count-1) {
648: r.write_no_lang(SingleElementHash(hash.last_key(), hash.last_value()));
1.123 moko 649: } else
650: #endif
651: {
1.121 misha 652: for(HashStringValue::Iterator i(hash); i; i.next(), pos-- )
653: if(!pos){
654: r.write_no_lang(SingleElementHash(i.key(), i.value()));
655: break;
656: }
657: }
658: break;
659: }
660: }
1.105 misha 661: }
662: }
663:
1.1 paf 664: // constructor
665:
1.57 paf 666: MHash::MHash(): Methoded("hash")
1.39 paf 667: {
1.21 parser 668: // ^hash::create[[copy_from]]
1.57 paf 669: add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1);
1.22 parser 670: // ^hash.add[add_from]
1.57 paf 671: add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1);
1.22 parser 672: // ^hash.sub[sub_from]
673: add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1);
674: // ^a.union[b] = hash
675: add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1);
676: // ^a.intersection[b] = hash
677: add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 1);
678: // ^a.intersects[b] = bool
679: add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1);
1.25 paf 680:
681: // ^a.delete[key]
1.119 misha 682: add_native_method("delete", Method::CT_DYNAMIC, _delete, 0, 1);
1.2 parser 683:
1.82 misha 684: // ^a.contains[key]
685: add_native_method("contains", Method::CT_DYNAMIC, _contains, 1, 1);
686: // backward
687: add_native_method("contain", Method::CT_DYNAMIC, _contains, 1, 1);
1.80 misha 688:
689: // ^hash::sql[query][options hash]
1.33 paf 690: add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2);
1.2 parser 691:
1.68 paf 692: // ^hash._keys[[column name]]
1.124 moko 693: add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 1);
1.16 parser 694:
695: // ^hash._count[]
1.124 moko 696: add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0);
1.26 paf 697:
698: // ^hash.foreach[key;value]{code}[delim]
699: add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1);
1.105 misha 700:
1.122 moko 701: // ^hash.sort[key;value]{string-key-maker}[[asc|desc]]
702: // ^hash.sort[key;value](numeric-key-maker)[[asc|desc]]
703: add_native_method("sort", Method::CT_DYNAMIC, _sort, 2+1, 2+1+1);
704:
1.121 misha 705: // ^hash._at[first|last[;'key'|'value'|'hash']]
706: // ^hash._at([-+]offset)[['key'|'value'|'hash']]
707: add_native_method("_at", Method::CT_DYNAMIC, _at, 1, 2);
1.124 moko 708:
709: #ifdef FEATURE_GET_ELEMENT4CALL
710: // aliases without "_"
711: add_native_method("keys", Method::CT_DYNAMIC, _keys, 0, 1);
712: add_native_method("count", Method::CT_DYNAMIC, _count, 0, 0);
713: add_native_method("at", Method::CT_DYNAMIC, _at, 1, 2);
714: #endif
715:
1.1 paf 716: }
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