rbtree3 0.7.0 → 0.7.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f6593e6073d49e075b44d1b1f3be4b244d58fc91b4f2c0705bdec7b5c4a9e11e
-  data.tar.gz: 128e6b9623e23694b48cafea9ff6012fe9a7d2473a24272f221ce7ec104b47ac
+  metadata.gz: e58d214b8c7a56e628ff7783e9f8ee40088fd78a3be0f719ee8f1125017d2d28
+  data.tar.gz: 29f619a21052915efd058701b2fb334f983066ac35b6c370b73208b6bdd8fe9a
 SHA512:
-  metadata.gz: 6c2dc0315779d6a7bdaf9ca7c591ea88c4161c46fac1c56bcba51673258c6c80c77113c7222444ea8567ce1cdcae3406cf8eeb0865c0f9e224203fd484a7606b
-  data.tar.gz: eb53a14756e78a30701c01c8ed0f8b5354e6ed499a790164cd30eb5018d942acd939ddc5008dfce33eca1c695438815f136f8ee093c1b0f5f5eec23ecb5cfc80
+  metadata.gz: e203ace7dad74d26d9df1d8776cbce09d9db8c15ab8d1cdc4ef822314346c595d851d0341c1c5a34a630d386959da4bac54b5b62b3e7d9a2789be7e78cbfae38
+  data.tar.gz: 53dfea3812a02aa104aee2f07fa5dd1504d58e7427e4ee5e581903472362a7d1f0147b92ca753b625ee344a4ac7435d8a4dc2eba7ab9c50060317f82fedb599c

data/ChangeLog

@@ -1,3 +1,9 @@
+2023-04-20 Tsimnuj Hawj
+
+  * version 0.7.1 released.
+
+  * rbtree.c: (rbtree_cmp): compilation fixes for Apple M1 chips (and newer)
+
 2022-01-10 Kyrylo Silin
 
 * version 0.7.0 released.

data/rbtree.c

@@ -122,7 +122,7 @@ static int
 rbtree_cmp(const void* key1, const void* key2, void* context)
 {
     VALUE ret;
-    if (TYPE(key1) == T_STRING && TYPE(key2) == T_STRING)
+    if (TYPE((VALUE)key1) == T_STRING && TYPE((VALUE)key2) == T_STRING)
         return rb_str_cmp((VALUE)key1, (VALUE)key2);
     ret = rb_funcall((VALUE)key1, id_cmp, 1, (VALUE)key2);
     return cmpint(ret, (VALUE)key1, (VALUE)key2);
@@ -301,7 +301,7 @@ insert_node_ensure(VALUE arg_)
         dict->dict_freenode(node, dict->dict_context);
         break;
     case NODE_NOT_FOUND:
-        if (TYPE(arg->key) == T_STRING)
+        if (TYPE((VALUE)arg->key) == T_STRING)
             node->dict_key = TO_KEY(rb_str_new4(GET_KEY(node)));
         break;
     case NODE_FOUND:
@@ -377,7 +377,7 @@ rbtree_fetch(int argc, VALUE* argv, VALUE self)
         rbtree_argc_error();
     block_given = rb_block_given_p();
     if (block_given && argc == 2)
-	rb_warn("block supersedes default value argument");
+        rb_warn("block supersedes default value argument");
 
     node = dict_lookup(DICT(self), TO_KEY(argv[0]));
     if (node != NULL)

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rbtree3
 version: !ruby/object:Gem::Version
-  version: 0.7.0
+  version: 0.7.1
 platform: ruby
 authors:
 - Kyrylo Silin
@@ -9,7 +9,7 @@ authors:
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2022-01-10 00:00:00.000000000 Z
+date: 2023-04-20 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.
@@ -54,7 +54,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.1.6
+rubygems_version: 3.4.1
 signing_key:
 specification_version: 4
 summary: A RBTree is a sorted associative collection that is implemented with a Red-Black