|
|
| version 1.18, 2001/09/21 15:35:45 | version 1.169, 2024/12/23 18:30:55 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: @b hash parser class. | Parser: @b hash parser class. |
| Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001-2024 Art. Lebedev Studio (http://www.artlebedev.com) |
| Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru> | |
| Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) | |
| */ | */ |
| static const char *RCSId="$Id$"; | |
| #include "classes.h" | #include "classes.h" |
| #include "pa_vmethod_frame.h" | |
| #include "pa_request.h" | #include "pa_request.h" |
| #include "pa_charsets.h" | |
| #include "pa_vhash.h" | #include "pa_vhash.h" |
| #include "pa_varray.h" | |
| #include "pa_vvoid.h" | #include "pa_vvoid.h" |
| #include "pa_sql_connection.h" | #include "pa_sql_connection.h" |
| #include "pa_vtable.h" | #include "pa_vtable.h" |
| #include "pa_vbool.h" | |
| #include "pa_vmethod_frame.h" | |
| // defines | volatile const char * IDENT_HASH_C="$Id$"; |
| #define HASH_CLASS_NAME "hash" | |
| // class | // class |
| class MHash : public Methoded { | class MHash: public Methoded { |
| public: // VStateless_class | public: // VStateless_class |
| Value *create_new_value(Pool& pool) { return new(pool) VHash(pool); } | Value* create_new_value(Pool&) { return new VHash(); } |
| public: | public: |
| MHash(Pool& pool); | MHash(); |
| public: // Methoded | |
| bool used_directly() { return true; } | |
| }; | }; |
| // global variable | |
| DECLARE_CLASS_VAR(hash, new MHash); | |
| // methods | // methods |
| #ifndef DOXYGEN | #ifndef DOXYGEN |
| class Hash_sql_event_handlers : public SQL_Driver_query_event_handlers { | class Hash_sql_event_handlers: public SQL_Driver_query_event_handlers { |
| bool distinct; | |
| HashStringValue& result; | |
| Value* row_value; | |
| int column_index; | |
| ArrayString* columns; | |
| bool one_bool_column; | |
| Table2hash_value_type value_type; | |
| int columns_count; | |
| public: | |
| Table* empty; | |
| public: | public: |
| Hash_sql_event_handlers(Pool& apool, const String& amethod_name, | Hash_sql_event_handlers(bool adistinct, HashStringValue& aresult, Table2hash_value_type avalue_type): |
| const String& astatement_string, const char *astatement_cstr, | distinct(adistinct), |
| Hash& arows_hash) : | result(aresult), |
| pool(apool), | row_value(0), |
| method_name(amethod_name), | column_index(0), |
| statement_string(astatement_string), | columns(new ArrayString), |
| statement_cstr(astatement_cstr), | one_bool_column(false), |
| rows_hash(arows_hash), | value_type(avalue_type), |
| columns(pool), | empty(0) { |
| row_index(0) { | |
| } | |
| void add_column(void *ptr, size_t size) { | |
| String *column=new(pool) String(pool); | |
| column->APPEND_TAINTED( | |
| (const char *)ptr, size, | |
| statement_cstr, 0); | |
| columns+=column; | |
| } | |
| void before_rows() { | |
| if(columns.size()<=1) | |
| PTHROW(0, 0, | |
| &method_name, | |
| "column count must be more than 1 to create a hash"); | |
| } | } |
| void add_row() { | |
| bool add_column(SQL_Error& error, const char* str, size_t ) { | |
| try { | |
| if(columns_count){ | |
| // another query in multi_statements mode | |
| columns=new ArrayString; | |
| columns_count=0; | |
| } | |
| *columns+=new String(str, String::L_TAINTED /* no length as 0x00 can be inside */); | |
| return false; | |
| } catch(...) { | |
| error=SQL_Error("exception occurred in Hash_sql_event_handlers::add_column"); | |
| return true; | |
| } | |
| } | |
| bool before_rows(SQL_Error& error) { | |
| columns_count=columns->count(); | |
| if(columns_count<1) { | |
| error=SQL_Error("no columns"); | |
| return true; | |
| } | |
| if(columns_count==1) { | |
| one_bool_column=true; | |
| } else { | |
| switch(value_type){ | |
| case C_STRING: { | |
| if(columns_count>2){ | |
| error=SQL_Error("only 2 columns allowed for $.type[string]"); | |
| return true; | |
| } | |
| break; | |
| } | |
| case C_TABLE: { | |
| // create empty table which we'll copy later | |
| empty=new Table(columns); | |
| break; | |
| } | |
| } | |
| } | |
| return false; | |
| } | |
| bool add_row(SQL_Error& /*error*/) { | |
| column_index=0; | column_index=0; |
| return false; | |
| } | } |
| void add_row_cell(void *ptr, size_t size) { | |
| String *cell=new(pool) String(pool); | bool add_row_cell(SQL_Error& error, const char *str, size_t ) { |
| if(size) | try { |
| cell->APPEND_TAINTED( | const String& cell=str ? *new String(str, String::L_TAINTED /* no length as 0x00 can be inside */) : String::Empty; |
| (const char *)ptr, size, | |
| statement_cstr, row_index++); | if(column_index==columns_count){ |
| if(column_index==0) { | // should never happen, buggy driver case |
| VHash *row_vhash=new(pool) VHash(pool); | error=SQL_Error("columns index exceed the columns count"); |
| row_hash=row_vhash->get_hash(); | return true; |
| rows_hash.put(*cell, row_vhash); | } |
| } else | |
| row_hash->put(*columns.get_string(column_index), new(pool) VString(*cell)); | bool duplicate=false; |
| column_index++; | if(one_bool_column) { |
| duplicate=result.put_dont_replace(cell, &VBool::get(true)); // put. existed? | |
| } else if(column_index==0) { | |
| switch(value_type){ | |
| case C_HASH: { | |
| VHash* row_vhash=new VHash; | |
| row_value=row_vhash; | |
| duplicate=result.put_dont_replace(cell, row_vhash); // put. existed? | |
| break; | |
| } | |
| case C_STRING: { | |
| VString* row_vstring=new VString(); | |
| row_value=row_vstring; | |
| duplicate=result.put_dont_replace(cell, row_vstring); // put. existed? | |
| break; | |
| } | |
| case C_TABLE: { | |
| VTable* vtable=(VTable*)result.get(cell); | |
| if(vtable) { // table with this key exist? | |
| if(!distinct) { | |
| duplicate=true; | |
| break; | |
| } | |
| } else { | |
| // no? creating table of same structure as source | |
| Table::Action_options table_options(0, 0); | |
| vtable=new VTable(new Table(*empty, table_options/*no rows, just structure*/)); | |
| result.put(cell, vtable); // put | |
| } | |
| ArrayString* row=new ArrayString(columns_count); | |
| row_value=(Value*)row; | |
| *row+=&cell; | |
| *vtable->get_table()+=row; | |
| break; | |
| } | |
| } | |
| } else { | |
| switch(value_type) { | |
| case C_HASH: { | |
| row_value->get_hash()->put(*columns->get(column_index), new VString(cell)); | |
| break; | |
| } | |
| case C_STRING: { | |
| VString* row_string=(VString*)row_value; | |
| row_string->set_string(cell); | |
| break; | |
| } | |
| case C_TABLE: { | |
| ArrayString* row=(ArrayString*)row_value; | |
| *row+=&cell; | |
| break; | |
| } | |
| } | |
| } | |
| if(duplicate & !distinct) { | |
| error=SQL_Error("duplicate key"); | |
| return true; | |
| } | |
| column_index++; | |
| return false; | |
| } catch(...) { | |
| error=SQL_Error("exception occurred in Hash_sql_event_handlers::add_row_cell"); | |
| return true; | |
| } | |
| } | } |
| private: | |
| Pool& pool; | |
| const String& method_name; | |
| const String& statement_string; const char *statement_cstr; | |
| Hash& rows_hash; | |
| Hash *row_hash; | |
| int column_index; | |
| Array columns; | |
| int row_index; | |
| }; | }; |
| #endif | #endif |
| static void _sql(Request& r, const String& method_name, MethodParams *params) { | static void _create_or_add(Request& r, MethodParams& params) { |
| Pool& pool=r.pool(); | if(params.count()) { |
| Value& vsrc=params.as_no_junction(0, PARAM_MUST_BE_HASH); | |
| VHashBase& self=GET_SELF(r, VHashBase); | |
| HashStringValue* self_hash=&(self.hash()); | |
| HashStringValue* src_hash; | |
| if(VArray* src=dynamic_cast<VArray*>(&vsrc)) { | |
| for(ArrayValue::Iterator i(src->array()); i; i.next()){ | |
| if(i.value()) | |
| self_hash->put(i.key(), i.value()); | |
| } | |
| return; | |
| } else if(VHashBase* src=dynamic_cast<VHashBase*>(&vsrc)) { | |
| src_hash=&(src->hash()); | |
| if(src_hash==self_hash) // same: doing nothing | |
| return; | |
| if(Value* vdefault=src->get_default()) | |
| self.set_default(vdefault); | |
| } else { | |
| // allows $h[^hash::create[non-blank string]], thus as_hash("param") is more correct, but is not backward compatible | |
| src_hash=vsrc.get_hash(); | |
| } | |
| if(src_hash) | |
| for(HashStringValue::Iterator i(*src_hash); i; i.next()) | |
| self_hash->put(i.key(), i.value()); | |
| } | |
| } | |
| if(!r.connection) | static void _sub(Request& r, MethodParams& params) { |
| PTHROW(0, 0, | if(HashStringValue* src=params.as_hash(0, "param")) { |
| &method_name, | HashStringValue* self=&(GET_SELF(r, VHashBase).hash()); |
| "without connect"); | if(src==self) { // same: clearing |
| self->clear(); | |
| Value& statement=params->as_junction(0, "statement must be code"); | return; |
| } | |
| ulong limit=0; | for(HashStringValue::Iterator i(*src); i; i.next()) |
| if(params->size()>1) { | self->remove(i.key()); |
| Value& limit_code=params->as_junction(1, "limit must be expression"); | |
| limit=(uint)r.process(limit_code).as_double(); | |
| } | } |
| } | |
| static void copy_all_dontoverwrite_to(HashStringValue::key_type key, HashStringValue::value_type value, HashStringValue* dest) { | |
| dest->put_dont_replace(key, value); | |
| } | |
| static void _union(Request& r, MethodParams& params) { | |
| // dest = copy of self | |
| Value& result=*new VHash(GET_SELF(r, VHashBase).hash()); | |
| // dest += b | |
| if(HashStringValue* src=params.as_hash(0, "param")) | |
| src->for_each<HashStringValue*>(copy_all_dontoverwrite_to, result.get_hash()); | |
| // return result | |
| r.write(result); | |
| } | |
| #ifndef DOXYGEN | |
| struct Copy_intersection_to_info { | |
| HashStringValue* b; | |
| HashStringValue* dest; | |
| }; | |
| #endif | |
| static void copy_intersection_by_arg(HashStringValue::key_type key, HashStringValue::value_type, Copy_intersection_to_info *info) { | |
| if(HashStringValue::value_type value=info->b->get(key)) | |
| info->dest->put_dont_replace(key, value); | |
| } | |
| static void copy_intersection_by_self(HashStringValue::key_type key, HashStringValue::value_type value, Copy_intersection_to_info *info) { | |
| if(info->b->get(key)) | |
| info->dest->put_dont_replace(key, value); | |
| } | |
| static void _intersection(Request& r, MethodParams& params) { | |
| Value& result=*new VHash; | |
| bool order_by_arg=false; | |
| if(params.count()>1) | |
| if(HashStringValue* options=params.as_hash(1, "options")) { | |
| int valid_options=0; | |
| if(Value* vorder=options->get("order")) { | |
| const String &sorder=r.process(*vorder).as_string(); | |
| if(sorder == "arg") | |
| order_by_arg=true; | |
| else if(sorder != "self") | |
| throw Exception(PARSER_RUNTIME, &sorder, "'order' must be 'self' or 'arg'"); | |
| valid_options++; | |
| } | |
| if(valid_options!=options->count()) | |
| throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION); | |
| } | |
| if(HashStringValue* b=params.as_hash(0, "param")) { | |
| if(order_by_arg){ | |
| Copy_intersection_to_info info={&GET_SELF(r, VHashBase).hash(), result.get_hash()}; | |
| b->for_each<Copy_intersection_to_info*>(copy_intersection_by_arg, &info); | |
| } else { | |
| Copy_intersection_to_info info={b, result.get_hash()}; | |
| GET_SELF(r, VHashBase).hash().for_each<Copy_intersection_to_info*>(copy_intersection_by_self, &info); | |
| } | |
| } | |
| r.write(result); | |
| } | |
| static bool intersects( HashStringValue::key_type key, HashStringValue::value_type /*value*/, HashStringValue* b) { | |
| return b->get(key)!=0; | |
| } | |
| static void _intersects(Request& r, MethodParams& params) { | |
| bool result=false; | |
| if(HashStringValue* b=params.as_hash(0, "param")) { | |
| HashStringValue* self=&(GET_SELF(r, VHashBase).hash()); | |
| if(b==self) { | |
| r.write(VBool::get(true)); | |
| return; | |
| } | |
| result=self->first_that<HashStringValue*>(intersects, b)!=0; | |
| } | |
| // return result | |
| r.write(VBool::get(result)); | |
| } | |
| extern Table2hash_value_type get_value_type(Value& vvalue_type); | |
| extern int marshal_binds(HashStringValue& hash, SQL_Driver::Placeholder*& placeholders); | |
| extern void unmarshal_bind_updates(HashStringValue& hash, int placeholder_count, SQL_Driver::Placeholder* placeholders); | |
| static void _sql(Request& r, MethodParams& params) { | |
| Value& statement=params.as_junction(0, "statement must be code"); | |
| HashStringValue* bind=0; | |
| ulong limit=SQL_NO_LIMIT; | |
| ulong offset=0; | ulong offset=0; |
| if(params->size()>2) { | bool distinct=false; |
| Value& offset_code=params->as_junction(2, "offset must be expression"); | Table2hash_value_type value_type=C_HASH; |
| offset=(ulong)r.process(offset_code).as_double(); | if(params.count()>1) |
| } | if(HashStringValue* options=params.as_hash(1, "sql options")) { |
| int valid_options=0; | |
| Temp_lang temp_lang(r, String::UL_SQL); | for(HashStringValue::Iterator i(*options); i; i.next() ){ |
| const String& statement_string=r.process(statement).as_string(); | String::Body key=i.key(); |
| const char *statement_cstr= | Value* value=i.value(); |
| statement_string.cstr(String::UL_UNSPECIFIED, r.connection); | if(key == sql_bind_name) { |
| Hash& hash=static_cast<VHash *>(r.self)->hash(); | bind=value->get_hash(); |
| hash.clear(); | valid_options++; |
| Hash_sql_event_handlers handlers(pool, method_name, | } else if(key == sql_limit_name) { |
| statement_string, statement_cstr, hash); | limit=(ulong)r.process(*value).as_double(); |
| bool need_rethrow=false; Exception rethrow_me; | valid_options++; |
| PTRY { | } else if(key == sql_offset_name) { |
| r.connection->query( | offset=(ulong)r.process(*value).as_double(); |
| statement_cstr, offset, limit, | valid_options++; |
| handlers); | } else if (key == sql_distinct_name) { |
| } | distinct=r.process(*value).as_bool(); |
| PCATCH(e) { // query problem | valid_options++; |
| rethrow_me=e; need_rethrow=true; | } else if (key == sql_value_type_name) { |
| } | value_type=get_value_type(r.process(*value)); |
| PEND_CATCH | valid_options++; |
| if(need_rethrow) | } |
| PTHROW(rethrow_me.type(), rethrow_me.code(), | } |
| &statement_string, // setting more specific source [were url] | if(valid_options!=options->count()) |
| rethrow_me.comment()); | throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION); |
| } | } |
| static void keys_collector(const Hash::Key& key, Hash::Val *value, void *info) { | SQL_Driver::Placeholder* placeholders=0; |
| Table& table=*static_cast<Table *>(info); | uint placeholders_count=0; |
| Pool& pool=table.pool(); | if(bind) |
| placeholders_count=marshal_binds(*bind, placeholders); | |
| Array& row=*new(pool) Array(pool); | |
| row+=&key; | const String& statement_string=r.process_to_string(statement); |
| table+=&row; | const char* statement_cstr=statement_string.untaint_cstr(String::L_SQL, r.connection()); |
| } | |
| static void _keys(Request& r, const String& method_name, MethodParams *) { | HashStringValue& hash=GET_SELF(r, VHashBase).hash(); |
| Pool& pool=r.pool(); | hash.clear(); |
| Hash_sql_event_handlers handlers(distinct, hash, value_type); | |
| Array& columns=*new(pool) Array(pool); | |
| columns+=new(pool) String(pool, "key"); | r.connection()->query(statement_cstr, placeholders_count, placeholders, offset, limit, handlers, statement_string); |
| Table& table=*new(pool) Table(pool, &method_name, &columns); | |
| if(bind) | |
| static_cast<VHash *>(r.self)->hash().for_each(keys_collector, &table); | unmarshal_bind_updates(*bind, placeholders_count, placeholders); |
| VTable& result=*new(pool) VTable(pool, &table); | |
| result.set_name(method_name); | |
| r.write_no_lang(result); | |
| } | |
| static void _count(Request& r, const String& method_name, MethodParams *) { | |
| Pool& pool=r.pool(); | |
| Value& value=*new(pool) VInt(pool, static_cast<VHash *>(r.self)->hash().size()); | |
| value.set_name(method_name); | |
| r.write_no_lang(value); | |
| } | } |
| // constructor | static void keys_collector(HashStringValue::key_type key, HashStringValue::value_type, Table *table) { |
| Table::element_type row(new ArrayString(1)); | |
| *row+=new String(key, String::L_TAINTED); | |
| *table+=row; | |
| } | |
| static void _keys(Request& r, MethodParams& params) { | |
| const String* keys_column_name; | |
| if(params.count()>0) | |
| keys_column_name=¶ms.as_string(0, COLUMN_NAME_MUST_BE_STRING); | |
| else | |
| keys_column_name=new String("key"); | |
| Table::columns_type columns(new ArrayString(1)); | |
| *columns+=keys_column_name; | |
| Table* table=new Table(columns); | |
| GET_SELF(r, VHashBase).hash().for_each<Table*>(keys_collector, table); | |
| MHash::MHash(Pool& apool) : Methoded(apool) { | r.write(*new VTable(table)); |
| set_name(*NEW String(pool(), HASH_CLASS_NAME)); | } |
| // ^hash:sql[query][(count[;offset])] | static void _count(Request& r, MethodParams&) { |
| add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 3); | r.write(*new VInt(GET_SELF(r, VHashBase).hash().count())); |
| } | |
| // ^hash._keys[] | static void _delete(Request& r, MethodParams& params) { |
| add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 0); | if(params.count()>0) |
| GET_SELF(r, VHashBase).hash().remove(params.as_string(0, "key must be string")); | |
| else | |
| GET_SELF(r, VHashBase).hash().clear(); | |
| } | |
| // ^hash._count[] | static void _contains(Request& r, MethodParams& params) { |
| add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0); | VHashBase& self=GET_SELF(r, VHashBase); |
| const String& key_name=params.as_string(0, "key must be string"); | |
| bool result=SYMBOLS_EQ(key_name,_DEFAULT_SYMBOL) ? (self.get_default() != 0) : self.hash().contains(key_name); | |
| r.write(VBool::get(result)); | |
| } | } |
| // global variable | static void _foreach(Request& r, MethodParams& params) { |
| InCycle temp(r); | |
| const String* key_var_name=¶ms.as_string(0, "key-var name must be string"); | |
| const String* value_var_name=¶ms.as_string(1, "value-var name must be string"); | |
| Value* body_code=¶ms.as_junction(2, "body must be code"); | |
| Value* delim_maybe_code=params.count()>3?¶ms[3]:0; | |
| Value& caller=*r.get_method_frame()->caller(); | |
| if(key_var_name->is_empty()) key_var_name=0; | |
| if(value_var_name->is_empty()) value_var_name=0; | |
| HashStringValue& hash=GET_SELF(r, VHashBase).hash(); | |
| if(delim_maybe_code){ // delimiter set | |
| bool need_delim=false;; | |
| for(HashStringValue::Iterator i(hash); i; i.next()){ | |
| if(key_var_name){ | |
| VString* vkey=new VString(*new String(i.key(), String::L_TAINTED)); | |
| r.put_element(caller, *key_var_name, vkey); | |
| } | |
| if(value_var_name) | |
| r.put_element(caller, *value_var_name, i.value()); | |
| Value& sv_processed=r.process(*body_code); | |
| TempSkip4Delimiter skip(r); | |
| const String* s_processed=sv_processed.get_string(); | |
| if(s_processed && !s_processed->is_empty()) { // we have body | |
| if(need_delim) // need delim & iteration produced string? | |
| r.write(r.process(*delim_maybe_code)); | |
| else | |
| need_delim=true; | |
| } | |
| r.write(sv_processed); | |
| if(skip.check_break()) | |
| break; | |
| } | |
| } else { | |
| for(HashStringValue::Iterator i(hash); i; i.next()){ | |
| if(key_var_name){ | |
| VString* vkey=new VString(*new String(i.key(), String::L_TAINTED)); | |
| r.put_element(caller, *key_var_name, vkey); | |
| } | |
| if(value_var_name) | |
| r.put_element(caller, *value_var_name, i.value()); | |
| r.process_write(*body_code); | |
| if(r.check_skip_break()) | |
| break; | |
| } | |
| } | |
| } | |
| enum AtResultType { | |
| AtResultTypeValue = 0, | |
| AtResultTypeKey = 1, | |
| AtResultTypeHash = 2 | |
| }; | |
| static Value& SingleElementHash(String::Body akey, Value* avalue) { | |
| Value& result=*new VHash; | |
| result.put_element(*new String(akey, String::L_TAINTED), avalue); | |
| return result; | |
| } | |
| #ifndef DOXYGEN | |
| struct Hash_seq_item : public PA_Allocated { | |
| HashStringValue::Pair *hash_pair; | |
| union { | |
| const char *c_str; | |
| double d; | |
| } value; | |
| }; | |
| #endif | |
| static int sort_cmp_string(const void *a, const void *b) { | |
| return strcmp( | |
| static_cast<const Hash_seq_item *>(a)->value.c_str, | |
| static_cast<const Hash_seq_item *>(b)->value.c_str | |
| ); | |
| } | |
| static int sort_cmp_double(const void *a, const void *b) { | |
| double va=static_cast<const Hash_seq_item *>(a)->value.d; | |
| double vb=static_cast<const Hash_seq_item *>(b)->value.d; | |
| if(va<vb) | |
| return -1; | |
| else if(va>vb) | |
| return +1; | |
| else | |
| return 0; | |
| } | |
| static void _sort(Request& r, MethodParams& params){ | |
| #ifdef HASH_ORDER | |
| const String& key_var_name=params.as_string(0, "key-var name must be string"); | |
| const String& value_var_name=params.as_string(1, "value-var name must be string"); | |
| Value& key_maker=params.as_junction(2, "key-maker must be code"); | |
| bool reverse=params.count()>3 /*..[desc|asc|]*/ && params.as_no_junction(3, "order must not be code").as_string()=="desc"; // default=asc | |
| const String* key_var=key_var_name.is_empty()? 0 : &key_var_name; | |
| const String* value_var=value_var_name.is_empty()? 0 : &value_var_name; | |
| VMethodFrame* context=r.get_method_frame()->caller(); | |
| HashStringValue& hash=GET_SELF(r, VHashBase).hash(); | |
| int count=hash.count(); | |
| Hash_seq_item* seq=new Hash_seq_item[count]; | |
| int pos=0; | |
| bool key_values_are_strings=true; | |
| for(HashStringValue::Iterator i(hash); i; i.next(), pos++ ){ | |
| if(key_var) | |
| r.put_element(*context, *key_var, new VString(*new String(i.key(), String::L_TAINTED))); | |
| if(value_var) | |
| r.put_element(*context, *value_var, i.value()); | |
| Value& value=r.process(key_maker); | |
| if(pos==0) // determining key values type by first one | |
| key_values_are_strings=value.is_string(); | |
| seq[pos].hash_pair=i.pair(); | |
| if(key_values_are_strings) | |
| seq[pos].value.c_str=value.as_string().cstr(); | |
| else | |
| seq[pos].value.d=value.as_expr_result().as_double(); | |
| } | |
| // @todo: handle this elsewhere | |
| if(r.charsets.source().NAME()=="KOI8-R" && key_values_are_strings) | |
| for(pos=0; pos<count; pos++) | |
| if(*seq[pos].value.c_str) | |
| seq[pos].value.c_str=Charset::transcode(seq[pos].value.c_str, r.charsets.source(), pa_UTF8_charset).cstr(); | |
| // sort keys | |
| qsort(seq, count, sizeof(Hash_seq_item), key_values_are_strings?sort_cmp_string:sort_cmp_double); | |
| // reorder hash as required in 'seq' | |
| hash.order_clear(); | |
| if(reverse) | |
| for(pos=count-1; pos>=0; pos--) | |
| hash.order_next(seq[pos].hash_pair); | |
| else | |
| for(pos=0; pos<count; pos++) | |
| hash.order_next(seq[pos].hash_pair); | |
| delete[] seq; | |
| #endif | |
| } | |
| static void _at(Request& r, MethodParams& params) { | |
| HashStringValue& hash=GET_SELF(r, VHashBase).hash(); | |
| size_t count=hash.count(); | |
| // misha@ | |
| // I do not like that type is checked before whence. | |
| // But I do not like the idea to move it after whence (where process can be called) even more. | |
| AtResultType result_type=AtResultTypeValue; | |
| if(params.count() > 1) { | |
| const String& stype=params.as_string(1, "type must be string"); | |
| if(stype == "key") | |
| result_type=AtResultTypeKey; | |
| else if(stype == "hash") | |
| result_type=AtResultTypeHash; | |
| else if(stype != "value") | |
| throw Exception(PARSER_RUNTIME, &stype, "type must be 'key', 'value' or 'hash'"); | |
| } | |
| int pos=params.as_index(0, count, r); | |
| Methoded *hash_base_class; | if(count && pos >= 0 && (size_t)pos < count){ |
| switch(result_type) { | |
| case AtResultTypeKey: | |
| { | |
| #ifdef HASH_ORDER | |
| if(pos == 0) { | |
| r.write(*new VString(*new String(hash.first_key(), String::L_TAINTED))); | |
| } else if((size_t)pos == count-1) { | |
| r.write(*new VString(*new String(hash.last_key(), String::L_TAINTED))); | |
| } else | |
| #endif | |
| { | |
| for(HashStringValue::Iterator i(hash); i; i.next(), pos-- ) | |
| if(!pos){ | |
| r.write(*new VString(*new String(i.key(), String::L_TAINTED))); | |
| break; | |
| } | |
| } | |
| break; | |
| } | |
| case AtResultTypeValue: | |
| { | |
| #ifdef HASH_ORDER | |
| if(pos == 0) { | |
| r.write(*hash.first_value()); | |
| } else if((size_t)pos == count-1) { | |
| r.write(*hash.last_value()); | |
| } else | |
| #endif | |
| { | |
| for(HashStringValue::Iterator i(hash); i; i.next(), pos-- ) | |
| if(!pos){ | |
| r.write(*i.value()); | |
| break; | |
| } | |
| } | |
| break; | |
| } | |
| case AtResultTypeHash: | |
| { | |
| #ifdef HASH_ORDER | |
| if(pos == 0) { | |
| r.write(SingleElementHash(hash.first_key(), hash.first_value())); | |
| } else if((size_t)pos == count-1) { | |
| r.write(SingleElementHash(hash.last_key(), hash.last_value())); | |
| } else | |
| #endif | |
| { | |
| for(HashStringValue::Iterator i(hash); i; i.next(), pos-- ) | |
| if(!pos){ | |
| r.write(SingleElementHash(i.key(), i.value())); | |
| break; | |
| } | |
| } | |
| break; | |
| } | |
| } | |
| } | |
| } | |
| static void _set(Request& r, MethodParams& params) { | |
| HashStringValue& hash=GET_SELF(r, VHashBase).hash(); | |
| size_t count=hash.count(); | |
| int pos=params.as_index(0, count, r); | |
| if(count && pos >= 0 && (size_t)pos < count){ | |
| #ifdef HASH_ORDER | |
| if((size_t)pos == count-1) { | |
| hash.last_pair()->value=&r.process(params[1]); | |
| return; | |
| } else | |
| #endif | |
| { | |
| for(HashStringValue::Iterator i(hash); i; i.next(), pos-- ) | |
| if(!pos){ | |
| i.pair()->value=&r.process(params[1]); | |
| return; | |
| } | |
| } | |
| } | |
| if(count) | |
| throw Exception(PARSER_RUNTIME, 0, "index '%d' is out of range 0..%d", pos, count-1); | |
| throw Exception(PARSER_RUNTIME, 0, "index '%d' is out of range: hash is empty", pos); | |
| } | |
| // creator | extern String table_reverse_name; |
| static void _select(Request& r, MethodParams& params) { | |
| InCycle temp(r); | |
| const String* key_var_name=¶ms.as_string(0, "key-var name must be string"); | |
| const String* value_var_name=¶ms.as_string(1, "value-var name must be string"); | |
| Value& vcondition=params.as_expression(2, "condition must be number, bool or expression"); | |
| if(key_var_name->is_empty()) key_var_name=0; | |
| if(value_var_name->is_empty()) value_var_name=0; | |
| HashStringValue& source_hash=GET_SELF(r, VHashBase).hash(); | |
| Value& caller=*r.get_method_frame()->caller(); | |
| int limit=source_hash.count(); | |
| bool reverse=false; | |
| bool copy_default=false; | |
| if(params.count()>3) | |
| if(HashStringValue* options=params.as_hash(3)) { | |
| int valid_options=0; | |
| if(Value* vlimit=options->get(sql_limit_name)) { | |
| valid_options++; | |
| limit=r.process(*vlimit).as_int(); | |
| } | |
| if(Value* vreverse=options->get(table_reverse_name)) { | |
| valid_options++; | |
| reverse=r.process(*vreverse).as_bool(); | |
| } | |
| if(Value* vcopy_default=options->get(sql_default_name)) { | |
| valid_options++; | |
| copy_default=r.process(*vcopy_default).as_bool(); | |
| } | |
| if(valid_options!=options->count()) | |
| throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION); | |
| } | |
| HashStringValue& result_hash=*new HashStringValue(); | |
| if(limit>0){ | |
| #ifdef HASH_ORDER | |
| if(reverse){ | |
| for(HashStringValue::ReverseIterator i(source_hash); i; i.prev()){ | |
| if(key_var_name) | |
| r.put_element(caller, *key_var_name, new VString(*new String(i.key(), String::L_TAINTED))); | |
| if(value_var_name) | |
| r.put_element(caller, *value_var_name, i.value()); | |
| bool condition=r.process(vcondition).as_bool(); | |
| if(r.check_skip_break()) | |
| break; | |
| if(condition){ | |
| result_hash.put(i.key(), i.value()); | |
| if(!--limit) | |
| break; | |
| } | |
| } | |
| } else { | |
| #else | |
| { | |
| #endif | |
| for(HashStringValue::Iterator i(source_hash); i; i.next() ){ | |
| if(key_var_name) | |
| r.put_element(caller, *key_var_name, new VString(*new String(i.key(), String::L_TAINTED))); | |
| if(value_var_name) | |
| r.put_element(caller, *value_var_name, i.value()); | |
| bool condition=r.process(vcondition).as_bool(); | |
| if(r.check_skip_break()) | |
| break; | |
| if(condition){ | |
| result_hash.put(i.key(), i.value()); | |
| if(!--limit) | |
| break; | |
| } | |
| } | |
| } | |
| } | |
| VHash *result=new VHash(result_hash); | |
| if(copy_default){ | |
| result->set_default(GET_SELF(r, VHashBase).get_default()); | |
| } | |
| r.write(*result); | |
| } | |
| static void _reverse(Request& r, MethodParams&) { | |
| VHashBase& self=GET_SELF(r, VHashBase); | |
| HashStringValue& source_hash=self.hash(); | |
| HashStringValue& result_hash=*new HashStringValue(); | |
| #ifdef HASH_ORDER | |
| for(HashStringValue::ReverseIterator i(source_hash); i; i.prev()) | |
| result_hash.put(i.key(), i.value()); | |
| #else | |
| for(HashStringValue::Iterator i(source_hash); i; i.next() ) | |
| result_hash.put(i.key(), i.value()); | |
| #endif | |
| VHashBase& result=*new VHash(result_hash); | |
| if(Value* vdefault=self.get_default()) | |
| result.set_default(vdefault); | |
| r.write(result); | |
| } | |
| static void _rename(Request& r, MethodParams& params) { | |
| HashStringValue& hash=GET_SELF(r, VHashBase).hash(); | |
| if(params.count()>1){ | |
| const String& key_from=params.as_string(0, "from key must be string"); | |
| const String& key_to=params.as_string(1, "to key must be string"); | |
| hash.rename(key_from, key_to); | |
| } else { | |
| HashStringValue* names=params.as_hash(0,"single parameter"); | |
| for(HashStringValue::Iterator i(*names); i; i.next()) | |
| hash.rename(i.key(), i.value()->as_string()); | |
| } | |
| } | |
| // constructor | |
| MHash::MHash(): Methoded("hash") | |
| { | |
| // ^hash::create[[copy_from]] | |
| add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1); | |
| // ^hash.add[add_from] | |
| add_native_method("add", Method::CT_DYNAMIC, _create_or_add, 1, 1); | |
| // ^hash.sub[sub_from] | |
| add_native_method("sub", Method::CT_DYNAMIC, _sub, 1, 1); | |
| // ^a.union[b] = hash | |
| add_native_method("union", Method::CT_DYNAMIC, _union, 1, 1); | |
| // ^a.intersection[b][options hash] = hash | |
| add_native_method("intersection", Method::CT_DYNAMIC, _intersection, 1, 2); | |
| // ^a.intersects[b] = bool | |
| add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1); | |
| // ^a.delete[key] | |
| add_native_method("delete", Method::CT_DYNAMIC, _delete, 0, 1); | |
| // ^a.contains[key] | |
| add_native_method("contains", Method::CT_DYNAMIC, _contains, 1, 1); | |
| // backward | |
| add_native_method("contain", Method::CT_DYNAMIC, _contains, 1, 1); | |
| // ^hash::sql[query][options hash] | |
| add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2); | |
| // ^hash._keys[[column name]] | |
| add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 1); | |
| // ^hash._count[] | |
| add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0); | |
| // ^hash.foreach[key;value]{code}[delim] | |
| add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1); | |
| // ^hash.sort[key;value]{string-key-maker}[[asc|desc]] | |
| // ^hash.sort[key;value](numeric-key-maker)[[asc|desc]] | |
| add_native_method("sort", Method::CT_DYNAMIC, _sort, 3, 4); | |
| // ^hash.select[key;value](bool-condition)[options hash] | |
| add_native_method("select", Method::CT_DYNAMIC, _select, 3, 4); | |
| // ^hash.reverse[] | |
| add_native_method("reverse", Method::CT_DYNAMIC, _reverse, 0, 0); | |
| // ^hash._at[first|last[;'key'|'value'|'hash']] | |
| // ^hash._at([-+]index)[['key'|'value'|'hash']] | |
| add_native_method("_at", Method::CT_DYNAMIC, _at, 1, 2); | |
| // ^hash.set[first|last;value] | |
| // ^hash.set([-+]index)[value] | |
| add_native_method("set", Method::CT_DYNAMIC, _set, 2, 2); | |
| // ^hash.rename[from;to] | |
| // ^hash.rename[ $.from[to] ... ] | |
| add_native_method("rename", Method::CT_DYNAMIC, _rename, 1, 2); | |
| #ifdef FEATURE_GET_ELEMENT4CALL | |
| // aliases without "_" | |
| add_native_method("keys", Method::CT_DYNAMIC, _keys, 0, 1); | |
| add_native_method("count", Method::CT_DYNAMIC, _count, 0, 0); | |
| add_native_method("at", Method::CT_DYNAMIC, _at, 1, 2); | |
| #endif | |
| Methoded *MHash_create(Pool& pool) { | |
| return hash_base_class=new(pool) MHash(pool); | |
| } | } |