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 6030115
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T04:59:19+00:00 2026-05-23T04:59:19+00:00

Suppose that i have 2 objects, where each one has a particular slot numbered

  • 0

Suppose that i have 2 objects, where each one has a particular slot numbered from 1-5 (unique). Say that object1 has slot = 3 and object2 slot = 5.
What is an effective way to create a hash like :

{ 1 => nil, 2 => nil, 3 => object1, 4 => nil, 5 => object2}

I suppose map could be used, but what’s the best way ?

EDIT : 5 is just an example, please pretend that you do not know the number of slots.

  • 1 1 Answer
  • 1 View
  • 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-23T04:59:20+00:00Added an answer on May 23, 2026 at 4:59 am
    require 'ostruct'
    objects =[OpenStruct.new(:slot => 3), OpenStruct.new(:slot => 5)]
    base = Hash[(1..5).map { |x| [x, nil] }] # also: Hash[(1..5).zip]
    #=> {1=>nil, 2=>nil, 3=>nil, 4=>nil, 5=>nil}
    merged = base.merge(Hash[objects.map(&:slot).zip(objects)])
    #=> {1=>nil, 2=>nil, 3=>#<OpenStruct slot=3>, 4=>nil, 5=>#<OpenStruct slot=5>}
    

    Also:

    slots = Hash[objects.map(&:slot).zip(objects)]
    #=> {3=>#<OpenStruct slot=3>, 5=>#<OpenStruct slot=5>}
    merged = Hash[(1..5).map { |slot| [slot, slots[slot]] }]
    #=> {1=>nil, 2=>nil, 3=>#<OpenStruct slot=3>, 4=>nil, 5=>#<OpenStruct slot=5>}
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Suppose that we have previously instantiated three objects A, B, C from class D
Suppose I have a method that must return an object (say from a database
Suppose that I have two objects with the same property name that I am
In C#, suppose you have an object (say, myObject ) that is an instance
Suppose I have a customer object that has all of the standard customer properties
Suppose I have a UserControl whose DataContext is set to an object that has
I have two double values that are truncated to two decimal spots. Each one
Suppose we have an application (on a server) that has a set of resources:
Suppose I have a table nodes where I store a tree. Each node has
Suppose I have a list of type list<boost::any> that has some type in it

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.