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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T22:31:04+00:00 2026-05-13T22:31:04+00:00

Let’s say that I’m looking for a specific item in a has_many association. Is

  • 0

Let’s say that I’m looking for a specific item in a has_many association.

Is there a way to find that won’t rehit the database if what I’m requesting is already cached?

Here’s my situation (which is not working and does not do what I requested):

class User
  has_many :friendships

  def some_function(buddy)
    f = friendships.detect{|friendship| friendship.user == self && 
                                        friendship.friend == buddy}
    f.do_something
  end
end

The function is susceptible to N+1 problems, but most of the time I will already have either used :include or preloaded the user’s friendships elsewhere. However, if I didn’t do this, then this current function will fall back to requesting all the friendships, even though it only needs one. The solution would seem to be something like this:

f = Friendship.find_by_user_id_and_friend_id id, buddy.id

However, this will hit the database again even if all the friendships are cached and I have what I need right there.

Is there any way to either use the cached copy, or if none is available, search a specific record?

  • 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-13T22:31:05+00:00Added an answer on May 13, 2026 at 10:31 pm

    What you want is the #loaded? method of the association proxy:

    class User
      has_many :friendships
    
      def some_function(buddy)
        if friendships.loaded? then
          f = friendships.detect{|friendship| friendship.user == self && 
                                              friendship.friend == buddy}
        else
          Friendship.find_by_user_id_and_friend_id id, buddy.id
        end
      end
    end
    

    Unfortunately, #loaded? does not appear in the public documentation. You can always guard your call to #loaded? with friendships.respond_to?(:loaded?).

    Documentation for AssociationProxy#loaded? on GitHub.

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

Sidebar

Related Questions

Let's say I'm writing a PHP (>= 5.0) class that's meant to be a
Let's say that we have an ARGB color: Color argb = Color.FromARGB(127, 69, 12,
Let's say there is a graph and some set of functions like: create-node ::
Let's say I have some text as follows: do this, do that, then this,
Let's say that I have a set of relations that looks like this: relations
Let's say the rule is as follows: .largeField { width: 65%; } Is there
Let's say that I have a binary that I am building, and I include
Let's say there is a list of List<UInt32> Thus, : 12|12 23|33 33|22 11|22
Let's say that I have classes like this: public class Parent { public int
Let's say I'm creating an OpenGL game in C++ that will have many objects

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.