acts_as_better_tree 0.9.4 → 0.9.5

data/.gitignore

@@ -0,0 +1,19 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+.DS_STORE
+Gemfile.lock
+gemtest
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    acts_as_better_tree (0.0.1)
+    acts_as_better_tree (0.9.4)
 
 GEM
   remote: https://rubygems.org/

data/README.md

@@ -1,7 +1,6 @@
 # ActsAsBetterTree
 
-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 reads like a standard tree.
-It 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.
+An alternative to nested_sets and acts_as_tree. Designed to be a drop in replacement for acts_as_tree. Replaces betternestedset without the slow inserts when dealing with a large dataset. Used by upillar.com on a dataset of over 900,000 categories with no slow downs. In tests it shows a 285% speed increase on inserts with a dataset of 100k categories. As datasets become larger its insert speed stays about the same when nested_sets become slower. In all of my tests read speeds have been comparable with nested sets on everything but all_children which is inperceptibly slower on a dataset of 100k than betternestedset.
 
 
 ## Installation
@@ -29,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.build_csv_ids!
+    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"
@@ -49,8 +48,19 @@ Or install it yourself as:
     child1.parent # => root
     root.children # => [child1]
     root.children.first.children.first # => subchild1
-
-Copyright (c) 2008 Isaac Sloan, released under the MIT license
+    child1.self_and_ancestors # => [root, child1]
+    child1.ancestors
+    child1.siblings
+    child1.self_and_siblings
+    child1.move_to_child_of(parent)
+    child1.childless?
+    child1.ancestor_of?(subchild1)
+    child1.descendant_of?(root)
+    root.to_csv # => "root,child1,subchild1\n" returns and array of all children
+    Category.to_csv # => "root,child1,subchild1\nroot,child1,subchild2\n" returns entire tree in a csv string
+
+
+Copyright (c) 2008 Isaac Sloan, released under the MIT license.
 Inspired by David Heinemeier Hansson's acts_as_tree
 
 ## Contributing

data/lib/acts_as_better_tree/version.rb

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

data/lib/acts_as_better_tree.rb

@@ -1,5 +1,5 @@
 require "acts_as_better_tree/version"
-
+require "csv"
 module ActiveRecord
   module Acts
     module BetterTree
@@ -27,22 +27,26 @@ module ActiveRecord
               roots(options).first
             end
 
-            def traverse(nodes = self.roots, &block)
+            def recursively_traverse(nodes = self.roots, &block)
               nodes.each do |node|
                 yield node
-                traverse(node.children, &block)
+                recursively_traverse(node.children, &block)
               end
             end
 
             # Call this to upgrade an existing acts_as_tree to acts_as_better_tree
-            def build_csv_ids!(nodes = self.roots)
+            def tree_to_better_tree!(nodes = self.roots)
               transaction do
-                traverse(nodes) do |node|
+                recursively_traverse(nodes) do |node|
                   node.csv_ids = node.build_csv_ids
                   node.save
                 end
               end
             end
+
+            def to_csv
+              return new.to_csv(roots)
+            end
           end
         end
       end
@@ -123,12 +127,12 @@ module ActiveRecord
           csv = []
           nodes.each do |node|
             if node.childless?
-              csv += [node.self_and_ancestors.map(&:name).join(",")]
+              csv += [node.self_and_ancestors.map(&:name).to_csv]
             else
               csv += [to_csv(node.children)]
             end
           end
-          return csv.join("\n")
+          return csv.join("")
         end
 
         def build_csv_ids

data/spec/acts_as_better_tree_spec.rb

@@ -69,4 +69,7 @@ describe "ActsAsBetterTree" do
     bobcats.parent.name.should eql "Cats"
   end
 
+  it "should return a csv string of all nodes" do
+    Category.to_csv.should eql "Animals,Cats,Lions\nAnimals,Cats,Tiger\nAnimals,Cats,House Cat\nAnimals,Cats,Panther\nAnimals,Cats,Bobcats\n"
+  end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: acts_as_better_tree
 version: !ruby/object:Gem::Version
-  version: 0.9.4
+  version: 0.9.5
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-08-02 00:00:00.000000000 Z
+date: 2012-08-06 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,16 +20,13 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .DS_Store
+- .gitignore
 - Gemfile
 - Gemfile.lock
 - LICENSE
 - README.md
 - Rakefile
-- acts_as_better_tree-0.0.1.gem
-- acts_as_better_tree-0.9.3.gem
 - acts_as_better_tree.gemspec
-- gemtest
 - lib/acts_as_better_tree.rb
 - lib/acts_as_better_tree/version.rb
 - spec/acts_as_better_tree_spec.rb