Annotation of parser3/src/classes/hash.C, revision 1.140
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.140 ! moko 20: volatile const char * IDENT_HASH_C="$Id: hash.C,v 1.139 2016/12/26 16:24:03 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: row_value(0),
1.67 paf 65: column_index(0),
1.139 moko 66: columns(*new ArrayString),
1.86 misha 67: one_bool_column(false),
1.139 moko 68: value_type(avalue_type),
1.86 misha 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.130 moko 196: VHashBase& self=GET_SELF(r, VHashBase);
197: HashStringValue* self_hash=&(self.hash());
1.115 moko 198: HashStringValue* src_hash;
199:
1.130 moko 200: if(VHashBase* src=static_cast<VHashBase*>(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())
1.129 moko 207: self.set_default(vdefault);
1.115 moko 208: } else {
209: src_hash=vsrc.get_hash();
1.66 paf 210: }
1.115 moko 211:
212: if(src_hash)
1.138 moko 213: for(HashStringValue::Iterator i(*src_hash); i; i.next())
214: self_hash->put(i.key(), i.value());
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.130 moko 220: HashStringValue* self=&(GET_SELF(r, VHashBase).hash());
1.66 paf 221: if(src==self) { // same: clearing
222: self->clear();
223: return;
224: }
1.138 moko 225: for(HashStringValue::Iterator i(*src); i; i.next())
226: self->remove(i.key());
1.66 paf 227: }
1.57 paf 228: }
229:
1.130 moko 230: static void copy_all_dontoverwrite_to(HashStringValue::key_type key, HashStringValue::value_type value, HashStringValue* dest) {
1.57 paf 231: dest->put_dont_replace(key, value);
1.22 parser 232: }
1.57 paf 233: static void _union(Request& r, MethodParams& params) {
1.22 parser 234: // dest = copy of self
1.130 moko 235: Value& result=*new VHash(GET_SELF(r, VHashBase).hash());
1.22 parser 236: // dest += b
1.114 misha 237: if(HashStringValue* src=params.as_hash(0, "param"))
1.77 paf 238: src->for_each<HashStringValue*>(copy_all_dontoverwrite_to, result.get_hash());
1.22 parser 239:
240: // return result
1.137 moko 241: r.write(result);
1.22 parser 242: }
243:
244: #ifndef DOXYGEN
245: struct Copy_intersection_to_info {
1.57 paf 246: HashStringValue* b;
247: HashStringValue* dest;
1.22 parser 248: };
249: #endif
1.130 moko 250: static void copy_intersection_to(HashStringValue::key_type key, HashStringValue::value_type value, Copy_intersection_to_info *info) {
1.57 paf 251: if(info->b->get(key))
252: info->dest->put_dont_replace(key, value);
1.22 parser 253: }
1.57 paf 254: static void _intersection(Request& r, MethodParams& params) {
255: Value& result=*new VHash;
1.22 parser 256: // dest += b
1.114 misha 257: if(HashStringValue* b=params.as_hash(0, "param")) {
1.57 paf 258: Copy_intersection_to_info info={b, result.get_hash()};
1.130 moko 259: GET_SELF(r, VHashBase).hash().for_each<Copy_intersection_to_info*>(copy_intersection_to, &info);
1.22 parser 260: }
261:
262: // return result
1.137 moko 263: r.write(result);
1.22 parser 264: }
265:
1.130 moko 266: static bool intersects( HashStringValue::key_type key, HashStringValue::value_type /*value*/, HashStringValue* b) {
1.57 paf 267: return b->get(key)!=0;
1.22 parser 268: }
269:
1.57 paf 270: static void _intersects(Request& r, MethodParams& params) {
271: bool result=false;
272:
1.119 misha 273: if(HashStringValue* b=params.as_hash(0, "param")) {
1.130 moko 274: HashStringValue* self=&(GET_SELF(r, VHashBase).hash());
1.120 misha 275: if(b==self) {
1.137 moko 276: r.write(VBool::get(true));
1.120 misha 277: return;
278: }
1.119 misha 279: result=self->first_that<HashStringValue*>(intersects, b)!=0;
280: }
1.22 parser 281:
282: // return result
1.137 moko 283: r.write(VBool::get(result));
1.22 parser 284: }
285:
286:
1.71 paf 287: extern String sql_bind_name;
1.57 paf 288: extern String sql_limit_name;
289: extern String sql_offset_name;
290: extern String sql_default_name;
291: extern String sql_distinct_name;
1.81 misha 292: extern String sql_value_type_name;
293: extern Table2hash_value_type get_value_type(Value& vvalue_type);
1.71 paf 294: extern int marshal_binds(HashStringValue& hash, SQL_Driver::Placeholder*& placeholders);
295: extern void unmarshal_bind_updates(HashStringValue& hash, int placeholder_count, SQL_Driver::Placeholder* placeholders);
296:
1.57 paf 297: static void _sql(Request& r, MethodParams& params) {
298: Value& statement=params.as_junction(0, "statement must be code");
1.2 parser 299:
1.71 paf 300: HashStringValue* bind=0;
1.87 misha 301: ulong limit=SQL_NO_LIMIT;
1.33 paf 302: ulong offset=0;
1.49 paf 303: bool distinct=false;
1.81 misha 304: Table2hash_value_type value_type=C_HASH;
1.110 misha 305: if(params.count()>1)
1.114 misha 306: if(HashStringValue* options=params.as_hash(1, "sql options")) {
1.110 misha 307: int valid_options=0;
308: if(Value* vbind=options->get(sql_bind_name)) {
309: valid_options++;
310: bind=vbind->get_hash();
311: }
312: if(Value* vlimit=options->get(sql_limit_name)) {
313: valid_options++;
1.133 moko 314: limit=(ulong)r.process(*vlimit).as_double();
1.110 misha 315: }
316: if(Value* voffset=options->get(sql_offset_name)) {
317: valid_options++;
1.133 moko 318: offset=(ulong)r.process(*voffset).as_double();
1.110 misha 319: }
320: if(Value* vdistinct=options->get(sql_distinct_name)) {
321: valid_options++;
1.133 moko 322: distinct=r.process(*vdistinct).as_bool();
1.110 misha 323: }
324: if(Value* vvalue_type=options->get(sql_value_type_name)) {
325: valid_options++;
1.133 moko 326: value_type=get_value_type(r.process(*vvalue_type));
1.110 misha 327: }
328: if(valid_options!=options->count())
329: throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION);
330: }
1.2 parser 331:
1.71 paf 332: SQL_Driver::Placeholder* placeholders=0;
333: uint placeholders_count=0;
334: if(bind)
335: placeholders_count=marshal_binds(*bind, placeholders);
336:
1.37 paf 337: const String& statement_string=r.process_to_string(statement);
1.136 moko 338: const char* statement_cstr=statement_string.untaint_cstr(String::L_SQL, r.connection());
1.97 misha 339:
1.130 moko 340: HashStringValue& hash=GET_SELF(r, VHashBase).hash();
1.11 parser 341: hash.clear();
1.57 paf 342: Hash_sql_event_handlers handlers(
1.49 paf 343: statement_string, statement_cstr,
344: distinct,
1.86 misha 345: hash,
346: value_type);
1.87 misha 347:
1.57 paf 348: r.connection()->query(
1.70 paf 349: statement_cstr,
1.73 paf 350: placeholders_count, placeholders,
1.70 paf 351: offset, limit,
1.45 paf 352: handlers,
353: statement_string);
1.71 paf 354:
355: if(bind)
356: unmarshal_bind_updates(*bind, placeholders_count, placeholders);
1.2 parser 357: }
358:
1.130 moko 359: static void keys_collector(HashStringValue::key_type key, HashStringValue::value_type, Table *table) {
1.100 misha 360: Table::element_type row(new ArrayString(1));
1.57 paf 361: *row+=new String(key, String::L_TAINTED);
362: *table+=row;
1.9 parser 363: }
1.68 paf 364: static void _keys(Request& r, MethodParams& params) {
365: const String* keys_column_name;
366: if(params.count()>0)
1.81 misha 367: keys_column_name=¶ms.as_string(0, COLUMN_NAME_MUST_BE_STRING);
1.68 paf 368: else
369: keys_column_name=new String("key");
370:
1.101 misha 371: Table::columns_type columns(new ArrayString(1));
1.68 paf 372: *columns+=keys_column_name;
1.57 paf 373: Table* table=new Table(columns);
1.9 parser 374:
1.130 moko 375: GET_SELF(r, VHashBase).hash().for_each<Table*>(keys_collector, table);
1.9 parser 376:
1.137 moko 377: r.write(*new VTable(table));
1.9 parser 378: }
379:
1.57 paf 380: static void _count(Request& r, MethodParams&) {
1.137 moko 381: r.write(*new VInt(GET_SELF(r, VHashBase).hash().count()));
1.16 parser 382: }
383:
1.57 paf 384: static void _delete(Request& r, MethodParams& params) {
1.119 misha 385: if(params.count()>0)
1.130 moko 386: GET_SELF(r, VHashBase).hash().remove(params.as_string(0, "key must be string"));
1.119 misha 387: else
1.130 moko 388: GET_SELF(r, VHashBase).hash().clear();
1.25 paf 389: }
390:
1.82 misha 391: static void _contains(Request& r, MethodParams& params) {
1.130 moko 392: VHashBase& self=GET_SELF(r, VHashBase);
1.129 moko 393: const String& key_name=params.as_string(0, "key must be string");
394: bool result=SYMBOLS_EQ(key_name,_DEFAULT_SYMBOL) ? (self.get_default() != 0) : self.hash().contains(key_name);
1.137 moko 395: r.write(VBool::get(result));
1.80 misha 396: }
397:
1.57 paf 398: static void _foreach(Request& r, MethodParams& params) {
1.102 misha 399: InCycle temp(r);
1.77 paf 400:
1.128 moko 401: const String* key_var_name=¶ms.as_string(0, "key-var name must be string");
402: const String* value_var_name=¶ms.as_string(1, "value-var name must be string");
403: Value* body_code=¶ms.as_junction(2, "body must be code");
1.134 moko 404: Value* delim_maybe_code=params.count()>3?¶ms[3]:0;
1.128 moko 405: Value& caller=*r.get_method_frame()->caller();
1.85 misha 406:
1.128 moko 407: if(key_var_name->is_empty()) key_var_name=0;
408: if(value_var_name->is_empty()) value_var_name=0;
1.57 paf 409:
1.130 moko 410: HashStringValue& hash=GET_SELF(r, VHashBase).hash();
1.128 moko 411:
412: if(delim_maybe_code){ // delimiter set
413: bool need_delim=false;;
414: for(HashStringValue::Iterator i(hash); i; i.next()){
415: if(key_var_name){
416: VString* vkey=new VString(*new String(i.key(), String::L_TAINTED));
417: r.put_element(caller, *key_var_name, vkey);
418: }
419:
420: if(value_var_name)
421: r.put_element(caller, *value_var_name, i.value());
422:
1.132 moko 423: Value& sv_processed=r.process(*body_code);
1.140 ! moko 424: TempSkip4Delimiter skip(r);
1.128 moko 425:
426: const String* s_processed=sv_processed.get_string();
427: if(s_processed && !s_processed->is_empty()) { // we have body
428: if(need_delim) // need delim & iteration produced string?
1.137 moko 429: r.write(r.process(*delim_maybe_code));
1.128 moko 430: else
431: need_delim=true;
432: }
433:
1.137 moko 434: r.write(sv_processed);
1.128 moko 435:
1.140 ! moko 436: if(skip.check_break())
1.128 moko 437: break;
438: }
439: } else {
440: for(HashStringValue::Iterator i(hash); i; i.next()){
441: if(key_var_name){
442: VString* vkey=new VString(*new String(i.key(), String::L_TAINTED));
443: r.put_element(caller, *key_var_name, vkey);
444: }
445:
446: if(value_var_name)
447: r.put_element(caller, *value_var_name, i.value());
448:
449: r.process_write(*body_code);
450:
1.140 ! moko 451: if(r.check_skip_break())
1.128 moko 452: break;
453: }
454: }
1.26 paf 455: }
456:
1.121 misha 457: enum AtResultType {
458: AtResultTypeValue = 0,
459: AtResultTypeKey = 1,
460: AtResultTypeHash = 2
461: };
462:
463: inline Value& SingleElementHash(String::Body akey, Value* avalue) {
464: Value& result=*new VHash;
465: result.put_element(*new String(akey, String::L_TAINTED), avalue);
466: return result;
467: }
468:
1.122 moko 469: #ifndef DOXYGEN
470: struct Hash_seq_item {
471: HashStringValue::Pair *hash_pair;
472: union {
473: const char *c_str;
474: double d;
475: } value;
476: };
477: #endif
478: static int sort_cmp_string(const void *a, const void *b) {
479: return strcmp(
480: static_cast<const Hash_seq_item *>(a)->value.c_str,
481: static_cast<const Hash_seq_item *>(b)->value.c_str
482: );
483: }
484: static int sort_cmp_double(const void *a, const void *b) {
485: double va=static_cast<const Hash_seq_item *>(a)->value.d;
486: double vb=static_cast<const Hash_seq_item *>(b)->value.d;
487: if(va<vb)
488: return -1;
489: else if(va>vb)
490: return +1;
491: else
492: return 0;
493: }
494: static void _sort(Request& r, MethodParams& params){
1.123 moko 495: #ifdef HASH_ORDER
1.122 moko 496: const String& key_var_name=params.as_string(0, "key-var name must be string");
497: const String& value_var_name=params.as_string(1, "value-var name must be string");
498: Value& key_maker=params.as_junction(2, "key-maker must be code");
1.139 moko 499: bool reverse=params.count()>3 /*..[desc|asc|]*/ && params.as_no_junction(3, "order must not be code").as_string()=="desc"; // default=asc
1.122 moko 500:
501: const String* key_var=key_var_name.is_empty()? 0 : &key_var_name;
502: const String* value_var=value_var_name.is_empty()? 0 : &value_var_name;
503: VMethodFrame* context=r.get_method_frame()->caller();
504:
1.130 moko 505: HashStringValue& hash=GET_SELF(r, VHashBase).hash();
1.122 moko 506: int count=hash.count();
507:
508: Hash_seq_item* seq=new(PointerFreeGC) Hash_seq_item[count];
509: int pos=0;
510: bool key_values_are_strings=true;
511:
512: for(HashStringValue::Iterator i(hash); i; i.next(), pos++ ){
513: if(key_var)
514: r.put_element(*context, *key_var, new VString(*new String(i.key(), String::L_TAINTED)));
515: if(value_var)
516: r.put_element(*context, *value_var, i.value());
517:
1.133 moko 518: Value& value=r.process(key_maker);
1.122 moko 519: if(pos==0) // determining key values type by first one
520: key_values_are_strings=value.is_string();
521:
522: seq[pos].hash_pair=i.pair();
523: if(key_values_are_strings)
524: seq[pos].value.c_str=value.as_string().cstr();
525: else
526: seq[pos].value.d=value.as_expr_result().as_double();
527: }
528:
529: // @todo: handle this elsewhere
530: if(r.charsets.source().NAME()=="KOI8-R" && key_values_are_strings)
531: for(pos=0; pos<count; pos++)
532: if(*seq[pos].value.c_str)
1.131 moko 533: seq[pos].value.c_str=Charset::transcode(seq[pos].value.c_str, r.charsets.source(), pa_UTF8_charset).cstr();
1.122 moko 534:
535: // sort keys
536: qsort(seq, count, sizeof(Hash_seq_item), key_values_are_strings?sort_cmp_string:sort_cmp_double);
537:
538: // reorder hash as required in 'seq'
539: hash.order_clear();
540: if(reverse)
541: for(pos=count-1; pos>=0; pos--)
542: hash.order_next(seq[pos].hash_pair);
543: else
544: for(pos=0; pos<count; pos++)
545: hash.order_next(seq[pos].hash_pair);
546:
547: delete[] seq;
1.123 moko 548: #endif
1.122 moko 549: }
550:
1.105 misha 551: static void _at(Request& r, MethodParams& params) {
1.130 moko 552: HashStringValue& hash=GET_SELF(r, VHashBase).hash();
1.105 misha 553: size_t count=hash.count();
554:
555: int pos=0;
556:
1.121 misha 557: // misha@
558: // I do not like that type is checked before whence.
1.133 moko 559: // But I do not like the idea to move it after whence (where process can be called) even more.
1.121 misha 560: AtResultType result_type=AtResultTypeValue;
561: if(params.count() > 1) {
562: const String& stype=params.as_string(1, "type must be string");
563: if(stype == "key")
564: result_type=AtResultTypeKey;
565: else if(stype == "hash")
566: result_type=AtResultTypeHash;
567: else if(stype != "value")
568: throw Exception(PARSER_RUNTIME, &stype, "type must be 'key', 'value' or 'hash'");
569: }
570:
1.134 moko 571: Value& vwhence=params[0];
1.121 misha 572: if(vwhence.is_string()) {
1.105 misha 573: const String& swhence=*vwhence.get_string();
574: if(swhence == "last")
575: pos=count-1;
576: else if(swhence != "first")
577: throw Exception(PARSER_RUNTIME,
578: &swhence,
579: "whence must be 'first', 'last' or expression");
580: } else {
1.133 moko 581: pos=r.process(vwhence).as_int();
1.105 misha 582: if(pos < 0)
583: pos+=count;
584: }
585:
1.106 misha 586: if(count && pos >= 0 && (size_t)pos < count){
1.121 misha 587: switch(result_type) {
588: case AtResultTypeKey:
589: {
1.123 moko 590: #ifdef HASH_ORDER
1.121 misha 591: if(pos == 0) {
1.137 moko 592: r.write(*new VString(*new String(hash.first_key(), String::L_TAINTED)));
1.121 misha 593: } else if((size_t)pos == count-1) {
1.137 moko 594: r.write(*new VString(*new String(hash.last_key(), String::L_TAINTED)));
1.123 moko 595: } else
596: #endif
597: {
1.121 misha 598: for(HashStringValue::Iterator i(hash); i; i.next(), pos-- )
599: if(!pos){
1.137 moko 600: r.write(*new VString(*new String(i.key(), String::L_TAINTED)));
1.121 misha 601: break;
602: }
603: }
1.105 misha 604: break;
605: }
1.121 misha 606: case AtResultTypeValue:
607: {
1.123 moko 608: #ifdef HASH_ORDER
1.121 misha 609: if(pos == 0) {
1.137 moko 610: r.write(*hash.first_value());
1.121 misha 611: } else if((size_t)pos == count-1) {
1.137 moko 612: r.write(*hash.last_value());
1.123 moko 613: } else
614: #endif
615: {
1.121 misha 616: for(HashStringValue::Iterator i(hash); i; i.next(), pos-- )
617: if(!pos){
1.137 moko 618: r.write(*i.value());
1.121 misha 619: break;
620: }
621: }
622: break;
623: }
624: case AtResultTypeHash:
625: {
1.123 moko 626: #ifdef HASH_ORDER
1.121 misha 627: if(pos == 0) {
1.137 moko 628: r.write(SingleElementHash(hash.first_key(), hash.first_value()));
1.121 misha 629: } else if((size_t)pos == count-1) {
1.137 moko 630: r.write(SingleElementHash(hash.last_key(), 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){
1.137 moko 636: r.write(SingleElementHash(i.key(), i.value()));
1.121 misha 637: break;
638: }
639: }
640: break;
641: }
642: }
1.105 misha 643: }
644: }
645:
1.1 paf 646: // constructor
647:
1.57 paf 648: MHash::MHash(): Methoded("hash")
1.39 paf 649: {
1.21 parser 650: // ^hash::create[[copy_from]]
1.57 paf 651: add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1);
1.22 parser 652: // ^hash.add[add_from]
1.57 paf 653: add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1);
1.22 parser 654: // ^hash.sub[sub_from]
655: add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1);
656: // ^a.union[b] = hash
657: add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1);
658: // ^a.intersection[b] = hash
659: add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 1);
660: // ^a.intersects[b] = bool
661: add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1);
1.25 paf 662:
663: // ^a.delete[key]
1.119 misha 664: add_native_method("delete", Method::CT_DYNAMIC, _delete, 0, 1);
1.2 parser 665:
1.82 misha 666: // ^a.contains[key]
667: add_native_method("contains", Method::CT_DYNAMIC, _contains, 1, 1);
668: // backward
669: add_native_method("contain", Method::CT_DYNAMIC, _contains, 1, 1);
1.80 misha 670:
671: // ^hash::sql[query][options hash]
1.33 paf 672: add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2);
1.2 parser 673:
1.68 paf 674: // ^hash._keys[[column name]]
1.124 moko 675: add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 1);
1.16 parser 676:
677: // ^hash._count[]
1.124 moko 678: add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0);
1.26 paf 679:
680: // ^hash.foreach[key;value]{code}[delim]
681: add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1);
1.105 misha 682:
1.122 moko 683: // ^hash.sort[key;value]{string-key-maker}[[asc|desc]]
684: // ^hash.sort[key;value](numeric-key-maker)[[asc|desc]]
685: add_native_method("sort", Method::CT_DYNAMIC, _sort, 2+1, 2+1+1);
686:
1.121 misha 687: // ^hash._at[first|last[;'key'|'value'|'hash']]
688: // ^hash._at([-+]offset)[['key'|'value'|'hash']]
689: add_native_method("_at", Method::CT_DYNAMIC, _at, 1, 2);
1.124 moko 690:
691: #ifdef FEATURE_GET_ELEMENT4CALL
692: // aliases without "_"
693: add_native_method("keys", Method::CT_DYNAMIC, _keys, 0, 1);
694: add_native_method("count", Method::CT_DYNAMIC, _count, 0, 0);
695: add_native_method("at", Method::CT_DYNAMIC, _at, 1, 2);
696: #endif
697:
1.1 paf 698: }
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