|
|
| version 1.52, 2002/12/09 11:07:39 | version 1.142, 2017/05/17 14:22:11 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: @b hash parser class. | Parser: @b hash parser class. |
| Copyright (c) 2001, 2002 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001-2017 Art. Lebedev Studio (http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) |
| */ | */ |
| static const char* IDENT_HASH_C="$Date$"; | |
| #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_vvoid.h" | #include "pa_vvoid.h" |
| #include "pa_sql_connection.h" | #include "pa_sql_connection.h" |
| Line 16 static const char* IDENT_HASH_C="$Date$" | Line 17 static const char* IDENT_HASH_C="$Date$" |
| #include "pa_vbool.h" | #include "pa_vbool.h" |
| #include "pa_vmethod_frame.h" | #include "pa_vmethod_frame.h" |
| volatile const char * IDENT_HASH_C="$Id$"; | |
| // 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 { |
| const String& statement_string; const char* statement_cstr; | |
| bool distinct; | |
| HashStringValue& rows_hash; | |
| Value* row_value; | |
| int column_index; | |
| ArrayString& columns; | |
| bool one_bool_column; | |
| static VBool only_one_column_value; | |
| Table2hash_value_type value_type; | |
| int columns_count; | |
| public: | public: |
| Hash_sql_event_handlers(Pool& apool, const String& amethod_name, | Table* empty; |
| const String& astatement_string, const char *astatement_cstr, | public: |
| Hash_sql_event_handlers( | |
| const String& astatement_string, | |
| const char* astatement_cstr, | |
| bool adistinct, | bool adistinct, |
| Hash& arows_hash): | HashStringValue& arows_hash, |
| pool(apool), | Table2hash_value_type avalue_type) |
| method_name(amethod_name), | : |
| statement_string(astatement_string), | statement_string(astatement_string), |
| statement_cstr(astatement_cstr), | statement_cstr(astatement_cstr), |
| distinct(adistinct), | distinct(adistinct), |
| rows_hash(arows_hash), | rows_hash(arows_hash), |
| columns(pool), | row_value(0), |
| row_index(0) { | column_index(0), |
| columns(*new ArrayString), | |
| one_bool_column(false), | |
| value_type(avalue_type), | |
| empty(0) { | |
| } | |
| bool add_column(SQL_Error& error, const char* str, size_t ) { | |
| try { | |
| 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; | |
| } | |
| } | } |
| void add_column(void *ptr, size_t size) { | |
| String *column=new(pool) String(pool); | bool before_rows(SQL_Error& error) { |
| column->APPEND_TAINTED( | if(columns.count()<1) { |
| (const char *)ptr, size, | error=SQL_Error(PARSER_RUNTIME, "no columns"); |
| statement_cstr, 0); | return true; |
| columns+=column; | } |
| } | switch(value_type){ |
| void before_rows() { | case C_STRING: { |
| if(columns.size()<=1) | if(columns.count()>2){ |
| throw SQL_Exception("parser.runtime", | error=SQL_Error(PARSER_RUNTIME, "only 2 columns allowed for $.type[string]."); |
| &method_name, | return true; |
| "column count must be more than 1 to create a hash"); | } |
| } | |
| case C_TABLE: { | |
| // create empty table which we'll copy later | |
| empty=new Table(&columns); | |
| columns_count=columns.count(); | |
| } | |
| case C_HASH: { | |
| one_bool_column=columns.count()==1; | |
| } | |
| } | |
| return false; | |
| } | } |
| void add_row() { | |
| 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++); | bool duplicate=false; |
| if(column_index==0) { | if(one_bool_column) { |
| VHash *row_vhash=new(pool) VHash(pool); | duplicate=rows_hash.put_dont_replace(cell, &only_one_column_value); // put. existed? |
| row_hash=row_vhash->get_hash(0); | } else if(column_index==0) { |
| if(rows_hash.put_dont_replace(*cell, row_vhash)) // put. existed? | switch(value_type){ |
| if(!distinct) | case C_HASH: { |
| throw SQL_Exception("parser.runtime", | VHash* row_vhash=new VHash; |
| cell, | row_value=row_vhash; |
| "duplicate key"); | duplicate=rows_hash.put_dont_replace(cell, row_vhash); // put. existed? |
| } else | break; |
| row_hash->put(*columns.get_string(column_index), new(pool) VString(*cell)); | } |
| column_index++; | case C_STRING: { |
| } | VString* row_vstring=new VString(); |
| row_value=row_vstring; | |
| private: | duplicate=rows_hash.put_dont_replace(cell, row_vstring); // put. existed? |
| Pool& pool; | break; |
| const String& method_name; | } |
| const String& statement_string; const char *statement_cstr; | case C_TABLE: { |
| bool distinct; | VTable* vtable=(VTable*)rows_hash.get(cell); |
| Hash& rows_hash; | Table* table; |
| Hash *row_hash; | |
| int column_index; | if(vtable) { // table with this key exist? |
| Array columns; | if(!distinct) { |
| int row_index; | duplicate=true; |
| break; | |
| } | |
| table=vtable->get_table(); | |
| } else { | |
| // no? creating table of same structure as source | |
| Table::Action_options table_options(0, 0); | |
| table=new Table(*empty, table_options/*no rows, just structure*/); | |
| vtable=new VTable(table); | |
| rows_hash.put(cell, vtable); // put | |
| } | |
| ArrayString* row=new ArrayString(columns_count); | |
| row_value=(Value*)row; | |
| *row+=&cell; | |
| *table+=row; | |
| break; | |
| } | |
| } | |
| } else { | |
| switch(value_type) { | |
| case C_HASH: { | |
| row_value->get_hash()->put(*columns[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(PARSER_RUNTIME, "duplicate key"); | |
| return true; | |
| } | |
| column_index++; | |
| return false; | |
| } catch(...) { | |
| error=SQL_Error("exception occurred in Hash_sql_event_handlers::add_row_cell"); | |
| return true; | |
| } | |
| } | |
| }; | }; |
| VBool Hash_sql_event_handlers::only_one_column_value(true); | |
| #endif | #endif |
| static void copy_all_overwrite_to(const Hash::Key& key, Hash::Val *value, void *info) { | static void _create_or_add(Request& r, MethodParams& params) { |
| Hash& dest=*static_cast<Hash *>(info); | if(params.count()) { |
| dest.put(key, value); | Value& vsrc=params.as_no_junction(0, PARAM_MUST_BE_HASH); |
| } | VHashBase& self=GET_SELF(r, VHashBase); |
| static void _create_or_add(Request& r, const String& method_name, MethodParams *params) { | HashStringValue* self_hash=&(self.hash()); |
| Pool& pool=r.pool(); | HashStringValue* src_hash; |
| if(params->size()) { | if(VHashBase* src=static_cast<VHashBase*>(vsrc.as(VHASH_TYPE))) { |
| Value& vb=params->as_no_junction(0, "param must be hash"); | src_hash=&(src->hash()); |
| if(Hash *b=vb.get_hash(&method_name)) | |
| b->for_each(copy_all_overwrite_to, &static_cast<VHash *>(r.get_self())->hash(&method_name)); | if(src_hash==self_hash) // same: doing nothing |
| return; | |
| if(Value* vdefault=src->get_default()) | |
| self.set_default(vdefault); | |
| } else { | |
| src_hash=vsrc.get_hash(); | |
| } | |
| if(src_hash) | |
| for(HashStringValue::Iterator i(*src_hash); i; i.next()) | |
| self_hash->put(i.key(), i.value()); | |
| } | } |
| } | } |
| static void remove_key_from(const Hash::Key& key, Hash::Val *value, void *info) { | static void _sub(Request& r, MethodParams& params) { |
| Hash& dest=*static_cast<Hash *>(info); | if(HashStringValue* src=params.as_hash(0, "param")) { |
| dest.remove(key); | HashStringValue* self=&(GET_SELF(r, VHashBase).hash()); |
| } | if(src==self) { // same: clearing |
| static void _sub(Request& r, const String& method_name, MethodParams *params) { | self->clear(); |
| Pool& pool=r.pool(); | return; |
| } | |
| Value& vb=params->as_no_junction(0, "param must be hash"); | for(HashStringValue::Iterator i(*src); i; i.next()) |
| if(Hash *b=vb.get_hash(&method_name)) | self->remove(i.key()); |
| b->for_each(remove_key_from, &static_cast<VHash *>(r.get_self())->hash(&method_name)); | } |
| } | } |
| static void copy_all_dontoverwrite_to(const Hash::Key& key, Hash::Val *value, void *info) { | static void copy_all_dontoverwrite_to(HashStringValue::key_type key, HashStringValue::value_type value, HashStringValue* dest) { |
| Hash& dest=*static_cast<Hash *>(info); | dest->put_dont_replace(key, value); |
| dest.put_dont_replace(key, value); | |
| } | } |
| static void _union(Request& r, const String& method_name, MethodParams *params) { | static void _union(Request& r, MethodParams& params) { |
| Pool& pool=r.pool(); | |
| // dest = copy of self | // dest = copy of self |
| Hash& dest=*new(pool) Hash(static_cast<VHash *>(r.get_self())->hash(&method_name)); | Value& result=*new VHash(GET_SELF(r, VHashBase).hash()); |
| // dest += b | // dest += b |
| Value& vb=params->as_no_junction(0, "param must be hash"); | if(HashStringValue* src=params.as_hash(0, "param")) |
| if(Hash *b=vb.get_hash(&method_name)) | src->for_each<HashStringValue*>(copy_all_dontoverwrite_to, result.get_hash()); |
| b->for_each(copy_all_dontoverwrite_to, &dest); | |
| // return result | // return result |
| Value& result=*new(pool) VHash(pool, dest); | r.write(result); |
| r.write_no_lang(result); | |
| } | } |
| #ifndef DOXYGEN | #ifndef DOXYGEN |
| struct Copy_intersection_to_info { | struct Copy_intersection_to_info { |
| Hash *b; | HashStringValue* b; |
| Hash *dest; | HashStringValue* dest; |
| }; | }; |
| #endif | #endif |
| static void copy_intersection_to(HashStringValue::key_type key, HashStringValue::value_type value, Copy_intersection_to_info *info) { | |
| static void copy_intersection_to(const Hash::Key& key, Hash::Val *value, void *info) { | if(info->b->get(key)) |
| Copy_intersection_to_info& i=*static_cast<Copy_intersection_to_info *>(info); | info->dest->put_dont_replace(key, value); |
| if(i.b->get(key)) | |
| i.dest->put_dont_replace(key, value); | |
| } | } |
| static void _intersection(Request& r, const String& method_name, MethodParams *params) { | static void _intersection(Request& r, MethodParams& params) { |
| Pool& pool=r.pool(); | Value& result=*new VHash; |
| // dest = copy of self | |
| Hash& dest=*new(pool) Hash(pool); | |
| // dest += b | // dest += b |
| Value& vb=params->as_no_junction(0, "param must be hash"); | if(HashStringValue* b=params.as_hash(0, "param")) { |
| if(Hash *b=vb.get_hash(&method_name)) { | Copy_intersection_to_info info={b, result.get_hash()}; |
| Copy_intersection_to_info info={ | GET_SELF(r, VHashBase).hash().for_each<Copy_intersection_to_info*>(copy_intersection_to, &info); |
| b, | |
| &dest | |
| }; | |
| static_cast<VHash *>(r.get_self())->hash(&method_name).for_each(copy_intersection_to, &info); | |
| } | } |
| // return result | // return result |
| r.write_no_lang(*new(pool) VHash(pool, dest)); | r.write(result); |
| } | } |
| static void *intersects(const Hash::Key& key, Hash::Val *value, void *info) { | static bool intersects( HashStringValue::key_type key, HashStringValue::value_type /*value*/, HashStringValue* b) { |
| return static_cast<Hash *>(info)->get(key); | return b->get(key)!=0; |
| } | } |
| static void _intersects(Request& r, const String& method_name, MethodParams *params) { | static void _intersects(Request& r, MethodParams& params) { |
| Pool& pool=r.pool(); | bool result=false; |
| bool yes=false; | |
| // dest = copy of self | if(HashStringValue* b=params.as_hash(0, "param")) { |
| Hash& dest=*new(pool) Hash(pool); | HashStringValue* self=&(GET_SELF(r, VHashBase).hash()); |
| // dest += b | if(b==self) { |
| Value& vb=params->as_no_junction(0, "param must be hash"); | r.write(VBool::get(true)); |
| if(Hash *b=vb.get_hash(&method_name)) | return; |
| yes=static_cast<VHash *>(r.get_self())->hash(&method_name).first_that(intersects, b)!=0; | } |
| result=self->first_that<HashStringValue*>(intersects, b)!=0; | |
| } | |
| // return result | // return result |
| r.write_no_lang(*new(pool) VBool(pool, yes)); | r.write(VBool::get(result)); |
| } | } |
| static void _sql(Request& r, const String& method_name, MethodParams *params) { | extern String sql_bind_name; |
| Pool& pool=r.pool(); | extern String sql_limit_name; |
| extern String sql_offset_name; | |
| extern String sql_default_name; | |
| extern String sql_distinct_name; | |
| extern String sql_value_type_name; | |
| 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); | |
| Value& statement=params->as_junction(0, "statement must be code"); | static void _sql(Request& r, MethodParams& params) { |
| Value& statement=params.as_junction(0, "statement must be code"); | |
| ulong limit=0; | HashStringValue* bind=0; |
| ulong limit=SQL_NO_LIMIT; | |
| ulong offset=0; | ulong offset=0; |
| bool distinct=false; | bool distinct=false; |
| if(params->size()>1) { | Table2hash_value_type value_type=C_HASH; |
| Value& voptions=params->as_no_junction(1, "options must be hash, not code"); | if(params.count()>1) |
| if(!voptions.is_string()) | if(HashStringValue* options=params.as_hash(1, "sql options")) { |
| if(Hash *options=voptions.get_hash(&method_name)) { | int valid_options=0; |
| int valid_options=0; | if(Value* vbind=options->get(sql_bind_name)) { |
| if(Value *vlimit=(Value *)options->get(*sql_limit_name)) { | valid_options++; |
| valid_options++; | bind=vbind->get_hash(); |
| limit=(ulong)r.process_to_value(*vlimit).as_double(); | } |
| } | if(Value* vlimit=options->get(sql_limit_name)) { |
| if(Value *voffset=(Value *)options->get(*sql_offset_name)) { | valid_options++; |
| valid_options++; | limit=(ulong)r.process(*vlimit).as_double(); |
| offset=(ulong)r.process_to_value(*voffset).as_double(); | } |
| } | if(Value* voffset=options->get(sql_offset_name)) { |
| if(Value *vdistinct=(Value *)options->get(*sql_distinct_name)) { | valid_options++; |
| valid_options++; | offset=(ulong)r.process(*voffset).as_double(); |
| distinct=r.process_to_value(*vdistinct).as_bool(); | } |
| } | if(Value* vdistinct=options->get(sql_distinct_name)) { |
| if(valid_options!=options->size()) | valid_options++; |
| throw Exception("parser.runtime", | distinct=r.process(*vdistinct).as_bool(); |
| &method_name, | } |
| "called with invalid option"); | if(Value* vvalue_type=options->get(sql_value_type_name)) { |
| } else | valid_options++; |
| throw Exception("parser.runtime", | value_type=get_value_type(r.process(*vvalue_type)); |
| &method_name, | } |
| "options must be hash"); | if(valid_options!=options->count()) |
| } | throw Exception(PARSER_RUNTIME, 0, CALLED_WITH_INVALID_OPTION); |
| } | |
| SQL_Driver::Placeholder* placeholders=0; | |
| uint placeholders_count=0; | |
| if(bind) | |
| placeholders_count=marshal_binds(*bind, placeholders); | |
| Temp_lang temp_lang(r, String::UL_SQL); | |
| const String& statement_string=r.process_to_string(statement); | const String& statement_string=r.process_to_string(statement); |
| const char *statement_cstr= | const char* statement_cstr=statement_string.untaint_cstr(String::L_SQL, r.connection()); |
| statement_string.cstr(String::UL_UNSPECIFIED, r.connection(&method_name)); | |
| Hash& hash=static_cast<VHash *>(r.get_self())->hash(&method_name); | HashStringValue& hash=GET_SELF(r, VHashBase).hash(); |
| hash.clear(); | hash.clear(); |
| Hash_sql_event_handlers handlers(pool, method_name, | Hash_sql_event_handlers handlers( |
| statement_string, statement_cstr, | statement_string, statement_cstr, |
| distinct, | distinct, |
| hash); | hash, |
| value_type); | |
| r.connection(&method_name)->query( | r.connection()->query( |
| statement_cstr, offset, limit, | statement_cstr, |
| placeholders_count, placeholders, | |
| offset, limit, | |
| handlers, | handlers, |
| statement_string); | statement_string); |
| if(bind) | |
| unmarshal_bind_updates(*bind, placeholders_count, placeholders); | |
| } | |
| 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"); | |
| static void keys_collector(const Hash::Key& key, Hash::Val *value, void *info) { | Table::columns_type columns(new ArrayString(1)); |
| Table& table=*static_cast<Table *>(info); | *columns+=keys_column_name; |
| Pool& pool=table.pool(); | Table* table=new Table(columns); |
| Array& row=*new(pool) Array(pool); | GET_SELF(r, VHashBase).hash().for_each<Table*>(keys_collector, table); |
| row+=&key; | |
| table+=&row; | r.write(*new VTable(table)); |
| } | } |
| static void _keys(Request& r, const String& method_name, MethodParams *) { | |
| Pool& pool=r.pool(); | |
| Array& columns=*new(pool) Array(pool); | static void _count(Request& r, MethodParams&) { |
| columns+=new(pool) String(pool, "key"); | r.write(*new VInt(GET_SELF(r, VHashBase).hash().count())); |
| Table& table=*new(pool) Table(pool, &method_name, &columns); | } |
| static_cast<VHash *>(r.get_self())->hash(&method_name).for_each(keys_collector, &table); | static void _delete(Request& r, MethodParams& params) { |
| 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(); | |
| } | |
| r.write_no_lang(*new(pool) VTable(pool, &table)); | static void _contains(Request& r, MethodParams& params) { |
| 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)); | |
| } | } |
| static void _count(Request& r, const String& method_name, MethodParams *) { | static void _foreach(Request& r, MethodParams& params) { |
| Pool& pool=r.pool(); | 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()); | |
| r.write_no_lang( | Value& sv_processed=r.process(*body_code); |
| *new(pool) VInt(pool, static_cast<VHash *>(r.get_self())->hash(&method_name).size())); | 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; | |
| } | |
| } | |
| } | } |
| static void _delete(Request& r, const String& method_name, MethodParams *params) { | enum AtResultType { |
| Pool& pool=r.pool(); | AtResultTypeValue = 0, |
| AtResultTypeKey = 1, | |
| AtResultTypeHash = 2 | |
| }; | |
| static_cast<VHash *>(r.get_self())->hash(&method_name).remove(params->as_string(0, "key must be string")); | inline 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 | #ifndef DOXYGEN |
| struct Foreach_info { | struct Hash_seq_item { |
| Request *r; | HashStringValue::Pair *hash_pair; |
| const String* key_var_name; | union { |
| const String* value_var_name; | const char *c_str; |
| Value *body_code; | double d; |
| Value *delim_maybe_code; | } value; |
| VString *vkey; | |
| bool need_delim; | |
| }; | }; |
| #endif | #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(PointerFreeGC) 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(); | |
| } | |
| static void one_foreach_cycle(const Hash::Key& akey, Hash::Val *avalue, | // @todo: handle this elsewhere |
| void *info) { | if(r.charsets.source().NAME()=="KOI8-R" && key_values_are_strings) |
| Foreach_info& i=*static_cast<Foreach_info *>(info); | for(pos=0; pos<count; pos++) |
| if(*seq[pos].value.c_str) | |
| i.vkey->set_string(akey); | seq[pos].value.c_str=Charset::transcode(seq[pos].value.c_str, r.charsets.source(), pa_UTF8_charset).cstr(); |
| Value& ncontext=*i.r->get_method_frame()->caller(); | |
| ncontext.put_element(*i.key_var_name, i.vkey, false); | // sort keys |
| ncontext.put_element(*i.value_var_name, static_cast<Value *>(avalue), false); | qsort(seq, count, sizeof(Hash_seq_item), key_values_are_strings?sort_cmp_string:sort_cmp_double); |
| StringOrValue sv_processed=i.r->process(*i.body_code); | // reorder hash as required in 'seq' |
| const String *s_processed=sv_processed.get_string(); | hash.order_clear(); |
| if(i.delim_maybe_code && s_processed && s_processed->size()) { // delimiter set and we have body | if(reverse) |
| if(i.need_delim) // need delim & iteration produced string? | for(pos=count-1; pos>=0; pos--) |
| i.r->write_pass_lang(i.r->process(*i.delim_maybe_code)); | hash.order_next(seq[pos].hash_pair); |
| i.need_delim=true; | else |
| } | for(pos=0; pos<count; pos++) |
| i.r->write_pass_lang(sv_processed); | hash.order_next(seq[pos].hash_pair); |
| } | |
| static void _foreach(Request& r, const String& method_name, MethodParams *params) { | delete[] seq; |
| Pool& pool=r.pool(); | #endif |
| 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& body_code=params->as_junction(2, "body must be code"); | static void _at(Request& r, MethodParams& params) { |
| Value *delim_maybe_code=params->size()>3?¶ms->get(3):0; | HashStringValue& hash=GET_SELF(r, VHashBase).hash(); |
| size_t count=hash.count(); | |
| Foreach_info info={ | |
| &r, | int pos=0; |
| &key_var_name, &value_var_name, | |
| &body_code, | // misha@ |
| delim_maybe_code, | // 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. | |
| new(pool) VString(pool), | AtResultType result_type=AtResultTypeValue; |
| false | if(params.count() > 1) { |
| }; | const String& stype=params.as_string(1, "type must be string"); |
| VHash& self=*static_cast<VHash *>(r.get_self()); | if(stype == "key") |
| Hash& hash=self.hash(&method_name); | result_type=AtResultTypeKey; |
| VHash_lock lock(self); | else if(stype == "hash") |
| hash.for_each(one_foreach_cycle, &info); | result_type=AtResultTypeHash; |
| else if(stype != "value") | |
| throw Exception(PARSER_RUNTIME, &stype, "type must be 'key', 'value' or 'hash'"); | |
| } | |
| Value& vwhence=params[0]; | |
| if(vwhence.is_string()) { | |
| const String& swhence=*vwhence.get_string(); | |
| if(swhence == "last") | |
| pos=count-1; | |
| else if(swhence != "first") | |
| throw Exception(PARSER_RUNTIME, | |
| &swhence, | |
| "whence must be 'first', 'last' or expression"); | |
| } else { | |
| pos=r.process(vwhence).as_int(); | |
| if(pos < 0) | |
| pos+=count; | |
| } | |
| 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; | |
| } | |
| } | |
| } | |
| } | } |
| // constructor | // constructor |
| MHash::MHash(Pool& apool) : Methoded(apool, "hash") | MHash::MHash(): Methoded("hash") |
| { | { |
| // ^hash::create[[copy_from]] | // ^hash::create[[copy_from]] |
| add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1); | add_native_method("create", Method::CT_DYNAMIC, _create_or_add, 0, 1); |
| Line 348 MHash::MHash(Pool& apool) : Methoded(apo | Line 661 MHash::MHash(Pool& apool) : Methoded(apo |
| add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1); | add_native_method("intersects", Method::CT_DYNAMIC, _intersects, 1, 1); |
| // ^a.delete[key] | // ^a.delete[key] |
| add_native_method("delete", Method::CT_DYNAMIC, _delete, 1, 1); | 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][$.limit(1) $.offset(2)] | // ^hash::sql[query][options hash] |
| add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2); | add_native_method("sql", Method::CT_DYNAMIC, _sql, 1, 2); |
| // ^hash._keys[] | // ^hash._keys[[column name]] |
| add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 0); | add_native_method("_keys", Method::CT_DYNAMIC, _keys, 0, 1); |
| // ^hash._count[] | // ^hash._count[] |
| add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0); | add_native_method("_count", Method::CT_DYNAMIC, _count, 0, 0); |
| // ^hash.foreach[key;value]{code}[delim] | // ^hash.foreach[key;value]{code}[delim] |
| add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1); | add_native_method("foreach", Method::CT_DYNAMIC, _foreach, 2+1, 2+1+1); |
| } | |
| // global variable | |
| Methoded *hash_class; | // ^hash.sort[key;value]{string-key-maker}[[asc|desc]] |
| // ^hash.sort[key;value](numeric-key-maker)[[asc|desc]] | |
| // creator | add_native_method("sort", Method::CT_DYNAMIC, _sort, 2+1, 2+1+1); |
| // ^hash._at[first|last[;'key'|'value'|'hash']] | |
| // ^hash._at([-+]offset)[['key'|'value'|'hash']] | |
| add_native_method("_at", Method::CT_DYNAMIC, _at, 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_class=new(pool) MHash(pool); | |
| } | } |