acts_as_better_tree 0.9.5 → 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 626f6d72ed65efb1cac94e550e27e3af3cb7206f
+  data.tar.gz: ea21b886ce356e30985e9702757fb54e557245e5
+SHA512:
+  metadata.gz: ca36af0c8a56427ce3d30e4f0d3e6d3c5fef6a011fd3ec31b57a1d42f88b399224c1ef29691e119d642a4033e195aafa12a41312d18ad143d197fc50b5f0e36d
+  data.tar.gz: ece9981f83c38cf1e6d07a2e1dd2ca00f1717364b89bcc2e002c126536b70baf02212ee78ea8042ad26641b3e31639427b3e6e2bd5350a49d891f861b99dafa4

data/README.md

@@ -19,7 +19,7 @@ Or install it yourself as:
 
 ## Usage
 
-    Required fields are parent_id, root_id, csv_ids.
+  Required fields are parent_id, root_id, csv_ids.
 
     create_table :categories do |t|
      t.column :root_id, :integer
@@ -28,7 +28,7 @@ Or install it yourself as:
      t.column :name, :string
     end
 
-    If upgrading from acts_as_tree just add root_id and csv_ids and run Category.tree_to_better_tree!
+  If upgrading from acts_as_tree just add root_id and csv_ids and run Category.tree_to_better_tree!
 
     class Category < ActiveRecord::Base
         acts_as_better_tree :order => "name"

data/lib/acts_as_better_tree.rb

@@ -8,15 +8,15 @@ module ActiveRecord
       end
 
       module ClassMethods
-        def acts_as_better_tree(options = {}, &b)
+        def acts_as_better_tree(options = {})
           configuration = {:order => "id ASC", :destroy_dependent => true }
           configuration.update(options) if options.is_a?(Hash)
 
           belongs_to :parent, :class_name => name, :foreign_key => :parent_id
-          has_many :children, {:class_name => name, :foreign_key => :parent_id, :order => configuration[:order]}.merge(configuration[:destroy_dependent] ? {:dependent => :destroy} : {}), &b
-          has_many :parents_children, {:class_name => name, :primary_key => :parent_id, :foreign_key => :parent_id, :order => configuration[:order]}, &b
+          has_many :children, -> {order(configuration[:order])}, {:class_name => name, :foreign_key => :parent_id}.merge(configuration[:destroy_dependent] ? {:dependent => :destroy} : {})
+          has_many :parents_children, -> {order(configuration[:order])}, {:class_name => name, :primary_key => :parent_id, :foreign_key => :parent_id}
           belongs_to :root, :class_name => name, :foreign_key => :root_id
-          scope :roots, :order => configuration[:order], :conditions => {:parent_id => nil}
+          scope :roots, -> {order(configuration[:order]).where(:parent_id => nil)}
           after_create       :assign_csv_ids
           after_validation  :update_csv_ids, :on => :update
 
@@ -161,23 +161,17 @@ module ActiveRecord
         end
 
         def update_csv_ids
-          return unless parent_foreign_key_changed?
+          return unless parent_foreign_key_changed? 
           old_csv_ids = self.csv_ids
           self.csv_ids = build_csv_ids
           self.root_id = build_root_id
-          self.class.update_all("csv_ids = Replace(csv_ids, '#{old_csv_ids},', '#{self.csv_ids},'), root_id = #{self.root_id}", "csv_ids like '#{old_csv_ids},%'")
+          self.class.where("csv_ids like '#{old_csv_ids},%'").update_all("csv_ids = Replace(csv_ids, '#{old_csv_ids},', '#{self.csv_ids},'), root_id = #{self.root_id}") unless self.new_record?
         end
       end
     end
   end
 end
 
-#ActiveRecord::Base.send :include, ActiveRecord::Acts::BetterTree
-#
-#ActiveRecord::Base.class_eval do
-#  include ActiveRecord::Acts::BetterTree
-#end
-
 class ActiveRecord::Base
   include ActiveRecord::Acts::BetterTree
 end

data/lib/acts_as_better_tree/version.rb

@@ -1,3 +1,3 @@
 module ActsAsBetterTree
-  VERSION = "0.9.5"
+  VERSION = "1.0.0"
 end

metadata

@@ -1,15 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: acts_as_better_tree
 version: !ruby/object:Gem::Version
-  version: 0.9.5
-  prerelease: 
+  version: 1.0.0
 platform: ruby
 authors:
 - Isaac Sloan
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-08-06 00:00:00.000000000 Z
+date: 2016-04-22 00:00:00.000000000 Z
 dependencies: []
 description: acts_as_better_tree is great for anyone who needs a fast tree capable
   of handling millions of nodes without slowing down on writes like nestedset or on
@@ -20,7 +19,7 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gitignore
+- ".gitignore"
 - Gemfile
 - Gemfile.lock
 - LICENSE
@@ -34,27 +33,26 @@ files:
 - spec/spec_helper.rb
 homepage: https://github.com/isaacsloan/acts_as_better_tree
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.21
+rubygems_version: 2.4.5.1
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: acts_as_better_tree is backwards compatible with acts_as_tree and remains
   fast with large datasets by storing the ancestry of every node in the field csv_ids.
 test_files: