mm-tree 0.1.1 → 0.1.2

data/lib/locale/en.yml

@@ -5,4 +5,4 @@ en:
         tree:
           cyclic: "Can't be children of a descendant"
           incorrect_parent_nv_dv: "Positional values doesn't match parent (check nv/dv values)"
-          search_class_mismatch: "Mismatch between search classes. Parent: %{parent_search_class} Node: %{node_search_class}. They must be equal"
+          search_class_mismatch: "Mismatch between search classes. Parent: %{parent_search_class} Node: %{node_search_class}"

data/lib/locale/nb.yml

@@ -0,0 +1,8 @@
+nb:
+  mongo_mapper:
+    errors:
+      messages:
+        tree:
+          cyclic: "Kan ikke være barnet av en etterkommer."
+          incorrect_parent_nv_dv: "Posisjonelle/rasjonelle verdier stemmer ikke (check nv/dv values)"
+          search_class_mismatch: "Søke klassene er ikke identiske. Forelder: %{parent_search_class} Node/barn: %{node_search_class}."

data/lib/mongo_mapper/plugins/tree.rb

@@ -12,6 +12,22 @@ module MongoMapper
           self.where(tree_parent_id_field => nil).sort(tree_sort_order()).all
         end
 
+        # force all keys to update
+        def rekey_all!
+          # rekey keys for each root. will do children 
+          _pos = 1
+          self.roots.each do |root|
+            new_keys = keys_from_parent_keys_and_position({:nv => 0, :dv => 1, :snv => 1, :sdv => 0}, _pos)
+            if !compare_keys(root.tree_keys(), new_keys)
+              root.move_nv_dv(new_keys[:nv], new_keys[:dv], {:ignore_conflict => true})
+              root.save!
+              root.reload
+            end
+            root.rekey_children
+            _pos += 1
+          end
+        end
+
         def position_from_nv_dv(nv, dv)
           anc_tree_keys = ancestor_tree_keys(nv, dv)
           (nv - anc_tree_keys[:nv]) / anc_tree_keys[:snv]
@@ -51,11 +67,25 @@ module MongoMapper
           return rethash
         end #get_ancestor_keys(nv,dv)
 
+        def keys_from_parent_keys_and_position(parent_keys, position)
+          { :nv => parent_keys[:nv] + (position * parent_keys[:snv]),
+            :dv => parent_keys[:dv] + (position * parent_keys[:sdv]),
+            :snv => parent_keys[:nv] + ((position + 1) * parent_keys[:snv]),
+            :sdv => parent_keys[:dv] + ((position + 1) * parent_keys[:sdv]) }
+        end
+
+        def compare_keys(key1, key2)
+        ( (key1[:nv] === key2[:nv]) and
+          (key1[:dv] === key2[:dv]) and
+          (key1[:snv] === key2[:snv]) and
+          (key1[:sdv] === key2[:sdv]))
+        end
+
         def tree_sort_order
           if !tree_use_rational_numbers
-            "#{tree_order} tree_info.depth.asc" 
+            "#{tree_order} #{tree_info_depth_field}" 
           else
-            "tree_info.nv_div_dv.asc"
+            tree_info_nv_div_dv_field.asc
           end
         end
 
@@ -85,11 +115,17 @@ module MongoMapper
         self.tree_search_class ||= self
 
         class_attribute :tree_parent_id_field
-        self.tree_parent_id_field ||= "parent_id"
+        self.tree_parent_id_field ||= :parent_id
 
         class_attribute :tree_use_rational_numbers
         self.tree_use_rational_numbers ||= true
 
+        class_attribute :tree_info_depth_field
+        self.tree_info_depth_field ||= :tree_info_depth
+
+        class_attribute :tree_info_nv_div_dv_field
+        self.tree_info_nv_div_dv_field ||= :tree_info_nv_div_dv
+
         class_attribute :tree_order
 
         key tree_parent_id_field, ObjectId
@@ -139,11 +175,11 @@ module MongoMapper
         if parent.nil?
           self[tree_parent_id_field] = nil
           self.tree_info.path = []
-          self.tree_info.depth = 0
+          self[tree_info_depth_field] = 0
         elsif !!opts[:force] || self.changes.include?(tree_parent_id_field)
           @_will_move = true
           self.tree_info.path  = parent.tree_info.path + [parent._id] 
-          self.tree_info.depth = parent.tree_info.depth + 1
+          self[tree_info_depth_field] = parent[tree_info_depth_field] + 1
         end
       end
 
