davenport 1.0.0 → 1.0.2.pre

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e60864e6083af33645d1f935132f958e613db8acffdd2523c29fafde6eaa7673
-  data.tar.gz: 643c0618945c97d49340f1aaf711b72dbe31e674ae4752563568591cd18c54bd
+  metadata.gz: 602601c1968346a69a93ba33634853205c2c53602d44edebf49bd1e406a64fe5
+  data.tar.gz: 2115f76023c51ae60625863d8fab0370d17db500d0c4cc8f8781a473a363e934
 SHA512:
-  metadata.gz: 50daf9a754d6c3f1b72297cd9a5688dfbc4c52c292dbe7d358715439c17ce63abdc7c3d0944acf54c2b17c8a9ac6b6d70bab543df54812c4288cc522b0f18cc1
-  data.tar.gz: 6e033d3ecdeacf7305759b1c5da0563d6fe4655147d7651d2693f05ed9292e3a9a914fec0fd32fb385ba71a0faedf22d37dc057070ff25a334248b05cc8cb852
+  metadata.gz: a68bd514867d1958e63cb4cd05254d2deb743dade10b38291f7bfa7240dbcfc6ab80c689caa1ec24050b323cc145acb45eee9ca1a7adb09738b84ff6ed45e1e8
+  data.tar.gz: 888c2a41f62baf512a7f2c29185d27e64d89a2d7fa606fc8c9d8727a0bc900d672dcd2624c56e3c9b1e0dbe1e134204b1b26babec953466b53a1671f7edc3eb5

data/Rakefile

@@ -1,29 +1,9 @@
-# -*- ruby -*-
-
 require 'rubygems'
-require 'hoe'
 require 'rake/extensiontask'
 
-# Hoe.plugin :compiler
-# Hoe.plugin :gem_prelude_sucks
-# Hoe.plugin :inline
-# Hoe.plugin :minitest
-# Hoe.plugin :racc
-# Hoe.plugin :rcov
-# Hoe.plugin :rdoc
-
-HOE = Hoe.spec "davenport" do
-  developer("Douglas Lovell", "doug@wbreeze.com")
-  license "LGPL-3.0"
-  self.spec_extras = {
-    extensions: ['ext/davenport/extconf.rb']
-  }
-end
+spec = Gem::Specification.load('davenport.gemspec')
 
-Rake::ExtensionTask.new('davenport', HOE.spec) do |ext|
-  ext.lib_dir = File.join('lib', 'davenport')
+Rake::ExtensionTask.new "davenport_ruby", spec do |ext|
+  ext.name = 'davenport_ruby'
+  ext.lib_dir = 'lib/davenport_ruby'
 end
-
-Rake::Task[:test].prerequisites << :compile
-
-# vim: syntax=ruby

data/ext/{davenport/davenport.c → davenport_ruby/davenport_ruby.c}

@@ -105,7 +105,7 @@ VALUE davenport(VALUE self)
   return pref;
 }
 
