rbtree-ruby 0.1.1 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 047f125ed11edef5fa998d90ff50d80f90879a065d6407b02184d21089f0b1a8
-  data.tar.gz: 1bb83c26b7aca89d6cce328298f51d9ba9c3e1e5b7fc1ea2adf3b59c88bf2c40
+  metadata.gz: bc2846050227a83e7ae7bb63d1e6208ed39acc54de759c98e08d994685d1b067
+  data.tar.gz: 2a28105ee3667fb794c1f5d32c396b21542f45bceb3c858c160d7389f6d2ae3b
 SHA512:
-  metadata.gz: '0847bf075101301c924d093b9561c6fe014efbd9bfbc94020427c0382ab38608c275f5e50e0df7221c21b21afc2282de920273bc22dbbb11db2822a367cabc8f'
-  data.tar.gz: 5b0bc3e6f05ffa239b0316c8927380eddfb322b5e207001930354f5482748f0b148bfd2a42b8796ae83fd19f0b7dd97d9f5b863fcc1500094406b7731bbf3c78
+  metadata.gz: 22239d22c7b771a93bbb1811407d6ea6364ae21b22008d53d44e102188991b7299b6dacdcbc28a206dbfd21658d8081f964bf855b7c69c3d19d3312be49ffe3d
+  data.tar.gz: 8f98487332a3cb77f478f745b775b148aff862ab80fc020d064cade6a84692a4e498854cce864b4d49806a760ee7c6d9c38e4e9ac3e5c7598444ead625e91eb7

data/CHANGELOG.md

@@ -5,6 +5,30 @@ 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
+- **Replaced `RBTree::LinkedList` with Ruby Array** in MultiRBTree
+  - 6-8x performance improvement for all operations (shift, pop, append)
+  - Removed `RBTree::LinkedList` and `RBTree::LinkedList::Node` classes
+  - `get_all` now returns Array instead of LinkedList
+  - Benchmark results: 100K shift operations 452ms → 69ms
+
+## [0.1.1] - 2026-01-13
+
+### Fixed
+- Fixed syntax error in `RBTree::LinkedList.[]` method (escaped newline issue)
+
 ## [0.1.0] - 2026-01-13
 
 ### Added
