rbtree-ruby 0.2.2 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 13b088e9f0f8ab5cf80a77b8f9b8e1af73b94b33bdff90115fe575def2c54b11
-  data.tar.gz: 51636a7c22c4ccc70d2ac14bafc58a39bbccac7599a704506c280d8d39345117
+  metadata.gz: 28594e663eac8519467b09c0756a032b2ef887d69df9e9335d1d79c36744a134
+  data.tar.gz: 492d6896dd4a0644ecc8ad721214afe2827daf3acbde38dce938e6da54cac87f
 SHA512:
-  metadata.gz: e543801d0b22de4ee8654f7b8164121c2107ccda64bc16f47d034e98526703e4aa444e03cecd225bddb9aa9fc5547813bcd1bc73cd4a4048df98eee5d41a2fc6
-  data.tar.gz: 6d6986550fe2293e971558e65119f230c3eb26e8f43f8af77fe8bf666d5df337c6bf23e36a4e4fd7e8aee86287b6f58579e48a637e66d27a6e80ab66b0010ed4
+  metadata.gz: 3aeeca5b0d3de1a8826fac660dc6b201c046cb193328ba75bcd20f679f682fbf65479179fcddebe63920522eaa9ede28a9f8a784c76387e86530105a7378c8cd
+  data.tar.gz: 1e960a2132c1c3bc8988e233ebfb249f121900ac6eabbbcce0aa86186ceb24caa3224d4e7ebb8ad2acda5b927976ec0d5a0437ec20ad5fe2162eda841d15f909

data/CHANGELOG.md

@@ -5,6 +5,37 @@ 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.3.0] - 2026-01-15
+
+### Changed
+### API Changes (Method Renaming & Deprecation)
+> [!WARNING]
+> The public API has been refactored to improve consistency. The following methods have been renamed.
+> Old methods are preserved as aliases for backward compatibility but are **deprecated** and may be removed in future versions.
+
+*   `get_all` -> `values` (Returns Enumerator by default)
+*   `delete_one` -> `delete_value`
+*   `delete` (MultiRBTree) -> `delete_key`
+    *   *Note: `delete` is now an alias for `delete_key` in MultiRBTree for compatibility.*
+*   `get` (MultiRBTree) -> *Behavior clarified*: Returns first value (alias for `first_value` or `value(key)`)
+*   `get_first`/`get_last` -> `first_value`/`last_value`
+*   `delete_first`/`delete_last` -> `delete_first_value`/`delete_last_value`
+
+- **Visibility**: `insert_entry` (RBTree) and traversal helper methods (MultiRBTree) are now `private` instead of `protected`, as they are internal implementation details.
+
+### Fixed
+- **MultiRBTree Traversal Fix**: Fixed an issue where `MultiRBTree#each` and other traversal methods yielded `key, value` as separate arguments instead of a single `[key, value]` array. This ensures compatibility with `Enumerable` methods like `count` and consistent behavior with `RBTree` and standard `Hash`.
+
+## [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
@@ -153,6 +184,10 @@ 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.3.0]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.3.0
+[0.2.3]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.2.3
+[0.2.2]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.2.2
+[0.2.1]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.2.1
 [0.2.0]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.2.0
 [0.1.8]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.8
 [0.1.7]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.7

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"
 
 # ソート順でイテレーション
@@ -104,11 +108,11 @@ tree.insert(2, 'two')
 tree.size  # => 4 (キーバリューペアの総数)
 
 # 最初の値を取得
-tree.get(1)      # => "first one"
+tree.value(1)      # => "first one"
 tree[1]          # => "first one"
 
 # キーの全ての値を取得（Enumeratorを返す）
-tree.get_all(1).to_a  # => ["first one", "second one", "third one"]
+tree.values(1).to_a  # => ["first one", "second one", "third one"]
 
 # 全キーバリューペアをイテレーション
 tree.each { |k, v| puts "#{k}: #{v}" }
@@ -119,11 +123,11 @@ tree.each { |k, v| puts "#{k}: #{v}" }
 # 2: two
 
 # 最初の値のみ削除
