rbtree-ruby 0.2.1 → 0.2.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 89348dfde7177409ecdca6a4184ebee7f83f3a57eebb84b3f4925ad4460a7a92
-  data.tar.gz: bd46b055e05a121787b67ecf20836181800abe0a230800703872c1412826ccfa
+  metadata.gz: f3c97bfa59aaaa7bbc03f272fdc5e383b258f529134f1d2a79fd3758d1d53b02
+  data.tar.gz: fa9c8df14da95bf4224164d720c90981c1c68ef96e5cb544007327b9a1564b11
 SHA512:
-  metadata.gz: 908a2d3d58bfac4c7d092e745ebe7f3f2c391551ea5fa7822871d1d0334c64985169df7433342e0e77cad9cf85f8a6b1a265ee427d96445095b3aa27da73d8ef
-  data.tar.gz: c7b5afe4a5189deee48c6abc5cbca6340c14ebfc65d581f2788117bfb84aabca7757582ab5b6bbcf7cc5866e6350be4f85f87fda78ea49af8c394dd0884de6b3
+  metadata.gz: e856b4d10d326c3d3261d21044db760b41447dd01e1eb22bff4dfe1ac07e71f709792b75a9ee48ddc3195f06993fd86e8434511b3f2f0eaafbcf0827da05aa1e
+  data.tar.gz: 10e8c1af8787b201c73a64557ba86304867b601daae13ad816771b87e52a81e30bc94dbeda5accc1e224a55d397ae28e0325918d61d8d4db40ee09cdd83876fa

data/CHANGELOG.md

@@ -5,6 +5,29 @@ 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.2.3] - 2026-01-14
+
+### Added
+- **Bulk Insert**: `insert` now supports bulk insertion from Hash, Array of pairs, Enumerator, or Block.
+  - `tree.insert({1 => 'one', 2 => 'two'})`
+  - `tree.insert([[1, 'one'], [2, 'two']])`
+  - `tree.insert { source_data }`
+- **Flexible Initialization**: `RBTree.new` and `MultiRBTree.new` now accept bulk data and an `overwrite:` option.
+  - `RBTree.new([[1, 'a'], [1, 'b']], overwrite: false)`
+
+## [0.2.2] - 2026-01-14
+
+### Changed
+- **Iterative Traversal (Complete)**: All traversal methods (`lt`, `lte`, `gt`, `gte`, `between` and their `_desc` variants) now use an iterative stack-based approach instead of recursion.
+  - Ensures deep trees can be traversed without `SystemStackError`.
+  - Applies to both `RBTree` and `MultiRBTree`.
+- **Code Deduplication**: Unified traversal logic between `RBTree` and `MultiRBTree` for better maintainability.
+- **Documentation**: Minor typo fixes.
+
+### Fixed
+- **MultiRBTree#prev / #succ**: Fixed incorrect use of bare `super` which forwarded keyword arguments to parent methods that don't accept them. Also fixed incorrect access to parent return value (was treating `[key, value]` pair as a node object).
+- **MultiRBTree#shift / #pop hash index leak**: When `shift` or `pop` removed the last value for a key, the key remained in the internal hash index (`@hash_index`). Now correctly uses `delete_node(key)` instead of `remove_node(node)` to ensure hash index consistency.
+
 ## [0.2.1] - 2026-01-14
 
 ### Added

data/README.ja.md

@@ -2,8 +2,7 @@
 
 🌍 *[English](README.md) | [日本語](README.ja.md)*
 
-Red-Black Tree（赤黒木）データ構造のピュアRuby実装です。挿入、削除、検索操作がO(log n)の時間計算量で実行できる、
-効率的な順序付きキーバリューストレージを提供します。
+Red-Black Tree（赤黒木）データ構造のピュアRuby実装です。挿入、削除、検索操作がO(log n)の時間計算量で実行できる、効率的な順序付きキーバリューストレージを提供します。
 
 ## 特徴
 
@@ -43,13 +42,18 @@ require 'rbtree'
 # 空のツリーを作成
 tree = RBTree.new
 
-# データで初期化
+# データで初期化（バルク挿入）
 tree = RBTree.new({3 => 'three', 1 => 'one', 2 => 'two'})
 tree = RBTree[[5, 'five'], [4, 'four']]
