aboutsummaryrefslogtreecommitdiffstats
path: root/activerecord/lib
Commit message (Collapse)AuthorAgeFilesLines
...
* | | | | | | rm JoinHelper from JoinAssociationAaron Patterson2013-10-141-3/+1
| | | | | | |
* | | | | | | unhook `join_constraints` from the @tables ivarAaron Patterson2013-10-132-3/+3
| | | | | | |
* | | | | | | remove delegate methods that are not usedAaron Patterson2013-10-131-1/+1
| | | | | | |
* | | | | | | push the node->AR cache up one levelAaron Patterson2013-10-132-16/+12
| | | | | | |
* | | | | | | eliminate single use methodAaron Patterson2013-10-131-6/+3
| | | | | | |
* | | | | | | eliminate duplicate code from to_sqlAaron Patterson2013-10-132-7/+9
| | | | | | | | | | | | | | | | | | | | | | | | | | | | I don't really like passing the block, but this seems easiest for now
* | | | | | | calling construct_relation_for_association_find is no longer necessaryAaron Patterson2013-10-131-1/+1
| | | | | | |
* | | | | | | push up `select` exclusionAaron Patterson2013-10-132-4/+6
| | | | | | |
* | | | | | | JoinDependency will take care of making things uniqueAaron Patterson2013-10-131-1/+1
| | | | | | |
* | | | | | | remove dead codeAaron Patterson2013-10-111-5/+0
| | | | | | |
* | | | | | | remove useless codeAaron Patterson2013-10-111-24/+20
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | turns out that the activerecord object will always have the same id as the row from which it was constructed
* | | | | | | 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
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Remove duplicate removal code because we avoid adding duplicates as we walk the tree the first time
* | | | | | | 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
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | We don't need to poke at the macro to figure out if we should look for a cached record or not
* | | | | | | 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-114-20/+23
| | | | | | | | | | | | | | | | | | | | | | | | | | | | For now, we'll set the tables on the nodes manually.
* | | | | | | decouple the `join_constraints` method from the parent pointerAaron Patterson2013-10-112-2/+8
|/ / / / / /
* | | | | | no reason to do this column addition and subtraction businessAaron Patterson2013-10-111-1/+1
| | | | | |
* | | | | | refactor a little so we can remove some methodsAaron Patterson2013-10-102-4/+1
| | | | | |
* | | | | | the parent node is on the stack, so use itAaron Patterson2013-10-101-4/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | we don't need to walk back up the node's parents when we have the parent on the stack
* | | | | | 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-102-50/+0
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Now that we merge trees from the top down, we don't need to search through the whole tree for particular nodes, just walk it and merge.
* | | | | | merge JoinDependency as outer joinsAaron Patterson2013-10-102-1/+31
| | | | | | | | | | | | | | | | | | | | | | | | Merge JoinDependency objects as outer joins
* | | | | | stuff the join dependency object in the "anything goes" hash.Aaron Patterson2013-10-104-6/+8
| | | | | |
* | | | | | stop splatting things back and forthAaron Patterson2013-10-102-2/+2
| | | | | |
* | | | | | simplify each method.Aaron Patterson2013-10-101-8/+2
| | | | | | | | | | | | | | | | | | | | | | | | Stop writing terrible code Aaron. This is Ruby, not Scheme
* | | | | | stop creating a bunch of relation objects when we can slap all the joins on ↵Aaron Patterson2013-10-092-8/+3
| | | | | | | | | | | | | | | | | | | | | | | | at once
* | | | | | Merge branch 'builder-instances'Rafael Mendonça França2013-10-097-57/+42
|\ \ \ \ \ \
| * | | | | | Method visibility will not make difference hereRafael Mendonça França2013-10-094-8/+0
| | | | | | |
| * | | | | | Remove builder instancesRafael Mendonça França2013-10-092-22/+10
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | All the job can be done at class level so we can avoid some object allocation
| * | | | | | Extract the scope building to a class methodRafael Mendonça França2013-10-092-10/+17
| | | | | | |
| * | | | | | Remove unneeded readerRafael Mendonça França2013-10-091-2/+0
| | | | | | |
| * | | | | | Move wrap_scope to class levelRafael Mendonça França2013-10-091-2/+2
| | | | | | |
| * | | | | | Move macro to class levelRafael Mendonça França2013-10-094-5/+5
| | | | | | |
| * | | | | | Make validate_options a class methodRafael Mendonça França2013-10-091-3/+3
| | | | | | |
| * | | | | | Make valid_options a class methodRafael Mendonça França2013-10-096-7/+7
| | | | | | |
| * | | | | | Define the association extensions without need to have a builderRafael Mendonça França2013-10-092-14/+14
| | | | | | | | | | | | | | | | | | | | | | | | | | | | instance
* | | | | | | no need to to_symAaron Patterson2013-10-091-1/+1
| | | | | | |
* | | | | | | Merge branch 'tree'Aaron Patterson2013-10-095-109/+105
|\ \ \ \ \ \ \ | |_|_|/ / / / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * tree: (22 commits) remove dead code add some convenient methods for avoiding array allocations hide join_constraints inside the JoinDependency object speed up match? expose the root node and call it just skip the join if it's already there speed up finding existing nodes make node search more efficient remove == so we can see where walking up parents occurs push parent up to the superclass convert JoinBase to a tree and remove the Node class names are guaranteed to be symbols eliminate function that is only used in one place we will always detect the same node, so just pass the node in we do not need to to_s the name all the time parent is guaranteed to be the same reduce number of comparisons and array allocations rename the variable to make more sense with a tree walk the tree rather than generating a hash and walking it do not convert the tree to a list just for the first node ...
| * | | | | | remove dead codeAaron Patterson2013-10-091-13/+0
| | | | | | |
| * | | | | | add some convenient methods for avoiding array allocationsAaron Patterson2013-10-092-3/+6
| | | | | | |
| * | | | | | hide join_constraints inside the JoinDependency objectAaron Patterson2013-10-092-8/+7
| | | | | | |
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-12 19:38:35 +0000