Commit message (Expand) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | | | | | | 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 | |
* | | | | | | Merge pull request #12473 from claudiob/document-after-touch | Yves Senn | 2013-10-09 | 2 | -2/+6 | |
|\ \ \ \ \ \ | |_|/ / / / |/| | | | | | ||||||
| * | | | | | Add documentation for after_touch [ci skip] | claudiob | 2013-10-08 | 2 | -2/+6 | |
| |/ / / / | ||||||
* | | | | | :scissors: | Rafael Mendonça França | 2013-10-09 | 2 | -2/+2 | |
* | | | | | Push define_accessors to class level since we don't need anythig from | Rafael Mendonça França | 2013-10-08 | 3 | -8/+8 | |
* | | | | | Use the reflection name instead of the accessor | Rafael Mendonça França | 2013-10-08 | 2 | -1/+2 | |
* | | | | | Move add_counter_cache_methods to class level | Rafael Mendonça França | 2013-10-08 | 1 | -2/+2 | |
* | | | | | Move define_constructors to class level | Rafael Mendonça França | 2013-10-08 | 1 | -3/+2 | |
* | | | | | Move define_writers to class level since we don't need anything from the | Rafael Mendonça França | 2013-10-08 | 2 | -3/+3 | |
* | | | | | Move define_readers to class method since it doesn't need nothing from | Rafael Mendonça França | 2013-10-08 | 2 | -5/+3 | |
* | | | | | Fix the indentation | Rafael Mendonça França | 2013-10-08 | 1 | -12/+13 | |
|/ / / / | ||||||
* | | | | join parts in `build` are *always* new, so don't bother checking | Aaron Patterson | 2013-10-08 | 1 | -1/+2 | |
* | | | | stop looking up the reflection multiple times | Aaron Patterson | 2013-10-08 | 1 | -6/+5 | |
* | | | | cache join associations and join base on the stack | Aaron Patterson | 2013-10-08 | 1 | -4/+11 | |
* | | | | use the API rather than accessing underlying data structures | Aaron Patterson | 2013-10-08 | 1 | -1/+1 | |
* | | | | associations is always a hash | Aaron Patterson | 2013-10-08 | 1 | -19/+13 | |
* | | | | keys are always symbols | Aaron Patterson | 2013-10-08 | 1 | -2/+4 | |
* | | | | we can get a list of reflections from the join parts, so let's remove | Aaron Patterson | 2013-10-08 | 1 | -3/+5 | |
* | | | | transform the association input so we can avoid type checks later. | Aaron Patterson | 2013-10-08 | 1 | -17/+31 | |
* | | | | we know the keys are scalars, so avoid some typechecking | Aaron Patterson | 2013-10-08 | 1 | -8/+12 | |
* | | | | this method is only ever called with a reflection | Aaron Patterson | 2013-10-08 | 1 | -6/+2 | |
* | | | | don't access the reflections hash | Aaron Patterson | 2013-10-08 | 2 | -3/+7 | |
* | | | | build association tree thing on demand. | Aaron Patterson | 2013-10-08 | 1 | -6/+11 | |
* | | | | hide join_parts internals from other classes | Aaron Patterson | 2013-10-08 | 2 | -17/+17 | |
* | | | | decouple JoinAssociation from JoinDependency | Aaron Patterson | 2013-10-08 | 2 | -10/+5 | |
* | | | | @associations can never have an array, so remove the dead code | Aaron Patterson | 2013-10-08 | 1 | -4/+0 | |
* | | | | typecast records returned from the db rather than to_sing everything | Aaron Patterson | 2013-10-08 | 2 | -12/+21 | |
|/ / / |