diff options
author | Aaron Patterson <aaron.patterson@gmail.com> | 2013-10-09 15:36:47 -0700 |
---|---|---|
committer | Aaron Patterson <aaron.patterson@gmail.com> | 2013-10-09 15:36:47 -0700 |
commit | b64d64a648309226eda328cf0356893d9a8eae97 (patch) | |
tree | 1e82b101446904a1e952b508ae9cb6d17b8f0048 /activemodel | |
parent | bdeeba1c558f56df2bf240643d74f38f2b9ae98f (diff) | |
parent | 7473c625083ab14246760f60afb93397dccfe7c5 (diff) | |
download | rails-b64d64a648309226eda328cf0356893d9a8eae97.tar.gz rails-b64d64a648309226eda328cf0356893d9a8eae97.tar.bz2 rails-b64d64a648309226eda328cf0356893d9a8eae97.zip |
Merge branch 'tree'
* 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
...
Diffstat (limited to 'activemodel')
0 files changed, 0 insertions, 0 deletions