rbtree-ruby 0.1.7 → 0.1.8

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8aa1d883925f6b7f608108f1f916598aa04be013aee415c06dfc7bda35d6986c
-  data.tar.gz: e935f213100c933b42a3cf0d709809d5ca8d536db56d6e27a6b3de9681847ad9
+  metadata.gz: ad4ff4e15079d2034a111e0180f1abbf5f433283de5c125f45569f9b69f558fc
+  data.tar.gz: 7355e1ae3964e79aa8d110c52e38672641c8d67ac1cb4cfbbd974fe6298f07f7
 SHA512:
-  metadata.gz: 419f0270137b6a6ae39bd73d5ea0c4cc25ff0769c288619ee795d172e724040c6032c09c952745b9bb871ff082861c00ae879fa6a98a571414bad87c2534cb9a
-  data.tar.gz: e403cc18d16ff9661a341fb326b3aadebc5d1a83b69ed03395b318cf6666d8de9dca24e88da2a9c231395aa7780ce57ed89902717ad1266bd1551e384872719f
+  metadata.gz: e62ddc40bfc16d4afaf9430b679b03cfb50e89d3a02d7ab43a190b168015d4c6605baf579cc55abc0d42db207465538f99e81618beca873a1b4c654d1ab0c72f
+  data.tar.gz: d11f0258d1ea5ea2686cc8bb581eb3b5c524554bf2182d68d54759e592d58d57e463bfa87b13dbabb67e68becfa8648108b267751791a1877e49bc7c6e2f6a06

data/CHANGELOG.md

@@ -5,6 +5,15 @@ 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.8] - 2026-01-14
+
+### Changed
+- **Range Query Returns Enumerator**: `lt`, `lte`, `gt`, `gte`, `between` now return an `Enumerator` instead of an `Array` when no block is given
+  - Enables lazy evaluation: `tree.gt(100).lazy.take(5).to_a`
+  - Enables chaining: `tree.lt(50).map { |k, v| k }`
+  - Use `.to_a` to get an Array: `tree.lt(50).to_a`
+  - **Breaking**: Code using direct array access like `tree.lt(50)[0]` must change to `tree.lt(50).first`
+
 ## [0.1.7] - 2026-01-14
 
 ### Added
@@ -107,9 +116,6 @@ 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.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
 [0.1.6]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.6
