closure_tree 4.2.4 → 4.2.5

checksums.yaml

@@ -1,15 +1,7 @@
 ---
-!binary "U0hBMQ==":
-  metadata.gz: !binary |-
-    NmE3ZGYxNDE5MjE5Y2FkMjMxNjY5YjVmMTZkYmM4MTY5ZGQ0NTUxZQ==
-  data.tar.gz: !binary |-
-    NGMyNmRiZGY1N2RiNGZiYTk1NzgzYzg4N2U2MDIxZWFlNjNmNjMxZg==
-!binary "U0hBNTEy":
-  metadata.gz: !binary |-
-    NzE2ZTUxMDY0YzAxMDY1ZTFjMzlkM2ZjZDcwNDJhMjg3YWRiODU2NWYxMjgz
-    YjJkNzIxNzA2MjQwYTliMjEyNTVmYjZkMDExNGZlMzM3MjVjYjY0NGZjZDNi
-    ODA4MzQ4OTFkYmE1YWYzODQ4ZDY2YmRhMjIyZWJhZDQ4NjU1MDA=
-  data.tar.gz: !binary |-
-    ZThkMTI0YTU0OTJlNjEzMjdlMjU2Mjc5M2I5NGI2M2UxODQwMjc0NDUzMTEw
-    NWZmNDM1Yjk3YmI4M2I5OGIzYWQ2Zjg0YzE0NWIxYjMyNTY3ZjBjOTdmZDBh
-    OTYyMGEzZjFjYTAyZjBlZWY3NDMyNDNhMDllODY2ZjNhZWVkYjk=
+SHA1:
+  metadata.gz: e95e5a8b184eb1ac818d7fbe79f9fd332cc94fe1
+  data.tar.gz: 1663703503122d4a0a2fe17d6270ab19c5a40596
+SHA512:
+  metadata.gz: 27afdd7889a43d53c25298cf35fb754ef41fc7c3728ad07e9a048cc33a7932638cabae18951e1fdbe089060bb97b2d7496e6d4368b6bc79bfac80f1b832d86d5
+  data.tar.gz: 42bd0e1731527939884764a16279ca0511ad18bd701ba620a70fe17cf7abe6321c466ba297333e1311884c0b142a091c14fe9ba10e87efc5f083b669ee1229a0

data/README.md

