RubyGems - rbtree - Versions diffs - 0.2.0 → 0.4.4 - Mend

rbtree 0.2.0 → 0.4.4

Files changed (11) hide show

checksums.yaml +7 -0
data/LICENSE +1 -1
data/MANIFEST +0 -1
data/README +52 -57
data/dict.c +364 -83
data/dict.h +30 -6
data/extconf.rb +12 -29
data/rbtree.c +824 -519
data/test.rb +393 -193
metadata +52 -45
data/ChangeLog +0 -425

metadata CHANGED Viewed

@@ -1,35 +1,28 @@
---- !ruby/object:Gem::Specification
-rubygems_version: 0.9.4
-specification_version: 1
+--- !ruby/object:Gem::Specification
 name: rbtree
-version: !ruby/object:Gem::Version
-  version: 0.2.0
-date: 2008-02-05 00:00:00 +09:00
-summary: A sorted associative collection.
-require_paths:
-- .
-email: burningdowntheopera at yahoo dot co dot jp
-homepage: http://www.geocities.co.jp/SiliconValley-PaloAlto/3388/rbtree/README.html
-rubyforge_project:
-description: 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.
-autorequire:
-default_executable:
-bindir: bin
-has_rdoc: true
-required_ruby_version: !ruby/object:Gem::Version::Requirement
-  requirements:
-  - - ">"
-    - !ruby/object:Gem::Version
-      version: 0.0.0
-  version:
+version: !ruby/object:Gem::Version
+  version: 0.4.4
 platform: ruby
-signing_key:
-cert_chain:
-post_install_message:
-authors:
+authors:
 - OZAWA Takuma
-files:
-- ChangeLog
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2021-01-01 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.
+email:
+executables: []
+extensions:
+- extconf.rb
+extra_rdoc_files:
+- README
+- rbtree.c
+files:
 - LICENSE
 - MANIFEST
 - README
@@ -39,20 +32,34 @@ files:
 - extconf.rb
 - rbtree.c
 - test.rb
-test_files:
-- test.rb
-rdoc_options:
-- --main
-- RBTree
-- --exclude
-- .*
-extra_rdoc_files:
-- rbtree.c
-executables: []
-extensions:
-- extconf.rb
+homepage: http://rbtree.rubyforge.org/
+licenses:
+- MIT
+metadata: {}
+post_install_message:
+rdoc_options:
+- "--title"
+- Ruby/RBTree
+- "--main"
+- README
+- "--exclude"
+- "\\A(?!README|rbtree\\.c).*\\z"
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 1.8.6
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-dependencies: []
+rubygems_version: 3.2.3
+signing_key:
+specification_version: 4
+summary: A sorted associative collection.
+test_files:
+- test.rb

data/ChangeLog DELETED Viewed

