Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8236963
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 7, 20262026-06-07T19:18:35+00:00 2026-06-07T19:18:35+00:00

I have a hash of values from a database query: a1 = {:a =>

  • 0

I have a hash of values from a database query:

a1 = {:a => 1, :b => 2 }

And another hash of values for a third party library:

b1 = {'a' => 1, 'b' => 2 }

I’d like to see if a1 has 'a' which I like to consider the equivalent of :a. How is that done? So I can check if there are any missing keys from b1 in a1.

What I want is to treat the key 'a' as the same as the key :a.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-07T19:18:37+00:00Added an answer on June 7, 2026 at 7:18 pm

    This will give you an array of (string) keys from b1 that are not present (as symbol keys) in a1:

    b1.keys - a1.keys.map { |key| key.to_s }
    

    You can then do:

    missing = b1.keys - a1.keys.map { |key| key.to_s }
    missing.each do |key|
        a1[key.to_sym] = b1[key]
    end
    

    That’s assuming b1 always has only string keys, you’re only worried about a1 missing key/value pairs from b1, and your goal is to insert the missing pairs into a1 (with symbol keys), all of which sound true from your question. If any of those assumptions are false, this should at least get you started.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a database where users are represented by hashes. Each user (hash) has
I have a Rails model called Person which has database table columns for first_name
I have method which updating data in database from CSV. csv_text = File.read(#{Rails.root}/db/seed/books.csv) csv
I have written a simple Java class to generate the hash values of the
I have a Hash Map (many-to-one relationship between texts and boolean values): name flag
I have @hash that looks like this: [1, {:clid=>1, :nvz=>4, :tip=>IP, :name=>Mark, :record=>some text}]
I have a hash in which I store the products a customer buys (
Let's say I have a hash in Ruby like this: d = {1 =>
I have a script which captures tweets and puts them into a database. I
I have a large number of values ranging from 0 - 5463458053. To each

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.