acts_as_happy_tree 1.0.0

data/README

@@ -0,0 +1,28 @@
+acts_as_happy_tree
+============
+
+Specify this +acts_as+ extension if you want to model a tree structure by providing a parent association and a children
+association. This requires that you have a foreign key column, which by default is called +parent_id+.
+
+  class Category < ActiveRecord::Base
+    acts_as_happy_tree :order => "name"
+  end
+
+  Example:
+  root
+   \_ child1
+        \_ subchild1
+        \_ subchild2
+
+  root      = Category.create("name" => "root")
+  child1    = root.children.create("name" => "child1")
+  subchild1 = child1.children.create("name" => "subchild1")
+
+  root.parent   # => nil
+  child1.parent # => root
+  root.children # => [child1]
+  root.children.first.children.first # => subchild1
+
+Copyright (c) 2007 David Heinemeier Hansson, released under the MIT license  
+
+Includes patch from http://dev.rubyonrails.org/ticket/1924

data/Rakefile

@@ -0,0 +1,73 @@
+require 'rubygems'
+require 'rake'
+
+begin
+  require 'jeweler'
+  Jeweler::Tasks.new do |gem|
+    gem.name = "acts_as_happy_tree"
+    gem.summary = %Q{acts_as_happy_tree as a gem}
+    gem.description = %Q{acts_as_happy_tree as a gem}
+    gem.email = "jim@saturnflyer.com"
+    gem.homepage = "http://github.com/saturnflyer/acts_as_happy_tree"
+    gem.authors = ["David Heinemeier Hansson",'and others']
+    # gem.add_development_dependency "thoughtbot-shoulda"
+    # gem is a Gem::Specification... see http://www.rubygems.org/read/chapter/20 for additional settings
+  end
+rescue LoadError
+  puts "Jeweler (or a dependency) not available. Install it with: sudo gem install jeweler"
+end
+
+require 'rake/testtask'
+Rake::TestTask.new(:test) do |test|
+  test.libs << 'lib' << 'test'
+  test.test_files = FileList['test/*_test.rb']
+  test.verbose = true
+end
+
+task 'test:ar30' do
+  ENV['AR_VERSION'] = '3.0.10'
+  Rake::Task["test"].execute
+end
+
+task 'test:ar31' do
+  ENV['AR_VERSION'] = '3.1.2'
+  Rake::Task["test"].execute
+end
+
+task 'test:ar32' do
+  ENV['AR_VERSION'] = '3.2.1'
+  Rake::Task["test"].execute
+end
+
+task 'test:all' => ['test:ar32', 'test:ar31', 'test:ar30']
+
+begin
+  require 'rcov/rcovtask'
+  Rcov::RcovTask.new do |test|
+    test.libs << 'test'
+    test.pattern = 'test/**/*_test.rb'
+    test.verbose = true
+  end
+rescue LoadError
+  task :rcov do
+    abort "RCov is not available. In order to run rcov, you must: sudo gem install spicycode-rcov"
+  end
+end
+
+task :test => :check_dependencies
+
+task :default => :test
+
+require 'rake/rdoctask'
+Rake::RDocTask.new do |rdoc|
+  if File.exist?('VERSION')
+    version = File.read('VERSION')
+  else
+    version = ""
+  end
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "acts_as_happy_tree #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/VERSION

@@ -0,0 +1 @@
+1.0.0

data/acts_as_happy_tree.gemspec