@@ -156,8 +192,8 @@ module MongoMapper
         self.tree_info.dv = dv
       end
 
-    # TODO: what if we move parent without providing NV/DV??? NEED TO SUPPORT THAT AS WELL!
-    # Should calculate next free nv/dv and set that if parent has changed. (set values to "missing and call missing function should work")
+      # Should calculate next free nv/dv and set that if parent has changed. 
+      # (set values to "missing and call missing function should work")
       def update_nv_dv(opts = {})
         return if !tree_use_rational_numbers
         if @_set_nv_dv == true
@@ -172,9 +208,8 @@ module MongoMapper
         elsif (self.changes.include?(tree_parent_id_field)) || opts[:force]
           # only changed parent, needs to find next free position
           # use function for "missing nv/dv"
-          # TODO CHECK THIS!!!! might only need self.has_siblings? instead of + 1
-          new_keys = self.next_keys_available(self[tree_parent_id_field], (self.has_siblings? + 1)) if !opts[:position]
-          new_keys = self.next_keys_available(self[tree_parent_id_field], (opts[:position] + 1)) if opts[:position]
+          new_keys = self.keys_from_position((self.has_siblings? + 1)) if !opts[:position]
+          new_keys = self.keys_from_position((opts[:position] + 1)) if opts[:position]
           self.move_nv_dv(new_keys[:nv], new_keys[:dv])
         end
       end
@@ -193,12 +228,12 @@ module MongoMapper
           else
             last_sibling_position = self.class.position_from_nv_dv(last_sibling.tree_info.nv, last_sibling.tree_info.dv)
           end
-          new_keys = self.next_keys_available(self[tree_parent_id_field], (last_sibling_position + 1) )
+          new_keys = self.keys_from_position((last_sibling_position + 1) )
           self.tree_info.nv = new_keys[:nv]
           self.tree_info.dv = new_keys[:dv]
           self.tree_info.snv = new_keys[:snv]
           self.tree_info.sdv = new_keys[:sdv]
-          self.tree_info.nv_div_dv = Float(new_keys[:nv]/Float(new_keys[:dv]))
+          self[tree_info_nv_div_dv_field] = Float(new_keys[:nv]/Float(new_keys[:dv]))
           @_set_nv_dv = true
         end
       end
@@ -208,9 +243,6 @@ module MongoMapper
       # can force move without updating conflicting siblings
       def move_nv_dv(nv, dv, opts = {})
         return if !tree_use_rational_numbers
-#        return
-        # nv_div_dv = Float(nv)/Float(dv)
-        # find nv_div_dv?
         position = self.class.position_from_nv_dv(nv, dv)
         if !self.root?
           anc_keys = self.class.ancestor_tree_keys(nv, dv)
@@ -240,14 +272,14 @@ module MongoMapper
         self.tree_info.dv = dv
         self.tree_info.snv = rnv
         self.tree_info.sdv = rdv
-        self.tree_info.nv_div_dv = Float(self.tree_info.nv)/Float(self.tree_info.dv)
+        self[tree_info_nv_div_dv_field] = Float(self.tree_info.nv)/Float(self.tree_info.dv)
         # as this is triggered from after_validation, save should be triggered by the caller.
       end
       # change this require ancestor data + position, 
       # next position can be found using: self.has_siblings? + 1
       # as when moving children, the sibling_count won't work
-      def next_keys_available(parent_id, position)
-        _parent = tree_search_class.where(:_id => parent_id).first
+      def keys_from_position(position)
+        _parent = tree_search_class.where(:_id => self[tree_parent_id_field]).first
         _parent = nil if ((_parent.nil?) || (_parent == []))
         ancnv = 0
         ancsnv = 1
@@ -259,24 +291,11 @@ module MongoMapper
           ancdv  = _parent.tree_info.dv
           ancsdv = _parent.tree_info.sdv
         end
-        if (position == 0) && (_parent.nil?)
-          rethash = {:nv => 1, :dv => 1, :snv => 2, :sdv => 1}
-        else 
-          # get values from sibling_count
-          _nv = ancnv + (position * ancsnv)
-          _dv = ancdv + (position * ancsdv)
-          rethash = {
-            :nv => _nv,
-            :dv => _dv,
-            :snv => ancnv + ((position + 1) * ancsnv),
-            :sdv => ancdv + ((position + 1) * ancsdv)
-          }
-        end
-        rethash
+        self.class.keys_from_parent_keys_and_position({:nv => ancnv, :dv => ancdv, :snv => ancsnv, :sdv => ancsdv}, position)
       end
 
       def next_sibling_keys
