rbtree-ruby 0.3.3 → 0.3.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2145d91a96cc64b7e65c65460716b678301f74d6decdffa2dbd077a914273c21
-  data.tar.gz: 66503c542ce07672a493830afbfcb66ebfea14d8563e67b1b2dd1d5ecd1d9c48
+  metadata.gz: 911e435d0a205afc1a62791f857ac66d6d6300d2aa332566aa916e65e16148d2
+  data.tar.gz: d1a2b2aec3404901985cfec8a54c5b3df87d12bd4c8872833ba111dd3641033b
 SHA512:
-  metadata.gz: 7befca8277d78b75242a443c2ec155bded73f899222b32330c6416e6ffeaad8ec6bca01e11ce23c6047208871cf71cfb8c6a742732b4ae0b531f54e51a8e424e
-  data.tar.gz: eb77127897b535277717575afe27c47cd087ba15685f59b0df67516c55d393a8d7412cf08d667cea5494978746967c098294bb73e8e9771c2aee363762afcca9
+  metadata.gz: 6b1a96900494faa73b223e5905897299799c9a5432aa6cbdd95c6881c48c8666fe82f1653907231918fd027413eed3036da64a21087bfded6307a434c3de63b2
+  data.tar.gz: 6456acef3636bf7f857611a22407c4f4a053c632a973b2dfc05913d99b55a338c3a4dbce41d03074c7589354cc4bad2765c5e4be683d2a080248ea30b6a22b04

data/CHANGELOG.md

@@ -5,6 +5,18 @@ 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.4] - 2026-01-25
+
+### Added
+- **Range-based Lookup**: Support for passing `Range` objects to the bracket operator `[]`.
+  - `tree[2..4]` -> `between(2, 4)`
+  - `tree[2...4]` -> `between(2, 4, include_max: false)`
+  - `tree[5..]` -> `gte(5)`
+  - `tree[..10]` -> `lte(10)`
+  - `tree[...10]` -> `lt(10)`
+  - Returns an `Enumerator` of `[key, value]` pairs.
+  - *Note: `gt` (greater than exclusive) is not covered by standard Ruby Range syntax and remains available via the `gt` method.*
+
 ## [0.3.3] - 2026-01-23
 
 ### Optimized
@@ -207,6 +219,8 @@ 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.4]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.3.4
+[0.3.3]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.3.3
 [0.3.2]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.3.2
 [0.3.1]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.3.1
 [0.3.0]: https://github.com/firelzrd/rbtree-ruby/releases/tag/v0.3.0

data/README.ja.md

@@ -80,9 +80,16 @@ tree.max  # => [20, "twenty"]
 
 # 範囲クエリ（Enumeratorを返す、配列には.to_aを使用）
 tree.lt(10).to_a   # => [[1, "one"], [2, "two"], [3, "three"]]
-tree.gte(10).to_a  # => [[10, "ten"], [20, "twenty"]]
+tree.gte(10).each { |k, v| puts k } # ブロック渡しでのループ
 tree.between(2, 10).to_a  # => [[2, "two"], [3, "three"], [10, "ten"]]
 
+# []でのRangeオブジェクトの利用 (v0.3.4+)
+tree[..10].to_a    # lte(10)相当
+tree[2..10].each { |k, v| ... } # Rangeでのループ
+tree[2...10].to_a  # between(2, 10, include_max: false)相当
+tree[10..].to_a    # gte(10)相当
+tree[2..10, reverse: true].to_a # オプション指定可能
+
 # shiftとpop
 tree.shift  # => [1, "one"] (最小値を削除)
 tree.pop    # => [20, "twenty"] (最大値を削除)

data/README.md

@@ -80,9 +80,16 @@ tree.max  # => [20, "twenty"]
 
 # Range queries (return Enumerator, use .to_a for Array)
 tree.lt(10).to_a   # => [[1, "one"], [2, "two"], [3, "three"]]
-tree.gte(10).to_a  # => [[10, "ten"], [20, "twenty"]]
+tree.gte(10).each { |k, v| puts k } # Block iteration
 tree.between(2, 10).to_a  # => [[2, "two"], [3, "three"], [10, "ten"]]
 
+# Range objects in [] (v0.3.4+)
+tree[..10].to_a    # lte(10)
+tree[2..10].each { |k, v| ... } # Block iteration on Range
+tree[2...10].to_a  # between(2, 10, include_max: false)
+tree[10..].to_a    # gte(10)
+tree[2..10, reverse: true].to_a # with options
+
 # Shift and pop
 tree.shift  # => [1, "one"] (removes minimum)
 tree.pop    # => [20, "twenty"] (removes maximum)

data/lib/rbtree/version.rb

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

data/lib/rbtree.rb

@@ -191,11 +191,35 @@ class RBTree
   # @example
   #   tree = RBTree.new({1 => 'one', 2 => 'two'})
   #   tree.get(1)  # => "one"
-  #   tree[2]      # => "two"
-  #   tree[3]      # => nil
   def value(key) = @hash_index[key]&.value
   alias :get :value
-  alias :[] :value
+
+  # Retrieves a value associated with the given key, or a range of entries if a Range is provided.
+  #
+  # @param key_or_range [Object, Range] the key to look up or a Range for query
+  # @param ... [Hash] additional options to pass to the respective lookup method
+  # @return [Object, Enumerator, nil]
+  #   - If a key is provided: the associated value, or nil if not found
+  #   - If a Range is provided: an Enumerator yielding [key, value] pairs
+  # @example Single key lookup
+  #   tree[2]      # => "two"
+  # @example Range lookup
+  #   tree[2..4].to_a  # => [[2, "two"], [3, "three"], [4, "four"]]
+  #   tree[...3].to_a  # => [[1, "one"], [2, "two"]]
+  def [](key_or_range, **)
+    return value(key_or_range, **) if !key_or_range.is_a?(Range)
+
+    r = key_or_range
+    r.begin ? (
+      r.end ?
+        between(r.begin, r.end, include_max: !r.exclude_end?, **) :
+        gte(r.begin, **)
+    ) : (
+      r.end ?
+        (r.exclude_end? ? lt(r.end, **) : lte(r.end, **)) :
+        each(**)
+    )
+  end
 
   # Returns the key with the key closest to the given key.
   #
@@ -1499,7 +1523,6 @@ class MultiRBTree < RBTree
   #   tree.get(1, last: true)  # => "second"
   def value(key, last: false) = @hash_index[key]&.value&.send(last ? :last : :first)
   alias :get :value
-  alias :[] :value
 
   # Retrieves the first value associated with the given key.
   #

metadata

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