locomotive_mongoid_acts_as_tree 0.1.5.1

data/.document

@@ -0,0 +1,5 @@
+README.rdoc
+lib/**/*.rb
+bin/*
+features/**/*.feature
+LICENSE

data/.gitignore

@@ -0,0 +1,21 @@
+## MAC OS
+.DS_Store
+
+## TEXTMATE
+*.tmproj
+tmtags
+
+## EMACS
+*~
+\#*
+.\#*
+
+## VIM
+*.swp
+
+## PROJECT::GENERAL
+coverage
+rdoc
+pkg
+
+## PROJECT::SPECIFIC

data/CHANGELOG

@@ -0,0 +1,27 @@
+*0.1.4 (July 5th 2010)*
+*parent_id attribute accessor acts as expected
+
+*0.1.3 (June 15th, 2010)*
+*patch from joshuabowers (http://github.com/saks/mongoid_acts_as_tree/commit/a98bb62746b71692853a91de7eb35ac55c19bf11)
+
+*0.1.2 (April 5th, 2010)*
+
+*Dependencies updated
+
+*0.1.1 (April 5th, 2010)*
+
+*Imroved #children.delete()
+
+*Add #children.clear, #children=, #children.replace
+
+*Ruby1.8.7p174 compatible
+
+*Ruby1.9.1p243 compatible
+
+
+*0.1.0 (April 4th, 2010)*
+
+*Support for Mongoid instead of mongo-mapper
+
+*Proxy object #children added with methods: <<, delete
+

data/LICENSE

@@ -0,0 +1,20 @@
+Copyright (c) 2009 Jakob Vidmar
+
+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/README.rdoc

@@ -0,0 +1,48 @@
+= mongoid-acts_as_tree
+
+This is an implementation of a tree structure for Mongoid.
+
+== Installation
+
+Install as gem
+
+  gem install mongoid_acts_as_tree
+
+== Usage
+
+Enable the tree functionality by declaring acts_as_tree on your model
+
+  class Category
+    include Mongoid::Document
+    include Mongoid::Acts::Tree
+
+    field :name, :type => String
+
+    acts_as_tree
+  end
+
+The method accepts :parent_id_field, :path_field, :depth_field, :order as a hash.
+
+  :parent_id_field, :path_field, :depth_field => override the default field names
+  :order => control the order (format ['value', 'asc'] or [['field_1', 'asc'], ['field_2', 'desc']])
+
+Check the test_tree.rb for examples.
+
+== About bugs
+
+Use it. If you find any bugs, contact me (if possible with a test case) or patch it yourself (see next section).
+
+== Note on Patches/Pull Requests
+
+* Fork the project.
+* Make your feature addition or bug fix.
+* Add tests for it. This is important so I don't break it in a
+  future version unintentionally.
+* 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 I can ignore when I pull)
+* Send me a pull request. Bonus points for topic branches.
+
+== Copyright
+
+Copyright (c) 2009 Jakob Vidmar. See LICENSE for details.
+

data/Rakefile

@@ -0,0 +1,48 @@
+require 'rubygems'
+require 'rake'
+require 'rake/gempackagetask'
+
+gemspec = eval(File.read('locomotive_mongoid_acts_as_tree.gemspec'))
+Rake::GemPackageTask.new(gemspec) do |pkg|
+  pkg.gem_spec = gemspec
+end
+
+desc "build the gem and release it to rubygems.org"
+task :release => :gem do
+  sh "gem push pkg/locomotive_mongoid_acts_as_tree-#{gemspec.version}.gem"
+end
+
+require 'rake/testtask'
+Rake::TestTask.new(:test) do |test|
+  test.libs << 'lib' << 'test'
+  test.pattern = 'test/**/test_*.rb'
+  test.verbose = true
+end
+
+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|
+  version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "mongoid_acts_as_tree #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end
+

data/VERSION

@@ -0,0 +1 @@
+0.1.5.1

data/lib/mongoid_acts_as_tree.rb