@@ -1,425 +0,0 @@
-2007-09-21  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* extconf.rb: no gcc options for mswin32.
-2007-02-01  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* version 0.2.0 released.
-2007-01-25  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_readjust): remove a warning.
-	* rbtree.c (rbtree_default): should not call default procedure if
-	no key is given.
-	* rbtree.c (rbtree_equal): returns true if two rbtrees have same
-	set of key-value set.
-2004-10-27  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* version 0.1.3 released.
-2004-07-29  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_bound): RBTree#bound(lower, upper = lower).
-2004-07-11  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (MultiRBTree): new class. MultiRBTree allows duplicates
-	of keys.
-	* rbtree.c (rbtree_dump, rbtree_s_load): use Array as a storage
-	for performance improvement.
-	* rbtree.c (rbtree_equal, rbtree_initialize_copy, rbtree_update):
-	should use rb_obj_is_kind_of.
-	* rbtree.c (iter_lev): added to count iterator level for nesting
-	and thread-safety.
-2004-06-29  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* dict.c: remove codes Ruby/RBTree doesn't need. now not supposed
-	to use dict.c with other program.
-	* dict.h: ditto.
-	* dict.c (dict_equal): remove key_eql argument. use
-	dict->dict_compare to compare keys.
-2004-06-20  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_cmp): use rb_str_cmp if the type of keys is
-	string.
-	* rbtree.c (rbtree_cmp): use rb_cmpint.
-	* rbtree.c (rbtree_user_cmp): ditto.
-2004-06-12  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* version 0.1.2 release.
-2004-05-31  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_initialize_copy): if an exception is raised in
-	the method rbtree is not modified.
-	* rbtree.c (rbtree_delete_if): if an exception is raised in the
-	block rbtree is not modified(no keys are deleted).
-	* rbtree.c (rbtree_readjust): use rb_gc_force_recycle.
-2004-05-24  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_initialize_copy): use aset_i. duplicating a key
-	of string is fast because of copy-on-write.
-	* rbtree.c (rbtree_readjust): ditto.
-	* rbtree.c (rbtree_update): ditto.
-	* rbtree.c (rbtree_aset): no dict_lookup for better performance.
-	* rbtree.c (rbtree_update): was same whether a block is given or not.
-2004-05-23  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (inspect_rbtree): add OBJ_INFECTs.
-	* rbtree.c (inspect_rbtree): change ``compare'' to ``cmp_proc''.
-	* rbtree.c (pp_block): ditto.
-2004-04-26  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_s_create): accept Hash argument.
-	* rbtree.c (rbtree_s_create): should just copy keys and values.
-2004-02-19  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (pp_object_group): use id_object_group.
-2004-02-16  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* version 0.1.1 release.
-2004-02-13  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* README: rewritten.
-	* rbtree.c (document): incomplete document for rdoc.
-2004-02-08  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* test.rb (test_pp): add pretty printing test.
-2004-02-07  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_mark): should check rbtree and dict is
-	initialized. Thanks to Neil Spring.
-2004-02-05  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (prettyprint): polish code.
-	* test.rb (assert_raise): alias of assert_raises for Ruby 1.6.x.
-2004-02-02  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* test.rb: clean code. no more RUnit support. use Test::Unit.
-2004-01-29  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_dump): optimization.
-	* rbtree.c (rbtree_s_load): ditto.
-2004-01-27  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (readjust): RBTree#readjust() just readjusts elements
-	using current comparison block. use RBTree#readjust(nil) to set
-	default comparison block.
-	* extconf.rb (assertion): removed.
-2004-01-14  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* ctest/test.c: removed.
-	* ctest/testlib.c: ditto.
-	* ctest/testlib.h: ditto.
-	* ctest/Makefile: ditto.
-2004-01-04  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* version 0.1.0 release.
-2004-01-03  OZAWA Takuma  <burningdowntheopera@yahoo.co.jp>
-	* rbtree.c (rbtree_to_rbtree): new method.
-	* rbtree.c (each_pair_i, rbtree_bound_body, rbtree_delete_if_body,
-	  select_i, update_block_i): use rb_yield_values.
-	* rbtree.c (rbtree_each): RBTree#each should yield single value.
-	* rbtree.c (rbtree_select): select(key..) is removed.
-	* rbtree.c (rbtree_fetch): always warn if default argument and a
-	  block are supplied at the same time.
-2003-08-12  takuma ozawa  <hermione@24i.net>
-	* version 0.0.7 release.
-2003-08-11  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_to_hash): copy default value.
-	* rbtree.c (rbtree_readjust): takes a Proc argument.
-	* rbtree.c (to_hash_i): optimization.
-2003-08-09  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_merge): new method.
-	* rbtree.c (rbtree_select): select(key..) is deprecated.
-	* rbtree.c (rbtree_values_at): new method.
-	* rbtree.c (rbtree_initialized_copy): rbtree_copy_object changed to.
-2003-07-27  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_dump): new method based on Ara Howard's code.
-	Thanks.
-	* rbtree.c (rbtree_s_load): ditto.
-2003-03-25  takuma ozawa  <hermione@24i.net>
-	* version 0.0.6 release.
-2003-02-26  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_readjust): rbtree_modify.
-2003-02-23  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_copy_object): use copy_i.
-	* rbtree.c (rbtree_readjust): ditto.
-	* rbtree.c (rbtree_aset): not freeze a key.
-2003-01-24  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_aset): optimization.
-2003-01-18  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_aset): not raise an exception if a dict is
-	full and the key has been contained.
-2003-01-16  takuma ozawa  <hermione@24i.net>
-	* version 0.0.5 release.
-2002-12-26  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_alloc): new allocation framework.
-	* rbtree.c (rbtree_copy_object): changed become to copy_object.
-	* rbtree.c (rbtree_cmp): use NUM2INT in case nil returned.
-	* extconf.rb (assertion): assertion is off by default.
-	* rbtree.c (rbtree_aset): fixed a memory leak occured if the
-	comparison block raises an exception.
-2002-11-24  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_pretty_print): new method.
-	* rbtree.c (rbtree_pretty_print_cycle): new method.
-2002-11-22  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_inspect): format changed.
-	* rbtree.c (rbtree_user_cmp): use NUM2INT.
-2002-10-29  takuma ozawa  <hermione@24i.net>
-	* version 0.0.4 release.
-2002-10-18  takuma ozawa  <hermione@24i.net>
-	* extconf.rb (assertion): change name to assertion.
-2002-10-12  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_readjust): assign Qnil to other's dict_context
-	after swap.
-	* rbtree.c (rbtree_bound): use dict_compare for range check.
-2002-10-10  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_readjust): empty dict check.
-	* rbtree.c (rbtree_readjust): not use dict_readjust for better
-	readability.
-	* rbtree.c (rbtree_become): must copy dict_compare and
-	dict_context before copying nodes.
-	* rbtree.c (rbtree_delete_if): rbtree_modify.
-	* rbtree.c (rbtree_shift_pop): ditto.
-	* rbtree.c (rbtree_update): ditto.
-	* test.rb: Test::Unit.
-	* rbtree.c (rbtree_readjust): clear other's nodes after swap.
-	* rbtree.c (rbtree_readjust): assign Qnil to other's ifnone after
-	swap.
-2002-10-07  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_update): self assignment check.
-	* rbtree.c (rbtree_update): replace duplicate value by return
-	value of block if given.
-2002-10-03  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_become): self assignment check.
-2002-09-24  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_cmp_proc): new method.
-	* rbtree.c (rbtree_readjust): if no block given, must assign Qnil
-	to context.
-	* rbtree.c (rbtree_inspect): format changed.
-2002-09-23  takuma ozawa  <hermione@24i.net>
-	* dict.c (dict_equal): empty test must be after similar test.
-2002-09-22  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_update): convert argument to RBTree.
-	* rbtree.c (rbtree_become): ditto.
-	* rbtree.c (rbtree_eq): use rb_equal.
-	* rbtree.c (rbtree_eql): change name to rbtree_eq.
-2002-09-20  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (RBTREE_FL_COPY): removed.
-	* ctest/test.c: rewritten in C. CppUnit is not required.
-2002-09-18  takuma ozawa  <hermione@24i.net>
-	* depend: new file.
-	* rbtree.c (rbtree_equal): no need to check RBTREE_PROC_DEFAULT.
-	* extconf.rb (inline) check for inline keyword.
-2002-09-17  takuma ozawa  <hermione@24i.net>
-	* version 0.0.3 release.
-2002-09-16  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_reverse_each): new method.
-2002-09-12  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_s_create): unset RBTREE_PROC_DEFAULT if the
-	argument is RBTree.
-	* rbtree.c (rbtree_clone): use rbtree_become.
-	* rbtree.c (version.h): not included.
-2002-09-11  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_to_a): use OBJ_INFECT.
-	* rbtree.c (rbtree_to_hash): ditto.
-	* rbtree.c (rbtree_become): replaced by rbtree_replace.
-	* rbtree.c (rbtree_replace): removed. replace is implemented
-	useing rbtree_become.
-	* rbtree.c (rbtree_first_last): first or pop from empty tree
-	should not return its default proc.
-2002-09-09  takuma ozawa  <hermione@24i.net>
-	* rbtree.c (rbtree_become): new method.
-	* rbtree.c (rbtree_clone): unset RBTREE_IN_ITERATION.
-	* rbtree.c (rbtree_replace): should copy ifnone.
-	* rbtree.c (rbtree_shift_pop): shift or pop from empty tree should
-	not return its default proc.
-	* rbtree.c (rbtree_default_proc): new method.
-	* rbtree.c (rbtree_equal): should check default values and
-	RBTREE_PROC_DEFAULT.
-2002-07-19  takuma ozawa  <metal@mine.ne.jp>
-	* dict.c (alloc_node): must return NULL if a memory allocation
-	fails.
-2002-07-13  takuma ozawa  <metal@mine.ne.jp>
-	* version 0.0.2 release.
-2002-07-11  takuma ozawa  <metal@mine.ne.jp>
-	* rbtree.c (rbtree_readjust): new method.
-2002-07-10  takuma ozawa  <metal@mine.ne.jp>
-	* dict.c (dict_clone): clone object must copy must_unfreeze
-	variable.
-2002-06-25  takuma ozawa  <metal@mine.ne.jp>
-	* dict.h (dnode_t): add must_freeze flag not to unfreeze already
-	freezed object.
-2002-06-22  takuma ozawa  <metal@mine.ne.jp>
-	* rbtree.c (rbtree_first): new method.
-	* rbtree.c (rbtree_last): new method.
-	* rbtree.c (rbtree_pop): new method.
-2002-06-14  takuma ozawa  <metal@mine.ne.jp>
-	* initial release.