acts_as_tree-1.8 1.1.0

data/.gitignore

@@ -0,0 +1,5 @@
+*.gem
+.bundle
+pkg/*
+.rvmrc
+Gemfile.lock

data/.travis.yml

@@ -0,0 +1,5 @@
+language: ruby
+rvm:
+  - 1.9.2
+  - 1.9.3
+  - ruby-head

data/Gemfile

@@ -0,0 +1,7 @@
+source :rubygems
+
+gemspec
+
+group :test do
+  gem 'rake'
+end

data/README.md

@@ -0,0 +1,76 @@
+# ActsAsTree [![Build Status](https://secure.travis-ci.org/amerine/acts_as_tree.png?branch=master)][travis] [![Dependency Status](https://gemnasium.com/amerine/acts_as_tree.png?travis)][gemnasium]
+[travis]: (http://travis-ci.org/amerine/acts_as_tree)
+[gemnasium]: (https://gemnasium.com/amerine/acts_as_tree)
+
+
+ActsAsTree extends ActiveRecord to add simple support for organizing items into
+parent–children relationships.
+
+## Example
+
+    class Category < ActiveRecord::Base
+      include ActsAsTree
+
+      acts_as_tree order: "name"
+    end
+
+    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
+
+## Compatibility
+
+We no longer support Ruby 1.8 or versions if Rails/ActiveRecord older than 3.0. If you're using a version of ActiveRecord older than 3.0 please use 0.1.1.
+
+Moving forward we will do our best to support the latest versions of ActiveRecord and Ruby.
+
+## Change Log
+* 1.1.0 - April 24th, 2012
+	* Deprecate the ActiveRecord::Acts::Tree module in favor of ActsAsTree
+* 1.0.1 - April 18th, 2012
+	* Include the Railtie for easier loading in Rails. Will reassess the forced module inclusion in the future.
+* 1.0.0 - April 14th, 2012
+	* Official 1.0 release. Force users to include the ActiveRecord::Acts::Tree module.
+* 0.2.0 - April 9, 2012
+	* Rails 3 Support
+* 0.1.1 - February 3, 2010
+	* Bug Fixes
+* 0.1.0 - October 9th, 2009
+	* First Gem Release
+
+## Note on Patches/Pull Requests
+
+1. Fork the project.
+2. Make your feature addition or bug fix.
+3. Add tests for it. This is important so we don't break it in a future version
+   unintentionally.
+4. Commit, do not mess with rakefile, version, or history. (if you want to have
+   your own version, that is fine but bump version in a commit by itself so we can
+   ignore when we pull)
+5. Send us a pull request. Bonus points for topic branches.
+
+## License (MIT)
+
+Copyright (c) 2007 David Heinemeier Hansson
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the 'Software'), to deal in the
+Software without restriction, including without limitation the rights to use,
+copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
+Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/Rakefile

@@ -0,0 +1,21 @@
+require 'bundler/gem_tasks'
+
+desc "Run the tests."
+task :test do
+  $: << "lib" << "test"
+  Dir["test/*_test.rb"].each { |f| require f[5..-4] }
+end
+
+task :default => :test
+
+# Run the rdoc task to generate rdocs for this gem
+require 'rdoc/task'
+RDoc::Task.new do |rdoc|
+  require "acts_as_tree/version"
+  version = ActsAsTree::VERSION
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "acts_as_tree-rails3 #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/acts_as_tree.gemspec

@@ -0,0 +1,25 @@
+# -*- encoding: utf-8 -*-
+$:.push File.expand_path("../lib", __FILE__)
+require 'acts_as_tree/version'
+
+Gem::Specification.new do |s|
+  s.name        = 'acts_as_tree-1.8'
+  s.version     = ActsAsTree::VERSION
+  s.authors     = ['Erik Dahlstrand', 'Rails Core', 'Mark Turner', 'Swanand Pagnis']
+  s.email       = ['erik.dahlstrand@gmail.com', 'mark@amerine.net', 'swanand.pagnis@gmail.com']
+  s.homepage    = 'https://github.com/dryade/acts_as_tree'
+  s.summary     = %q{Provides a simple tree behaviour to active_record models.}
+  s.description = %q{A gem that adds simple support for organizing ActiveRecord models into parent–children relationships.}
+
+  s.files         = `git ls-files`.split("\n")
+  s.test_files    = `git ls-files -- {test,features}/*`.split("\n")
+  s.executables   = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
+  s.require_paths = ["lib"]
+  s.rdoc_options  = ["--charset=UTF-8"]
+
+  s.add_dependency "activerecord", ">= 3.0.0"
+
+  # Dependencies (installed via 'bundle install')...
+  s.add_development_dependency "sqlite3"
+  s.add_development_dependency "rdoc"
+end

data/lib/acts_as_tree.rb

@@ -0,0 +1,169 @@
+require 'acts_as_tree/version'
+
+module ActsAsTree
+
+  if defined? Rails::Railtie
+    require 'rails'
+    class Railtie < Rails::Railtie
+      initializer 'acts_as_tree.insert_into_active_record' do
+        ActiveSupport.on_load :active_record do
+          ActsAsTree::Railtie.insert
+        end
+      end
+    end
+  end
+
+  class Railtie
+    def self.insert
+      if defined?(ActiveRecord)
+        ActiveRecord::Base.send(:include, ActsAsTree)
+      end
+    end
+  end
+
+  def self.included(base)
+    base.extend(ClassMethods)
+  end
+
+  # 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
+  #     include ActiveRecord::Acts:Tree
+  #
+  #     acts_as_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
+  #
+  # In addition to the parent and children associations, the following
+  # instance methods are added to the class after calling
+  # <tt>acts_as_tree</tt>:
+  # * <tt>siblings</tt> - Returns all the children of the parent, excluding
+  #                       the current node (<tt>[subchild2]</tt> when called
+  #                       on <tt>subchild1</tt>)
+  # * <tt>self_and_siblings</tt> - Returns all the children of the parent,
+  #                                including the current node (<tt>[subchild1, subchild2]</tt>
+  #                                when called on <tt>subchild1</tt>)
+  # * <tt>ancestors</tt> - Returns all the ancestors of the current node
+  #                        (<tt>[child1, root]</tt> when called on <tt>subchild2</tt>)
+  # * <tt>root</tt> - Returns the root of the current node (<tt>root</tt>
+  #                   when called on <tt>subchild2</tt>)
+  module ClassMethods
+    # Configuration options are:
+    #
+    # * <tt>foreign_key</tt> - specifies the column name to use for tracking
+    #                          of the tree (default: +parent_id+)
+    # * <tt>order</tt> - makes it possible to sort the children according to
+    #                    this SQL snippet.
+    # * <tt>counter_cache</tt> - keeps a count in a +children_count+ column
+    #                            if set to +true+ (default: +false+).
+    def acts_as_tree(options = {})
+      configuration = {
+        :foreign_key =>   "parent_id",
+        :order  =>         nil,
+        :counter_cache => nil,
+        :dependent =>     :destroy
+      }
+
+      configuration.update(options) if options.is_a?(Hash)
+
+      belongs_to :parent, :class_name =>    name,
+        :foreign_key  =>   configuration[:foreign_key],
+        :counter_cache => configuration[:counter_cache],
+        :inverse_of =>    :children
+
+      has_many :children, :class_name =>  name,
+        :foreign_key => configuration[:foreign_key],
+        :order =>       configuration[:order],
+        :dependent =>   configuration[:dependent],
+        :inverse_of =>  :parent
+
+      class_eval <<-EOV
+            include ActsAsTree::InstanceMethods
+
+            after_update :update_parents_counter_cache
+
+            def self.roots
+              order_option = %Q{#{configuration.fetch :order, "nil"}}
+
+              find(:all, :conditions => "#{configuration[:foreign_key]} IS NULL",
+                         :order =>      order_option)
+            end
+
+            def self.root
+              order_option = %Q{#{configuration.fetch :order, "nil"}}
+
+              find(:first, :conditions => "#{configuration[:foreign_key]} IS NULL",
+                           :order =>      order_option)
+            end
+      EOV
+    end
+  end
+
+  module InstanceMethods
+    # Returns list of ancestors, starting from parent until root.
+    #
+    #   subchild1.ancestors # => [child1, root]
+    def ancestors
+      node, nodes = self, []
+      nodes << node = node.parent while node.parent
+      nodes
+    end
+
+    # Returns the root node of the tree.
+    def root
+      node = self
+      node = node.parent while node.parent
+      node
+    end
+
+    # Returns all siblings of the current node.
+    #
+    #   subchild1.siblings # => [subchild2]
+    def siblings
+      self_and_siblings - [self]
+    end
+
+    # Returns all siblings and a reference to the current node.
+    #
+    #   subchild1.self_and_siblings # => [subchild1, subchild2]
+    def self_and_siblings
+      parent ? parent.children : self.class.roots
+    end
+
+    # Returns children (without subchildren) and current node itself.
+    #
+    #   root.self_and_children # => [root, child1]
+    def self_and_children
+      [self] + self.children
+    end
+
+    private
+
+    def update_parents_counter_cache
+      if self.respond_to?(:children_count) && parent_id_changed?
+        self.class.decrement_counter(:children_count, parent_id_was)
+        self.class.increment_counter(:children_count, parent_id)
+      end
+    end
+  end
+end
+
+# Deprecating the following code in the future.
+require 'acts_as_tree/active_record/acts/tree'

data/lib/acts_as_tree/active_record/acts/tree.rb

@@ -0,0 +1,15 @@
+require 'acts_as_tree'
+
+module ActiveRecord
+  module Acts #:nodoc:
+    module Tree
+      include ::ActsAsTree
+
+      def self.included(base)
+        Kernel.warn "[DEPRECATION] The module ActiveRecord::Acts::Tree has moved to ActsAsTree"
+
+        base.extend ::ActsAsTree::ClassMethods
+      end
+    end
+  end
+end

data/lib/acts_as_tree/version.rb

@@ -0,0 +1,3 @@
+module ActsAsTree
+  VERSION = "1.1.0"
+end

data/test/acts_as_tree_test.rb

@@ -0,0 +1,304 @@
+require 'test/unit'
+require 'active_record'
+require 'acts_as_tree'
+
+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
+  include ActsAsTree
+end
+
+class TreeMixin < Mixin
+  acts_as_tree foreign_key: "parent_id", order: "id"
+end
+
+class TreeMixinWithoutOrder < Mixin
+  acts_as_tree foreign_key: "parent_id"
+end
+
+class TreeMixinNullify < Mixin
+  acts_as_tree foreign_key: "parent_id", order: "id", dependent: :nullify
+end
+
+class TreeMixinWithCounterCache < Mixin
+  acts_as_tree foreign_key: "parent_id", order: "id", counter_cache: :children_count
+end
+
+class RecursivelyCascadedTreeMixin < Mixin
+  acts_as_tree foreign_key: "parent_id"
+  has_one :first_child, class_name: 'RecursivelyCascadedTreeMixin', foreign_key: :parent_id
+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
+    @child1_child_child = TreeMixin.create! parent_id: @child1_child.id
+    @root_child2        = TreeMixin.create! parent_id: @root1.id
+    @root2              = TreeMixin.create!
+    @root3              = TreeMixin.create!
+  end
+
+  def teardown
+    teardown_db
+  end
+
+  def test_children
+    assert_equal @root1.children, [@root_child1, @root_child2]
+    assert_equal @root_child1.children, [@child1_child]
+    assert_equal @child1_child.children, [@child1_child_child]
+    assert_equal @child1_child_child.children, []
+    assert_equal @root_child2.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_delete
+    assert_equal 7, 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_root
+    assert_equal @root1, TreeMixin.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_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_self_and_children
+    assert_equal [@root1, @root_child1, @root_child2], @root1.self_and_children
+    assert_equal [@root2], @root2.self_and_children
+  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
+
+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
+
+class UnsavedTreeTest < Test::Unit::TestCase
+  def setup
+    setup_db
+    @root       = TreeMixin.new
+    @root_child = @root.children.build
+  end
+
+  def teardown
+    teardown_db
+  end
+
+  def test_inverse_of
+    # We want children to be aware of their parent before saving either
+    assert_equal @root, @root_child.parent
+  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

metadata

@@ -0,0 +1,123 @@
+--- !ruby/object:Gem::Specification 
+name: acts_as_tree-1.8
+version: !ruby/object:Gem::Version 
+  hash: 19
+  prerelease: 
+  segments: 
+  - 1
+  - 1
+  - 0
+  version: 1.1.0
+platform: ruby
+authors: 
+- Erik Dahlstrand
+- Rails Core
+- Mark Turner
+- Swanand Pagnis
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2013-02-22 00:00:00 Z
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  version_requirements: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 7
+        segments: 
+        - 3
+        - 0
+        - 0
+        version: 3.0.0
+  requirement: *id001
+  type: :runtime
+  prerelease: false
+  name: activerecord
+- !ruby/object:Gem::Dependency 
+  version_requirements: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  requirement: *id002
+  type: :development
+  prerelease: false
+  name: sqlite3
+- !ruby/object:Gem::Dependency 
+  version_requirements: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  requirement: *id003
+  type: :development
+  prerelease: false
+  name: rdoc
+description: "A gem that adds simple support for organizing ActiveRecord models into parent\xE2\x80\x93children relationships."
+email: 
+- erik.dahlstrand@gmail.com
+- mark@amerine.net
+- swanand.pagnis@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- .gitignore
+- .travis.yml
+- Gemfile
+- README.md
+- Rakefile
+- acts_as_tree.gemspec
+- lib/acts_as_tree.rb
+- lib/acts_as_tree/active_record/acts/tree.rb
+- lib/acts_as_tree/version.rb
+- test/acts_as_tree_test.rb
+homepage: https://github.com/dryade/acts_as_tree
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --charset=UTF-8
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: Provides a simple tree behaviour to active_record models.
+test_files: []
+