+tree = RBTree.new do # ブロック初期化
+  data_source.each { |data| [data.time, data.content] } 
+end
 
 # 値の挿入と取得
 tree.insert(10, 'ten')
 tree[20] = 'twenty'
+# バルク挿入
+tree.insert({30 => 'thirty', 40 => 'forty'})
 puts tree[10]  # => "ten"
 
 # ソート順でイテレーション
@@ -138,6 +142,8 @@ tree.nearest(8)   # => [10, "ten"]
 
 ### 前後キー検索
 
+ツリーの中で次のキーまたは前のキーを検索します。
+
 ```ruby
 tree = RBTree.new({1 => 'one', 3 => 'three', 5 => 'five', 7 => 'seven'})
 
@@ -202,8 +208,8 @@ tree.max(last: true)      # => [2, "b"]      (最大キーの最後の値)
 
 - `insert(key, value)` - O(log n)
 - `delete(key)` - O(log n)
-- `get(key)` / `[]` - **O(1)** (ハイブリッドハッシュインデックス)
-- `has_key?` - **O(1)** (ハイブリッドハッシュインデックス)
+- `get(key)` / `[]` - **O(1)** (内部ハッシュインデックスによる超高速アクセス)
+- `has_key?` - **O(1)** (内部ハッシュインデックスによる超高速チェック)
 - `min` - **O(1)**
 - `max` - O(log n)
 - `shift` / `pop` - O(log n)
@@ -227,7 +233,7 @@ RBTreeは内部的な**メモリプール**を使用してノードオブジェ
 | **範囲クエリ** | **O(log n + k)** | O(n) フィルター | **〜540倍高速** | 部分木へ直接ジャンプ vs 全件スキャン |
 | **最小値抽出** | **O(log n)** | O(n) 検索 | **〜160倍高速** | 連続的なリバランス vs 全件スキャン |
 | **ソート済みイテレーション** | **O(n)** | O(n log n) | **無料** | 常にソート済み vs 明示的な`sort` |
-| **キー検索** | **O(1)** | O(1) | **同等** | ハイブリッドハッシュインデックス |
+| **キー検索** | **O(1)** | O(1) | **同等** | **ハイブリッドハッシュインデックスにより、Hashと同等のO(1)検索速度を実現** |
 
 ### RBTreeを使うべき場面
 

data/README.md

@@ -2,8 +2,7 @@
 
 🌍 *[English](README.md) | [日本語](README.ja.md)*
 
-A pure Ruby implementation of the Red-Black Tree data structure, providing efficient ordered
-key-value storage with O(log n) time complexity for insertion, deletion, and lookup operations.
+A pure Ruby implementation of the Red-Black Tree data structure, providing efficient ordered key-value storage with O(log n) time complexity for insertion, deletion, and lookup operations.
 
 ## Features
 
@@ -43,13 +42,18 @@ require 'rbtree'
 # Create an empty tree
 tree = RBTree.new
 
-# Or initialize with data
+# Or initialize with data (Bulk Insert)
 tree = RBTree.new({3 => 'three', 1 => 'one', 2 => 'two'})
 tree = RBTree[[5, 'five'], [4, 'four']]
+tree = RBTree.new do # Block initialization
+  data_source.each { |data| [data.time, data.content] } 
+end
 
 # Insert and retrieve values
 tree.insert(10, 'ten')
 tree[20] = 'twenty'
+# Bulk insert
+tree.insert({30 => 'thirty', 40 => 'forty'})
 puts tree[10]  # => "ten"
 
 # Iterate in sorted order
@@ -229,7 +233,7 @@ For ordered and spatial operations, RBTree is not just faster—it is in a compl
 | **Range Queries** | **O(log n + k)** | O(n) filter | **~540x faster** | Direct subtree jump vs full scan |
 | **Min Extraction** | **O(log n)** | O(n) search | **~160x faster** | Continuous rebalancing vs full scan |
 | **Sorted Iteration** | **O(n)** | O(n log n) | **FREE** | Always sorted vs explicit `sort` |
-| **Key Lookup** | **O(1)** | O(1) | **Equal** | Optimized Hybrid Hash Index |
+| **Key Lookup** | **O(1)** | O(1) | **Equal** | **Hybrid Hash Index provides O(1) access like standard Hash** |
 
 ### When to Use RBTree
 

data/lib/rbtree/version.rb

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