| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | cache the primary key / typcast lookup on the stack | Aaron Patterson | 2013-10-11 | 1 | -9/+9 |
| * | remove dead code / make duplicate code more obvious | Aaron Patterson | 2013-10-11 | 1 | -4/+4 |
| * | pull parent and alias tacker from the nodes. | Aaron Patterson | 2013-10-11 | 4 | -20/+23 |
| * | decouple the `join_constraints` method from the parent pointer | Aaron Patterson | 2013-10-11 | 2 | -2/+8 |
| * | no reason to do this column addition and subtraction business | Aaron Patterson | 2013-10-11 | 1 | -1/+1 |
| * | refactor a little so we can remove some methods | Aaron Patterson | 2013-10-10 | 2 | -4/+1 |
| * | the parent node is on the stack, so use it | Aaron Patterson | 2013-10-10 | 1 | -4/+4 |
| * | pass the parent node to the construct method | Aaron Patterson | 2013-10-10 | 1 | -7/+6 |
| * | nodes do not need to be sorted | Aaron Patterson | 2013-10-10 | 1 | -1/+1 |
| * | delete unused code | Aaron Patterson | 2013-10-10 | 2 | -50/+0 |
| * | merge JoinDependency as outer joins | Aaron Patterson | 2013-10-10 | 2 | -1/+31 |
| * | stuff the join dependency object in the "anything goes" hash. | Aaron Patterson | 2013-10-10 | 4 | -6/+8 |
| * | stop splatting things back and forth | Aaron Patterson | 2013-10-10 | 2 | -2/+2 |
| * | simplify each method. | Aaron Patterson | 2013-10-10 | 1 | -8/+2 |
| * | stop creating a bunch of relation objects when we can slap all the joins on a... | Aaron Patterson | 2013-10-09 | 2 | -8/+3 |
| * | Merge branch 'builder-instances' | Rafael Mendonça França | 2013-10-09 | 8 | -59/+43 |
| |\ |
|
| | * | Method visibility will not make difference here | Rafael Mendonça França | 2013-10-09 | 4 | -8/+0 |
| | * | Remove builder instances | Rafael Mendonça França | 2013-10-09 | 2 | -22/+10 |
| | * | Extract the scope building to a class method | Rafael Mendonça França | 2013-10-09 | 2 | -10/+17 |
| | * | Remove unneeded reader | Rafael Mendonça França | 2013-10-09 | 1 | -2/+0 |
| | * | Move wrap_scope to class level | Rafael Mendonça França | 2013-10-09 | 1 | -2/+2 |
| | * | Move macro to class level | Rafael Mendonça França | 2013-10-09 | 4 | -5/+5 |
| | * | Make validate_options a class method | Rafael Mendonça França | 2013-10-09 | 1 | -3/+3 |
| | * | Make valid_options a class method | Rafael Mendonça França | 2013-10-09 | 6 | -7/+7 |
| | * | Define the association extensions without need to have a builder | Rafael Mendonça França | 2013-10-09 | 3 | -16/+15 |
| * | | no need to to_sym | Aaron Patterson | 2013-10-09 | 1 | -1/+1 |
| * | | Merge branch 'tree' | Aaron Patterson | 2013-10-09 | 5 | -109/+105 |
| |\ \ |
|
| | * | | remove dead code | Aaron Patterson | 2013-10-09 | 1 | -13/+0 |
| | * | | add some convenient methods for avoiding array allocations | Aaron Patterson | 2013-10-09 | 2 | -3/+6 |
| | * | | hide join_constraints inside the JoinDependency object | Aaron Patterson | 2013-10-09 | 2 | -8/+7 |
| | * | | speed up match? | Aaron Patterson | 2013-10-09 | 1 | -0/+1 |
| | * | | expose the root node and call it | Aaron Patterson | 2013-10-09 | 1 | -21/+11 |
| | * | | just skip the join if it's already there | Aaron Patterson | 2013-10-09 | 1 | -14/+10 |
| | * | | speed up finding existing nodes | Aaron Patterson | 2013-10-09 | 1 | -3/+1 |
| | * | | make node search more efficient | Aaron Patterson | 2013-10-09 | 4 | -3/+43 |
| | * | | remove == so we can see where walking up parents occurs | Aaron Patterson | 2013-10-09 | 4 | -25/+15 |
| | * | | push parent up to the superclass | Aaron Patterson | 2013-10-09 | 3 | -7/+11 |
| | * | | convert JoinBase to a tree and remove the Node class | Aaron Patterson | 2013-10-09 | 2 | -42/+30 |
| | * | | names are guaranteed to be symbols | Aaron Patterson | 2013-10-08 | 1 | -1/+1 |
| | * | | eliminate function that is only used in one place | Aaron Patterson | 2013-10-08 | 1 | -7/+2 |
| | * | | we will always detect the same node, so just pass the node in | Aaron Patterson | 2013-10-08 | 1 | -7/+2 |
| | * | | we do not need to to_s the name all the time | Aaron Patterson | 2013-10-08 | 1 | -5/+3 |
| | * | | parent is guaranteed to be the same | Aaron Patterson | 2013-10-08 | 1 | -4/+1 |
| | * | | reduce number of comparisons and array allocations | Aaron Patterson | 2013-10-08 | 1 | -11/+10 |
| | * | | rename the variable to make more sense with a tree | Aaron Patterson | 2013-10-08 | 1 | -7/+7 |
| | * | | walk the tree rather than generating a hash and walking it | Aaron Patterson | 2013-10-08 | 1 | -21/+10 |
| | * | | do not convert the tree to a list just for the first node | Aaron Patterson | 2013-10-08 | 1 | -1/+1 |
| | * | | generate the association hash from the top down | Aaron Patterson | 2013-10-08 | 1 | -17/+15 |
| | * | | store join parts in a tree | Aaron Patterson | 2013-10-08 | 1 | -16/+45 |
| * | | | Using flat_map instead of map and flatten | Arun Agrawal | 2013-10-09 | 1 | -1/+1 |
