closure_tree 6.4.0 → 7.2.0

data/spec/fixtures/tags.yml

@@ -1,98 +0,0 @@
-# Read about fixtures at http://api.rubyonrails.org/classes/Fixtures.html
-
-grandparent:
-  name: grandparent
-  title: Nonnie
-
-parent:
-  name: parent
-  parent: grandparent
-  title: Mom
-
-child:
-  name: child
-  parent: parent
-  title: Kid
-
-people:
-  name: people
-
-# people has no children
-
-events:
-  name: events
-
-# events has only one child
-
-birthday:
-  name: birthday
-  parent: events
-
-places:
-  name: places
-
-# places has many children, with many depths
-
-home:
-  name: home
-  parent: places
-
-indoor:
-  name: indoor
-  parent: places
-
-outdoor:
-  name: outdoor
-  parent: places
-
-museum:
-  name: museum
-  parent: places
-
-united_states:
-  name: united_states
-  parent: places
-
-california:
-  name: california
-  parent: united_states
-
-san_francisco:
-  name: san_francisco
-  parent: california
-
-
-# Move and deletion test tree
-
-a1:
-  name: a1
-
-b1:
-  name: b1
-  parent: a1
-
-b2:
-  name: b2
-  parent: a1
-
-c1a:
-  name: c1a
-  parent: b1
-  sort_order: 2
-
-c1b:
-  name: c1b
-  parent: b1
-  sort_order: 1
-
-c2:
-  name: c2
-  parent: b2
-
-d2:
-  name: d2
-  parent: c2
-
-e2:
-  name: e2
-  parent: d2

data/spec/generators/migration_generator_spec.rb

@@ -1,48 +0,0 @@
-# require 'spec_helper'
-# require 'ammeter/init'
-#
-# # Generators are not automatically loaded by Rails
-# require 'generators/closure_tree/migration_generator'
-#
-# RSpec.describe ClosureTree::Generators::MigrationGenerator, type: :generator do
-#   TMPDIR = Dir.mktmpdir
-#   # Tell generator where to put its output
-#   destination TMPDIR
-#   before { prepare_destination }
-#
-#   describe 'generator output' do
-#     before { run_generator %w(tag) }
-#     subject { migration_file('db/migrate/create_tag_hierarchies.rb') }
-#     it { is_expected.to be_a_migration }
-#     it { is_expected.to contain(/t.integer :ancestor_id, null: false/) }
-#     it { is_expected.to contain(/t.integer :descendant_id, null: false/) }
-#     it { is_expected.to contain(/t.integer :generations, null: false/) }
-#     it { is_expected.to contain(/add_index :tag_hierarchies/) }
-#   end
-#
-#   describe 'generator output with namespaced model' do
-#     before { run_generator %w(Namespace::Type) }
-#     subject { migration_file('db/migrate/create_namespace_type_hierarchies.rb') }
-#     it { is_expected.to be_a_migration }
-#     it { is_expected.to contain(/t.integer :ancestor_id, null: false/) }
-#     it { is_expected.to contain(/t.integer :descendant_id, null: false/) }
-#     it { is_expected.to contain(/t.integer :generations, null: false/) }
-#     it { is_expected.to contain(/add_index :namespace_type_hierarchies/) }
-#   end
-#
-#   describe 'generator output with namespaced model with /' do
-#     before { run_generator %w(namespace/type) }
-#     subject { migration_file('db/migrate/create_namespace_type_hierarchies.rb') }
-#     it { is_expected.to be_a_migration }
-#     it { is_expected.to contain(/t.integer :ancestor_id, null: false/) }
-#     it { is_expected.to contain(/t.integer :descendant_id, null: false/) }
-#     it { is_expected.to contain(/t.integer :generations, null: false/) }
-#     it { is_expected.to contain(/add_index :namespace_type_hierarchies/) }
-#   end
-#
-#   it 'should run all tasks in generator without errors' do
-#     gen = generator %w(tag)
-#     expect(gen).to receive :create_migration_file
-#     capture(:stdout) { gen.invoke_all }
-#   end
-# end

data/spec/has_closure_tree_root_spec.rb

