rbtree-ruby 0.2.3 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f3c97bfa59aaaa7bbc03f272fdc5e383b258f529134f1d2a79fd3758d1d53b02
-  data.tar.gz: fa9c8df14da95bf4224164d720c90981c1c68ef96e5cb544007327b9a1564b11
+  metadata.gz: 28594e663eac8519467b09c0756a032b2ef887d69df9e9335d1d79c36744a134
+  data.tar.gz: 492d6896dd4a0644ecc8ad721214afe2827daf3acbde38dce938e6da54cac87f
 SHA512:
-  metadata.gz: e856b4d10d326c3d3261d21044db760b41447dd01e1eb22bff4dfe1ac07e71f709792b75a9ee48ddc3195f06993fd86e8434511b3f2f0eaafbcf0827da05aa1e
-  data.tar.gz: 10e8c1af8787b201c73a64557ba86304867b601daae13ad816771b87e52a81e30bc94dbeda5accc1e224a55d397ae28e0325918d61d8d4db40ee09cdd83876fa
+  metadata.gz: 3aeeca5b0d3de1a8826fac660dc6b201c046cb193328ba75bcd20f679f682fbf65479179fcddebe63920522eaa9ede28a9f8a784c76387e86530105a7378c8cd
+  data.tar.gz: 1e960a2132c1c3bc8988e233ebfb249f121900ac6eabbbcce0aa86186ceb24caa3224d4e7ebb8ad2acda5b927976ec0d5a0437ec20ad5fe2162eda841d15f909

data/CHANGELOG.md

@@ -5,6 +5,27 @@ 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
@@ -163,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

@@ -108,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}" }
@@ -123,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)      # 残りの値を全て削除
 ```
 
 ### 最近傍キー検索
@@ -185,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')
@@ -208,7 +208,7 @@ tree.max(last: true)      # => [2, "b"]      (最大キーの最後の値)
 
 - `insert(key, value)` - O(log n)
 - `delete(key)` - O(log n)
-- `get(key)` / `[]` - **O(1)** (内部ハッシュインデックスによる超高速アクセス)
+- `value(key)` / `[]` - **O(1)** (内部ハッシュインデックスによる超高速アクセス)
 - `has_key?` - **O(1)** (内部ハッシュインデックスによる超高速チェック)
 - `min` - **O(1)**
 - `max` - O(log n)

data/README.md

@@ -108,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}" }
@@ -123,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
@@ -185,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')
@@ -208,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)

data/lib/rbtree/version.rb

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