-        next_keys_available(self[tree_parent_id_field], self.class.position_from_nv_dv(self.tree_info.nv, self.tree_info.dv) +1)
+        keys_from_position(self.class.position_from_nv_dv(self.tree_info.nv, self.tree_info.dv) +1)
       end
 
       # to save queries, this will calculate ancestor tree keys instead of query them
@@ -330,6 +349,21 @@ module MongoMapper
         end
       end
 
+      def rekey_children
+        return if (!self.children?)
+        _pos = 1
+        self.children.each do |child|
+          new_keys = self.class.keys_from_parent_keys_and_position(self.tree_keys(), _pos)
+          if !self.class.compare_keys(child.tree_keys(), new_keys)
+            child.move_nv_dv(new_keys[:nv], new_keys[:dv], {:ignore_conflict => true})
+            child.save!
+            child.reload
+          end
+          child.rekey_children
+          _pos += 1
+        end
+      end
+
       def root?
         self[tree_parent_id_field].nil?
       end
@@ -416,17 +450,8 @@ module MongoMapper
           self.children.each do |child|
             child.update_path!
             child.update_nv_dv!(:position => _position)
-            # puts "Update Child - #{child.name.inspect} #{child.changes.inspect}"
-            # puts "#{child.updated_at.to_f}"
-            child.save
-            child.reload
-            # puts "#{child.updated_at.to_f}"
             child.save
             child.reload
-            # puts "#{child.updated_at.to_f}"
-            child.reload
-            # puts "#{child.updated_at.to_f}"
-
             _position += 1
           end
           self.enable_timestamp_callback()

data/lib/version.rb

@@ -1,6 +1,6 @@
 # encoding: UTF-8
 module MongoMapper
   module Tree
-    Version = '0.1.1'
+    Version = '0.1.2'
   end
 end

data/test/helper.rb

@@ -41,4 +41,36 @@ class Test::Unit::TestCase
   def eql_arrays?(first, second)
     first.collect(&:_id).to_set == second.collect(&:_id).to_set
   end
+
+  custom_matcher :verify_keys do |receiver, matcher, args|
+    testkeys = args[0]
+    matcher.positive_failure_message = "Expected #{receiver.name} to match keys #{testkeys}, but got #{receiver.tree_keys()}"
+    matcher.negative_failure_message = "Expected #{receiver.name} to NOT match keys #{testkeys}, but got #{receiver.tree_keys()}"
+    rkeys = receiver.tree_keys()
+    ( (rkeys[:nv] === testkeys[:nv]) and
+      (rkeys[:dv] === testkeys[:dv]) and
+      (rkeys[:snv] === testkeys[:snv]) and
+      (rkeys[:sdv] === testkeys[:sdv]))
+  end
+
+  custom_matcher :verify_order do |receiver, matcher, args|
+    matching_order = args[0]
+    order_from_reciever_ids = Array.new
+    order_from_reciever_names = Array.new
+    receiver.each do |reci|
+      # order_from_reciever_ids << reci._id
+      order_from_reciever_names << reci.name
+    end
+    
+    order_from_matching_ids = Array.new
+    order_from_matching_names = Array.new
+    matching_order.each do |matc|
+      # order_from_matching_ids << matc._id
+      order_from_matching_names << matc.name
+    end
+    matcher.positive_failure_message = "Expected order to be #{order_from_matching_names}, but got #{order_from_reciever_names}"
+    matcher.negative_failure_message = "Expected order to be different from #{order_from_matching_names}, but got #{order_from_reciever_names}"
+    receiver == args[0]
+  end
+
 end

data/test/test_search_class_multi.rb

@@ -14,7 +14,7 @@ class TestSearchScope < Test::Unit::TestCase
       @cube_1_2 = Cube.create(:name => "Cube 1.2", :parent => @cube_1)
       @cube_1_2_1 = Cube.create(:name => "Cube 1.2.1", :parent => @cube_1_2)
       @cube_1_2_2 = Cube.create(:name => "Cube 1.2.2", :parent => @cube_1_2)
