d_heap 0.2.1 → 0.6.0

data/lib/d_heap/version.rb

@@ -1,3 +1,6 @@
+# frozen_string_literal: true
+
 class DHeap
-  VERSION = "0.2.1"
+  VERSION = "0.6.0"
+
 end

metadata

@@ -1,15 +1,43 @@
 --- !ruby/object:Gem::Specification
 name: d_heap
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.6.0
 platform: ruby
 authors:
 - nicholas a. evans
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-12-26 00:00:00.000000000 Z
-dependencies: []
+date: 2021-01-24 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: benchmark_driver
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: ruby-prof
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: |
   A C extension implementation of a d-ary heap data structure, suitable for
   use in e.g. priority queues or Djikstra's algorithm.
@@ -20,24 +48,53 @@ extensions:
 - ext/d_heap/extconf.rb
 extra_rdoc_files: []
 files:
+- ".github/workflows/main.yml"
 - ".gitignore"
 - ".rspec"
+- ".rubocop.yml"
 - ".travis.yml"
+- ".yardopts"
+- CHANGELOG.md
 - CODE_OF_CONDUCT.md
 - Gemfile
 - Gemfile.lock
 - LICENSE.txt
+- N
 - README.md
 - Rakefile
+- benchmarks/perf.rb
+- benchmarks/push_n.yml
+- benchmarks/push_n_pop_n.yml
+- benchmarks/push_pop.yml
+- benchmarks/stackprof.rb
+- bin/bench_charts
+- bin/bench_n
+- bin/benchmark-driver
+- bin/benchmarks
 - bin/console
+- bin/profile
 - bin/rake
 - bin/rspec
+- bin/rubocop
 - bin/setup
 - d_heap.gemspec
+- docs/benchmarks-2.txt
+- docs/benchmarks-mem.txt
+- docs/benchmarks.txt
+- docs/profile.txt
 - ext/d_heap/d_heap.c
-- ext/d_heap/d_heap.h
 - ext/d_heap/extconf.rb
+- images/push_n.png
+- images/push_n_pop_n.png
+- images/push_pop.png
+- images/wikipedia-min-heap.png
+- lib/benchmark_driver/runner/ips_zero_fail.rb
 - lib/d_heap.rb
+- lib/d_heap/benchmarks.rb
+- lib/d_heap/benchmarks/benchmarker.rb
+- lib/d_heap/benchmarks/implementations.rb
+- lib/d_heap/benchmarks/profiler.rb
+- lib/d_heap/benchmarks/rspec_matchers.rb
 - lib/d_heap/version.rb
 homepage: https://github.com/nevans/d_heap
 licenses:
@@ -54,14 +111,14 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 2.5.0
+      version: 2.4.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.3
+rubygems_version: 3.1.4
 signing_key: 
 specification_version: 4
 summary: A d-ary heap implementation, for priority queues

data/ext/d_heap/d_heap.h

@@ -1,74 +0,0 @@
-#ifndef D_HEAP_H
-#define D_HEAP_H 1
-
-#include "ruby.h"
-
-// d=4 uses the fewest comparisons for insert + delete-min (in the worst case).
-#define DHEAP_DEFAULT_D 4
-
-// This is a somewhat arbitary maximum. But benefits from more leaf nodes
-// are very unlikely to outweigh the increasinly higher number of worst-case
-// comparisons as d gets further from 4.
-#define DHEAP_MAX_D 32
-
-
-#define CMP_LT(a, b, cmp_opt) \
-    (OPTIMIZED_CMP(a, b, cmp_opt) < 0)
-#define CMP_LTE(a, b, cmp_opt) \
-    (OPTIMIZED_CMP(a, b, cmp_opt) <= 0)
-#define CMP_GT(a, b, cmp_opt) \
-    (OPTIMIZED_CMP(a, b, cmp_opt) > 0)
-#define CMP_GTE(a, b, cmp_opt) \
-    (OPTIMIZED_CMP(a, b, cmp_opt) >= 0)
-
-VALUE rb_cDHeap;
-ID id_cmp;
-
-// from internal/numeric.h
-#ifndef INTERNAL_NUMERIC_H
-int rb_float_cmp(VALUE x, VALUE y);
-#endif /* INTERNAL_NUMERIC_H */
-
-// from internal/compar.h
-#ifndef INTERNAL_COMPAR_H
-#define STRING_P(s) (RB_TYPE_P((s), T_STRING) && CLASS_OF(s) == rb_cString)
-
-enum {
-    cmp_opt_Integer,
-    cmp_opt_String,
-    cmp_opt_Float,
-    cmp_optimizable_count
-};
-
-struct cmp_opt_data {
-    unsigned int opt_methods;
-    unsigned int opt_inited;
-};
-
-#define NEW_CMP_OPT_MEMO(type, value) \
-    NEW_PARTIAL_MEMO_FOR(type, value, cmp_opt)
-#define CMP_OPTIMIZABLE_BIT(type) (1U << TOKEN_PASTE(cmp_opt_,type))
-#define CMP_OPTIMIZABLE(data, type) \
-    (((data).opt_inited & CMP_OPTIMIZABLE_BIT(type)) ? \
-     ((data).opt_methods & CMP_OPTIMIZABLE_BIT(type)) : \
-     (((data).opt_inited |= CMP_OPTIMIZABLE_BIT(type)), \
-      rb_method_basic_definition_p(TOKEN_PASTE(rb_c,type), id_cmp) && \
-      ((data).opt_methods |= CMP_OPTIMIZABLE_BIT(type))))
-
-#define OPTIMIZED_CMP(a, b, data) \
-    ((FIXNUM_P(a) && FIXNUM_P(b) && CMP_OPTIMIZABLE(data, Integer)) ? \
-     (((long)a > (long)b) ? 1 : ((long)a < (long)b) ? -1 : 0) : \
-     (STRING_P(a) && STRING_P(b) && CMP_OPTIMIZABLE(data, String)) ? \
-     rb_str_cmp(a, b) : \
-     (RB_FLOAT_TYPE_P(a) && RB_FLOAT_TYPE_P(b) && CMP_OPTIMIZABLE(data, Float)) ? \
-     rb_float_cmp(a, b) : \
-     rb_cmpint(rb_funcallv(a, id_cmp, 1, &b), a, b))
-
-#define puts(v) { \
-    ID sym_puts = rb_intern("puts"); \
-    rb_funcall(rb_mKernel, sym_puts, 1, v); \
-}
-
-#endif /* INTERNAL_COMPAR_H */
-
-#endif /* D_HEAP_H */