From 4ca1add62c53da19b70b23609e41fe6c2197f099 Mon Sep 17 00:00:00 2001 From: kiddy818 Date: Wed, 5 Aug 2020 12:26:56 +0800 Subject: [PATCH 1/2] Update version.rb --- lib/priority_queue/version.rb | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lib/priority_queue/version.rb b/lib/priority_queue/version.rb index b32b690..bc9f5ca 100644 --- a/lib/priority_queue/version.rb +++ b/lib/priority_queue/version.rb @@ -1,3 +1,3 @@ module PriorityQueue - VERSION = "0.1.6" + VERSION = "0.1.7" end From 00592bf9c801b1deedbcd5a5d6ee58d5dc61bdec Mon Sep 17 00:00:00 2001 From: kiddy818 Date: Wed, 5 Aug 2020 12:40:59 +0800 Subject: [PATCH 2/2] fix bug: L820 rb_funcall paramter error rb_funcall(Qnil, id_format, 4, rb_str_new2("NODE%i -> NODE%i;\n"), ULONG2NUM((unsigned long) n), ULONG2NUM((unsigned long) n1))); here has only 3 parameters (rb_str_new2 (with 2 %i parameter), n, n1), not 4. so change 4 to 3 --- ext/priority_queue/CPriorityQueue/priority_queue.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/ext/priority_queue/CPriorityQueue/priority_queue.c b/ext/priority_queue/CPriorityQueue/priority_queue.c index eafc1de..0c95bd4 100644 --- a/ext/priority_queue/CPriorityQueue/priority_queue.c +++ b/ext/priority_queue/CPriorityQueue/priority_queue.c @@ -5,7 +5,7 @@ * * This is a fibonacci heap priority queue implementation. * - * (c) 2005 Brian Schröder + * (c) 2005 Brian Schröder * * Please submit bugreports to priority_queue@brian-schroeder.de * @@ -285,7 +285,7 @@ priority_node* priority_queue_delete_min(priority_queue* q) { n = n->right; } while (n!=min->child); - // Kinder einfügen + // Kinder einfügen if (q->rootlist) { priority_node* const l1 = q->rootlist->left; priority_node* const l2 = n->left; @@ -299,10 +299,10 @@ priority_node* priority_queue_delete_min(priority_queue* q) { } } - // Größe anpassen + // Größe anpassen q->length = length-1; - // Wieder aufhübschen + // Wieder aufhübschen consolidate_queue(q); } @@ -817,7 +817,7 @@ void pq_node2dot(VALUE result_string, priority_node* n, unsigned int level) { pq_node2dot(result_string, n1, level + 1); for (i=0; i NODE%i;\n"), + rb_funcall(Qnil, id_format, 3, rb_str_new2("NODE%i -> NODE%i;\n"), ULONG2NUM((unsigned long) n), ULONG2NUM((unsigned long) n1))); n1 = n1->right; } while(n1 != n->child);