@@ -35,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.0]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.0
+[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/README.md

@@ -99,7 +99,7 @@ tree.get(1)      # => "first one"
 tree[1]          # => "first one"
 
 # Get all values for a key
-tree.get_all(1)  # => LinkedList with ["first one", "second one", "third one"]
+tree.get_all(1)  # => ["first one", "second one", "third one"]
 
 # Iterate over all key-value pairs
 tree.each { |k, v| puts "#{k}: #{v}" }

data/lib/rbtree/version.rb

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

data/lib/rbtree.rb

@@ -50,7 +50,7 @@ require_relative "rbtree/version"
 # Iteration over all elements takes O(n) time.
 #
 # @author Masahito Suzuki
-# @since 0.1.1
+# @since 0.1.0
 class RBTree
   include Enumerable
 
@@ -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
@@ -963,7 +965,7 @@ end
 #   tree.delete(1)      # removes all remaining values for key 1
 #
 # @author Masahito Suzuki
-# @since 0.1.0
+# @since 0.1.2
 class MultiRBTree < RBTree
   # Retrieves the first value associated with the given key.
   #
@@ -983,7 +985,7 @@ class MultiRBTree < RBTree
   # Retrieves all values associated with the given key.
   #
   # @param key [Object] the key to look up
-  # @return [LinkedList, nil] a LinkedList containing all values, or nil if not found
+  # @return [Array, nil] an Array containing all values, or nil if not found
   # @example
   #   tree = MultiRBTree.new
   #   tree.insert(1, 'first')
@@ -1022,7 +1024,7 @@ class MultiRBTree < RBTree
         x = x.right
       end
     end
-    z = Node.new(key, LinkedList[value], Node::RED, @nil_node, @nil_node, @nil_node)
+    z = Node.new(key, [value], Node::RED, @nil_node, @nil_node, @nil_node)
     z.parent = y
     if y == @nil_node
       @root = z
@@ -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
@@ -1074,7 +1078,7 @@ class MultiRBTree < RBTree
   # Removes the node and all associated values.
   #
   # @param key [Object] the key to delete
-  # @return [LinkedList, nil] the list of all deleted values, or nil if not found
+  # @return [Array, nil] the array of all deleted values, or nil if not found
   # @example
   #   tree = MultiRBTree.new
   #   tree.insert(1, 'first')
@@ -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,114 +1261,3 @@ class RBTree::Node
   # @return [Boolean] true if black, false otherwise
   def black? = @color == BLACK
 end
-
-# A doubly-linked list used by MultiRBTree to store multiple values per key.
-#
-# This internal data structure maintains insertion order and supports efficient
-# operations at both ends of the list.
-#
-# @api private
-class RBTree::LinkedList
-  # Returns the number of values in the list.
-  # @return [Integer] the size
-  attr_reader :size
-  
-  # Creates a new LinkedList from the given values.
-  #
-  # @param values [Array<Object>] initial values
-  # @return [LinkedList] a new list
-  def self.[](*values)
-    list = new
-    values.each do |value|
-      list << value
-    end
-    list
-  end
-
-  # Creates a new empty LinkedList.
-  def initialize
-    @stop = Node.new(nil, nil, nil)
-    @stop.prev = @stop.succ = @stop
-    @size = 0
-  end
-
-  # Iterates over values in forward order.
-  # @yield [value] each value in the list
-  def each
-    node = @stop.succ
-    while node != @stop
-      yield node.value
-      node = node.succ
-    end
-  end
-
-  # Iterates over values in reverse order.
-  # @yield [value] each value in reverse
-  def reverse_each
-    node = @stop.prev
-    while node != @stop
-      yield node.value
-      node = node.prev
-    end
-  end
-
-  # Checks if the list is empty.
-  # @return [Boolean] true if empty
-  def empty? = @stop.succ == @stop
-  
-  # Returns the first value.
-  # @return [Object, nil] the first value or nil if empty
-  def first = empty? ? nil : @stop.succ.value
-  
-  # Returns the last value.
-  # @return [Object, nil] the last value or nil if empty
-  def last = empty? ? nil : @stop.prev.value
-
-  # Appends a value to the end of the list.
-  # @param value [Object] the value to append
-  # @return [LinkedList] self
-  def <<(value)
-    @stop.prev = @stop.prev.succ = Node.new(value, @stop.prev, @stop)
-    @size += 1
-    self
-  end
-
-  # Removes and returns the first value.
-  # @return [Object, nil] the first value or nil if empty
-  def shift
-    return nil if empty?
-    value = @stop.succ.value
-    (@stop.succ = @stop.succ.succ).prev = @stop
-    @size -= 1
-    value
-  end
-
-  # Removes and returns the last value.
-  # @return [Object, nil] the last value or nil if empty
-  def pop
-    return nil if empty?
-    value = @stop.prev.value
-    (@stop.prev = @stop.prev.prev).succ = @stop
-    @size -= 1
-    value
-  end
-end
-
-# Internal node structure for LinkedList.
-# @api private
-class RBTree::LinkedList::Node
-  # @return [Object] the value stored in this node
-  attr_accessor :value
-  # @return [Node] the previous node
-  attr_accessor :prev
-  # @return [Node] the successor node
-  attr_accessor :succ
-
-  # Creates a new list node.
-  # @param value [Object] the value
-  # @param prev [Node] the previous node
-  # @param succ [Node] the successor node
-  def initialize(value, prev, succ)
-    @value, @prev, @succ = value, prev, succ
-  end
-end

metadata

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