hash - Diff of hashes with a correction factor in Ruby for dynamic hashes -

-

similar question how create diff of hashes correction factor? want compare hashes inside array hashes can dynamic.

h_array = [    {:roll => "1", :name => "saroj", :class => "mscit"},     {:name => "saroj", :class => "mscit", :roll => "12", :attendance => "p"},     {:class => "mscit", :roll => "12", :name => "saroj", :attendance => "f", :remarks => "something"} ]  get_diff(h_array, correct_factor = 2) # should return # matched :: {:class=>"mscit", :roll=>"12", :name=>"saroj"}, # unmatched :: {:attendance=>"f", :remarks=>"something"}  get_diff(h_array, correct_factor = 3) # should return  # matched :: {:name=>"saroj"}, # unmatched :: {:class=>"mscit", :roll=>"12", :attendance=>"f", :remarks=>"something"}

the correct_factor number determines how many keys/values should match consider matched. want diff function returns both matched , unmatched pair.

def get_diff(input,correct_factor)     input_hash_merged = hash.new     solution_hash = hash.new     input.select{ |x| input_hash_merged.merge!(x) }     input_hash_merged.each |k,v|         arr = array.new         freq = hash.new(0)         input.select{ |x| arr << x[k] unless x[k].nil? }         arr.select{ |x| freq[x] += 1 }         max_element = arr.sort_by { |x| freq[x] }.last         max_count = freq.values.sort.last         solution_hash[k] = max_element unless max_count < correct_factor     end     unmatched_hash = input_hash_merged.reject{|k,v| !solution_hash[k].nil?}      p solution_hash     p unmatched_hash end

Comments

Post a Comment

Popular posts from this blog

Javascript line number mapping -

-
magically formatted comments change reported line number of javascript errors in browsers; this: //@line n "f" n line number , f file name. unfortunately, //@line appears ungoogleable. know there documentation on feature, , browsers support it? (i found references here , here .) from can find available in mozilla based browsers. it using js_setoptions command can turn these options on or off depending on values passed. https://developer.mozilla.org/en/js_setoptions
Read more

c# - Is it possible to remove an existing registration from Autofac container builder? -

-
something along lines: builder.registertype<mytype>().as<itype>(); builder.registertype<mytype2>().as<itype>(); builder.deregistertype<mytype>().as<itype>() var container = builder.build(); var types = container.resolve<ienumerable<itype>>(); assert.istrue(types.count == 1); assert.istrue(types[0].gettype == typeof(mytype2)); scenario: go through bunch of assemblies , go register types want make sure have 1 implementation of given type. need before create container. track on own nice if autofac me bit. this cannot done directly using containerbuilder , unless start on new one. mind you, having first built container should able construct new container filtering away unwanted types , reusing registrations first container. this: ... var container = builder.build(); builder = new containerbuilder(); var components = container.componentregistry.registrations .where(cr => cr.activator.limittype != typ...
Read more

php - Mysql PK and FK char(36) vs int(10) -

-
i have read mysql can handle indexes , searches better if tables keys integers rather char(36) uuid's. is worth converting int(10)? note: use 1 server , have have plans use multiple databases concurrently therefore removing 1 of big reasons using uuid. our tables innodb if makes difference. thanks in advance. usually rdbms can handle integer keys pk more efficient, other datatypes. reason how build index column, yes: long dont require string (or other typed) keys, should use integers. however: char(36) , int(10) far away being equal, because int(10) much smaller, char(36). dont know, if require many different keys, should keep in mind. update, complete last paragraph: int(10) 32-bit, char(36) 36 - ^byte^ (= 288-bit). not mean, int consumes less space, means, char(36) has 4 times more different keys.
Read more