rbtree-ruby 0.1.4 → 0.1.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3d5898bb2e8aaea4617747c5f4024ab023a1afeabba3abafeaf2b86bb6afa986
-  data.tar.gz: c6651a33b8e66ee3528dc8ab3abf2359f3e2647fc27491e8bd5083ef08844d77
+  metadata.gz: 56ddd66545f9e423b96066b12deea8e22fc86b35b7a97be056ebf91f80543e77
+  data.tar.gz: 10a3ec88b0a5f5cb199ac96267d7665bfee99ab4fb9cf89488790fe798120b05
 SHA512:
-  metadata.gz: e7d1619486160150a91842631953842f3bddcb90213d415ec9aaca846184220ada9494cdae1eadf05ae5d523c5646b1ce19590d0b60c9df8ddd0c0f01a40ede7
-  data.tar.gz: ed2f20ab619e64c6daf16f4484fc52b0bc724e3b9b0f8b08c3a61921cbde5077f99beace823afbf3133c74ab3dfd838b48c5b09392bcaaee4fc0a930eb507589
+  metadata.gz: 1d521a30299f8c3db327d1b671d84113cf3c9e5adc90a78747e76b7480ef02ceb95d813a90eeebadfd32e4b8360b2d43fffd1ed1ac4d9314d8368cbe137ce7aa
+  data.tar.gz: 445a6cf0a99efdd0b5b4dc41dd86ec219e784cc3a2ecf150b4467e2619bcb08bd9b47d119d1c5310f43fdecdd7dc19941c3bfa4ae9e7b68d2b359819336f0a97

data/CHANGELOG.md

@@ -5,6 +5,15 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [0.1.5] - 2026-01-13
+
+### Changed
+- **Iterative Traversal**: Replaced recursive tree traversal with iterative approach
+  - `each`, `reverse_each`, and other traversal methods now use an explicit stack
+  - Prevents `SystemStackError` (stack overflow) on extremely deep trees
+  - Slightly improves iteration performance by removing recursion overhead
+  - Applies to both `RBTree` and `MultiRBTree`
+
 ## [0.1.4] - 2026-01-13
 
 ### Changed
@@ -68,6 +77,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
   - ASCII diagrams for tree rotation operations
 - MIT License (Copyright © 2026 Masahito Suzuki)
 
+[0.1.5]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.5
 [0.1.4]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.4
 [0.1.3]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.3
 [0.1.2]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.2

data/lib/rbtree/version.rb

@@ -2,5 +2,5 @@
 
 class RBTree
   # The version of the rbtree-ruby gem
-  VERSION = "0.1.4"
+  VERSION = "0.1.5"
 end

data/lib/rbtree.rb

@@ -465,10 +465,17 @@ class RBTree
   # @yield [key, value] each key-value pair in ascending order
   # @return [void]
   def traverse_asc(node, &block)
-    return if node == @nil_node
-    traverse_asc(node.left, &block)
-    yield node.key, node.value
-    traverse_asc(node.right, &block)
+    stack = []
+    current = node
+    while current != @nil_node || !stack.empty?
+      while current != @nil_node
+        stack << current
+        current = current.left
+      end
+      current = stack.pop
+      yield current.key, current.value
+      current = current.right
+    end
   end
 
   # Traverses the tree in descending order (reverse in-order traversal).
@@ -477,10 +484,17 @@ class RBTree
   # @yield [key, value] each key-value pair in descending order
   # @return [void]
   def traverse_desc(node, &block)
-    return if node == @nil_node
-    traverse_desc(node.right, &block)
-    yield node.key, node.value
-    traverse_desc(node.left, &block)
+    stack = []
+    current = node
+    while current != @nil_node || !stack.empty?
+      while current != @nil_node
+        stack << current
+        current = current.right
+      end
+      current = stack.pop
+      yield current.key, current.value
+      current = current.left
+    end
   end
 
   # Traverses nodes with keys less than the specified key.
@@ -1166,17 +1180,31 @@ class MultiRBTree < RBTree
   private
 
   def traverse_asc(node, &block)
-    return if node == @nil_node
-    traverse_asc(node.left, &block)
-    node.value.each { |v| yield node.key, v }
-    traverse_asc(node.right, &block)
+    stack = []
+    current = node
+    while current != @nil_node || !stack.empty?
+      while current != @nil_node
+        stack << current
+        current = current.left
+      end
+      current = stack.pop
+      current.value.each { |v| yield current.key, v }
+      current = current.right
+    end
   end
 
   def traverse_desc(node, &block)
-    return if node == @nil_node
-    traverse_desc(node.right, &block)
-    node.value.reverse_each { |v| yield node.key, v }
-    traverse_desc(node.left, &block)
+    stack = []
+    current = node
+    while current != @nil_node || !stack.empty?
+      while current != @nil_node
+        stack << current
+        current = current.right
+      end
+      current = stack.pop
+      current.value.reverse_each { |v| yield current.key, v }
+      current = current.left
+    end
   end
 
   def traverse_lt(node, key, &block)

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rbtree-ruby
 version: !ruby/object:Gem::Version
-  version: 0.1.4
+  version: 0.1.5
 platform: ruby
 authors:
 - Masahito Suzuki