rbtree-ruby 0.1.4 → 0.1.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3d5898bb2e8aaea4617747c5f4024ab023a1afeabba3abafeaf2b86bb6afa986
-  data.tar.gz: c6651a33b8e66ee3528dc8ab3abf2359f3e2647fc27491e8bd5083ef08844d77
+  metadata.gz: bf6eb0a695ef93f89f9af8ceea5928c549785ea0110992f061b00ecdc76e3d64
+  data.tar.gz: 458cbee1ded3e8e0686ec495392bffbaf881ac0bc798d68790240abb0a3011b7
 SHA512:
-  metadata.gz: e7d1619486160150a91842631953842f3bddcb90213d415ec9aaca846184220ada9494cdae1eadf05ae5d523c5646b1ce19590d0b60c9df8ddd0c0f01a40ede7
-  data.tar.gz: ed2f20ab619e64c6daf16f4484fc52b0bc724e3b9b0f8b08c3a61921cbde5077f99beace823afbf3133c74ab3dfd838b48c5b09392bcaaee4fc0a930eb507589
+  metadata.gz: 48ee9755aad89802b6cb1b6af19a7919151e14531f2c6e2f2dfbb07062c5e1060490e8d5244d0fd960f44d4eb8b00e84ee9f24e5b3be6319c808f212dde848c2
+  data.tar.gz: aeadf12c689069742c8cc05c569a84bbb6a87b3736f2f7e6351b68fb2aae5dbc24eca80e65a97455b50dae82b47c3ade7b8b70a171d86f879a179865eab9182d

data/CHANGELOG.md

@@ -5,6 +5,21 @@ 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.6] - 2026-01-13
+
+### Changed
+- **Performance**: Standardized on Boolean colors (`true`/`false`) instead of Symbols (`:red`/`:black`) for faster checks.
+- **Optimization**: `insert` operations now check the internal hash index first, allowing O(1) updates for existing keys (RBTree) and O(1) appends (MultiRBTree).
+
+## [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 +83,8 @@ 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.6]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.6
+[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.6"
 end

data/lib/rbtree.rb

@@ -174,6 +174,11 @@ class RBTree
   #   tree.insert(1, 'uno', overwrite: false)  # => nil (no change)
   #   tree[2] = 'two'              # using alias
   def insert(key, value, overwrite: true)
+    if (node = @hash_index[key])
+      return nil unless overwrite
+      node.value = value
+      return true
+    end
     y = @nil_node
     x = @root
     while x != @nil_node
@@ -465,10 +470,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 +489,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.
@@ -1038,6 +1057,10 @@ class MultiRBTree < RBTree
   #   tree.insert(1, 'first')
   #   tree.insert(1, 'second')  # adds another value for key 1
   def insert(key, value)
+    if (node = @hash_index[key])
+      node.value << value
+      return true
+    end
     y = @nil_node
     x = @root
     while x != @nil_node
@@ -1166,17 +1189,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)
@@ -1260,16 +1297,16 @@ end
 class RBTree::Node
   attr_accessor :key, :value, :color, :left, :right, :parent
 
-  # Red color constant
-  RED = :red
-  # Black color constant
-  BLACK = :black
+  # Red color constant (true)
+  RED = true
+  # Black color constant (false)
+  BLACK = false
 
   # Creates a new Node.
   #
   # @param key [Object] the key
   # @param value [Object] the value
-  # @param color [Symbol] the color (:red or :black)
+  # @param color [Boolean] the color (true=red, false=black)
   # @param left [Node] the left child
   # @param right [Node] the right child
   # @param parent [Node] the parent node

metadata

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