@@ -1,154 +0,0 @@
-require "spec_helper"
-
-describe "has_closure_tree_root" do
-  let!(:ct1) { ContractType.create!(name: "Type1") }
-  let!(:ct2) { ContractType.create!(name: "Type2") }
-  let!(:user1) { User.create!(email: "1@example.com", group_id: group.id) }
-  let!(:user2) { User.create!(email: "2@example.com", group_id: group.id) }
-  let!(:user3) { User.create!(email: "3@example.com", group_id: group.id) }
-  let!(:user4) { User.create!(email: "4@example.com", group_id: group.id) }
-  let!(:user5) { User.create!(email: "5@example.com", group_id: group.id) }
-  let!(:user6) { User.create!(email: "6@example.com", group_id: group.id) }
-  let!(:group_reloaded) { group.class.find(group.id) } # Ensures were starting fresh.
-
-  before do
-    # The tree (contract types in parens)
-    #
-    #                   U1(1)
-    #                  /    \
-    #              U2(1)   U3(1&2)
-    #             /        /     \
-    #         U4(2)      U5(1)   U6(2)
-
-    user1.children << user2
-    user1.children << user3
-    user2.children << user4
-    user3.children << user5
-    user3.children << user6
-
-    user1.contracts.create!(title: "Contract 1", contract_type: ct1)
-    user2.contracts.create!(title: "Contract 2", contract_type: ct1)
-    user3.contracts.create!(title: "Contract 3", contract_type: ct1)
-    user3.contracts.create!(title: "Contract 4", contract_type: ct2)
-    user4.contracts.create!(title: "Contract 5", contract_type: ct2)
-    user5.contracts.create!(title: "Contract 6", contract_type: ct1)
-    user6.contracts.create!(title: "Contract 7", contract_type: ct2)
-  end
-
-  context "with basic config" do
-    let!(:group) { Group.create!(name: "TheGroup") }
-
-    it "loads all nodes in a constant number of queries" do
-      expect do
-        root = group_reloaded.root_user_including_tree
-        expect(root.children[0].email).to eq "2@example.com"
-        expect(root.children[0].parent.children[1].email).to eq "3@example.com"
-      end.to_not exceed_query_limit(2)
-    end
-
-    it "loads all nodes plus single association in a constant number of queries" do
-      expect do
-        root = group_reloaded.root_user_including_tree(:contracts)
-        expect(root.children[0].email).to eq "2@example.com"
-        expect(root.children[0].parent.children[1].email).to eq "3@example.com"
-        expect(root.children[0].children[0].contracts[0].user.
-          parent.parent.children[1].children[1].contracts[0].title).to eq "Contract 7"
-      end.to_not exceed_query_limit(3)
-    end
-
-    it "loads all nodes and associations in a constant number of queries" do
-      expect do
-        root = group_reloaded.root_user_including_tree(contracts: :contract_type)
-        expect(root.children[0].email).to eq "2@example.com"
-        expect(root.children[0].parent.children[1].email).to eq "3@example.com"
-        expect(root.children[1].contracts.map(&:contract_type).map(&:name)).to eq %w(Type1 Type2)
-        expect(root.children[1].children[0].contracts[0].contract_type.name).to eq "Type1"
-        expect(root.children[0].children[0].contracts[0].user.
-          parent.parent.children[1].children[1].contracts[0].contract_type.name).to eq "Type2"
-      end.to_not exceed_query_limit(4) # Without this feature, this is 15, and scales with number of nodes.
-    end
-
-    it "memoizes by assoc_map" do
-      group_reloaded.root_user_including_tree.email = "x"
-      expect(group_reloaded.root_user_including_tree.email).to eq "x"
-      group_reloaded.root_user_including_tree(contracts: :contract_type).email = "y"
-      expect(group_reloaded.root_user_including_tree(contracts: :contract_type).email).to eq "y"
-      expect(group_reloaded.root_user_including_tree.email).to eq "x"
-    end
-
-    it "doesn't memoize if true argument passed" do
-      group_reloaded.root_user_including_tree.email = "x"
-      expect(group_reloaded.root_user_including_tree(true).email).to eq "1@example.com"
-      group_reloaded.root_user_including_tree(contracts: :contract_type).email = "y"
-      expect(group_reloaded.root_user_including_tree(true, contracts: :contract_type).email).
-        to eq "1@example.com"
-    end
-
-    it "works if true passed on first call" do
-      expect(group_reloaded.root_user_including_tree(true).email).to eq "1@example.com"
-    end
-
-    it "eager loads inverse association to group" do
-      expect do
-        root = group_reloaded.root_user_including_tree
-        expect(root.group).to eq group
-        expect(root.children[0].group).to eq group
-      end.to_not exceed_query_limit(2)
-    end
-
-    it "works if eager load association map is not given" do
-      expect do
-        root = group_reloaded.root_user_including_tree
-        expect(root.children[0].email).to eq "2@example.com"
-        expect(root.children[0].parent.children[1].children[0].email).to eq "5@example.com"
-      end.to_not exceed_query_limit(2)
-    end
-
-    context "with no tree root" do
-      let(:group2) { Group.create!(name: "OtherGroup") }
-
-      it "should return nil" do
-        expect(group2.root_user_including_tree(contracts: :contract_type)).to be_nil
-      end
-    end
-
-    context "with multiple tree roots" do
-      let!(:other_root) { User.create!(email: "10@example.com", group_id: group.id) }
-
-      it "should error" do
-        expect do
-          root = group_reloaded.root_user_including_tree(contracts: :contract_type)
-        end.to raise_error(ClosureTree::MultipleRootError)
-      end
-    end
-  end
-
-  context "with explicit class_name and foreign_key" do
-    let(:group) { Grouping.create!(name: "TheGrouping") }
-
-    it "should still work" do
-      root = group_reloaded.root_person_including_tree(contracts: :contract_type)
-      expect(root.children[0].email).to eq "2@example.com"
-    end
-  end
-
-  context "with bad class_name" do
-    let(:group) { UserSet.create!(name: "TheUserSet") }
-
-    it "should error" do
-      expect do
-        root = group_reloaded.root_user_including_tree(contracts: :contract_type)
-      end.to raise_error(NameError)
-    end
-  end
-
-  context "with bad foreign_key" do
-    let(:group) { Team.create!(name: "TheTeam") }
-
-    it "should error" do
-      expect do
-        root = group_reloaded.root_user_including_tree(contracts: :contract_type)
-      end.to raise_error(ActiveRecord::StatementInvalid)
-    end
-  end
-end