-void Init_davenport()
+void Init_davenport_ruby()
 {
   VALUE mDv = rb_define_module("Davenport");
   VALUE cPg = rb_define_class_under(mDv, "PreferenceGraph", rb_cData);

data/ext/{davenport → davenport_ruby}/extconf.rb

@@ -6,4 +6,4 @@ unless have_library('davenport', 'preference_graph_add_preference')
 end
 
 create_header
-create_makefile 'davenport/davenport'
+create_makefile 'davenport_ruby/davenport_ruby'

data/lib/davenport.rb

@@ -1,7 +1,7 @@
-require 'davenport/davenport'
+require 'davenport_ruby/davenport_ruby'
 
 module Davenport
-  VERSION = "1.0.0"
+  VERSION = "1.0.2"
 
   class PreferenceGraphCountException < StandardError
   end

metadata

@@ -1,90 +1,54 @@
 --- !ruby/object:Gem::Specification
 name: davenport
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.0.2.pre
 platform: ruby
 authors:
-- Douglas Lovell
+- Douglas Lovell <https://wbreeze.com/>
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-05-27 00:00:00.000000000 Z
+date: 2019-07-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
-  name: rdoc
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '4.0'
-    - - "<"
-      - !ruby/object:Gem::Version
-        version: '7'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '4.0'
-    - - "<"
-      - !ruby/object:Gem::Version
-        version: '7'
-- !ruby/object:Gem::Dependency
-  name: hoe
+  name: rake-compiler
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.17'
+        version: '1.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.17'
-description: |-
-  A ranking is a partial order that, given some set of alternatives, places
-  some before others.
-  A preference graph, given some number of rankings, expresses the combination
-  of all of those rankings. It is a directed, weighted graph in which the
-  nodes represent the alternatives and the edges represent preferences.
-
-  Use this to build a preference graph from individual rankings and compute
-  a Kemeny order, aggregated preference that minimizes the number of
-  pair-wise disagreements with the individual rankings.
-
-  This is a Ruby binding built around a C language implementation of
-  Davenport's algorithm, found on github at
-  {wbreeze/davenport}[https://github.com/wbreeze/davenport]
-email:
-- doug@wbreeze.com
+        version: '1.0'
+description: 'Provides a Ruby interface for aggregating partial order expressions
+  into a partial order with minimal Kemeny-Young distance '
+email: 
 executables: []
 extensions:
-- ext/davenport/extconf.rb
-extra_rdoc_files:
-- History.txt
-- Manifest.txt
-- README.rdoc
+- ext/davenport_ruby/extconf.rb
+extra_rdoc_files: []
 files:
-- ".autotest"
 - History.txt
-- Manifest.txt
 - README.rdoc
 - Rakefile
-- ext/davenport/davenport.c
-- ext/davenport/extconf.rb
+- ext/davenport_ruby/davenport_ruby.c
+- ext/davenport_ruby/extconf.rb
 - lib/davenport.rb
-- test/test_davenport.rb
 homepage: https://github.com/wbreeze/davenport-ruby
 licenses:
 - LGPL-3.0
-metadata: {}
+metadata:
+  bug_tracker_uri: https://github.com/wbreeze/davenport-ruby/issues
+  changelog_uri: https://github.com/wbreeze/davenport-ruby/pulls
+  documentation_uri: https://github.com/wbreeze/davenport-ruby
+  homepage_uri: https://github.com/wbreeze/davenport-ruby
+  source_code_uri: https://github.com/wbreeze/davenport-ruby
 post_install_message: 
-rdoc_options:
-- "--main"
-- README.rdoc
+rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
@@ -94,13 +58,13 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ">="
+  - - ">"
     - !ruby/object:Gem::Version
-      version: '0'
-requirements: []
+      version: 1.3.1
+requirements:
+- libdavenport
 rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
-summary: A ranking is a partial order that, given some set of alternatives, places
-  some before others
+summary: Ruby binding for the Davenport library
 test_files: []

data/.autotest

@@ -1,25 +0,0 @@
-# -*- ruby -*-
-
-require "autotest/restart"
-
-# Autotest.add_hook :initialize do |at|
-#   at.testlib = "minitest/unit"
-#
-#   at.extra_files << "../some/external/dependency.rb"
-#
-#   at.libs << ":../some/external"
-#
-#   at.add_exception "vendor"
-#
-#   at.add_mapping(/dependency.rb/) do |f, _|
-#     at.files_matching(/test_.*rb$/)
-#   end
-#
-#   %w(TestA TestB).each do |klass|
-#     at.extra_class_map[klass] = "test/test_misc.rb"
-#   end
-# end
-
-# Autotest.add_hook :run_command do |at|
-#   system "rake build"
-# end

data/Manifest.txt

@@ -1,9 +0,0 @@
-.autotest
-History.txt
-Manifest.txt
-README.rdoc
-Rakefile
-ext/davenport/extconf.rb
-ext/davenport/davenport.c
-lib/davenport.rb
-test/test_davenport.rb

data/test/test_davenport.rb

@@ -1,54 +0,0 @@
-require "minitest/autorun"
-require "davenport"
-
-class TestDavenport < Minitest::Test
-  def test_sanity
-    refute_nil(Davenport::VERSION)
-  end
-
-  def test_one_ranking
-    node_ct = 4;
-    pg = Davenport::PreferenceGraph.new(node_ct)
-    expected_ranking = [3, 4, 1, 2];
-    pg.add_preference(expected_ranking);
-    assert_equal(expected_ranking, pg.davenport);
-  end
-
-  def test_constructor_type_error
-    assert_raises(TypeError) do
-      Davenport::PreferenceGraph.new(Object.new)
-    end
-  end
-
-  def test_add_preference_type_error
-    pg = Davenport::PreferenceGraph.new(4)
-    assert_raises(TypeError) do
-      pg.add_preference(Object.new)
-    end
-  end
-
-  def test_add_preference_array_type_error
-    pg = Davenport::PreferenceGraph.new(3)
-    assert_raises(TypeError) do
-      a = [Object.new, Object.new, Object.new];
-      pg.add_preference(a)
-    end
-  end
-
-  def test_add_preference_array_length_error
-    pg = Davenport::PreferenceGraph.new(3)
-    assert_raises(Davenport::PreferenceGraphCountException) do
-      a = [1, 1];
-      pg.add_preference(a)
-    end
-  end
-
-  def test_ranking_two
-    pg = Davenport::PreferenceGraph.new(4)
-    pg.add_preference([1, 3, 2, 4])
-    pg.add_preference([1, 2, 2, 4])
-    pg.add_preference([2, 1, 3, 4])
-    pg.add_preference([1, 3, 2, 4])
-    assert_equal([1, 3, 2, 4], pg.davenport)
-  end
-end