-tree.delete_one(1)  # => "first one"
-tree.get(1)         # => "second one"
+tree.delete_value(1)  # => "first one"
+tree.value(1)         # => "second one"
 
 # キーの全ての値を削除
-tree.delete(1)      # 残りの値を全て削除
+tree.delete_key(1)      # 残りの値を全て削除
 ```
 
 ### 最近傍キー検索
@@ -138,6 +142,8 @@ tree.nearest(8)   # => [10, "ten"]
 
 ### 前後キー検索
 
+ツリーの中で次のキーまたは前のキーを検索します。
+
 ```ruby
 tree = RBTree.new({1 => 'one', 3 => 'three', 5 => 'five', 7 => 'seven'})
 
@@ -179,15 +185,15 @@ tree.insert(1, 'second')
 tree.insert(1, 'third')
 
 # 最初または最後の値にアクセス
-tree.get(1)               # => "first"
-tree.get(1, last: true)   # => "third"
-tree.get_first(1)         # => "first"
-tree.get_last(1)          # => "third"
+tree.value(1)               # => "first"
+tree.value(1, last: true)   # => "third"
+tree.first_value(1)         # => "first"
+tree.last_value(1)          # => "third"
 
 # どちらの端からも削除可能
-tree.delete_first(1)      # => "first"
-tree.delete_last(1)       # => "third"  
-tree.get(1)               # => "second"
+tree.delete_first_value(1)      # => "first"
+tree.delete_last_value(1)       # => "third"  
+tree.value(1)               # => "second"
 
 # min/maxの:lastオプション
 tree.insert(2, 'a')
@@ -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)** (ハイブリッドハッシュインデックス)
+- `value(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
@@ -104,11 +108,11 @@ tree.insert(2, 'two')
 tree.size  # => 4 (total number of key-value pairs)
 
 # Get first value
-tree.get(1)      # => "first one"
+tree.value(1)      # => "first one"
 tree[1]          # => "first one"
 
 # Get all values for a key (returns Enumerator)
-tree.get_all(1).to_a  # => ["first one", "second one", "third one"]
+tree.values(1).to_a  # => ["first one", "second one", "third one"]
 
 # Iterate over all key-value pairs
 tree.each { |k, v| puts "#{k}: #{v}" }
@@ -119,11 +123,11 @@ tree.each { |k, v| puts "#{k}: #{v}" }
 # 2: two
 
 # Delete only first value
-tree.delete_one(1)  # => "first one"
-tree.get(1)         # => "second one"
+tree.delete_value(1)  # => "first one"
+tree.value(1)         # => "second one"
 
 # Delete all values for a key
-tree.delete(1)      # removes all remaining values
+tree.delete_key(1)      # removes all remaining values
 ```
 
 ### Nearest Key Search
@@ -181,15 +185,15 @@ tree.insert(1, 'second')
 tree.insert(1, 'third')
 
 # Access first or last value
-tree.get(1)               # => "first"
-tree.get(1, last: true)   # => "third"
-tree.get_first(1)         # => "first"
-tree.get_last(1)          # => "third"
+tree.value(1)               # => "first"
+tree.value(1, last: true)   # => "third"
+tree.first_value(1)         # => "first"
+tree.last_value(1)          # => "third"
 
 # Delete from either end
-tree.delete_first(1)      # => "first"
-tree.delete_last(1)       # => "third"  
-tree.get(1)               # => "second"
+tree.delete_first_value(1)      # => "first"
+tree.delete_last_value(1)       # => "third"  
+tree.value(1)               # => "second"
 
 # min/max with :last option
 tree.insert(2, 'a')
@@ -204,7 +208,7 @@ All major operations run in **O(log n)** time:
 
 - `insert(key, value)` - O(log n)
 - `delete(key)` - O(log n)
-- `get(key)` / `[]` - **O(1)** (hybrid hash index)
+- `value(key)` / `[]` - **O(1)** (hybrid hash index)
 - `has_key?` - **O(1)** (hybrid hash index)
 - `min` - **O(1)**
 - `max` - O(log n)
@@ -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.2"
+  VERSION = "0.3.0"
 end