data/spec/hierarchy_maintenance_spec.rb

@@ -1,16 +0,0 @@
-require 'spec_helper'
-
-describe ClosureTree::HierarchyMaintenance do
-  describe '.rebuild!' do
-    it 'rebuild tree' do
-      20.times do |counter|
-        Metal.create(:value => "Nitro-#{counter}", parent: Metal.all.sample)
-      end
-      hierarchy_count = MetalHierarchy.count
-      expect(hierarchy_count).to be > (20*2)-1 # shallowest-possible case, where all children use the first root
-      MetalHierarchy.delete_all
-      Metal.rebuild!
-      expect(MetalHierarchy.count).to eq(hierarchy_count)
-    end
-  end
-end

data/spec/label_spec.rb

@@ -1,554 +0,0 @@
-require 'spec_helper'
-
-def create_label_tree
-  @d1 = Label.find_or_create_by_path %w(a1 b1 c1 d1)
-  @c1 = @d1.parent
-  @b1 = @c1.parent
-  @a1 = @b1.parent
-  @d2 = Label.find_or_create_by_path %w(a1 b1 c2 d2)
-  @c2 = @d2.parent
-  @d3 = Label.find_or_create_by_path %w(a2 b2 c3 d3)
-  @c3 = @d3.parent
-  @b2 = @c3.parent
-  @a2 = @b2.parent
-  Label.update_all("#{Label._ct.order_column} = id")
-end
-
-def create_preorder_tree(suffix = "", &block)
-  %w(
-    a/l/n/r
-    a/l/n/q
-    a/l/n/p
-    a/l/n/o
-    a/l/m
-    a/b/h/i/j/k
-    a/b/c/d/g
-    a/b/c/d/f
-    a/b/c/d/e
-  ).shuffle.each { |ea| Label.find_or_create_by_path(ea.split('/').collect { |ea| "#{ea}#{suffix}" }) }
-
-  Label.roots.each_with_index do |root, root_idx|
-    root.order_value = root_idx
-    yield(root) if block_given?
-    root.save!
-    root.self_and_descendants.each do |ea|
-      ea.children.to_a.sort_by(&:name).each_with_index do |ea, idx|
-        ea.order_value = idx
-        yield(ea) if block_given?
-        ea.save!
-      end
-    end
-  end
-end
-
-describe Label do
-  context "destruction" do
-    it "properly destroys descendents created with find_or_create_by_path" do
-      c = Label.find_or_create_by_path %w(a b c)
-      b = c.parent
-      a = c.root
-      a.destroy
-      expect(Label.exists?(id: [a.id, b.id, c.id])).to be_falsey
-    end
-
-    it "properly destroys descendents created with add_child" do
-      a = Label.create(name: 'a')
-      b = a.add_child Label.new(name: 'b')
-      c = b.add_child Label.new(name: 'c')
-      a.destroy
-      expect(Label.exists?(a.id)).to be_falsey
-      expect(Label.exists?(b.id)).to be_falsey
-      expect(Label.exists?(c.id)).to be_falsey
-    end
-
-    it "properly destroys descendents created with <<" do
-      a = Label.create(name: 'a')
-      b = Label.new(name: 'b')
-      a.children << b
-      c = Label.new(name: 'c')
-      b.children << c
-      a.destroy
-      expect(Label.exists?(a.id)).to be_falsey
-      expect(Label.exists?(b.id)).to be_falsey
-      expect(Label.exists?(c.id)).to be_falsey
-    end
-  end
-
-  context "roots" do
-    it "sorts alphabetically" do
-      expected = (0..10).to_a
-      expected.shuffle.each do |ea|
-        Label.create! do |l|
-          l.name = "root #{ea}"
-          l.order_value = ea
-        end
-      end
-      expect(Label.roots.collect { |ea| ea.order_value }).to eq(expected)
-    end
-  end
-
-  context "Base Label class" do
-    it "should find or create by path" do
-      # class method:
-      c = Label.find_or_create_by_path(%w{grandparent parent child})
-      expect(c.ancestry_path).to eq(%w{grandparent parent child})
-      expect(c.name).to eq("child")
-      expect(c.parent.name).to eq("parent")
-    end
-  end
-
-  context "Parent/child inverse relationships" do
-    it "should associate both sides of the parent and child relationships" do
-      parent = Label.new(:name => 'parent')
-      child = parent.children.build(:name => 'child')
-      expect(parent).to be_root
-      expect(parent).not_to be_leaf
-      expect(child).not_to be_root
-      expect(child).to be_leaf
-    end
-  end
-
-  context "DateLabel" do
-    it "should find or create by path" do
-      date = DateLabel.find_or_create_by_path(%w{2011 November 23})
-      expect(date.ancestry_path).to eq(%w{2011 November 23})
-      date.self_and_ancestors.each { |ea| expect(ea.class).to eq(DateLabel) }
-      expect(date.name).to eq("23")
-      expect(date.parent.name).to eq("November")
-    end
-  end
-
-  context "DirectoryLabel" do
-    it "should find or create by path" do
-      dir = DirectoryLabel.find_or_create_by_path(%w{grandparent parent child})
-      expect(dir.ancestry_path).to eq(%w{grandparent parent child})
-      expect(dir.name).to eq("child")
-      expect(dir.parent.name).to eq("parent")
-      expect(dir.parent.parent.name).to eq("grandparent")
-      expect(dir.root.name).to eq("grandparent")
-      expect(dir.id).not_to eq(Label.find_or_create_by_path(%w{grandparent parent child}))
-      dir.self_and_ancestors.each { |ea| expect(ea.class).to eq(DirectoryLabel) }
-    end
-  end
-
-  context "Mixed class tree" do
-    context "preorder tree" do
-      before do
-        classes = [Label, DateLabel, DirectoryLabel, EventLabel]
-        create_preorder_tree do |ea|
-          ea.type = classes[ea.order_value % 4].to_s
-        end
-      end
-      it "finds roots with specific classes" do
-        expect(Label.roots).to eq(Label.where(:name => 'a').to_a)
-        expect(DirectoryLabel.roots).to be_empty
-        expect(EventLabel.roots).to be_empty
-      end
-
-      it "all is limited to subclasses" do
-        expect(DateLabel.all.map(&:name)).to match_array(%w(f h l n p))
-        expect(DirectoryLabel.all.map(&:name)).to match_array(%w(g q))
-        expect(EventLabel.all.map(&:name)).to eq(%w(r))
-      end
-
-      it "returns descendents regardless of subclass" do
-        expect(Label.root.descendants.map { |ea| ea.class.to_s }.uniq).to match_array(
-          %w(Label DateLabel DirectoryLabel EventLabel)
-        )
-      end
-    end
-
-    it "supports children << and add_child" do
-      a = EventLabel.create!(:name => "a")
-      b = DateLabel.new(:name => "b")
-      a.children << b
-      c = Label.new(:name => "c")
-      b.add_child(c)
-
-      expect(a.self_and_descendants.collect do |ea|
-        ea.class
-      end).to eq([EventLabel, DateLabel, Label])
-
-      expect(a.self_and_descendants.collect do |ea|
-        ea.name
-      end).to eq(%w(a b c))
-    end
-  end
-
-  context "find_all_by_generation" do
-    before :each do
-      create_label_tree
-    end
-
-    it "finds roots from the class method" do
-      expect(Label.find_all_by_generation(0).to_a).to eq([@a1, @a2])
-    end
-
-    it "finds roots from themselves" do
-      expect(@a1.find_all_by_generation(0).to_a).to eq([@a1])
-    end
-
-    it "finds itself for non-roots" do
-      expect(@b1.find_all_by_generation(0).to_a).to eq([@b1])
-    end
-
-    it "finds children for roots" do
-      expect(Label.find_all_by_generation(1).to_a).to eq([@b1, @b2])
-    end
-
-    it "finds children" do
-      expect(@a1.find_all_by_generation(1).to_a).to eq([@b1])
-      expect(@b1.find_all_by_generation(1).to_a).to eq([@c1, @c2])
-    end
-
-    it "finds grandchildren for roots" do
-      expect(Label.find_all_by_generation(2).to_a).to eq([@c1, @c2, @c3])
-    end
-
-    it "finds grandchildren" do
-      expect(@a1.find_all_by_generation(2).to_a).to eq([@c1, @c2])
-      expect(@b1.find_all_by_generation(2).to_a).to eq([@d1, @d2])
-    end
-
-    it "finds great-grandchildren for roots" do
-      expect(Label.find_all_by_generation(3).to_a).to eq([@d1, @d2, @d3])
-    end
-  end
-
-  context "loading through self_and_ scopes" do
-    before :each do
-      create_label_tree
-    end
-
-    it "self_and_descendants should result in one select" do
-      expect(count_queries do
-        a1_array = @a1.self_and_descendants
-        expect(a1_array.collect { |ea| ea.name }).to eq(%w(a1 b1 c1 c2 d1 d2))
-      end).to eq(1)
-    end
-
-    it "self_and_ancestors should result in one select" do
-      expect(count_queries do
-        d1_array = @d1.self_and_ancestors
-        expect(d1_array.collect { |ea| ea.name }).to eq(%w(d1 c1 b1 a1))
-      end).to eq(1)
-    end
-  end
-
-  context "deterministically orders with polymorphic siblings" do
-    before :each do
-      @parent = Label.create!(:name => 'parent')
-      @a, @b, @c, @d, @e, @f = ('a'..'f').map { |ea| EventLabel.new(:name => ea) }
-      @parent.children << @a
-      @a.append_sibling(@b)
-      @b.append_sibling(@c)
-      @c.append_sibling(@d)
-      @parent.append_sibling(@e)
-      @e.append_sibling(@f)
-    end
-
-    def name_and_order(enum)
-      enum.map { |ea| [ea.name, ea.order_value] }
-    end
-
-    def children_name_and_order
-      name_and_order(@parent.children.reload)
-    end
-
-    def roots_name_and_order
-      name_and_order(Label.roots)
-    end
-
-    it 'order_values properly' do
-      expect(children_name_and_order).to eq([['a', 0], ['b', 1], ['c', 2], ['d', 3]])
-    end
-
-    it 'when inserted before' do
-      @b.append_sibling(@a)
-      expect(children_name_and_order).to eq([['b', 0], ['a', 1], ['c', 2], ['d', 3]])
-    end
-
-    it 'when inserted after' do
-      @a.append_sibling(@c)
-      expect(children_name_and_order).to eq([['a', 0], ['c', 1], ['b', 2], ['d', 3]])
-    end
-
-    it 'when inserted before the first' do
-      @a.prepend_sibling(@d)
-      expect(children_name_and_order).to eq([['d', 0], ['a', 1], ['b', 2], ['c', 3]])
-    end
-
-    it 'when inserted after the last' do
-      @d.append_sibling(@b)
-      expect(children_name_and_order).to eq([['a', 0], ['c', 1], ['d', 2], ['b', 3]])
-    end
-
-    it 'prepends to root nodes' do
-      @parent.prepend_sibling(@f)
-      expect(roots_name_and_order).to eq([['f', 0], ['parent', 1], ['e', 2]])
-    end
-  end
-
-  describe 'code in the readme' do
-    it 'creates STI label hierarchies' do
-      child = Label.find_or_create_by_path([
-        {type: 'DateLabel', name: '2014'},
-        {type: 'DateLabel', name: 'August'},
-        {type: 'DateLabel', name: '5'},
-        {type: 'EventLabel', name: 'Visit the Getty Center'}
-      ])
-      expect(child).to be_a(EventLabel)
-      expect(child.name).to eq('Visit the Getty Center')
-      expect(child.ancestors.map(&:name)).to eq(%w(5 August 2014))
-      expect(child.ancestors.map(&:class)).to eq([DateLabel, DateLabel, DateLabel])
-    end
-
-    it 'appends and prepends siblings' do
-      root = Label.create(name: 'root')
-      a = root.append_child(Label.new(name: 'a'))
-      b = Label.create(name: 'b')
-      c = Label.create(name: 'c')
-
-      a.append_sibling(b)
-      expect(a.self_and_siblings.collect(&:name)).to eq(%w(a b))
-      expect(root.reload.children.collect(&:name)).to eq(%w(a b))
-      expect(root.children.collect(&:order_value)).to eq([0, 1])
-
-      a.prepend_sibling(b)
-      expect(a.self_and_siblings.collect(&:name)).to eq(%w(b a))
-      expect(root.reload.children.collect(&:name)).to eq(%w(b a))
-      expect(root.children.collect(&:order_value)).to eq([0, 1])
-
-      a.append_sibling(c)
-      expect(a.self_and_siblings.collect(&:name)).to eq(%w(b a c))
-      expect(root.reload.children.collect(&:name)).to eq(%w(b a c))
-      expect(root.children.collect(&:order_value)).to eq([0, 1, 2])
-
-      # We need to reload b because it was updated by a.append_sibling(c)
-      b.reload.append_sibling(c)
-      expect(root.reload.children.collect(&:name)).to eq(%w(b c a))
-      expect(root.children.collect(&:order_value)).to eq([0, 1, 2])
-
-      # We need to reload a because it was updated by b.append_sibling(c)
-      d = a.reload.append_sibling(Label.new(:name => "d"))
-      expect(d.self_and_siblings.collect(&:name)).to eq(%w(b c a d))
-      expect(d.self_and_siblings.collect(&:order_value)).to eq([0, 1, 2, 3])
-    end
-  end
-
-  # https://github.com/mceachen/closure_tree/issues/84
-  it "properly appends children with <<" do
-    root = Label.create(:name => "root")
-    a = Label.create(:name => "a", :parent => root)
-    b = Label.create(:name => "b", :parent => root)
-    expect(a.order_value).to eq(0)
-    expect(b.order_value).to eq(1)
-    #c = Label.create(:name => "c")
-
-    # should the order_value for roots be set?
-    expect(root.order_value).not_to be_nil
-    expect(root.order_value).to eq(0)
-
-    # order_value should never be nil on a child.
-    expect(a.order_value).not_to be_nil
-    expect(a.order_value).to eq(0)
-    # Add a child to root at end of children.
-    root.children << b
-    expect(b.parent).to eq(root)
-    expect(a.self_and_siblings.collect(&:name)).to eq(%w(a b))
-    expect(root.reload.children.collect(&:name)).to eq(%w(a b))
-    expect(root.children.collect(&:order_value)).to eq([0, 1])
-  end
-
-  context "#add_sibling" do
-    it "should move a node before another node which has an uninitialized order_value" do
-      f = Label.find_or_create_by_path %w(a b c d e fa)
-      f0 = f.prepend_sibling(Label.new(:name => "fb")) # < not alpha sort, so name shouldn't matter
-      expect(f0.ancestry_path).to eq(%w(a b c d e fb))
-      expect(f.siblings_before.to_a).to eq([f0])
-      expect(f0.siblings_before).to be_empty
-      expect(f0.siblings_after).to eq([f])
-      expect(f.siblings_after).to be_empty
-      expect(f0.self_and_siblings).to eq([f0, f])
-      expect(f.self_and_siblings).to eq([f0, f])
-    end
-
-    let(:f1) { Label.find_or_create_by_path %w(a1 b1 c1 d1 e1 f1) }
-
-    it "should move a node to another tree" do
-      f2 = Label.find_or_create_by_path %w(a2 b2 c2 d2 e2 f2)
-      f1.add_sibling(f2)
-      expect(f2.ancestry_path).to eq(%w(a1 b1 c1 d1 e1 f2))
-      expect(f1.parent.reload.children).to eq([f1, f2])
-    end
-
-    it "should reorder old-parent siblings when a node moves to another tree" do
-      f2 = Label.find_or_create_by_path %w(a2 b2 c2 d2 e2 f2)
-      f3 = f2.prepend_sibling(Label.new(:name => "f3"))
-      f4 = f2.append_sibling(Label.new(:name => "f4"))
-      f1.add_sibling(f2)
-      expect(f1.self_and_siblings.collect(&:order_value)).to eq([0, 1])
-      expect(f3.self_and_siblings.collect(&:order_value)).to eq([0, 1])
-      expect(f1.self_and_siblings.collect(&:name)).to eq(%w(f1 f2))
-      expect(f3.self_and_siblings.collect(&:name)).to eq(%w(f3 f4))
-    end
-  end
-
-  context "order_value must be set" do
-
-    before do
-      @root = Label.create(name: 'root')
-      @a, @b, @c = %w(a b c).map { |n| @root.children.create(name: n) }
-    end
-
-    it 'should set order_value on roots' do
-      expect(@root.order_value).to eq(0)
-    end
-
-    it 'should set order_value with siblings' do
-      expect(@a.order_value).to eq(0)
-      expect(@b.order_value).to eq(1)
-      expect(@c.order_value).to eq(2)
-    end
-
-    it 'should reset order_value when a node is moved to another location' do
-      root2 = Label.create(name: 'root2')
-      root2.add_child @b
-      expect(@a.order_value).to eq(0)
-      expect(@b.order_value).to eq(0)
-      expect(@c.reload.order_value).to eq(1)
-    end
-  end
-
-  context "destructive reordering" do
-    before :each do
-      # to make sure order_value isn't affected by additional nodes:
-      create_preorder_tree
-      @root = Label.create(:name => 'root')
-      @a = @root.children.create!(:name => 'a')
-      @b = @a.append_sibling(Label.new(:name => 'b'))
-      @c = @b.append_sibling(Label.new(:name => 'c'))
-    end
-    context "doesn't create sort order gaps" do
-      it 'from head' do
-        @a.destroy
-        expect(@root.reload.children).to eq([@b, @c])
-        expect(@root.children.map { |ea| ea.order_value }).to eq([0, 1])
-      end
-      it 'from mid' do
-        @b.destroy
-        expect(@root.reload.children).to eq([@a, @c])
-        expect(@root.children.map { |ea| ea.order_value }).to eq([0, 1])
-      end
-      it 'from tail' do
-        @c.destroy
-        expect(@root.reload.children).to eq([@a, @b])
-        expect(@root.children.map { |ea| ea.order_value }).to eq([0, 1])
-      end
-    end
-
-    context 'add_sibling moves descendant nodes' do
-      let(:roots) { (0..10).map { |ea| Label.create(name: ea) } }
-      let(:first_root) { roots.first }
-      let(:last_root) { roots.last }
-      it 'should retain sort orders of descendants when moving to a new parent' do
-        expected_order = ('a'..'z').to_a.shuffle
-        expected_order.map { |ea| first_root.add_child(Label.new(name: ea)) }
-        actual_order = first_root.children.reload.pluck(:name)
-        expect(actual_order).to eq(expected_order)
-        last_root.append_child(first_root)
-        expect(last_root.self_and_descendants.pluck(:name)).to eq(%w(10 0) + expected_order)
-      end
-
-      it 'should retain sort orders of descendants when moving within the same new parent' do
-        path = ('a'..'z').to_a
-        z = first_root.find_or_create_by_path(path)
-        z_children_names = (100..150).to_a.shuffle.map { |ea| ea.to_s }
-        z_children_names.reverse.each { |ea| z.prepend_child(Label.new(name: ea)) }
-        expect(z.children.reload.pluck(:name)).to eq(z_children_names)
-        a = first_root.find_by_path(['a'])
-        # move b up to a's level:
-        b = a.children.first
-        a.add_sibling(b)
-        expect(b.parent).to eq(first_root)
-        expect(z.children.reload.pluck(:name)).to eq(z_children_names)
-      end
-    end
-
-    it "shouldn't fail if all children are destroyed" do
-      roots = Label.roots.to_a
-      roots.each { |ea| ea.children.destroy_all }
-      expect(Label.all.to_a).to match_array(roots)
-    end
-  end
-
-  context 'descendent destruction' do
-    it 'properly destroys descendents created with add_child' do
-      a = Label.create(name: 'a')
-      b = Label.new(name: 'b')
-      a.add_child b
-      c = Label.new(name: 'c')
-      b.add_child c
-      a.destroy
-      expect(Label.exists?(id: [a.id, b.id, c.id])).to be_falsey
-    end
-
-    it 'properly destroys descendents created with <<' do
-      a = Label.create(name: 'a')
-      b = Label.new(name: 'b')
-      a.children << b
-      c = Label.new(name: 'c')
-      b.children << c
-      a.destroy
-      expect(Label.exists?(id: [a.id, b.id, c.id])).to be_falsey
-    end
-  end
-
-  context 'preorder' do
-    it 'returns descendants in proper order' do
-      create_preorder_tree
-      a = Label.root
-      expect(a.name).to eq('a')
-      expected = ('a'..'r').to_a
-      expect(a.self_and_descendants_preordered.collect { |ea| ea.name }).to eq(expected)
-      expect(Label.roots_and_descendants_preordered.collect { |ea| ea.name }).to eq(expected)
-      # Let's create the second root by hand so we can explicitly set the sort order
-      Label.create! do |l|
-        l.name = "a1"
-        l.order_value = a.order_value + 1
-      end
-      create_preorder_tree('1')
-      # Should be no change:
-      expect(a.reload.self_and_descendants_preordered.collect { |ea| ea.name }).to eq(expected)
-      expected += ('a'..'r').collect { |ea| "#{ea}1" }
-      expect(Label.roots_and_descendants_preordered.collect { |ea| ea.name }).to eq(expected)
-    end
-  end unless sqlite? # sqlite doesn't have a power function.
-
-  context 'hash_tree' do
-    before do
-      @a = EventLabel.create(name: 'a')
-      @b = DateLabel.create(name: 'b')
-      @c = DirectoryLabel.create(name: 'c')
-      (1..3).each { |i| DirectoryLabel.create!(name: "c#{ i }", mother_id: @c.id) }
-    end
-    it 'should return tree with correct scope when called on class' do
-      tree = DirectoryLabel.hash_tree
-      expect(tree.keys.size).to eq(1)
-      expect(tree.keys.first).to eq(@c)
-      expect(tree[@c].keys.size).to eq(3)
-    end
-    it 'should return tree with correct scope when called on all' do
-      tree = DirectoryLabel.all.hash_tree
-      expect(tree.keys.size).to eq(1)
-      expect(tree.keys.first).to eq(@c)
-      expect(tree[@c].keys.size).to eq(3)
-    end
-    it 'should return tree with correct scope when called on scope chain' do
-      tree = Label.where(name: 'b').hash_tree
-      expect(tree.keys.size).to eq(1)
-      expect(tree.keys.first).to eq(@b)
-      expect(tree[@b]).to eq({})
-    end
-  end
-end