Rubygems | Latest Versions for rbtreehttps://rubygems.org/gems2023-09-30T13:06:56Zrbtree (0.4.6)https://rubygems.org/gems/rbtree/versions/0.4.62022-12-10T21:30:55ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.4.5)https://rubygems.org/gems/rbtree/versions/0.4.52022-02-02T05:23:25ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.4.4)https://rubygems.org/gems/rbtree/versions/0.4.42021-01-01T02:16:35ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.4.3)https://rubygems.org/gems/rbtree/versions/0.4.32021-01-01T00:03:12ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.4.2)https://rubygems.org/gems/rbtree/versions/0.4.22013-12-26T09:48:52ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.4.1)https://rubygems.org/gems/rbtree/versions/0.4.12013-03-29T20:15:53ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.4.0)https://rubygems.org/gems/rbtree/versions/0.4.02013-03-11T16:46:20ZOZAWA TakumaA sorted associative collection.
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.
rbtree (0.3.0)https://rubygems.org/gems/rbtree/versions/0.3.02009-11-14T11:00:04ZOZAWA TakumaA sorted associative collection.
RBTree is a sorted associative collection that is implemented with Red-Black Tree. The elements of RBTree are ordered and its interface is the almost same as Hash, so simply you can consider RBTree sorted Hash. rbtree (0.2.1)https://rubygems.org/gems/rbtree/versions/0.2.12009-07-25T18:00:42ZOZAWA TakumaA sorted associative collection.
RBTree is a sorted associative collection that is implemented with Red-Black Tree. The elements of RBTree are ordered and its interface is the almost same as Hash, so simply you can consider RBTree sorted Hash. rbtree (0.2.0)https://rubygems.org/gems/rbtree/versions/0.2.02009-07-25T18:00:42ZOZAWA TakumaA sorted associative collection.
RBTree is a sorted associative collection using Red-Black Tree as the internal data structure. The elements of RBTree are ordered and the interface is the almost same as Hash, so simply you can consider RBTree sorted Hash.