red-black-tree 0.1.9 → 0.1.10

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 06ad66aa31594940e116b62cd872c61dc65ebb90964e097d84b4d540e9eefa2d
-  data.tar.gz: 74ae5eae6622755db6e1df89fe03e598e8c9c3bd22ce20ebe363464c60c6f7f6
+  metadata.gz: ef532dd5b5da89ad3dbf780bba52824ecdece998306dc89d4742ddd7b9444a1b
+  data.tar.gz: dee8cd6cb0ebf9b837519d9131790590e6fcab86c5fe45af0d28cb603d53f224
 SHA512:
-  metadata.gz: a17c8c5c6e2aab3cd53736d00ba3367b402450383b9f8a078669887d2590eed699e4d559dd588c18d90a0ce4fcde64b6a4c9aee8fc6452ab2d663e50c79b11bb
-  data.tar.gz: cfcd5d572e43089fce345cab92d8327c3002f6c282f422316dc16d48020672ac8a62f878b33a67d73f55027498df1f36fa5d1f7526f31a943b0860338a7f00c5
+  metadata.gz: 75b0530cb685fb3cfcd1fa8435a8329e97df9fbd49e5e7063b5de0c34cbef24c453dc5d22481c8ba4cafe475f48ea3ccafa37788ef92b066c667882ce860130c
+  data.tar.gz: 8fdf009768bfb1551f2f4954ddab323c12b1d76d438c0be8b2bbb4ffe10816de58513e2642649ad78b25b1ea931a03a29a82b3d2df6a3dfeae70997158fe9183

data/CHANGELOG.md

@@ -1,5 +1,9 @@
 ## [Unreleased]
 
+## [0.1.10] - 2026-05-17
+
+- Fix `RedBlackTree#delete!` orphaning predecessor's child when deleting a node with two valid children
+
 ## [0.1.9] - 2026-05-10
 
 - Add `Enumerable` to `RedBlackTree`

data/README.md

@@ -156,34 +156,34 @@ Benchmark.ips do |x|
   x.compare!
 end
 
-#=> ruby 3.4.1 (2024-12-25 revision 48d4efcb85) +YJIT +PRISM [arm64-darwin24]
+#=> ruby 4.0.3 (2026-04-21 revision 85ddef263a) +YJIT +PRISM [arm64-darwin23]
 #=> Warming up --------------------------------------
 #=>  RedBlackTree#search     3.000 i/100ms
 #=> Array#find (gradual sort)
 #=>                          1.000 i/100ms
 #=> Array#find (single sort)
-#=>                         95.000 i/100ms
+#=>                         79.000 i/100ms
 #=> Array#bsearch (gradual sort)
 #=>                          1.000 i/100ms
 #=> Array#bsearch (single sort)
-#=>                        108.000 i/100ms
+#=>                         87.000 i/100ms
 #=> Calculating -------------------------------------
-#=>  RedBlackTree#search     42.850 (± 4.7%) i/s   (23.34 ms/i) -    216.000 in   5.049896s
+#=>  RedBlackTree#search     32.188 (± 6.2%) i/s   (31.07 ms/i) -    162.000 in   5.051229s
 #=> Array#find (gradual sort)
-#=>                           0.274 (± 0.0%) i/s     (3.65 s/i) -      2.000 in   7.302412s
+#=>                           0.207 (± 0.0%) i/s     (4.83 s/i) -      2.000 in   9.651532s
 #=> Array#find (single sort)
-#=>                         935.492 (± 2.7%) i/s    (1.07 ms/i) -      4.750k in   5.081415s
+#=>                         809.310 (± 3.8%) i/s    (1.24 ms/i) -      4.108k in   5.084020s
 #=> Array#bsearch (gradual sort)
-#=>                           0.275 (± 0.0%) i/s     (3.63 s/i) -      2.000 in   7.269027s
+#=>                           0.205 (± 0.0%) i/s     (4.88 s/i) -      2.000 in   9.753754s
 #=> Array#bsearch (single sort)
-#=>                          1.104k (± 2.0%) i/s  (905.52 μs/i) -      5.616k in   5.087395s
-#=>
+#=>                         857.497 (± 1.0%) i/s    (1.17 ms/i) -      4.350k in   5.073414s
+#=> 
 #=> Comparison:
-#=>  Array#bsearch (single sort):     1104.3 i/s
-#=>     Array#find (single sort):      935.5 i/s - 1.18x  slower
-#=>          RedBlackTree#search:       42.9 i/s - 25.77x  slower
-#=> Array#bsearch (gradual sort):        0.3 i/s - 4013.67x  slower
-#=>    Array#find (gradual sort):        0.3 i/s - 4031.85x  slower
+#=> Array#bsearch (single sort):      857.5 i/s
+#=> Array#find (single sort):      809.3 i/s - 1.06x  slower
+#=>  RedBlackTree#search:       32.2 i/s - 26.64x  slower
+#=> Array#find (gradual sort):        0.2 i/s - 4138.00x  slower
+#=> Array#bsearch (gradual sort):        0.2 i/s - 4181.79x  slower
 ```
 
 ## WIP Features

data/lib/red-black-tree.rb

@@ -135,7 +135,9 @@ class RedBlackTree
 
     if node.children_are_valid?
       delete_node_with_two_children! node
-    elsif node.single_child_is_valid?
+    end
+
+    if node.single_child_is_valid?
       delete_node_with_one_child! node
     elsif node.children_are_leaves?
       delete_leaf_node! node, original_node
@@ -348,7 +350,6 @@ class RedBlackTree
     predecessor = predecessor.right until predecessor.right.leaf?
     node.swap_colour_with! predecessor
     node.swap_position_with! predecessor
-    node.swap_position_with! LeafNode.new
 
     @root = predecessor if is_root
   end

data/lib/red_black_tree/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 class RedBlackTree
-  VERSION = "0.1.9"
+  VERSION = "0.1.10"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: red-black-tree
 version: !ruby/object:Gem::Version
-  version: 0.1.9
+  version: 0.1.10
 platform: ruby
 authors:
 - Joshua Young
@@ -49,7 +49,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 4.0.6
+rubygems_version: 4.0.10
 specification_version: 4
 summary: Red-Black Tree Data Structure for Ruby
 test_files: []