cfoley I wholly agree with you and in fact my implementation is similar to your encapsulation idea. O(n^2) is probably not going to be an issue in my case. I was really just curious if someone smarter than me might have a solution that I wasn't seeing. Thanks for you input.

Starbucks internet connection sucks! Removing a double post cuz I don't know how to just delete.

cfoley, on 16 March 2013 - 10:59 PM, said:

cfoley I don't understand how this solves the looping issue. I'm reading your answer to imply creating a utility class that builds the two association arrays that are needed via the Relateion method. So the Relateion method would still do the exact same looping algorithm, but you get the accessor methods associatedAs and associatedBs. Maybe I wasn't clear in the initial post, or I misunderstand you're solution. Creating a wrapper or utility object to hold the finished products is really a non-issue. I only interested in trying to find a better solution to the initial looping algorithm.

To be fair these are completely disparate objects so there just might not be a better solution.

stackoverflow you're correct that this would at least limit doing this multiple times; however, in this case it's going to be used as a utility function where the cache would not reflect updates unless it was refreshed. The api in this case doesn't support page queries. So it's an all or nothing query. Meaning I couldn't just query for the updates an merge them in.

When I first read the topic heading I was expecting to see some dirty pics of Nokia phones. Is that weird?