order_tree 0.0.2 → 0.0.3

data/lib/order_tree/order_tree_node.rb

@@ -16,7 +16,19 @@ module OrderTree
       self.prev.next = next_node if self.prev 
 
       if self.tree.root.first.equal? self
-        self.tree.root.first = self.next
+        if next_node
+          self.tree.root.instance_eval do
+            self.first = next_node
+          end
+        end
+      end
+
+      if self.tree.root.last.equal? self
+        if prev_node
+          self.tree.root.instance_eval do
+            self.last = prev_node
+          end
+        end
       end
 
       # try this so that the node can remove

data/lib/order_tree/version.rb

@@ -1,3 +1,3 @@
 module OrderTree
-  VERSION = "0.0.2"
+  VERSION = "0.0.3"
 end

data/spec/order_tree_spec.rb

@@ -41,7 +41,7 @@ describe OrderTree::UniqueProxy do
     proxy(5).inspect.should eq "5"
     OrderTree::UniqueProxy.verbose_inspect = true
     p = proxy(5) 
-    p.inspect.to_s.should match(/#<UniqueProxy:(.*?)\s=>\s5>/)
+    p.inspect.to_s.should match(/#<OrderTree::UniqueProxy:(.*?)\s=>\s5>/)
     p.to_s.should == "proxy(5)"
     OrderTree::UniqueProxy.verbose_inspect = false
     p2 = eval(p.to_s)
@@ -191,6 +191,26 @@ describe OrderTree::OrderTree do
     v.should eq 4
   end
 
+  it "can overwrite the last node without losing it" do
+    ot = OrderTree::OrderTree.new({:first => { :a => 'a', :b => 'c'}, :second => { :a => 'a', :b => 'b'}})
+    last_path = ot.each_path.to_a.last
+    ot[*last_path] = "b"
+
+    ot.each_path.to_a.last
+    ot[*last_path].should eq "b"
+  end
+
+  it "can overwrite the first node without losing it" do
+    ot = OrderTree::OrderTree.new({:first => { :a => 'a', :b => 'c'}, :second => { :a => 'a', :b => 'b'}})
+
+    first_path, second_path = ot.each_path.to_a[0..1]
+    ot[*first_path] = "old_first"
+
+    # is no last
+    ot[*ot.each_path.to_a.last].should eq "old_first"
+    ot.each_path.to_a.first.should eq second_path
+  end
+
   it "does == comparison" do
     ot = OrderTree::OrderTree.new @testhash
     ot2 = OrderTree::OrderTree.new @testhash

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: order_tree
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
   prerelease: 
 platform: ruby
 authors:
@@ -9,12 +9,12 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2011-07-25 00:00:00.000000000 -05:00
+date: 2011-07-26 00:00:00.000000000 -05:00
 default_executable: 
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
-  requirement: &3691310 !ruby/object:Gem::Requirement
+  requirement: &3691050 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -22,10 +22,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *3691310
+  version_requirements: *3691050
 - !ruby/object:Gem::Dependency
   name: simplecov
-  requirement: &3691090 !ruby/object:Gem::Requirement
+  requirement: &3690830 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -33,10 +33,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *3691090
+  version_requirements: *3690830
 - !ruby/object:Gem::Dependency
   name: ruby-prof
-  requirement: &3690870 !ruby/object:Gem::Requirement
+  requirement: &3690610 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -44,10 +44,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *3690870
+  version_requirements: *3690610
 - !ruby/object:Gem::Dependency
   name: ruby-debug19
-  requirement: &3690650 !ruby/object:Gem::Requirement
+  requirement: &3690400 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -55,7 +55,7 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *3690650
+  version_requirements: *3690400
 description: Use OrderTree when you need both insertion order access and nested hash
   path style access
 email: