rbtree-ruby 0.1.2 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 59400faa90822b08dbe1fc115c6bf28f526b4e139924e1950f625ac552f5124c
-  data.tar.gz: 3f7bda0222388236a6b9f0b8fc4e8fef0cc5e365b1b98eddceef73ec3c1d8114
+  metadata.gz: bc2846050227a83e7ae7bb63d1e6208ed39acc54de759c98e08d994685d1b067
+  data.tar.gz: 2a28105ee3667fb794c1f5d32c396b21542f45bceb3c858c160d7389f6d2ae3b
 SHA512:
-  metadata.gz: b2207668d8974b8af9e0261c819d3a63f537b557d9f1188799026524d27dd23703f020fb3ce397047bd6b9434cc3f079e42e68152f33fa9bd69ede97b4e66530
-  data.tar.gz: 593e5575adb4755b6a2212144ca56920918fe31a5a0b048e37655b5729216ee4bfe3f3ae43f5477ec2c8b9e0d2e1cf2ef4dca5df1208f757fef85a643c9b1c7d
+  metadata.gz: 22239d22c7b771a93bbb1811407d6ea6364ae21b22008d53d44e102188991b7299b6dacdcbc28a206dbfd21658d8081f964bf855b7c69c3d19d3312be49ffe3d
+  data.tar.gz: 8f98487332a3cb77f478f745b775b148aff862ab80fc020d064cade6a84692a4e498854cce864b4d49806a760ee7c6d9c38e4e9ac3e5c7598444ead625e91eb7

data/CHANGELOG.md

@@ -5,6 +5,16 @@ 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.3] - 2026-01-13
+
+### Changed
+- **Hybrid Hash Index**: Added internal `@hash_index` for O(1) key lookup
+  - `get(key)` and `has_key?(key)` now use hash lookup instead of tree traversal
+  - Search performance now matches Hash (within 10-20% overhead)
+  - Benchmark: 10M elements, 1M lookups - RBTree 290ms vs Hash 271ms
+  - Both RBTree and MultiRBTree benefit from this optimization
+  - Memory trade-off: ~1.5x due to hash index storage
+
 ## [0.1.2] - 2026-01-13
 
 ### Changed
@@ -49,4 +59,5 @@ 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.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.2"
+  VERSION = "0.1.3"
 end

data/lib/rbtree.rb

@@ -92,6 +92,7 @@ class RBTree
     @nil_node.right = @nil_node
     @root = @nil_node
     @min_node = @nil_node
+    @hash_index = {}  # Hash index for O(1) key lookup
     @size = 0
 
     if args.any?
@@ -139,7 +140,7 @@ class RBTree
   #   tree.has_key?(1)  # => true
   #   tree.has_key?(3)  # => false
   def has_key?(key)
-    find_node(key) != @nil_node
+    @hash_index.key?(key)
   end
 
   # Retrieves the value associated with the given key.
@@ -152,8 +153,7 @@ class RBTree
   #   tree[2]      # => "two"
   #   tree[3]      # => nil
   def get(key)
-    n = find_node(key)
-    n == @nil_node ? nil : n.value
+    @hash_index[key]&.value
   end
   alias_method :[], :get
 
@@ -207,6 +207,7 @@ class RBTree
       @min_node = z
     end
     
+    @hash_index[key] = z  # Add to hash index
     true
   end
   alias_method :[]=, :insert
@@ -232,6 +233,7 @@ class RBTree
   def clear
     @root = @nil_node
     @min_node = @nil_node
+    @hash_index.clear
     @size = 0
     self
   end
@@ -622,8 +624,8 @@ class RBTree
   # @param key [Object] the key to delete
   # @return [Object, nil] the value of the deleted node, or nil if not found
   def delete_node(key)
-    z = find_node(key)
-    return nil if z == @nil_node
+    z = @hash_index.delete(key)  # O(1) lookup and remove from index
+    return nil unless z
     remove_node(z)
   end
 
@@ -936,12 +938,12 @@ end
 # A Multi Red-Black Tree that allows duplicate keys.
 #
 # MultiRBTree extends RBTree to support multiple values per key. Each key maps to
-# a linked list of values rather than a single value. The size reflects the total
+# an array of values rather than a single value. The size reflects the total
 # number of key-value pairs (not unique keys).
 #
 # == Features
 #
-# * Multiple values per key using linked lists
+# * Multiple values per key using arrays
 # * Separate methods for single deletion (`delete_one`) vs. all deletions (`delete`)
 # * Values for each key maintain insertion order
 # * min/max return first/last values respectively
@@ -1041,6 +1043,7 @@ class MultiRBTree < RBTree
       @min_node = z
     end
     
+    @hash_index[key] = z  # Add to hash index
     true
   end
 
@@ -1058,12 +1061,13 @@ class MultiRBTree < RBTree
   #   tree.delete_one(1)  # => "first"
   #   tree.get(1)         # => "second"
   def delete_one(key)
-    z = find_node(key)
-    return nil if z == @nil_node
+    z = @hash_index[key]  # O(1) lookup
+    return nil unless z
 
     value = z.value.shift
     @size -= 1
     if z.value.empty?
+      @hash_index.delete(key)  # Remove from index when node removed
       remove_node(z)
     end
     value
@@ -1082,8 +1086,8 @@ class MultiRBTree < RBTree
   #   vals = tree.delete(1)  # removes both values
   #   vals.size  # => 2
   def delete(key)
-    z = find_node(key)
-    return nil if z == @nil_node
+    z = @hash_index.delete(key)  # O(1) lookup and remove from index
+    return nil unless z
     
     count = z.value.size
     remove_node(z)
@@ -1257,4 +1261,3 @@ class RBTree::Node
   # @return [Boolean] true if black, false otherwise
   def black? = @color == BLACK
 end
-

metadata

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