-      @cube_1_2_2_1 = Cube.create(:name => "Cube 1.2.2.1", :parent => @cube_1_2_1)
+      @cube_1_2_1_1 = Cube.create(:name => "Cube 1.2.1.1", :parent => @cube_1_2_1)
     end
 
     should "return cubes as children of cube_1" do
@@ -37,9 +37,10 @@ class TestSearchScope < Test::Unit::TestCase
       @cube_1_2.reload
       @cube_1_2_1.reload
       @cube_1_2_2.reload
-      @cube_1_2_2_1.reload
-      @cube_1_1.siblings.should == [@cube_1_2, @cube_1_2_2]
-      @cube_1.descendants.should == [@cube_1_1, @cube_1_2, @cube_1_2_1, @cube_1_2_2, @cube_1_2_2_1]
+      @cube_1_2_1_1.reload
+      @cube_1_1.siblings.should verify_order(Array[@cube_1_2, @cube_1_2_2])
+      @cube_1.descendants.should verify_order(Array[@cube_1_1, @cube_1_2, @cube_1_2_1, @cube_1_2_1_1, @cube_1_2_2])
+      @cube_1.children.should verify_order(Array[@cube_1_1, @cube_1_2, @cube_1_2_2])
     end
 
     should "not return any triangles or cubes descendants of shape_1" do
@@ -64,7 +65,7 @@ class TestSearchScope < Test::Unit::TestCase
       @cube_1.errors.count.should == 1 #should have an error
       @cube_1.errors.each do |attribute, errmsg|
         attribute.to_s.should == "base"
-        errmsg.should == ("Mismatch between search classes. Parent: Triangle Node: Cube. They must be equal")
+        errmsg.should == ("Mismatch between search classes. Parent: Triangle Node: Cube")
       end
     end
 

data/test/test_tree.rb

@@ -8,8 +8,7 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
       @node_1_2_1  = Category.create(:name => "Node 1.2.1", :parent => @node_1_2)
       @node_1_2_2  = Category.create(:name => "Node 1.2.2", :parent => @node_1_2)
       @node_1_3    = Category.create(:name => "Node 1.3", :parent => @node_1)
-      #@node_4    = Category.create(:name => "Node 3", :parent => @node_1)
-      @node_2     = Category.create(:name => "Node 2")
+      @node_2      = Category.create(:name => "Node 2")
       @node_2_1    = Category.create(:name => "Node 2.1", :parent => @node_2)
       @node_2_2    = Category.create(:name => "Node 2.2", :parent => @node_2)
       @node_2_3    = Category.create(:name => "Node 2.3", :parent => @node_2)
@@ -53,9 +52,9 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
       end
 
       should "set depth" do
-        @node_1.tree_info.depth.should == 0
-        @node_1_1.tree_info.depth.should == 1
-        @node_1_2_1.tree_info.depth.should == 2
+        @node_1[Category.tree_info_depth_field].should == 0
+        @node_1_1[Category.tree_info_depth_field].should == 1
+        @node_1_2_1[Category.tree_info_depth_field].should == 2
       end
 
       should "have children" do
@@ -118,7 +117,7 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
           assert @node_1_2.descendants.include?(@node_1_3)
           assert @node_1_2_1.is_or_is_sibling_of?(@node_1_3)
           assert @node_1_2_2.is_or_is_sibling_of?(@node_1_3)
-          @node_1_3.tree_info.depth.should == 2
+          @node_1_3[Category.tree_info_depth_field].should == 2
         end
 
         should "move children on save" do
@@ -194,6 +193,26 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
     end
 
     context "node (keys)" do
+      should "verify order of tree" do
+        all_category_items = Category.sort(Category.tree_sort_order).all
+        correct_order = Array[@node_1, 
+                            @node_1_1, 
+                            @node_1_2,
+                            @node_1_2_1,
+                            @node_1_2_2,
+                            @node_1_3,
+                            @node_2,
+                            @node_2_1,
+                            @node_2_2,
+                            @node_2_3,
+                            @node_2_4,
+                            @node_2_4_1,
+                            @node_2_4_1_1,
+                            @node_2_4_2,
+                            @node_2_4_3]
+          all_category_items.should verify_order(correct_order);
+        end
+
       should "find keys from id" do
         assert Category.find(@node_1._id).tree_keys == @node_1.tree_keys, "Query doesn't match created object #{@node_1.name}"
         assert Category.find(@node_2_4_1_1._id).tree_keys == @node_2_4_1_1.tree_keys, "Query doesn't match created object #{@node_2_4_1_1.name}"
