aboutsummaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* Revert "Merge pull request #12480 from iwiznia/master"Jeremy Kemper2013-10-114-57/+0
| | | | | This reverts commit e5f5a838b96a362534d9bb60d02334439ed9784c, reversing changes made to d7567f3290a50952494e9213556a1f283a6cf3a0.
* no reason to do this column addition and subtraction businessAaron Patterson2013-10-111-1/+1
|
* Merge pull request #12480 from iwiznia/masterRafael Mendonça França2013-10-114-0/+57
|\ | | | | flatten and flatten! methods for ActiveSupport::Duration
| * flatten and flatten! methods for ActiveSupport::DurationIonatan Wiznia2013-10-114-0/+57
| |
* | Merge pull request #12503 from arunagw/removed-unused-requireRafael Mendonça França2013-10-111-1/+0
|\ \ | | | | | | No need to require rbconfig as we are using Gem.ruby
| * | No need to require rbconfig as we are using Gem.rubyArun Agrawal2013-10-111-1/+0
|/ /
* | 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
* | Merge pull request #12339 from tjschuck/bcrypt_cost_attrJeremy Kemper2013-10-103-1/+13
|\ \ | | | | | | Use bcrypt's public cost attr instead of internal constant
| * | Use bcrypt's public cost attr, not internal constantT.J. Schuck2013-10-103-1/+13
|/ / | | | | | | | | | | | | | | See: - https://github.com/codahale/bcrypt-ruby/pull/63 - https://github.com/codahale/bcrypt-ruby/pull/64 - https://github.com/codahale/bcrypt-ruby/pull/65
* / Respect `SCRIPT_NAME` when using `redirect` with a relative pathAndrew White2013-10-103-0/+136
|/ | | | | | | | | | | | | | | | Example: # application routes.rb mount BlogEngine => '/blog' # engine routes.rb get '/admin' => redirect('admin/dashboard') This now redirects to the path `/blog/admin/dashboard`, whereas before it would've generated an invalid url because there would be no slash between the host name and the path. It also allows redirects to work where the application is deployed to a subdirectory of a website. Fixes #7977
* 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-098-59/+43
|\
| * 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-093-16/+15
| | | | | | | | instance
* | Merge pull request #12488 from CoryFoy/masterRafael Mendonça França2013-10-091-6/+16
|\ \ | | | | | | [ci skip] Modifies the initialization guide to make the initializers process clearer
| * | Modifies the initialization guide to make the initializers process clearer ↵Cory Foy2013-10-091-6/+16
| | | | | | | | | | | | and remove a TODO. [ci skip]
* | | 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
| | |
| * | speed up match?Aaron Patterson2013-10-091-0/+1
| | |
| * | 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
| | | | | | | | | | | | Remove the annoying `find_or_build` stuff.
| * | speed up finding existing nodesAaron Patterson2013-10-091-3/+1
| | | | | | | | | | | | | | | The node must be a child of the parent passed in, so only search children of the parent node
| * | make node search more efficientAaron Patterson2013-10-094-3/+43
| | | | | | | | | | | | | | | | | | Rather than search every node in the tree, comparing that node and all of its parents every time, start at the root from both sides and work our way down the tree
| * | remove == so we can see where walking up parents occursAaron Patterson2013-10-094-25/+15
| | |
| * | push parent up to the superclassAaron Patterson2013-10-093-7/+11
| | | | | | | | | | | | We always want a linked list back to the root node.
| * | convert JoinBase to a tree and remove the Node classAaron Patterson2013-10-092-42/+30
| | |
| * | 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
| | | | | | | | | | | | | | | since we are searching a tree, the current level should be consistent, so we don't have to inspect the parent class / table
| * | reduce number of comparisons and array allocationsAaron Patterson2013-10-081-11/+10
| | | | | | | | | | | | | | | Just inspecting the children nodes will reduce the number of comparisons we have to do (since it is limited to the child size)
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-19 10:50:43 +0000