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

  • SEARCH
  • Home
  • 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 7023689
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T23:44:34+00:00 2026-05-27T23:44:34+00:00

I don’t understand how Ruby hashes work. I expect these: a = ‘a’ {a

  • 0

I don’t understand how Ruby hashes work.

I expect these:

a = 'a'
{a => 1}[a] # => 1
{a: 1}[:a] # => 1
{2 => 1}[2] # => 1

How does this work?

{'a' => 1}['a'] # => 1

The first string 'a' is not the same object as the second string '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-05-27T23:44:35+00:00Added an answer on May 27, 2026 at 11:44 pm
    some_hash[k] = v
    

    Basically, when you do this, what is stored is not a direct association k => v. Instead of that, k is asked for a hash code, which is then used to map to v.

    Equal values yield equal hash codes. That’s why your last example works the way it does.

    A couple of examples:

    1.9.3p0 :001 > s = 'string'
     => "string" 
    1.9.3p0 :002 > 'string'.hash 
     => -895223107629439507 
    1.9.3p0 :003 > 'string'.hash == s.hash
     => true 
    1.9.3p0 :004 > 2.hash
     => 2271355725836199018 
    1.9.3p0 :005 > nil.hash
     => 2199521878082658865
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I don't understand why this code doesn't work: function Messages(type,text) { console.log(In function Message);
Don't know a whole lot about streams. Why does the first version work using
Don't these two mean the same thing, first get the value and then increment?
Don't want to sort the entries. using this does not preserve the order as
Don't dismiss this as a newbie question! It's not, I'm not, I've tried everything,
I don't understand where the extra bits are coming from in this article about
I don’t think I’ve grokked currying yet. I understand what it does, and how
I don't know why this double json response are not successful: [{first_content:content,...}][{second_content:content,...}] So i
Don't understand, if Data.Map is and [] is. I found this out while wondering
Don't understand why #include <Header.h> is not compiling while #include Header.h is compiling with

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.