rbtree3 0.6.0 → 0.7.0

Sign up to get free protection for your applications and to get access to all the features.
Files changed (5) hide show
  1. checksums.yaml +4 -4
  2. data/ChangeLog +13 -0
  3. data/rbtree.c +1 -5
  4. data/test.rb +2 -2
  5. metadata +6 -7
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA256:
3
- metadata.gz: 3234cdc1ff704f6a3d32707f6b0fb740c5a946d42012453b56f186a2231157fc
4
- data.tar.gz: 97eeab5707ad178f92fd2261e0209fc37262e9e95f0d75b18f49da1963b2a49d
3
+ metadata.gz: f6593e6073d49e075b44d1b1f3be4b244d58fc91b4f2c0705bdec7b5c4a9e11e
4
+ data.tar.gz: 128e6b9623e23694b48cafea9ff6012fe9a7d2473a24272f221ce7ec104b47ac
5
5
  SHA512:
6
- metadata.gz: '0863e5d7883566ea6dd6da51e743d3606bdbc9f1dbce105e0f38bb2f60815bc4244691065bf4093cdd474d7b545b996dc25a3171ce114c471fa6108b7b21d2d5'
7
- data.tar.gz: 745622af2491d5bdbcded3112c98e2183b1f3716c5a46204274fc0392ff2e5e79b863c03b7ff6f727f4207f13486d0ed82f81b508fad22d00c6b9a74ebb0948f
6
+ metadata.gz: 6c2dc0315779d6a7bdaf9ca7c591ea88c4161c46fac1c56bcba51673258c6c80c77113c7222444ea8567ce1cdcae3406cf8eeb0865c0f9e224203fd484a7606b
7
+ data.tar.gz: eb53a14756e78a30701c01c8ed0f8b5354e6ed499a790164cd30eb5018d942acd939ddc5008dfce33eca1c695438815f136f8ee093c1b0f5f5eec23ecb5cfc80
data/ChangeLog CHANGED
@@ -1,3 +1,16 @@
1
+ 2022-01-10 Kyrylo Silin
2
+
3
+ * version 0.7.0 released.
4
+
5
+ * started testing against Ruby 3.0, 3.1 and Ruby head
6
+
7
+ * test.rb: fixed duplicate test names
8
+
9
+ * rbtree.c: deleted deprecated rb_gc_force_recycle calls
10
+
11
+ * rbtree.c: (Init_rbtree): MultiRBTree inherits from rb_cObject instead of
12
+ rb_cData, which fixed a compilation error on Ruby 3.1+
13
+
1
14
  2020-01-21 Brian Hawley
2
15
 
3
16
  * version 0.6.0 released.
data/rbtree.c CHANGED
@@ -665,8 +665,6 @@ copy_dict(VALUE src, VALUE dest, dict_comp_t cmp, void* context)
665
665
  DICT(temp) = DICT(dest);
666
666
  DICT(dest) = t;
667
667
  }
668
- rbtree_free(RBTREE(temp));
669
- rb_gc_force_recycle(temp);
670
668
  }
671
669
 
672
670
  /*
@@ -1575,7 +1573,6 @@ rbtree_dump(VALUE self, VALUE _limit)
1575
1573
 
1576
1574
  ret = rb_marshal_dump(ary, Qnil);
1577
1575
  rb_ary_clear(ary);
1578
- rb_gc_force_recycle(ary);
1579
1576
  return ret;
1580
1577
  }
1581
1578
 
@@ -1596,7 +1593,6 @@ rbtree_s_load(VALUE klass, VALUE str)
1596
1593
  IFNONE(rbtree) = ptr[len];
1597
1594
 
1598
1595
  rb_ary_clear(ary);
1599
- rb_gc_force_recycle(ary);
1600
1596
  return rbtree;
1601
1597
  }
1602
1598
 
@@ -1656,7 +1652,7 @@ rbtree_s_load(VALUE klass, VALUE str)
1656
1652
  */
1657
1653
  void Init_rbtree()
1658
1654
  {
1659
- MultiRBTree = rb_define_class("MultiRBTree", rb_cData);
1655
+ MultiRBTree = rb_define_class("MultiRBTree", rb_cObject);
1660
1656
  RBTree = rb_define_class("RBTree", MultiRBTree);
1661
1657
 
1662
1658
  rb_include_module(MultiRBTree, rb_mEnumerable);
data/test.rb CHANGED
@@ -701,7 +701,7 @@ class RBTreeTest < Test::Unit::TestCase
701
701
  end
702
702
  end
703
703
 
704
- def test_marshal
704
+ def test_marshal_dump
705
705
  assert_equal(@rbtree, Marshal.load(Marshal.dump(@rbtree)))
706
706
 
707
707
  @rbtree.default = "e"
@@ -890,7 +890,7 @@ class MultiRBTreeTest < Test::Unit::TestCase
890
890
  assert_equal(%w(c C b B b C b D a A), @rbtree.to_a.flatten)
891
891
  end
892
892
 
893
- def test_marshal
893
+ def test_marshal_dump_load
894
894
  assert_equal(@rbtree, Marshal.load(Marshal.dump(@rbtree)))
895
895
  end
896
896
 
metadata CHANGED
@@ -1,15 +1,15 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: rbtree3
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.6.0
4
+ version: 0.7.0
5
5
  platform: ruby
6
6
  authors:
7
7
  - Kyrylo Silin
8
8
  - OZAWA Takuma
9
- autorequire:
9
+ autorequire:
10
10
  bindir: bin
11
11
  cert_chain: []
12
- date: 2020-01-21 00:00:00.000000000 Z
12
+ date: 2022-01-10 00:00:00.000000000 Z
13
13
  dependencies: []
14
14
  description: |-
15
15
  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 +39,7 @@ metadata:
39
39
  homepage_uri: https://github.com/kyrylo/rbtree3
40
40
  source_code_uri: https://github.com/kyrylo/rbtree3
41
41
  changelog_uri: https://github.com/kyrylo/rbtree3/blob/master/ChangeLog
42
- post_install_message:
42
+ post_install_message:
43
43
  rdoc_options: []
44
44
  require_paths:
45
45
  - "./"
@@ -54,9 +54,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
54
54
  - !ruby/object:Gem::Version
55
55
  version: '0'
56
56
  requirements: []
57
- rubyforge_project:
58
- rubygems_version: 2.7.6.2
59
- signing_key:
57
+ rubygems_version: 3.1.6
58
+ signing_key:
60
59
  specification_version: 4
61
60
  summary: A RBTree is a sorted associative collection that is implemented with a Red-Black
62
61
  Tree.