@@ -236,7 +255,7 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
 
       should "move to new specific nv, dv location and move conflicting items" do
         assert @node_2_4.ancestor_tree_keys() == @node_2.tree_keys(), "Before move: #{@node_2_4.name} ancestor keys should match #{@node_2.name} got: #{@node_2_4.ancestor_tree_keys()} expected: #{@node_2.tree_keys()}"
-        assert @node_2_4_1.tree_info.depth == 2, "Before move: Depth of #{@node_2_4_1.name} should be 2"
+        assert @node_2_4_1[Category.tree_info_depth_field] == 2, "Before move: Depth of #{@node_2_4_1.name} should be 2"
         old_1_2_keys = @node_1_2.tree_keys()
         new_node_1_2_keys = @node_1_2.next_sibling_keys
         @node_2_4.set_position(@node_1_2.tree_info.nv, @node_1_2.tree_info.dv)
@@ -253,7 +272,7 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
 
       should "move @node_2_4 to root position" do
         assert @node_2_4.ancestor_tree_keys() == @node_2.tree_keys(), "Before move: #{@node_2_4.name} ancestor keys should match #{@node_2.name} got: #{@node_2_4.ancestor_tree_keys()} expected: #{@node_2.tree_keys()}"
-        assert @node_2_4_1.tree_info.depth == 2, "Before move: Depth of #{@node_2_4_1.name} should be 2"
+        assert @node_2_4_1[Category.tree_info_depth_field] == 2, "Before move: Depth of #{@node_2_4_1.name} should be 2"
         @node_2_4.parent = nil
         @node_2_4.save
         @node_2_4.reload
@@ -263,7 +282,7 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
       # TODO: OVERRIDE RELOAD TO LOAD ALL CHILDREN IN MEMORY/CACHE/ASSOCS
         @node_2_4_1.reload
         assert @node_2_4_1.tree_info.path.count == 1, "After move:  Path length of #{@node_2_4_1.name} should only be 1"
-        assert @node_2_4_1.tree_info.depth == 1, "After move: Depth of #{@node_2_4_1.name} should be 1"
+        assert @node_2_4_1[Category.tree_info_depth_field] == 1, "After move: Depth of #{@node_2_4_1.name} should be 1"
         assert @node_2_4_1.ancestor_tree_keys()   == @node_2_4.tree_keys(),   "After move: #{@node_2_4_1.name} ancestor keys should match #{@node_2_4.name} got: #{@node_2_4_1.ancestor_tree_keys()} expected: #{@node_2_4.tree_keys()}"
       # TODO: OVERRIDE RELOAD TO LOAD ALL CHILDREN IN MEMORY/CACHE/ASSOCS
         @node_2_4_1_1.reload
@@ -295,11 +314,59 @@ class TestMongomapperActsAsTree < Test::Unit::TestCase
         node_1_4.tree_keys.should_not == Hash[:nv => 7, :dv => 4, :snv => 9, :sdv => 5]
         node_1_4.tree_keys.should == Hash[:nv => 9, :dv => 5, :snv => 11, :sdv => 6]
       end
-    end # tree keys
 