@@ -0,0 +1,275 @@
+require "mongoid"
+
+module Mongoid
+  module Acts
+    module Tree
+      def self.included(model)
+        model.class_eval do
+          extend InitializerMethods
+        end
+      end
+
+      module InitializerMethods
+        def acts_as_tree(options = {})
+          options = {
+            :parent_id_field => "parent_id",
+            :path_field      => "path",
+            :depth_field     => "depth"
+          }.merge(options)
+
+          write_inheritable_attribute :acts_as_tree_options, options
+          class_inheritable_reader :acts_as_tree_options
+
+          include InstanceMethods
+          include Fields
+          extend Fields
+          extend ClassMethods
+
+          field parent_id_field, :type => BSON::ObjectId
+          field path_field, :type => Array,  :default => [], :index => true
+          field depth_field, :type => Integer, :default => 0
+
+          self.class_eval do
+            define_method "#{parent_id_field}=" do | new_parent_id |
+              if new_parent_id.present?
+                new_parent = self.class.find new_parent_id
+                new_parent.children.push self, false
+              else
+                self.write_attribute parent_id_field, nil
+                self[path_field] = []
+                self[depth_field] = 0
+              end
+            end
+          end
+
+          after_save      :move_children
+          validate        :will_save_tree
+          before_destroy  :destroy_descendants
+        end
+      end
+
+      module ClassMethods
+        def roots
+          self.where(parent_id_field => nil).order_by tree_order
+        end
+      end
+
+      module InstanceMethods
+        def [](field_name)
+          self.send field_name
+        end
+
+        def []=(field_name, value)
+          self.send "#{field_name}=", value
+        end
+
+        def ==(other)
+          return true if other.equal?(self)
+          return true if other.instance_of?(self.class) and other._id == self._id
+          false
+        end
+
+        def will_save_tree
+          if @_cyclic
+            errors.add(:base, "Can't be children of a descendant")
+          end
+        end
+
+        def fix_position
+          if parent.nil?
+            self.write_attribute parent_id_field, nil
+            self[path_field] = []
+            self[depth_field] = 0
+          else
+            self.write_attribute parent_id_field, parent._id
+            self[path_field] = parent[path_field] + [parent._id]
+            self[depth_field] = parent[depth_field] + 1
+            self.save
+          end
+        end
+
+        def parent
+          @_parent or (self[parent_id_field].nil? ? nil : self.class.find(self[parent_id_field]))
+        end
+
+        def root?
+          self[parent_id_field].nil?
+        end
+
+        def root
+          self[path_field].first.nil? ? self : self.class.find(self[path_field].first)
+        end
+
+        def ancestors
+          return [] if root?
+          self.class.where(:_id.in => self[path_field]).order_by(depth_field)
+        end
+
+        def self_and_ancestors
+          ancestors << self
+        end
+
+        def siblings
+          self.class.where(:_id.ne => self._id, parent_id_field => self[parent_id_field]).order_by tree_order
+        end
+
+        def self_and_siblings
+          self.class.where(parent_id_field => self[parent_id_field]).order_by tree_order
+        end
+
+        def children
+          Children.new self
+        end
+
+        def children=(new_children_list)
+          self.children.clear
+          new_children_list.each do | child |
+            self.children << child
+          end
+        end
+
+        alias replace children=
+
+        def descendants
+          # workorund for mongoid unexpected behavior
+          _new_record_var = self.instance_variable_get(:@new_record)
+          _new_record = _new_record_var != false
+
+          return [] if _new_record
+          self.class.all_in(path_field => [self._id]).order_by tree_order
+        end
+
+        def self_and_descendants
+          [self] + self.descendants
+        end
+
+        def is_ancestor_of?(other)
+          other[path_field].include?(self._id)
+        end
+
+        def is_or_is_ancestor_of?(other)
+          (other == self) or is_ancestor_of?(other)
+        end
+
+        def is_descendant_of?(other)
+          self[path_field].include?(other._id)
+        end
+
+        def is_or_is_descendant_of?(other)
+          (other == self) or is_descendant_of?(other)
+        end
+
+        def is_sibling_of?(other)
+          (other != self) and (other[parent_id_field] == self[parent_id_field])
+        end
+
+        def is_or_is_sibling_of?(other)
+          (other == self) or is_sibling_of?(other)
+        end
+
+        def move_children
+
+          if @_will_move
+            @_will_move = false
+            self.children.each do | child |
+              child.fix_position
+              child.save
+            end
+            @_will_move = true
+          end
+        end
+
+        def destroy_descendants
+          self.descendants.each &:destroy
+        end
+      end
+
+      #proxy class
+      class Children < Array
+        #TODO: improve accessors to options to eliminate object[object.parent_id_field]
+
+        def initialize(owner)
+          @parent = owner
+          self.concat find_children_for_owner.to_a
+        end
+
+        #Add new child to list of object children
+        def <<(object, will_save=true)
+          if object.descendants.include? @parent
+            object.instance_variable_set :@_cyclic, true
+          else
+            object.write_attribute object.parent_id_field, @parent._id
+            object[object.path_field] = @parent[@parent.path_field] + [@parent._id]
+            object[object.depth_field] = @parent[@parent.depth_field] + 1
+            object.instance_variable_set :@_will_move, true
+            object.save if will_save
+          end
+
+          super(object)
+        end
+
+        def build(attributes)
+          child = @parent.class.new(attributes)
+          self.push child
+          child
+        end
+
+        alias create build
+
+        alias push <<
+
+        #Deletes object only from children list.
+        #To delete object use <tt>object.destroy</tt>.
+        def delete(object_or_id)
+          object = case object_or_id
+            when String, BSON::ObjectId
+              @parent.class.find object_or_id
+            else
+              object_or_id
+          end
+
+          object.write_attribute object.parent_id_field, nil
+          object[object.path_field]      = []
+          object[object.depth_field]     = 0
+          object.save
+
+          super(object)
+        end
+
+        #Clear children list
+        def clear
+          self.each do | child |
+            @parent.children.delete child
+          end
+        end
+
+        private
+
+        def find_children_for_owner
+          @parent.class.where(@parent.parent_id_field => @parent.id).
+            order_by @parent.tree_order
+        end
+
+      end
+
+      module Fields
+        def parent_id_field
+          acts_as_tree_options[:parent_id_field]
+        end
+
+        def path_field
+          acts_as_tree_options[:path_field]
+        end
+
+        def depth_field
+          acts_as_tree_options[:depth_field]
+        end
+
+        def tree_order
+          acts_as_tree_options[:order] or []
+        end
+      end
+    end
+  end
+end
+