@@ -8,6 +8,7 @@ and tracking user referrals.
 [![Build Status](https://secure.travis-ci.org/mceachen/closure_tree.png?branch=master)](http://travis-ci.org/mceachen/closure_tree)
 [![Gem Version](https://badge.fury.io/rb/closure_tree.png)](http://rubygems.org/gems/closure_tree)
 [![Code Climate](https://codeclimate.com/github/mceachen/closure_tree.png)](https://codeclimate.com/github/mceachen/closure_tree)
+[![Dependency Status](https://gemnasium.com/mceachen/closure_tree.png)](https://gemnasium.com/mceachen/closure_tree)
 
 Substantially more efficient than
 [ancestry](https://github.com/stefankroes/ancestry) and
@@ -26,7 +27,7 @@ closure_tree has some great features:
   * 3 SQL INSERT/UPDATEs on node reparenting
 * __Support for Rails 3.0, 3.1, 3.2, and 4.0__
 * Support for reparenting children (and all their progeny)
-* Support for [concurrency](#concurrency) (using [with_advisory_lock](https://github/mceachen/with_advisory_lock))
+* Support for [concurrency](#concurrency) (using [with_advisory_lock](https://github.com/mceachen/with_advisory_lock))
 * Support for polymorphism [STI](#sti) within the hierarchy
 * ```find_or_create_by_path``` for [building out hierarchies quickly and conveniently](#find_or_create_by_path)
 * Support for [deterministic ordering](#deterministic-ordering) of children
@@ -87,11 +88,13 @@ Note that closure_tree only supports Rails 3.0 and later, and has test coverage
           t.integer  :generations, :null => false   # Number of generations between the ancestor and the descendant. Parent/child = 1, for example.
         end
 
-        # For "all progeny of…" selects:
-        add_index :tag_hierarchies, [:ancestor_id, :descendant_id], :unique => true
+        # For "all progeny of…" and leaf selects:
+        add_index :tag_hierarchies, [:ancestor_id, :descendant_id, :generations],
+          :unique => true, :name => "tag_anc_desc_udx"
 
-        # For "all ancestors of…" selects
+        # For "all ancestors of…" selects,
         add_index :tag_hierarchies, [:descendant_id]
+          :name => "tag_desc_idx"
       end
     end
     ```

data/lib/closure_tree/finders.rb

@@ -11,17 +11,21 @@ module ClosureTree
     # Find a child node whose +ancestry_path+ minus self.ancestry_path is +path+
     def find_or_create_by_path(path, attributes = {}, find_before_lock = true)
       attributes[:type] ||= self.type if _ct.subclass? && _ct.has_type?
+      # only bother trying to find_by_path on the first call:
       (find_before_lock && find_by_path(path, attributes)) || begin
+        subpath = path.is_a?(Enumerable) ? path.dup : [path]
+        return self if subpath.empty?
+        child_name = subpath.shift
+        attrs = attributes.merge(_ct.name_sym => child_name)
         _ct.with_advisory_lock do
-          subpath = path.is_a?(Enumerable) ? path.dup : [path]
-          child_name = subpath.shift
-          return self unless child_name
-          child = transaction do
-            attrs = attributes.merge(_ct.name_sym => child_name)
-            # shenanigans because children.create is bound to the superclass
-            # (in the case of polymorphism):
-            self.children.where(attrs).first || begin
-              self.class.new(attrs).tap { |ea| self.children << ea }
+          # shenanigans because children.create is bound to the superclass
+          # (in the case of polymorphism):
+          child = self.children.where(attrs).first || begin
+            self.class.new(attrs).tap do |ea|
+              # We know that there isn't a cycle, because we just created it, and
+              # cycle detection is expensive when the node is deep.
+              ea._ct_skip_cycle_detection!
+              self.children << ea
             end
           end
           child.find_or_create_by_path(subpath, attributes, false)
@@ -48,6 +52,11 @@ module ClosureTree
 
     module ClassMethods
 
+      # Fix deprecation warning:
+      def _ct_all
+        (ActiveRecord::VERSION::MAJOR >= 4 ) ? all : scoped
+      end
+
       def without(instance)
         if instance.new_record?
           all
@@ -79,7 +88,7 @@ module ClosureTree
 
       def with_ancestor(*ancestors)
         ancestor_ids = ancestors.map { |ea| ea.is_a?(ActiveRecord::Base) ? ea._ct_id : ea }
-        scope = ancestor_ids.blank? ? scoped : joins(:ancestor_hierarchies).
+        scope = ancestor_ids.blank? ? _ct_all : joins(:ancestor_hierarchies).
           where("#{_ct.hierarchy_table_name}.ancestor_id" => ancestor_ids).
           where("#{_ct.hierarchy_table_name}.generations > 0").
           readonly(false)
@@ -118,7 +127,8 @@ module ClosureTree
         scope = where(_ct.name_sym => path.pop).readonly(false)
         scope = ct_scoped_attributes(scope, attributes)
         last_joined_table = _ct.table_name
-        path.reverse.each_with_index do |ea, idx|
+        # MySQL doesn't support more than 61 joined tables (!!):
+        path.first(50).reverse.each_with_index do |ea, idx|
           next_joined_table = "p#{idx}"
           scope = scope.joins(<<-SQL)
             INNER JOIN #{_ct.quoted_table_name} AS #{next_joined_table}
@@ -129,8 +139,12 @@ module ClosureTree
           scope = ct_scoped_attributes(scope, attributes, next_joined_table)
           last_joined_table = next_joined_table
         end
-        scope = scope.where("#{last_joined_table}.#{_ct.parent_column_name}" => parent_id)
-        scope.first
+        result = scope.where("#{last_joined_table}.#{_ct.parent_column_name}" => parent_id).first
+        if path.size > 50 && result
+          find_by_path(path[50..-1], attributes, result.primary_key)
+        else
+          result
+        end
       end
 
       # Find or create nodes such that the +ancestry_path+ is +path+

data/lib/closure_tree/hierarchy_maintenance.rb

@@ -11,8 +11,13 @@ module ClosureTree
       before_destroy :_ct_before_destroy
     end
 
+    def _ct_skip_cycle_detection!
+      @_ct_skip_cycle_detection = true
+    end
+
     def _ct_validate
-      if changes[_ct.parent_column_name] &&
+      if !@_ct_skip_cycle_detection &&
+        changes[_ct.parent_column_name] &&
         parent.present? &&
         parent.self_and_ancestors.include?(self)
         errors.add(_ct.parent_column_sym, "You cannot add an ancestor as a descendant")
@@ -31,9 +36,11 @@ module ClosureTree
     end
 
     def _ct_before_destroy
-      delete_hierarchy_references
-      if _ct.options[:dependent] == :nullify
-        self.class.find(self.id).children.each { |c| c.rebuild! }
+      _ct.with_advisory_lock do
+        delete_hierarchy_references
+        if _ct.options[:dependent] == :nullify
+          self.class.find(self.id).children.each { |c| c.rebuild! }
+        end
       end
       true # don't prevent destruction
     end
@@ -57,20 +64,22 @@ module ClosureTree
     end
 
     def delete_hierarchy_references
-      # The crazy double-wrapped sub-subselect works around MySQL's limitation of subselects on the same table that is being mutated.
-      # It shouldn't affect performance of postgresql.
-      # See http://dev.mysql.com/doc/refman/5.0/en/subquery-errors.html
-      # Also: PostgreSQL doesn't support INNER JOIN on DELETE, so we can't use that.
-      _ct.connection.execute <<-SQL
-        DELETE FROM #{_ct.quoted_hierarchy_table_name}
-        WHERE descendant_id IN (
-          SELECT DISTINCT descendant_id
-          FROM (SELECT descendant_id
-            FROM #{_ct.quoted_hierarchy_table_name}
-            WHERE ancestor_id = #{_ct.quote(id)}
-          ) AS x )
-          OR descendant_id = #{_ct.quote(id)}
-      SQL
+      _ct.with_advisory_lock do
+        # The crazy double-wrapped sub-subselect works around MySQL's limitation of subselects on the same table that is being mutated.
+        # It shouldn't affect performance of postgresql.
+        # See http://dev.mysql.com/doc/refman/5.0/en/subquery-errors.html
+        # Also: PostgreSQL doesn't support INNER JOIN on DELETE, so we can't use that.
+        _ct.connection.execute <<-SQL
+          DELETE FROM #{_ct.quoted_hierarchy_table_name}
+          WHERE descendant_id IN (
+            SELECT DISTINCT descendant_id
+            FROM (SELECT descendant_id
+              FROM #{_ct.quoted_hierarchy_table_name}
+              WHERE ancestor_id = #{_ct.quote(id)}
+            ) AS x )
+            OR descendant_id = #{_ct.quote(id)}
+        SQL
+      end
     end
 
     module ClassMethods

data/lib/closure_tree/support.rb

@@ -106,9 +106,7 @@ module ClosureTree
     def with_advisory_lock(&block)
       if options[:with_advisory_lock]
         model_class.with_advisory_lock("closure_tree") do
-          model_class.transaction do
-            yield
-          end
+          transaction { yield }
         end
       else
         yield

data/lib/closure_tree/version.rb

@@ -1,3 +1,3 @@
 module ClosureTree
-  VERSION = Gem::Version.new("4.2.4") unless defined?(::ClosureTree::VERSION)
+  VERSION = Gem::Version.new("4.2.5") unless defined?(::ClosureTree::VERSION)
 end

data/spec/db/schema.rb

@@ -46,7 +46,7 @@ ActiveRecord::Schema.define(:version => 0) do
     t.string "name"
   end
 
-  force_add_index "tag_hierarchies", [:ancestor_id, :descendant_id], :unique => true, :name => "tag_anc_desc_idx"
+  force_add_index "tag_hierarchies", [:ancestor_id, :descendant_id, :generations], :unique => true, :name => "tag_anc_desc_idx"
   force_add_index "tag_hierarchies", [:descendant_id], :name => "tag_desc_idx"
 
   create_table "users", :force => true do |t|
@@ -66,7 +66,7 @@ ActiveRecord::Schema.define(:version => 0) do
     t.integer "generations", :null => false
   end
 
-  force_add_index "referral_hierarchies", [:ancestor_id, :descendant_id], :unique => true, :name => "ref_anc_desc_idx"
+  force_add_index "referral_hierarchies", [:ancestor_id, :descendant_id, :generations], :unique => true, :name => "ref_anc_desc_idx"
   force_add_index "referral_hierarchies", [:descendant_id], :name => "ref_desc_idx"
 
   create_table "labels", :force => true do |t|
@@ -82,7 +82,7 @@ ActiveRecord::Schema.define(:version => 0) do
     t.integer "generations", :null => false
   end
 
-  force_add_index "label_hierarchies", [:ancestor_id, :descendant_id], :unique => true, :name => "lh_anc_desc_idx"
+  force_add_index "label_hierarchies", [:ancestor_id, :descendant_id, :generations], :unique => true, :name => "lh_anc_desc_idx"
   force_add_index "label_hierarchies", [:descendant_id], :name => "lh_desc_idx"
 
   create_table "cuisine_types", :force => true do |t|

data/spec/parallel_spec.rb

@@ -3,29 +3,33 @@ require 'spec_helper'
 parallelism_is_broken = begin
   # Rails < 3.2 has known bugs with parallelism
   (ActiveRecord::VERSION::MAJOR <= 3 && ActiveRecord::VERSION::MINOR < 2) ||
-  # SQLite doesn't support parallel writes
-  ENV["DB"] =~ /sqlite/
+    # SQLite doesn't support parallel writes
+    ENV["DB"] =~ /sqlite/
 end
 
 describe "threadhot" do
 
   before :each do
+    ActiveRecord::Base.connection.reconnect!
     TagHierarchy.delete_all
     Tag.delete_all
-    @iterations = 5
-    @workers = 6 # Travis CI workers can't reliably handle larger numbers
     @parent = nil
+    # These values seem to allow Travis to reliably pass:
+    @iterations = 5
+    @workers = 6
+    @time_between_runs = 3
   end
 
   def find_or_create_at_even_second(run_at)
     sleep(run_at - Time.now.to_f)
     ActiveRecord::Base.connection.reconnect!
-    (@parent || Tag).find_or_create_by_path([run_at.to_s, :a, :b, :c].compact)
+    (@parent || Tag).find_or_create_by_path([run_at.to_s, :a, :b, :c])
   end
 
   def run_workers
-    start_time = Time.now.to_i + 2
-    @times = @iterations.times.collect { |ea| start_time + (ea * 2) }
+    expected_thread_setup_time = 4
+    start_time = Time.now.to_i + expected_thread_setup_time
+    @times = @iterations.times.collect { |ea| start_time + (ea * @time_between_runs) }
     @names = @times.collect { |ea| ea.to_s }
     @threads = @workers.times.collect do
       Thread.new do
@@ -35,7 +39,6 @@ describe "threadhot" do
     @threads.each { |ea| ea.join }
   end
 
-
   it "class method will not create dupes" do
     run_workers
     Tag.roots.collect { |ea| ea.name.to_i }.should =~ @times
@@ -57,9 +60,81 @@ describe "threadhot" do
 
   it "creates dupe roots without advisory locks" do
     # disable with_advisory_lock:
-    Tag.should_receive(:with_advisory_lock).any_number_of_times { |lock_name, &block| block.call }
+    Tag.stub(:with_advisory_lock).and_return { |lock_name, &block| block.call }
     run_workers
     Tag.where(:name => @names).size.should > @iterations
   end
 
+  it "fails to deadlock from parallel sibling churn" do
+    # target should be non-trivially long to maximize time spent in hierarchy maintenance
+    target = Tag.find_or_create_by_path(('a'..'z').to_a + ('A'..'Z').to_a)
+    expected_children = (1..100).to_a.map { |ea| "root ##{ea}" }
+    children_to_add = expected_children.dup
+    added_children = []
+    children_to_delete = []
+    deleted_children = []
+    creator_threads = @workers.times.map do
+      Thread.new do
+        ActiveRecord::Base.connection.reconnect!
+        begin
+          name = children_to_add.shift
+          unless name.nil?
+            target.find_or_create_by_path(name)
+            children_to_delete << name
+            added_children << name
+          end
+        end while !children_to_add.empty?
+      end
+    end
+    run_destruction = true
+    destroyer_threads = @workers.times.map do
+      Thread.new do
+        ActiveRecord::Base.connection.reconnect!
+        begin
+          victim = children_to_delete.shift
+          if victim
+            target.children.where(:name => victim).first.destroy
+            deleted_children << victim
+          else
+            sleep rand # wait for moar victims
+          end
+        end while run_destruction || !children_to_delete.empty?
+      end
+    end
+    creator_threads.each { |ea| ea.join }
+    run_destruction = false
+    destroyer_threads.each { |ea| ea.join }
+
+    added_children.should =~ expected_children
+    deleted_children.should =~ expected_children
+  end
+
+  # Oh, yeah, I'm totes monkey patching in a bad shuffle. I AM A NAUGHTY MONKAY
+  class Array
+    def bad_shuffle!(shuffle_count = nil)
+      shuffle_count ||= size / 10
+      pairs = Hash[*(0..(size)).to_a.shuffle.first(shuffle_count)]
+      pairs.each do |from, to|
+        self[from], self[to] = self[to], self[from]
+      end
+      self
+    end
+  end
+
+  it "fails to deadlock while simultaneously deleting items from the same hierarchy" do
+    target = User.find_or_create_by_path((1..200).to_a.map { |ea| ea.to_s })
+    nodes_to_delete = target.self_and_ancestors.to_a.bad_shuffle!
+    destroyer_threads = @workers.times.map do
+      Thread.new do
+        ActiveRecord::Base.connection.reconnect!
+        begin
+          victim = nodes_to_delete.shift
+          victim.destroy if victim
+        end while !nodes_to_delete.empty?
+      end
+    end
+    destroyer_threads.each { |ea| ea.join }
+    User.all.should be_empty
+  end
+
 end unless parallelism_is_broken

data/spec/spec_helper.rb

@@ -31,7 +31,11 @@ end
 ActiveRecord::Base.configurations = YAML::load(ERB.new(IO.read(plugin_test_dir + "/db/database.yml")).result)
 ActiveRecord::Base.establish_connection(ENV["DB"])
 ActiveRecord::Migration.verbose = false
-require 'db/schema'
+if ENV['NONUKES']
+  puts "skipping database creation"
+else
+  require 'db/schema'
+end
 require 'support/models'
 
 class Hash

data/spec/support/models.rb

@@ -1,7 +1,7 @@
 require 'uuidtools'
 
 class Tag < ActiveRecord::Base
-  acts_as_tree :dependent => :destroy, :order => "name"
+  acts_as_tree :dependent => :destroy, :order => :name
   before_destroy :add_destroyed_tag
   attr_accessible :name, :title if _ct.use_attr_accessible?
   def to_s

data/spec/tag_examples.rb

@@ -429,6 +429,14 @@ shared_examples_for "Tag (without fixtures)" do
       end
     end
 
+    describe 'very deep trees' do
+      it 'should find_or_create very deep nodes' do
+        expected_ancestry_path = (1..200).to_a.map { |ea| ea.to_s }
+        target = tag_class.find_or_create_by_path(expected_ancestry_path)
+        target.ancestry_path.should == expected_ancestry_path
+      end
+    end
+
     describe 'DOT rendering' do
       it 'should render for an empty scope' do
         tag_class.to_dot_digraph(tag_class.where("0=1")).should == "digraph G {\n}\n"

metadata

@@ -1,167 +1,167 @@
 --- !ruby/object:Gem::Specification
 name: closure_tree
 version: !ruby/object:Gem::Version
-  version: 4.2.4
+  version: 4.2.5
 platform: ruby
 authors:
 - Matthew McEachen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-06-27 00:00:00.000000000 Z
+date: 2013-07-14 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activerecord
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: 3.0.0
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: 3.0.0
 - !ruby/object:Gem::Dependency
   name: with_advisory_lock
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: 0.0.9
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: 0.0.9
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: yard
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: fuubar
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: rspec-rails
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: mysql2
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: pg
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: sqlite3
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 - !ruby/object:Gem::Dependency
   name: uuidtools
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 description: Easily and efficiently make your ActiveRecord model support hierarchies
@@ -212,17 +212,17 @@ require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.3
+rubygems_version: 2.0.2
 signing_key: 
 specification_version: 4
 summary: Easily and efficiently make your ActiveRecord model support hierarchies