-    should "rekey the entire treestructre" do
-      # TODO
+    end # context "node (keys)" do
+    context "when rekeying" do
+      should "be able to update the entire treestructre" do
+        return true
+        old_keys_node_1_2     = @node_1_2.tree_keys()
+        old_keys_node_2_4_2   = @node_2_4_2.tree_keys()
+        @node_1_2.destroy
+        @node_2_4_2.destroy
+        Category.rekey_all!
+
+        # verify some nodes that should be unaffected by rekeying
+        @node_1.reload
+        @node_2.reload
+        @node_2_1.reload
+        @node_1.should        verify_keys(Hash[:nv => 1, :dv => 1, :snv => 2, :sdv => 1])
+        @node_2.should        verify_keys(Hash[:nv => 2, :dv => 1, :snv => 3, :sdv => 1])
+        @node_2_1.should      verify_keys(Hash[:nv => 5, :dv => 2, :snv => 8, :sdv => 3])
+
+        @node_1_3.reload
+        @node_2_4_3.reload
+        @node_1_3.should      verify_keys(old_keys_node_1_2)
+        @node_2_4_3.should    verify_keys(old_keys_node_2_4_2)
+      end
+
+      should "rekey descendants of node_2" do
+        _node_2_2_1    = Category.create(:name => "Node 2.2.1", :parent => @node_2_2)
+        _node_2_2_1_1  = Category.create(:name => "Node 2.2.1.1", :parent => _node_2_2_1)
+        old_keys_node_2_4_1_1 = @node_2_4_1_1.tree_keys()
+        old_keys_node_2_4_1   = @node_2_4_1.tree_keys()
+        old_keys_node_2_2     = @node_2_2.tree_keys()
+        old_keys_node_2_2_1_1 = _node_2_2_1_1.tree_keys()
+        old_keys_node_2_2_1   = _node_2_2_1.tree_keys()
+        _node_2_2_1.destroy # delete temporary node
+        @node_2_2.destroy
+        @node_2_3.destroy
+        @node_2.rekey_children()
+        @node_2_4.reload
+        @node_2_4_1.reload
+        @node_2_4_1_1.reload
+
+        # verify some nodes that should be unaffected by rekeying
+        @node_1.reload
+        @node_1.should            verify_keys(Hash[:nv => 1, :dv => 1, :snv => 2, :sdv => 1])
+        @node_2_4.should          verify_keys(old_keys_node_2_2)
+        @node_2_4_1.should_not    verify_keys(old_keys_node_2_4_1)
+        @node_2_4_1_1.should_not  verify_keys(old_keys_node_2_4_1_1)
+        @node_2_4_1.should        verify_keys(old_keys_node_2_2_1)
+        @node_2_4_1_1.should      verify_keys(old_keys_node_2_2_1_1)
+      end
+
     end
 
+
   end #Context "Tree" do
 end

metadata

@@ -1,40 +1,50 @@
---- !ruby/object:Gem::Specification
+--- !ruby/object:Gem::Specification 
 name: mm-tree
-version: !ruby/object:Gem::Version
-  version: 0.1.1
+version: !ruby/object:Gem::Version 
+  hash: 31
   prerelease: 
+  segments: 
+  - 0
+  - 1
+  - 2
+  version: 0.1.2
 platform: ruby
-authors:
+authors: 
 - Leif Ringstad
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-08-28 00:00:00.000000000 Z
-dependencies:
-- !ruby/object:Gem::Dependency
-  name: mongo_mapper
-  requirement: !ruby/object:Gem::Requirement
-    none: false
-    requirements:
-    - - ~>
-      - !ruby/object:Gem::Version
-        version: 0.11.2
+
+date: 2012-09-02 00:00:00 Z
+dependencies: 
+- !ruby/object:Gem::Dependency 
   type: :runtime
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
+  requirement: &id001 !ruby/object:Gem::Requirement 
     none: false
-    requirements:
+    requirements: 
     - - ~>
-      - !ruby/object:Gem::Version
+      - !ruby/object:Gem::Version 
+        hash: 55
+        segments: 
+        - 0
+        - 11
+        - 2
         version: 0.11.2
+  version_requirements: *id001
+  prerelease: false
+  name: mongo_mapper
 description: Tree structure for MongoMapper with rational number sorting
-email:
+email: 
 - leifcr@gmail.com
 executables: []
+
 extensions: []
+
 extra_rdoc_files: []
-files:
+
+files: 
 - lib/locale/en.yml
+- lib/locale/nb.yml
 - lib/mm-tree.rb
 - lib/mongo_mapper/plugins/tree.rb
 - lib/mongo_mapper/plugins/tree_info.rb
@@ -51,35 +61,38 @@ files:
 - README.rdoc
 homepage: http://github.com/leifcr/mm-tree
 licenses: []
+
 post_install_message: 
 rdoc_options: []
-require_paths:
+
+require_paths: 
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement
+required_ruby_version: !ruby/object:Gem::Requirement 
   none: false
-  requirements:
-  - - ! '>='
-    - !ruby/object:Gem::Version
-      version: '0'
-      segments:
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
       - 0
-      hash: -3601179477307526079
-required_rubygems_version: !ruby/object:Gem::Requirement
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
   none: false
-  requirements:
-  - - ! '>='
-    - !ruby/object:Gem::Version
-      version: '0'
-      segments:
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
       - 0
-      hash: -3601179477307526079
+      version: "0"
 requirements: []
+
 rubyforge_project: 
 rubygems_version: 1.8.24
 signing_key: 
 specification_version: 3
 summary: Tree structure for MongoMapper
-test_files:
+test_files: 
 - test/helper.rb
 - test/models/category.rb
 - test/models/ordered_category.rb