data/locomotive_mongoid_acts_as_tree.gemspec

@@ -0,0 +1,68 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run the gemspec command
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{locomotive_mongoid_acts_as_tree}
+  s.version = "0.1.5.1"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Jakob Vidmar, Aliaksandr Rahalevich"]
+  s.date = %q{2010-10-13}
+  s.description = %q{Port of the old, venerable ActsAsTree with a bit of a twist}
+  s.email = ["saksmlz@gmail.com", "didier@nocoffee.fr"]
+  s.extra_rdoc_files = [
+    "LICENSE",
+     "README.rdoc"
+  ]
+  s.files = [
+    ".document",
+     ".gitignore",
+     "CHANGELOG",
+     "LICENSE",
+     "README.rdoc",
+     "Rakefile",
+     "VERSION",
+     "lib/mongoid_acts_as_tree.rb",
+     "locomotive_mongoid_acts_as_tree.gemspec",
+     "mongoid_acts_as_tree.gemspec",
+     "test/helper.rb",
+     "test/models/category.rb",
+     "test/models/ordered_category.rb",
+     "test/test_order.rb",
+     "test/test_tree.rb"
+  ]
+  s.homepage = %q{http://github.com/saks/mongoid_acts_as_tree}
+  s.rdoc_options = ["--charset=UTF-8"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = %q{1.3.7}
+  s.summary = %q{ActsAsTree plugin for Mongoid}
+  s.test_files = [
+    "test/helper.rb",
+     "test/models/category.rb",
+     "test/models/ordered_category.rb",
+     "test/test_order.rb",
+     "test/test_tree.rb"
+  ]
+
+  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
+      s.add_runtime_dependency(%q<mongoid>, ["<= 2.0.0.beta.19"])
+      s.add_runtime_dependency(%q<bson>, [">= 0.20.1"])
+      s.add_development_dependency(%q<shoulda>, [">= 2.10.2"])
+    else
+      s.add_dependency(%q<mongoid>, ["<= 2.0.0.beta.19"])
+      s.add_dependency(%q<bson>, [">= 0.20.1"])
+      s.add_dependency(%q<shoulda>, [">= 2.10.2"])
+    end
+  else
+    s.add_dependency(%q<mongoid>, ["<= 2.0.0.beta.19"])
+    s.add_dependency(%q<bson>, [">= 0.20.1"])
+    s.add_dependency(%q<shoulda>, [">= 2.10.2"])
+  end
+end
+

data/mongoid_acts_as_tree.gemspec

@@ -0,0 +1,67 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run the gemspec command
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{mongoid_acts_as_tree}
+  s.version = "0.1.5.1"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Jakob Vidmar, Aliaksandr Rahalevich"]
+  s.date = %q{2010-10-13}
+  s.description = %q{Port of the old, venerable ActsAsTree with a bit of a twist}
+  s.email = ["saksmlz@gmail.com", "didier@nocoffee.fr"]
+  s.extra_rdoc_files = [
+    "LICENSE",
+     "README.rdoc"
+  ]
+  s.files = [
+    ".document",
+     ".gitignore",
+     "CHANGELOG",
+     "LICENSE",
+     "README.rdoc",
+     "Rakefile",
+     "VERSION",
+     "lib/mongoid_acts_as_tree.rb",
+     "mongoid_acts_as_tree.gemspec",
+     "test/helper.rb",
+     "test/models/category.rb",
+     "test/models/ordered_category.rb",
+     "test/test_order.rb",
+     "test/test_tree.rb"
+  ]
+  s.homepage = %q{http://github.com/saks/mongoid_acts_as_tree}
+  s.rdoc_options = ["--charset=UTF-8"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = %q{1.3.7}
+  s.summary = %q{ActsAsTree plugin for Mongoid}
+  s.test_files = [
+    "test/helper.rb",
+     "test/models/category.rb",
+     "test/models/ordered_category.rb",
+     "test/test_order.rb",
+     "test/test_tree.rb"
+  ]
+
+  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
+      s.add_runtime_dependency(%q<mongoid>, ["<= 2.0.0.beta.19"])
+      s.add_runtime_dependency(%q<bson>, [">= 0.20.1"])
+      s.add_development_dependency(%q<shoulda>, [">= 2.10.2"])
+    else
+      s.add_dependency(%q<mongoid>, ["<= 2.0.0.beta.19"])
+      s.add_dependency(%q<bson>, [">= 0.20.1"])
+      s.add_dependency(%q<shoulda>, [">= 2.10.2"])
+    end
+  else
+    s.add_dependency(%q<mongoid>, ["<= 2.0.0.beta.19"])
+    s.add_dependency(%q<bson>, [">= 0.20.1"])
+    s.add_dependency(%q<shoulda>, [">= 2.10.2"])
+  end
+end
+

data/test/helper.rb

@@ -0,0 +1,33 @@
+require 'rubygems'
+require 'test/unit'
+require 'shoulda'
+
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'mongoid'
+
+Mongoid.configure.master = Mongo::Connection.new.db('acts_as_tree-test')
+
+Dir["#{File.dirname(__FILE__)}/models/*.rb"].each {|file| require file}
+
+class Test::Unit::TestCase
+  # Drop all columns after each test case.
+    def teardown
+    Mongoid.database.collections.each do |coll|
+      coll.remove
+    end
+  end
+
+  # Make sure that each test case has a teardown
+  # method to clear the db after each test.
+  def inherited(base)
+    base.define_method teardown do
+      super
+    end
+  end
+
+  def eql_arrays?(first, second)
+    first.map{|i| i._id}.to_set == second.map{|i| i._id}.to_set
+  end
+end
+

data/test/models/category.rb

@@ -0,0 +1,12 @@
+require "mongoid"
+require "mongoid_acts_as_tree"
+
+class Category
+  include Mongoid::Document
+  include Mongoid::Acts::Tree
+
+  field :name, :type => String
+
+  acts_as_tree
+end
+

data/test/models/ordered_category.rb

@@ -0,0 +1,13 @@
+require "mongoid"
+require "mongoid_acts_as_tree"
+
+class OrderedCategory
+  include Mongoid::Document
+  include Mongoid::Acts::Tree
+
+  field :name, :type => String
+  field :value, :type => Integer
+
+  acts_as_tree :order => [['value', 'asc']]
+end
+

data/test/test_order.rb

@@ -0,0 +1,35 @@
+require 'helper'
+require 'set'
+
+class TestMongoidActsAsTree < Test::Unit::TestCase
+  context "Ordered tree" do
+    setup do
+      @root_1     = OrderedCategory.create(:name => "Root 1", :value => 2)
+      @child_1    = OrderedCategory.create(:name => "Child 1", :value => 1)
+      @child_2    = OrderedCategory.create(:name => "Child 2", :value => 9)
+      @child_2_1  = OrderedCategory.create(:name => "Child 2.1", :value => 2)
+
+      @child_3    = OrderedCategory.create(:name => "Child 3", :value => 5)
+      @root_2     = OrderedCategory.create(:name => "Root 2", :value => 1)
+
+      @root_1.children << @child_1
+      @root_1.children << @child_2
+      @root_1.children << @child_3
+
+      @child_2.children << @child_2_1
+    end
+
+    should "be in order" do
+      assert_equal OrderedCategory.roots.to_a, [@root_2, @root_1]
+      assert_equal @root_1.children, [@child_1, @child_3, @child_2]
+
+      assert_equal @root_1.descendants, [@child_1, @child_2_1, @child_3, @child_2]
+      assert_equal @root_1.self_and_descendants, [@root_1, @child_1, @child_2_1, @child_3, @child_2]
+
+      assert_equal @child_2.siblings, [@child_1, @child_3]
+      assert_equal @child_2.self_and_siblings, [@child_1, @child_3, @child_2]
+      assert_equal @root_1.self_and_siblings, [@root_2, @root_1]
+    end
+  end
+end
+

data/test/test_tree.rb

@@ -0,0 +1,237 @@
+require 'helper'
+require 'set'
+
+$verbose = false
+
+class TestMongoidActsAsTree < Test::Unit::TestCase
+  context "Tree" do
+    setup do
+      @root_1     = Category.create(:name => "Root 1")
+      @child_1    = Category.create(:name => "Child 1")
+      @child_2    = Category.create(:name => "Child 2")
+      @child_2_1  = Category.create(:name => "Child 2.1")
+
+      @child_3    = Category.create(:name => "Child 3")
+      @root_2     = Category.create(:name => "Root 2")
+
+      @root_1.children << @child_1
+      @root_1.children << @child_2
+      @root_1.children << @child_3
+
+      @child_2.children << @child_2_1
+    end
+
+    should "add child via create or build" do
+      @root_1.children.build :name => "Child 2.2"
+      assert Category.where(:name => "Child 2.2").first.parent == @root_1
+    end
+
+   	should "add child via <<" do
+   		child = Category.create(:name => "Child 2.2")
+   		@root_1.children << child
+			assert child.parent == @root_1
+		end
+
+		should "delete child" do
+			@root_1.children.delete @child_1
+			assert_equal(2, @root_1.children.size)
+			@root_1.children.delete @child_2.id
+			assert_equal(@child_3, @root_1.children.first)
+		end
+
+		should "clear children list" do
+			@root_1.children.clear
+			assert_equal([], @root_1.children)
+		end
+
+		should "replace children list" do
+			new_children_list = [Category.create(:name => "test 1"), Category.create(:name => "test 2")]
+
+			@root_1.children = new_children_list
+			assert_equal(new_children_list, @root_1.children)
+
+			@root_1.children = []
+			assert_equal([], @root_1.children)
+		end
+
+    should "have roots" do
+      assert eql_arrays?(Category.roots, [@root_1, @root_2])
+    end
+
+		should "assign parent_id" do
+			child  = Category.create :name => 'child'
+			parent = Category.create :name => 'parent'
+
+			child.parent_id = parent.id
+			child.save
+
+			assert_equal parent.children.first.id, child.id
+			assert_equal parent.id, child.parent_id
+			assert parent.children.include? child
+
+			assert_equal 1, child.depth
+			assert_equal [parent.id], child.path
+
+			more_deep_child = Category.new(
+				:name => 'more deep child',
+				:parent_id => child.id
+			)
+
+			assert more_deep_child.new_record?
+			more_deep_child.save
+			assert !more_deep_child.new_record?
+
+			assert_equal child.children.first.id, more_deep_child.id
+			assert_equal child.id, more_deep_child.parent_id
+			assert child.children.include? more_deep_child
+
+			assert_equal 2, more_deep_child.depth
+			assert_equal [parent.id, child.id], more_deep_child.path
+
+			assert parent.descendants.include? child
+			assert parent.descendants.include? more_deep_child
+
+			assert more_deep_child.ancestors.include? child
+			assert more_deep_child.ancestors.include? parent
+		end
+
+		should "assign blank parent_id" do
+			@child_1.parent_id = ''
+			@child_1.save
+
+			assert_nil @child_1.reload.parent_id
+			assert_equal 0, @child_1.depth
+			assert_equal [], @child_1.path
+
+			@child_1.parent_id = nil
+			@child_1.save
+
+			assert_nil @child_1.reload.parent_id
+			assert_equal 0, @child_1.depth
+			assert_equal [], @child_1.path
+		end
+
+    context "node" do
+      should "have a root" do
+        assert_equal @root_1.root, @root_1
+        assert_not_equal @root_1.root, @root_2.root
+        assert_equal @root_1, @child_2_1.root
+      end
+
+      should "have ancestors" do
+        assert_equal @root_1.ancestors, []
+        assert_equal @child_2.ancestors, [@root_1]
+        assert_equal @child_2_1.ancestors, [@root_1, @child_2]
+        assert_equal @root_1.self_and_ancestors, [@root_1]
+        assert_equal @child_2.self_and_ancestors, [@root_1, @child_2]
+        assert_equal @child_2_1.self_and_ancestors, [@root_1, @child_2, @child_2_1]
+      end
+
+      should "have siblings" do
+        assert eql_arrays?(@root_1.siblings, [@root_2])
+        assert eql_arrays?(@child_2.siblings, [@child_1, @child_3])
+        assert eql_arrays?(@child_2_1.siblings, [])
+        assert eql_arrays?(@root_1.self_and_siblings, [@root_1, @root_2])
+        assert eql_arrays?(@child_2.self_and_siblings, [@child_1, @child_2, @child_3])
+        assert eql_arrays?(@child_2_1.self_and_siblings, [@child_2_1])
+      end
+
+      should "set depth" do
+        assert_equal 0, @root_1.depth
+        assert_equal 1, @child_1.depth
+        assert_equal 2, @child_2_1.depth
+      end
+
+      should "have children" do
+        assert @child_2_1.children.empty?
+        assert eql_arrays?(@root_1.children, [@child_1, @child_2, @child_3])
+      end
+
+      should "have descendants" do
+        assert eql_arrays?(@root_1.descendants, [@child_1, @child_2, @child_3, @child_2_1])
+        assert eql_arrays?(@child_2.descendants, [@child_2_1])
+        assert @child_2_1.descendants.empty?
+        assert eql_arrays?(@root_1.self_and_descendants, [@root_1, @child_1, @child_2, @child_3, @child_2_1])
+        assert eql_arrays?(@child_2.self_and_descendants, [@child_2, @child_2_1])
+        assert eql_arrays?(@child_2_1.self_and_descendants, [@child_2_1])
+      end
+
+      should "be able to tell if ancestor" do
+        assert @root_1.is_ancestor_of?(@child_1)
+        assert !@root_2.is_ancestor_of?(@child_2_1)
+        assert !@child_2.is_ancestor_of?(@child_2)
+
+        assert @root_1.is_or_is_ancestor_of?(@child_1)
+        assert !@root_2.is_or_is_ancestor_of?(@child_2_1)
+        assert @child_2.is_or_is_ancestor_of?(@child_2)
+      end
+
+      should "be able to tell if descendant" do
+        assert !@root_1.is_descendant_of?(@child_1)
+        assert @child_1.is_descendant_of?(@root_1)
+        assert !@child_2.is_descendant_of?(@child_2)
+
+        assert !@root_1.is_or_is_descendant_of?(@child_1)
+        assert @child_1.is_or_is_descendant_of?(@root_1)
+        assert @child_2.is_or_is_descendant_of?(@child_2)
+      end
+
+      should "be able to tell if sibling" do
+        assert !@root_1.is_sibling_of?(@child_1)
+        assert !@child_1.is_sibling_of?(@child_1)
+        assert !@child_2.is_sibling_of?(@child_2)
+
+        assert !@root_1.is_or_is_sibling_of?(@child_1)
+        assert @child_1.is_or_is_sibling_of?(@child_2)
+        assert @child_2.is_or_is_sibling_of?(@child_2)
+      end
+
+      context "when moving" do
+        should "recalculate path and depth" do
+					@child_2.children << @child_3
+          @child_3.save
+
+          assert @child_2.is_or_is_ancestor_of?(@child_3)
+          assert @child_3.is_or_is_descendant_of?(@child_2)
+          assert @child_2.children.include?(@child_3)
+          assert @child_2.descendants.include?(@child_3)
+          assert @child_2_1.is_or_is_sibling_of?(@child_3)
+          assert_equal 2, @child_3.depth
+        end
+
+        should "move children on save" do
+					@root_2.children << @child_2
+
+					@child_2_1.reload
+
+          assert @root_2.is_or_is_ancestor_of?(@child_2_1)
+          assert @child_2_1.is_or_is_descendant_of?(@root_2)
+          assert @root_2.descendants.include?(@child_2_1)
+        end
+
+        should "check against cyclic graph" do
+          @child_2_1.children << @root_1
+          assert !@root_1.save
+        end
+      end
+
+      should "destroy descendants when destroyed" do
+        @child_2.destroy
+        assert_nil Category.where(:id => @child_2_1._id).first
+      end
+    end
+
+    context "root node" do
+      should "not have a parent" do
+        assert_nil @root_1.parent
+      end
+    end
+
+    context "child_node" do
+      should "have a parent" do
+        assert_equal @child_2, @child_2_1.parent
+      end
+    end
+  end
+end
+

metadata

@@ -0,0 +1,138 @@
+--- !ruby/object:Gem::Specification 
+name: locomotive_mongoid_acts_as_tree
+version: !ruby/object:Gem::Version 
+  hash: 81
+  prerelease: false
+  segments: 
+  - 0
+  - 1
+  - 5
+  - 1
+  version: 0.1.5.1
+platform: ruby
+authors: 
+- Jakob Vidmar, Aliaksandr Rahalevich
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-10-13 00:00:00 +02:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: mongoid
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - <=
+      - !ruby/object:Gem::Version 
+        hash: 62196421
+        segments: 
+        - 2
+        - 0
+        - 0
+        - beta
+        - 19
+        version: 2.0.0.beta.19
+  type: :runtime
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: bson
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 77
+        segments: 
+        - 0
+        - 20
+        - 1
+        version: 0.20.1
+  type: :runtime
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: shoulda
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 35
+        segments: 
+        - 2
+        - 10
+        - 2
+        version: 2.10.2
+  type: :development
+  version_requirements: *id003
+description: Port of the old, venerable ActsAsTree with a bit of a twist
+email: 
+- saksmlz@gmail.com
+- didier@nocoffee.fr
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- LICENSE
+- README.rdoc
+files: 
+- .document
+- .gitignore
+- CHANGELOG
+- LICENSE
+- README.rdoc
+- Rakefile
+- VERSION
+- lib/mongoid_acts_as_tree.rb
+- locomotive_mongoid_acts_as_tree.gemspec
+- mongoid_acts_as_tree.gemspec
+- test/helper.rb
+- test/models/category.rb
+- test/models/ordered_category.rb
+- test/test_order.rb
+- test/test_tree.rb
+has_rdoc: true
+homepage: http://github.com/saks/mongoid_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.3.7
+signing_key: 
+specification_version: 3
+summary: ActsAsTree plugin for Mongoid
+test_files: 
+- test/helper.rb
+- test/models/category.rb
+- test/models/ordered_category.rb
+- test/test_order.rb
+- test/test_tree.rb