rbtree 0.4.4 → 0.4.5
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/README +3 -0
- data/extconf.rb +1 -0
- data/rbtree.c +7 -1
- metadata +8 -9
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: d5bc8dc390afc34242d6cd951136f2d86c9a0bafc809ed93d39d0fdf6c8ea9c0
|
4
|
+
data.tar.gz: '059f888a97995d9bc64edcdafb504817b570e07df03c3385e5c5fe3e8bbc8f72'
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 9a27e36148fab48e03777b3151dc70ee69262da497263bf83cc25c3b9c6b8c7080857cd75c0d2ac8b3837f511d8a448565f1ae64b1da7740dd26b6ec4fca955a
|
7
|
+
data.tar.gz: 9f682a9ce24a0cd3ff101d91cc145fbed066de4788cbb5b25abecfc1604c0e0065d1dc5d35d0f35d10df911bde971ab9f18edafd84030ae5309ce578be6cbc35
|
data/README
CHANGED
data/extconf.rb
CHANGED
@@ -11,6 +11,7 @@ have_func('rb_proc_lambda_p', 'ruby.h')
|
|
11
11
|
have_func('rb_ary_resize', 'ruby.h')
|
12
12
|
have_func('rb_obj_hide', 'ruby.h')
|
13
13
|
have_func('rb_safe_level', 'ruby.h')
|
14
|
+
have_func('rb_cData', 'ruby.h')
|
14
15
|
if Hash.method_defined?(:flatten)
|
15
16
|
$defs << '-DHAVE_HASH_FLATTEN'
|
16
17
|
end
|
data/rbtree.c
CHANGED
@@ -1897,7 +1897,13 @@ rbtree_s_load(VALUE klass, VALUE str)
|
|
1897
1897
|
*/
|
1898
1898
|
void Init_rbtree()
|
1899
1899
|
{
|
1900
|
-
MultiRBTree = rb_define_class("MultiRBTree",
|
1900
|
+
MultiRBTree = rb_define_class("MultiRBTree",
|
1901
|
+
#ifdef HAVE_RB_CDATA
|
1902
|
+
rb_cData
|
1903
|
+
#else
|
1904
|
+
rb_cObject
|
1905
|
+
#endif
|
1906
|
+
);
|
1901
1907
|
RBTree = rb_define_class("RBTree", MultiRBTree);
|
1902
1908
|
|
1903
1909
|
rb_include_module(MultiRBTree, rb_mEnumerable);
|
metadata
CHANGED
@@ -1,21 +1,21 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: rbtree
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.4.
|
4
|
+
version: 0.4.5
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- OZAWA Takuma
|
8
|
-
autorequire:
|
8
|
+
autorequire:
|
9
9
|
bindir: bin
|
10
10
|
cert_chain: []
|
11
|
-
date:
|
11
|
+
date: 2022-02-02 00:00:00.000000000 Z
|
12
12
|
dependencies: []
|
13
13
|
description: |
|
14
14
|
A RBTree is a sorted associative collection that is implemented with a
|
15
15
|
Red-Black Tree. It maps keys to values like a Hash, but maintains its
|
16
16
|
elements in ascending key order. The interface is the almost identical
|
17
17
|
to that of Hash.
|
18
|
-
email:
|
18
|
+
email:
|
19
19
|
executables: []
|
20
20
|
extensions:
|
21
21
|
- extconf.rb
|
@@ -36,7 +36,7 @@ homepage: http://rbtree.rubyforge.org/
|
|
36
36
|
licenses:
|
37
37
|
- MIT
|
38
38
|
metadata: {}
|
39
|
-
post_install_message:
|
39
|
+
post_install_message:
|
40
40
|
rdoc_options:
|
41
41
|
- "--title"
|
42
42
|
- Ruby/RBTree
|
@@ -57,9 +57,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
|
|
57
57
|
- !ruby/object:Gem::Version
|
58
58
|
version: '0'
|
59
59
|
requirements: []
|
60
|
-
rubygems_version: 3.
|
61
|
-
signing_key:
|
60
|
+
rubygems_version: 3.4.0.dev
|
61
|
+
signing_key:
|
62
62
|
specification_version: 4
|
63
63
|
summary: A sorted associative collection.
|
64
|
-
test_files:
|
65
|
-
- test.rb
|
64
|
+
test_files: []
|