rbtree-ruby 0.1.1 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 047f125ed11edef5fa998d90ff50d80f90879a065d6407b02184d21089f0b1a8
-  data.tar.gz: 1bb83c26b7aca89d6cce328298f51d9ba9c3e1e5b7fc1ea2adf3b59c88bf2c40
+  metadata.gz: 59400faa90822b08dbe1fc115c6bf28f526b4e139924e1950f625ac552f5124c
+  data.tar.gz: 3f7bda0222388236a6b9f0b8fc4e8fef0cc5e365b1b98eddceef73ec3c1d8114
 SHA512:
-  metadata.gz: '0847bf075101301c924d093b9561c6fe014efbd9bfbc94020427c0382ab38608c275f5e50e0df7221c21b21afc2282de920273bc22dbbb11db2822a367cabc8f'
-  data.tar.gz: 5b0bc3e6f05ffa239b0316c8927380eddfb322b5e207001930354f5482748f0b148bfd2a42b8796ae83fd19f0b7dd97d9f5b863fcc1500094406b7731bbf3c78
+  metadata.gz: b2207668d8974b8af9e0261c819d3a63f537b557d9f1188799026524d27dd23703f020fb3ce397047bd6b9434cc3f079e42e68152f33fa9bd69ede97b4e66530
+  data.tar.gz: 593e5575adb4755b6a2212144ca56920918fe31a5a0b048e37655b5729216ee4bfe3f3ae43f5477ec2c8b9e0d2e1cf2ef4dca5df1208f757fef85a643c9b1c7d

data/CHANGELOG.md

@@ -5,6 +5,20 @@ 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.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 +49,4 @@ 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.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.2"
 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
 
@@ -963,7 +963,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 +983,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 +1022,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
@@ -1074,7 +1074,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')
@@ -1258,113 +1258,3 @@ class RBTree::Node
   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.2
 platform: ruby
 authors:
 - Masahito Suzuki