-[0.1.5]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.5
-[0.1.4]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.1.4
-[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/lib/rbtree/version.rb

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

data/lib/rbtree.rb

@@ -331,28 +331,20 @@ class RBTree
   # @param key [Object] the upper bound (exclusive)
   # @param reverse [Boolean] if true, iterate in descending order (default: false)
   # @yield [key, value] each matching key-value pair (if block given)
-  # @return [Array<Array(Object, Object)>, RBTree] array of [key, value] pairs if no block, self otherwise
+  # @return [Enumerator, RBTree] Enumerator if no block given, self otherwise
   # @example
   #   tree = RBTree.new({1 => 'one', 2 => 'two', 3 => 'three', 4 => 'four'})
-  #   tree.lt(3)  # => [[1, "one"], [2, "two"]]
-  #   tree.lt(3, reverse: true)  # => [[2, "two"], [1, "one"]]
+  #   tree.lt(3).to_a  # => [[1, "one"], [2, "two"]]
+  #   tree.lt(3, reverse: true).first  # => [2, "two"]
+  #   tree.lt(3) { |k, v| puts k }  # prints keys, returns self
   def lt(key, reverse: false, &block)
-    if block_given?
-      if reverse
-        traverse_lt_desc(@root, key, &block)
-      else
-        traverse_lt(@root, key, &block)
-      end
-      self
+    return enum_for(:lt, key, reverse: reverse) unless block_given?
+    if reverse
+      traverse_lt_desc(@root, key, &block)
     else
-      res = []
-      if reverse
-        traverse_lt_desc(@root, key) { |k, v| res << [k, v] }
-      else
-        traverse_lt(@root, key) { |k, v| res << [k, v] }
-      end
-      res
+      traverse_lt(@root, key, &block)
     end
+    self
   end
 
   # Retrieves all key-value pairs with keys less than or equal to the specified key.
@@ -360,28 +352,19 @@ class RBTree
   # @param key [Object] the upper bound (inclusive)
   # @param reverse [Boolean] if true, iterate in descending order (default: false)
   # @yield [key, value] each matching key-value pair (if block given)
-  # @return [Array<Array(Object, Object)>, RBTree] array of [key, value] pairs if no block, self otherwise
+  # @return [Enumerator, RBTree] Enumerator if no block given, self otherwise
   # @example
   #   tree = RBTree.new({1 => 'one', 2 => 'two', 3 => 'three', 4 => 'four'})
-  #   tree.lte(3)  # => [[1, "one"], [2, "two"], [3, "three"]]
-  #   tree.lte(3, reverse: true)  # => [[3, "three"], [2, "two"], [1, "one"]]
+  #   tree.lte(3).to_a  # => [[1, "one"], [2, "two"], [3, "three"]]
+  #   tree.lte(3, reverse: true).first  # => [3, "three"]
   def lte(key, reverse: false, &block)
-    if block_given?
-      if reverse
-        traverse_lte_desc(@root, key, &block)
-      else
-        traverse_lte(@root, key, &block)
-      end
-      self
+    return enum_for(:lte, key, reverse: reverse) unless block_given?
+    if reverse
+      traverse_lte_desc(@root, key, &block)
     else
-      res = []
-      if reverse
-        traverse_lte_desc(@root, key) { |k, v| res << [k, v] }
-      else
-        traverse_lte(@root, key) { |k, v| res << [k, v] }
-      end
-      res
+      traverse_lte(@root, key, &block)
     end
+    self
   end
 
   # Retrieves all key-value pairs with keys greater than the specified key.
@@ -389,28 +372,19 @@ class RBTree
   # @param key [Object] the lower bound (exclusive)
   # @param reverse [Boolean] if true, iterate in descending order (default: false)
   # @yield [key, value] each matching key-value pair (if block given)
-  # @return [Array<Array(Object, Object)>, RBTree] array of [key, value] pairs if no block, self otherwise
+  # @return [Enumerator, RBTree] Enumerator if no block given, self otherwise
   # @example
   #   tree = RBTree.new({1 => 'one', 2 => 'two', 3 => 'three', 4 => 'four'})
-  #   tree.gt(2)  # => [[3, "three"], [4, "four"]]
-  #   tree.gt(2, reverse: true)  # => [[4, "four"], [3, "three"]]
+  #   tree.gt(2).to_a  # => [[3, "three"], [4, "four"]]
+  #   tree.gt(2, reverse: true).first  # => [4, "four"]
   def gt(key, reverse: false, &block)
-    if block_given?
-      if reverse
-        traverse_gt_desc(@root, key, &block)
-      else
-        traverse_gt(@root, key, &block)
-      end
-      self
+    return enum_for(:gt, key, reverse: reverse) unless block_given?
+    if reverse
+      traverse_gt_desc(@root, key, &block)
     else
-      res = []
-      if reverse
-        traverse_gt_desc(@root, key) { |k, v| res << [k, v] }
-      else
-        traverse_gt(@root, key) { |k, v| res << [k, v] }
-      end
-      res
+      traverse_gt(@root, key, &block)
     end
+    self
   end
 
   # Retrieves all key-value pairs with keys greater than or equal to the specified key.
@@ -418,28 +392,19 @@ class RBTree
   # @param key [Object] the lower bound (inclusive)
   # @param reverse [Boolean] if true, iterate in descending order (default: false)
   # @yield [key, value] each matching key-value pair (if block given)
-  # @return [Array<Array(Object, Object)>, RBTree] array of [key, value] pairs if no block, self otherwise
+  # @return [Enumerator, RBTree] Enumerator if no block given, self otherwise
   # @example
   #   tree = RBTree.new({1 => 'one', 2 => 'two', 3 => 'three', 4 => 'four'})
-  #   tree.gte(2)  # => [[2, "two"], [3, "three"], [4, "four"]]
-  #   tree.gte(2, reverse: true)  # => [[4, "four"], [3, "three"], [2, "two"]]
+  #   tree.gte(2).to_a  # => [[2, "two"], [3, "three"], [4, "four"]]
+  #   tree.gte(2, reverse: true).first  # => [4, "four"]
   def gte(key, reverse: false, &block)
-    if block_given?
-      if reverse
-        traverse_gte_desc(@root, key, &block)
-      else
-        traverse_gte(@root, key, &block)
-      end
-      self
+    return enum_for(:gte, key, reverse: reverse) unless block_given?
+    if reverse
+      traverse_gte_desc(@root, key, &block)
     else
-      res = []
-      if reverse
-        traverse_gte_desc(@root, key) { |k, v| res << [k, v] }
-      else
-        traverse_gte(@root, key) { |k, v| res << [k, v] }
-      end
-      res
+      traverse_gte(@root, key, &block)
     end
+    self
   end
 
   # Retrieves all key-value pairs with keys within the specified range.
@@ -450,29 +415,19 @@ class RBTree
   # @param include_max [Boolean] whether to include the upper bound (default: true)
   # @param reverse [Boolean] if true, iterate in descending order (default: false)
   # @yield [key, value] each matching key-value pair (if block given)
-  # @return [Array<Array(Object, Object)>, RBTree] array of [key, value] pairs if no block, self otherwise
+  # @return [Enumerator, RBTree] Enumerator if no block given, self otherwise
   # @example
   #   tree = RBTree.new({1 => 'one', 2 => 'two', 3 => 'three', 4 => 'four', 5 => 'five'})
-  #   tree.between(2, 4)  # => [[2, "two"], [3, "three"], [4, "four"]]
-  #   tree.between(2, 4, include_min: false)  # => [[3, "three"], [4, "four"]]
-  #   tree.between(2, 4, reverse: true)  # => [[4, "four"], [3, "three"], [2, "two"]]
+  #   tree.between(2, 4).to_a  # => [[2, "two"], [3, "three"], [4, "four"]]
+  #   tree.between(2, 4, reverse: true).first  # => [4, "four"]
   def between(min, max, include_min: true, include_max: true, reverse: false, &block)
-    if block_given?
-      if reverse
-        traverse_between_desc(@root, min, max, include_min, include_max, &block)
-      else
-        traverse_between(@root, min, max, include_min, include_max, &block)
-      end
-      self
+    return enum_for(:between, min, max, include_min: include_min, include_max: include_max, reverse: reverse) unless block_given?
+    if reverse
+      traverse_between_desc(@root, min, max, include_min, include_max, &block)
     else
-      res = []
-      if reverse
-        traverse_between_desc(@root, min, max, include_min, include_max) { |k, v| res << [k, v] }
-      else
-        traverse_between(@root, min, max, include_min, include_max) { |k, v| res << [k, v] }
-      end
-      res
+      traverse_between(@root, min, max, include_min, include_max, &block)
     end
+    self
   end
 
   # Returns the key-value pair with the key closest to the given key.

metadata

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