aboutsummaryrefslogtreecommitdiffstats
path: root/activerecord/lib/active_record/associations/join_dependency.rb
Commit message (Expand)AuthorAgeFilesLines
...
* move alias building to the table nodeAaron Patterson2013-10-141-4/+8
* let the Table class build the ARel alias nodesAaron Patterson2013-10-141-4/+9
* store aliases in a better structureAaron Patterson2013-10-141-4/+17
* unhook `join_constraints` from the @tables ivarAaron Patterson2013-10-131-1/+1
* push the node->AR cache up one levelAaron Patterson2013-10-131-10/+11
* remove dead codeAaron Patterson2013-10-111-5/+0
* remove useless codeAaron Patterson2013-10-111-24/+20
* the parent hash keeps the records unique alreadyAaron Patterson2013-10-111-4/+3
* keep track of AR objects we've made as we walk the treeAaron Patterson2013-10-111-35/+22
* push up the loaded target checkingAaron Patterson2013-10-111-9/+13
* we always have a model nowAaron Patterson2013-10-111-1/+1
* extract conditional to the callerAaron Patterson2013-10-111-11/+13
* we always have a reflection and it is on the nodeAaron Patterson2013-10-111-2/+2
* fix variable name. we're constructing a model, not an associationAaron Patterson2013-10-111-12/+12
* reflections know if they are collections, so askAaron Patterson2013-10-111-6/+5
* belongs_to can be treated the same way as has_oneAaron Patterson2013-10-111-12/+5
* cache the primary key / typcast lookup on the stackAaron Patterson2013-10-111-9/+9
* remove dead code / make duplicate code more obviousAaron Patterson2013-10-111-4/+4
* pull parent and alias tacker from the nodes.Aaron Patterson2013-10-111-1/+18
* decouple the `join_constraints` method from the parent pointerAaron Patterson2013-10-111-1/+7
* refactor a little so we can remove some methodsAaron Patterson2013-10-101-1/+1
* the parent node is on the stack, so use itAaron Patterson2013-10-101-4/+4
* pass the parent node to the construct methodAaron Patterson2013-10-101-7/+6
* nodes do not need to be sortedAaron Patterson2013-10-101-1/+1
* delete unused codeAaron Patterson2013-10-101-40/+0
* merge JoinDependency as outer joinsAaron Patterson2013-10-101-0/+30
* stuff the join dependency object in the "anything goes" hash.Aaron Patterson2013-10-101-2/+2
* stop splatting things back and forthAaron Patterson2013-10-101-1/+1
* stop creating a bunch of relation objects when we can slap all the joins on a...Aaron Patterson2013-10-091-3/+3
* remove dead codeAaron Patterson2013-10-091-13/+0
* add some convenient methods for avoiding array allocationsAaron Patterson2013-10-091-3/+3
* hide join_constraints inside the JoinDependency objectAaron Patterson2013-10-091-6/+6
* expose the root node and call itAaron Patterson2013-10-091-21/+11
* just skip the join if it's already thereAaron Patterson2013-10-091-14/+10
* speed up finding existing nodesAaron Patterson2013-10-091-3/+1
* make node search more efficientAaron Patterson2013-10-091-3/+20
* remove == so we can see where walking up parents occursAaron Patterson2013-10-091-10/+15
* convert JoinBase to a tree and remove the Node classAaron Patterson2013-10-091-41/+11
* names are guaranteed to be symbolsAaron Patterson2013-10-081-1/+1
* eliminate function that is only used in one placeAaron Patterson2013-10-081-7/+2
* we will always detect the same node, so just pass the node inAaron Patterson2013-10-081-7/+2
* we do not need to to_s the name all the timeAaron Patterson2013-10-081-5/+3
* parent is guaranteed to be the sameAaron Patterson2013-10-081-4/+1
* reduce number of comparisons and array allocationsAaron Patterson2013-10-081-11/+10
* rename the variable to make more sense with a treeAaron Patterson2013-10-081-7/+7
* walk the tree rather than generating a hash and walking itAaron Patterson2013-10-081-21/+10
* do not convert the tree to a list just for the first nodeAaron Patterson2013-10-081-1/+1
* generate the association hash from the top downAaron Patterson2013-10-081-17/+15
* store join parts in a treeAaron Patterson2013-10-081-16/+45
* join parts in `build` are *always* new, so don't bother checkingAaron Patterson2013-10-081-1/+2