rbtree3 0.7.1 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e58d214b8c7a56e628ff7783e9f8ee40088fd78a3be0f719ee8f1125017d2d28
-  data.tar.gz: 29f619a21052915efd058701b2fb334f983066ac35b6c370b73208b6bdd8fe9a
+  metadata.gz: 8d27d1e7a32ef3f88ddf0e3a4e6feed5d2fc8df02fd39d1d353c51a91d4f6ad2
+  data.tar.gz: 548f44e98a342c617f37ce6775a7686915fbd66a4e76e5bca401969910f16311
 SHA512:
-  metadata.gz: e203ace7dad74d26d9df1d8776cbce09d9db8c15ab8d1cdc4ef822314346c595d851d0341c1c5a34a630d386959da4bac54b5b62b3e7d9a2789be7e78cbfae38
-  data.tar.gz: 53dfea3812a02aa104aee2f07fa5dd1504d58e7427e4ee5e581903472362a7d1f0147b92ca753b625ee344a4ac7435d8a4dc2eba7ab9c50060317f82fedb599c
+  metadata.gz: 485f44e9c906d98c69f8fa197b7cdf59250d697ad2b7a844fd76d3aeb6128eb868b6b1bf38116136e2ad28cfc2b91d92d07d5b8c308ea988155b1a0f9cf650c4
+  data.tar.gz: a757b1c167d12842f8ed3d609d791004fe534c15789ddd3d1b769984885c6400baf86bdd07bf7c4eb0771e209fe113c14eb34e6dc6095b2c31249d6cfa6b7885

data/ChangeLog

@@ -1,3 +1,9 @@
+2026-03-24 Hiroshi SHIBATA, Kyrylo Silin
+
+	* version 1.0.0 released.
+
+	* added support for Ruby 4.1
+
 2023-04-20 Tsimnuj Hawj
 
   * version 0.7.1 released.

data/rbtree.c

@@ -1487,13 +1487,6 @@ typedef struct {
     VALUE pp;
 } pp_arg_t;
 
-static VALUE
-pp_object_group(VALUE arg_)
-{
-    pp_arg_t* arg = (pp_arg_t*)arg_;
-    return rb_funcall(arg->pp, id_object_group, 1, arg->rbtree);
-}
-
 static VALUE
 pp_block(RB_BLOCK_CALL_FUNC_ARGLIST(nil, arg_))
 {
@@ -1524,8 +1517,11 @@ rbtree_pretty_print(VALUE self, VALUE pp)
     pp_arg.rbtree = self;
     pp_arg.pp = pp;
 
-    return rb_iterate(pp_object_group, (VALUE)&pp_arg,
-                      pp_block, (VALUE)&pp_arg);
+    {
+        VALUE argv = pp_arg.rbtree;
+        return rb_block_call(pp_arg.pp, id_object_group, 1, &argv,
+                             pp_block, (VALUE)&pp_arg);
+    }
 }
 
 /*

data/test.rb

@@ -722,27 +722,30 @@ class RBTreeTest < Test::Unit::TestCase
 
     def test_pp
       assert_equal(%(#<RBTree: {}, default=nil, cmp_proc=nil>\n),
-                   PP.pp(RBTree[], ""))
-      assert_equal(%(#<RBTree: {"a"=>"A", "b"=>"B"}, default=nil, cmp_proc=nil>\n),
+                    PP.pp(RBTree[], ""))
+
+      arrow = RUBY_VERSION >= "3.4" ? " => " : "=>"
+
+      assert_equal(%(#<RBTree: {"a"#{arrow}"A", "b"#{arrow}"B"}, default=nil, cmp_proc=nil>\n),
                    PP.pp(RBTree[*%w(a A b B)], ""))
 
       rbtree = RBTree[*("a".."z").to_a]
       rbtree.default = "a"
       rbtree.readjust {|a, b| a <=> b }
       expected = <<EOS
-#<RBTree: {"a"=>"b",
-  "c"=>"d",
-  "e"=>"f",
-  "g"=>"h",
-  "i"=>"j",
-  "k"=>"l",
-  "m"=>"n",
-  "o"=>"p",
-  "q"=>"r",
-  "s"=>"t",
-  "u"=>"v",
-  "w"=>"x",
-  "y"=>"z"},
+#<RBTree: {"a"#{arrow}"b",
+  "c"#{arrow}"d",
+  "e"#{arrow}"f",
+  "g"#{arrow}"h",
+  "i"#{arrow}"j",
+  "k"#{arrow}"l",
+  "m"#{arrow}"n",
+  "o"#{arrow}"p",
+  "q"#{arrow}"r",
+  "s"#{arrow}"t",
+  "u"#{arrow}"v",
+  "w"#{arrow}"x",
+  "y"#{arrow}"z"},
  default="a",
  cmp_proc=#{rbtree.cmp_proc}>
 EOS
@@ -752,7 +755,7 @@ EOS
       rbtree[rbtree] = rbtree
       rbtree.default = rbtree
       expected = <<EOS
-#<RBTree: {"#<RBTree: ...>"=>"#<RBTree: ...>"},
+#<RBTree: {"#<RBTree: ...>"#{arrow}"#<RBTree: ...>"},
  default="#<RBTree: ...>",
  cmp_proc=nil>
 EOS

metadata

@@ -1,15 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rbtree3
 version: !ruby/object:Gem::Version
-  version: 0.7.1
+  version: 1.0.0
 platform: ruby
 authors:
 - Kyrylo Silin
 - OZAWA Takuma
-autorequire:
 bindir: bin
 cert_chain: []
-date: 2023-04-20 00:00:00.000000000 Z
+date: 1980-01-02 00:00:00.000000000 Z
 dependencies: []
 description: |-
   A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.
@@ -39,7 +38,6 @@ metadata:
   homepage_uri: https://github.com/kyrylo/rbtree3
   source_code_uri: https://github.com/kyrylo/rbtree3
   changelog_uri: https://github.com/kyrylo/rbtree3/blob/master/ChangeLog
-post_install_message:
 rdoc_options: []
 require_paths:
 - "./"
@@ -54,8 +52,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.4.1
-signing_key:
+rubygems_version: 4.0.3
 specification_version: 4
 summary: A RBTree is a sorted associative collection that is implemented with a Red-Black
   Tree.