@@ -0,0 +1,41 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{acts_as_happy_tree}
+  s.version = "1.0.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["David Heinemeier Hansson", "Jim Gay", "thoughtafter", "and others"]
+  s.date = %q{2012-08-18}
+  s.description = %q{Forked from acts_as_tree this should be a drop in replacement but with more features and tuned for performance and efficiency.}
+  s.email = %q{thoughtafter@gmail.com}
+  s.extra_rdoc_files = [
+    "README"
+  ]
+  s.files = [
+    "README",
+    "Rakefile",
+    "VERSION",
+    "acts_as_happy_tree.gemspec",
+    "init.rb",
+    "rails/init.rb",
+    "test/acts_as_happy_tree_test.rb"
+  ]
+  s.homepage = %q{http://github.com/thoughtafter/acts_as_happy_tree}
+  s.require_paths = ["lib"]
+  s.rubygems_version = %q{1.0.0}
+  s.summary = %q{acts_as_happy_tree gem}
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+    else
+    end
+  else
+  end
+end

data/init.rb

@@ -0,0 +1 @@
+require File.dirname(__FILE__) + "/rails/init"

data/rails/init.rb

@@ -0,0 +1 @@
+require 'acts_as_happy_tree'

data/test/acts_as_happy_tree_test.rb

@@ -0,0 +1,515 @@
+require 'test/unit'
+
+puts "Requested AR VER: #{ENV['AR_VERSION']}"
+gem 'activerecord', ENV['AR_VERSION']
+
+require 'rubygems'
+require 'active_record'
+
+puts "Activated AR VER: #{ActiveRecord::VERSION::STRING}"
+
+$:.unshift File.dirname(__FILE__) + '/../lib'
+require File.dirname(__FILE__) + '/../init'
+
+class Test::Unit::TestCase
+  def assert_queries(num = 1)
+    $query_count = 0
+    yield
+  ensure
+    assert_equal num, $query_count, "#{$query_count} instead of #{num} queries were executed."
+  end
+
+  def assert_no_queries(&block)
+    assert_queries(0, &block)
+  end
+end
+
+ActiveRecord::Base.establish_connection(:adapter => "sqlite3", :database => ":memory:")
+
+# AR keeps printing annoying schema statements
+$stdout = StringIO.new
+
+def setup_db
+  ActiveRecord::Base.logger
+  ActiveRecord::Schema.define(:version => 1) do
+    create_table :mixins do |t|
+      t.column :type, :string
+      t.column :parent_id, :integer
+      t.column :children_count, :integer, :default => 0
+    end
+  end
+end
+
+def teardown_db
+  ActiveRecord::Base.connection.tables.each do |table|
+    ActiveRecord::Base.connection.drop_table(table)
+  end
+end
+
+class Mixin < ActiveRecord::Base
+end
+
+class TreeMixin < Mixin
+  acts_as_happy_tree :foreign_key => "parent_id", :order => "id"
+end
+
+class TreeMixinWithCounterCache < Mixin
+  acts_as_happy_tree :foreign_key => "parent_id", :order => "id", :counter_cache => :children_count
+end
+
+class TreeMixinWithoutOrder < Mixin
+  acts_as_happy_tree :foreign_key => "parent_id"
+end
+
+class RecursivelyCascadedTreeMixin < Mixin
+  acts_as_happy_tree :foreign_key => "parent_id"
+  has_one :first_child, :class_name => 'RecursivelyCascadedTreeMixin', :foreign_key => :parent_id
+end
+
+class TreeMixinNullify < Mixin
+  acts_as_happy_tree :foreign_key => "parent_id", :order => "id", :dependent => :nullify
+end
+
+class TreeTest < Test::Unit::TestCase
+
+  def setup
+    setup_db
+    @root1 = TreeMixin.create!
+    @root_child1 = TreeMixin.create! :parent_id => @root1.id
+    @child1_child = TreeMixin.create! :parent_id => @root_child1.id
+    @root_child2 = TreeMixin.create! :parent_id => @root1.id
+    @root2 = TreeMixin.create!
+    @root3 = TreeMixin.create!
+    @root_child1.reload # need to reload to recognize children
+  end
+
+  def teardown
+    teardown_db
+  end
+
+  def test_children
+    assert_equal @root1.reload.children, [@root_child1, @root_child2]
+    assert_equal @root_child1.reload.children, [@child1_child]
+    assert_equal @child1_child.reload.children, []
+    assert_equal @root_child2.reload.children, []
+  end
+
+  def test_parent
+    assert_equal @root_child1.parent, @root1
+    assert_equal @root_child1.parent, @root_child2.parent
+    assert_nil @root1.parent
+  end
+
+  def test_nullify
+    root4 = TreeMixinNullify.create!
+    root4_child = TreeMixinNullify.create! :parent_id => root4.id
+    assert_equal 2, TreeMixinNullify.count
+    assert_equal root4.id, root4_child.parent_id
+    root4.destroy
+    assert_equal 1, TreeMixinNullify.count
+    assert_nil root4_child.reload.parent_id
+  end
+
+  def test_delete
+    assert_equal 6, TreeMixin.count
+    @root1.destroy
+    assert_equal 2, TreeMixin.count
+    @root2.destroy
+    @root3.destroy
+    assert_equal 0, TreeMixin.count
+  end
+
+  def test_insert
+    @extra = @root1.children.create
+
+    assert @extra
+
+    assert_equal @extra.parent, @root1
+
+    assert_equal 3, @root1.reload.children.count
+    assert @root1.children.include?(@extra)
+    assert @root1.children.include?(@root_child1)
+    assert @root1.children.include?(@root_child2)
+  end
+
+  def test_ancestors
+    assert_equal [], @root1.ancestors
+    assert_equal [@root1], @root_child1.ancestors
+    assert_equal [@root_child1, @root1], @child1_child.ancestors
+    assert_equal [@root1], @root_child2.ancestors
+    assert_equal [], @root2.ancestors
+    assert_equal [], @root3.ancestors
+  end
+
+  def test_ancestor_ids
+    assert_equal [], @root1.ancestor_ids
+    assert_equal [@root1.id], @root_child1.ancestor_ids
+    assert_equal [@root_child1.id, @root1.id], @child1_child.ancestor_ids
+    assert_equal [@root1.id], @root_child2.ancestor_ids
+    assert_equal [], @root2.ancestor_ids
+    assert_equal [], @root3.ancestor_ids
+  end
+
+  def test_ancestors_count
+    assert_equal 0, @root1.ancestors_count
+    assert_equal 1, @root_child1.ancestors_count
+    assert_equal 2, @child1_child.ancestors_count
+    assert_equal 1, @root_child2.ancestors_count
+    assert_equal 0, @root2.ancestors_count
+    assert_equal 0, @root3.ancestors_count
+  end
+
+  def test_class_root
+    assert_equal @root1, TreeMixin.root
+  end
+
+  def test_root
+    assert_equal @root1, @root1.root
+    assert_equal @root1, @root_child1.root
+    assert_equal @root1, @child1_child.root
+    assert_equal @root1, @root_child2.root
+    assert_equal @root2, @root2.root
+    assert_equal @root3, @root3.root
+  end
+
+  def test_root_id
+    assert_equal @root1.id, @root1.root_id
+    assert_equal @root1.id, @root_child1.root_id
+    assert_equal @root1.id, @child1_child.root_id
+    assert_equal @root1.id, @root_child2.root_id
+    assert_equal @root2.id, @root2.root_id
+    assert_equal @root3.id, @root3.root_id
+  end
+
+  def test_roots
+    assert_equal [@root1, @root2, @root3], TreeMixin.roots
+  end
+
+  def test_siblings
+    assert_equal [@root2, @root3], @root1.siblings
+    assert_equal [@root_child2], @root_child1.siblings
+    assert_equal [], @child1_child.siblings
+    assert_equal [@root_child1], @root_child2.siblings
+    assert_equal [@root1, @root3], @root2.siblings
+    assert_equal [@root1, @root2], @root3.siblings
+  end
+
+  def test_self_and_siblings
+    assert_equal [@root1, @root2, @root3], @root1.self_and_siblings
+    assert_equal [@root_child1, @root_child2], @root_child1.self_and_siblings
+    assert_equal [@child1_child], @child1_child.self_and_siblings
+    assert_equal [@root_child1, @root_child2], @root_child2.self_and_siblings
+    assert_equal [@root1, @root2, @root3], @root2.self_and_siblings
+    assert_equal [@root1, @root2, @root3], @root3.self_and_siblings
+  end
+
+  def test_root?
+    assert @root1.root?
+    assert @root2.root?
+    assert @root3.root?
+    assert !@root_child1.root?
+    assert !@root_child2.root?
+    assert !@child1_child.root?
+  end
+
+  def test_child?
+    assert !@root1.child?
+    assert !@root2.child?
+    assert !@root3.child?
+    assert @root_child1.child?
+    assert @root_child2.child?
+    assert @child1_child.child?
+  end
+
+  def test_parent?
+    assert @root1.parent?
+    assert !@root2.parent?
+    assert !@root3.parent?
+    assert @root_child1.parent?
+    assert !@root_child2.parent?
+    assert !@child1_child.parent?
+  end
+
+  def test_leaf?
+    assert !@root1.leaf?
+    assert @root2.leaf?
+    assert @root3.leaf?
+    assert !@root_child1.leaf?
+    assert @root_child2.leaf?
+    assert @child1_child.leaf?
+  end
+
+  def test_ancestor_of?
+    assert_equal false, @root1.ancestor_of?(nil)
+    assert_equal false, @root_child1.ancestor_of?(nil)
+    assert_equal false, @root_child2.ancestor_of?(nil)
+    assert_equal false, @child1_child.ancestor_of?(nil)
+
+    assert_equal false, @root1.ancestor_of?(0)
+    assert_equal false, @root_child1.ancestor_of?("foo")
+    assert_equal false, @root_child2.ancestor_of?(:bar)
+    assert_equal false, @child1_child.ancestor_of?(TreeMixin.new)
+
+    assert_equal true, @root1.ancestor_of?(@root_child1)
+    assert_equal true, @root1.ancestor_of?(@root_child2)
+    assert_equal true, @root1.ancestor_of?(@child1_child)
+
+    assert_equal false, @root_child1.ancestor_of?(@root1)
+    assert_equal false, @root_child2.ancestor_of?(@root1)
+    assert_equal false, @child1_child.ancestor_of?(@root1)
+
+    assert_equal false, @root1.ancestor_of?(@root1)
+    assert_equal false, @root1.ancestor_of?(@root2)
+    assert_equal false, @root1.ancestor_of?(@root3)
+
+    assert_equal true, @root_child1.ancestor_of?(@child1_child)
+    assert_equal false, @child1_child.ancestor_of?(@root_child1)
+  end
+
+  def test_descendant_of?
+    assert_equal false, @root1.descendant_of?(nil)
+    assert_equal false, @root_child1.descendant_of?(nil)
+    assert_equal false, @root_child2.descendant_of?(nil)
+    assert_equal false, @child1_child.descendant_of?(nil)
+
+    assert_equal false, @root1.descendant_of?(0)
+    assert_equal false, @root_child1.descendant_of?("foo")
+    assert_equal false, @root_child2.descendant_of?(:bar)
+    assert_equal false, @child1_child.descendant_of?(TreeMixin.new)
+
+    assert_equal false, @root1.descendant_of?(@root_child1)
+    assert_equal false, @root1.descendant_of?(@root_child2)
+    assert_equal false, @root1.descendant_of?(@child1_child)
+
+    assert_equal true, @root_child1.descendant_of?(@root1)
+    assert_equal true, @root_child2.descendant_of?(@root1)
+    assert_equal true, @child1_child.descendant_of?(@root1)
+
+    assert_equal false, @root1.descendant_of?(@root1)
+    assert_equal false, @root1.descendant_of?(@root2)
+    assert_equal false, @root1.descendant_of?(@root3)
+
+    assert_equal false, @root_child1.descendant_of?(@child1_child)
+    assert_equal true, @child1_child.descendant_of?(@root_child1)
+  end
+
+  def test_child_ids
+    assert_equal [@root_child1.id, @root_child2.id], @root1.child_ids
+    assert_equal [@child1_child.id], @root_child1.child_ids
+  end
+
+  def do_test_descendants_dfs(method, *args)
+    assert_equal [@root_child1, @child1_child, @root_child2], @root1.send(method, *args)
+    assert_equal [@child1_child], @root_child1.send(method, *args)
+  end
+
+  def test_descendants
+    do_test_descendants_dfs('descendants')
+  end
+
+  def test_descendants_classic
+    do_test_descendants_dfs('descendants_classic')
+    do_test_descendants_dfs('descendants', :traversal=>:classic)
+  end
+
+  def test_descendants_dfs
+    do_test_descendants_dfs('descendants_dfs')
+    do_test_descendants_dfs('descendants', :traversal=>:dfs)
+  end
+
+  def test_descendants_dfs_rec
+    do_test_descendants_dfs('descendants_dfs_rec')
+    do_test_descendants_dfs('descendants', :traversal=>:dfs_rec)
+  end
+
+  def do_test_descendants_bfs(method, *params)
+    assert_equal [@root_child1, @root_child2, @child1_child], @root1.send(method, *params)
+    assert_equal [@child1_child], @root_child1.send(method, *params)
+  end
+
+  def test_descendants_bfs
+    do_test_descendants_bfs('descendants_bfs')
+    do_test_descendants_bfs('descendants', :traversal=>:bfs)
+  end
+
+  def test_descendants_bfs_rec
+    do_test_descendants_bfs('descendants_bfs_rec')
+    do_test_descendants_bfs('descendants', :traversal=>:bfs_rec)
+  end
+
+  def do_test_self_and_descendants_dfs(method)
+    assert_equal [@root1, @root_child1, @child1_child, @root_child2], @root1.send(method)
+    assert_equal [@root_child1, @child1_child], @root_child1.send(method)
+  end
+
+  def test_self_and_descendants
+    do_test_self_and_descendants_dfs('self_and_descendants')
+  end
+
+  def test_self_and_descendants_dfs
+    do_test_self_and_descendants_dfs('self_and_descendants_dfs')
+  end
+
+  def test_self_and_descendants_bfs
+    assert_equal [@root1, @root_child1, @root_child2, @child1_child], @root1.self_and_descendants_bfs
+    assert_equal [@root_child1, @child1_child], @root_child1.self_and_descendants_bfs
+  end
+
+  def do_test_descendant_ids_dfs(method)
+    assert_equal [@root_child1, @child1_child, @root_child2].map(&:id),
+      @root1.send(method)
+    assert_equal [@child1_child].map(&:id), @root_child1.send(method)
+  end
+
+  def test_descendant_ids
+    do_test_descendant_ids_dfs('descendant_ids')
+  end
+
+  def test_descendant_ids_dfs
+    do_test_descendant_ids_dfs('descendant_ids_dfs')
+  end
+
+  def test_descendant_ids_dfs_rec
+    do_test_descendant_ids_dfs('descendant_ids_dfs_rec')
+  end
+
+  def do_test_descendant_ids_bfs(method)
+    assert_equal [@root_child1, @root_child2, @child1_child].map(&:id),
+      @root1.send(method)
+    assert_equal [@child1_child].map(&:id), @root_child1.send(method)
+  end
+
+  def test_descendant_ids_bfs
+    do_test_descendant_ids_bfs('descendant_ids_bfs')
+  end
+
+  def test_descendant_ids_bfs_rec
+    do_test_descendant_ids_bfs('descendant_ids_bfs_rec')
+  end
+
+  def do_test_descendants_count(counter)
+    assert_equal 3, @root1.send(counter)
+    assert_equal 0, @root2.send(counter)
+    assert_equal 0, @root3.send(counter)
+    assert_equal 1, @root_child1.send(counter)
+    assert_equal 0, @root_child2.send(counter)
+    assert_equal 0, @child1_child.send(counter)
+  end
+
+  def test_descendants_count
+    do_test_descendants_count(:descendants_count)
+  end
+
+  def test_descendants_count_dfs
+    do_test_descendants_count(:descendants_count_dfs)
+  end
+
+  def test_descendants_count_bfs
+    do_test_descendants_count(:descendants_count_bfs)
+  end
+
+  def test_descendants_count_dfs_rec
+    do_test_descendants_count(:descendants_count_dfs_rec)
+  end
+
+  def test_descendants_count_bfs_rec
+    do_test_descendants_count(:descendants_count_bfs_rec)
+  end
+end
+
+class TreeTestWithCounterCache < Test::Unit::TestCase
+  def setup
+    teardown_db
+    setup_db
+    @root = TreeMixinWithCounterCache.create!
+    @child1 = TreeMixinWithCounterCache.create! :parent_id => @root.id
+    @child1_child1 = TreeMixinWithCounterCache.create! :parent_id => @child1.id
+    @child2 = TreeMixinWithCounterCache.create! :parent_id => @root.id
+  end
+
+  def teardown
+    teardown_db
+  end
+
+  def test_counter_cache
+    assert_equal 2, @root.reload.children_count
+    assert_equal 1, @child1.reload.children_count
+  end
+
+  def test_update_parents_counter_cache
+    @child1_child1.update_attributes(:parent_id => @root.id)
+    assert_equal 3, @root.reload.children_count
+    assert_equal 0, @child1.reload.children_count
+  end
+
+end
+
+
+class TreeTestWithEagerLoading < Test::Unit::TestCase
+
+  def setup
+    teardown_db
+    setup_db
+    @root1 = TreeMixin.create!
+    @root_child1 = TreeMixin.create! :parent_id => @root1.id
+    @child1_child = TreeMixin.create! :parent_id => @root_child1.id
+    @root_child2 = TreeMixin.create! :parent_id => @root1.id
+    @root2 = TreeMixin.create!
+    @root3 = TreeMixin.create!
+
+    @rc1 = RecursivelyCascadedTreeMixin.create!
+    @rc2 = RecursivelyCascadedTreeMixin.create! :parent_id => @rc1.id
+    @rc3 = RecursivelyCascadedTreeMixin.create! :parent_id => @rc2.id
+    @rc4 = RecursivelyCascadedTreeMixin.create! :parent_id => @rc3.id
+  end
+
+  def teardown
+    teardown_db
+  end
+
+  def test_eager_association_loading
+    roots = TreeMixin.find(:all, :include => :children, :conditions => "mixins.parent_id IS NULL", :order => "mixins.id")
+    assert_equal [@root1, @root2, @root3], roots
+    assert_no_queries do
+      assert_equal 2, roots[0].children.count
+      assert_equal 0, roots[1].children.count
+      assert_equal 0, roots[2].children.count
+    end
+  end
+
+  def test_eager_association_loading_with_recursive_cascading_three_levels_has_many
+    root_node = RecursivelyCascadedTreeMixin.find(:first, :include => { :children => { :children => :children } }, :order => 'mixins.id')
+    assert_equal @rc4, assert_no_queries { root_node.children.first.children.first.children.first }
+  end
+
+  def test_eager_association_loading_with_recursive_cascading_three_levels_has_one
+    root_node = RecursivelyCascadedTreeMixin.find(:first, :include => { :first_child => { :first_child => :first_child } }, :order => 'mixins.id')
+    assert_equal @rc4, assert_no_queries { root_node.first_child.first_child.first_child }
+  end
+
+  def test_eager_association_loading_with_recursive_cascading_three_levels_belongs_to
+    leaf_node = RecursivelyCascadedTreeMixin.find(:first, :include => { :parent => { :parent => :parent } }, :order => 'mixins.id DESC')
+    assert_equal @rc1, assert_no_queries { leaf_node.parent.parent.parent }
+  end
+end
+
+class TreeTestWithoutOrder < Test::Unit::TestCase
+
+  def setup
+    setup_db
+    @root1 = TreeMixinWithoutOrder.create!
+    @root2 = TreeMixinWithoutOrder.create!
+  end
+
+  def teardown
+    teardown_db
+  end
+
+  def test_root
+    assert [@root1, @root2].include?(TreeMixinWithoutOrder.root)
+  end
+
+  def test_roots
+    assert_equal [], [@root1, @root2] - TreeMixinWithoutOrder.roots
+  end
+end

metadata

@@ -0,0 +1,56 @@
+--- !ruby/object:Gem::Specification
+name: acts_as_happy_tree
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+  prerelease: 
+platform: ruby
+authors:
+- David Heinemeier Hansson
+- Jim Gay
+- thoughtafter
+- and others
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-08-18 00:00:00.000000000 Z
+dependencies: []
+description: Forked from acts_as_tree this should be a drop in replacement but with
+  more features and tuned for performance and efficiency.
+email: thoughtafter@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files:
+- README
+files:
+- README
+- Rakefile
+- VERSION
+- acts_as_happy_tree.gemspec
+- init.rb
+- rails/init.rb
+- test/acts_as_happy_tree_test.rb
+homepage: http://github.com/thoughtafter/acts_as_happy_tree
+licenses: []
+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.11
+signing_key: 
+specification_version: 3
+summary: acts_as_happy_tree gem
+test_files: []