rbtree3 0.7.0 → 0.7.1
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/ChangeLog +6 -0
- data/rbtree.c +3 -3
- metadata +3 -3
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: e58d214b8c7a56e628ff7783e9f8ee40088fd78a3be0f719ee8f1125017d2d28
|
4
|
+
data.tar.gz: 29f619a21052915efd058701b2fb334f983066ac35b6c370b73208b6bdd8fe9a
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: e203ace7dad74d26d9df1d8776cbce09d9db8c15ab8d1cdc4ef822314346c595d851d0341c1c5a34a630d386959da4bac54b5b62b3e7d9a2789be7e78cbfae38
|
7
|
+
data.tar.gz: 53dfea3812a02aa104aee2f07fa5dd1504d58e7427e4ee5e581903472362a7d1f0147b92ca753b625ee344a4ac7435d8a4dc2eba7ab9c50060317f82fedb599c
|
data/ChangeLog
CHANGED
data/rbtree.c
CHANGED
@@ -122,7 +122,7 @@ static int
|
|
122
122
|
rbtree_cmp(const void* key1, const void* key2, void* context)
|
123
123
|
{
|
124
124
|
VALUE ret;
|
125
|
-
if (TYPE(key1) == T_STRING && TYPE(key2) == T_STRING)
|
125
|
+
if (TYPE((VALUE)key1) == T_STRING && TYPE((VALUE)key2) == T_STRING)
|
126
126
|
return rb_str_cmp((VALUE)key1, (VALUE)key2);
|
127
127
|
ret = rb_funcall((VALUE)key1, id_cmp, 1, (VALUE)key2);
|
128
128
|
return cmpint(ret, (VALUE)key1, (VALUE)key2);
|
@@ -301,7 +301,7 @@ insert_node_ensure(VALUE arg_)
|
|
301
301
|
dict->dict_freenode(node, dict->dict_context);
|
302
302
|
break;
|
303
303
|
case NODE_NOT_FOUND:
|
304
|
-
if (TYPE(arg->key) == T_STRING)
|
304
|
+
if (TYPE((VALUE)arg->key) == T_STRING)
|
305
305
|
node->dict_key = TO_KEY(rb_str_new4(GET_KEY(node)));
|
306
306
|
break;
|
307
307
|
case NODE_FOUND:
|
@@ -377,7 +377,7 @@ rbtree_fetch(int argc, VALUE* argv, VALUE self)
|
|
377
377
|
rbtree_argc_error();
|
378
378
|
block_given = rb_block_given_p();
|
379
379
|
if (block_given && argc == 2)
|
380
|
-
|
380
|
+
rb_warn("block supersedes default value argument");
|
381
381
|
|
382
382
|
node = dict_lookup(DICT(self), TO_KEY(argv[0]));
|
383
383
|
if (node != NULL)
|
metadata
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: rbtree3
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.7.
|
4
|
+
version: 0.7.1
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- Kyrylo Silin
|
@@ -9,7 +9,7 @@ authors:
|
|
9
9
|
autorequire:
|
10
10
|
bindir: bin
|
11
11
|
cert_chain: []
|
12
|
-
date:
|
12
|
+
date: 2023-04-20 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.
|
@@ -54,7 +54,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
|
|
54
54
|
- !ruby/object:Gem::Version
|
55
55
|
version: '0'
|
56
56
|
requirements: []
|
57
|
-
rubygems_version: 3.1
|
57
|
+
rubygems_version: 3.4.1
|
58
58
|
signing_key:
|
59
59
|
specification_version: 4
|
60
60
|
summary: A RBTree is a sorted associative collection that is implemented with a Red-Black
|