aliastable 3.0.3 → 3.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 64997be896934a0e70ba0c4776e26f08a68fae50
-  data.tar.gz: 7e7d8a38a21f8355be9c0e83559fb3e5689ea556
+SHA256:
+  metadata.gz: daff6ffd485a6eabe1a2341625be2ffd7b43e821b66d6b0a50363f5822f22cdd
+  data.tar.gz: cffa205ec028890811239ab49dfaf36111d53c749a8b90971fd658da5ad0fe5c
 SHA512:
-  metadata.gz: e49595d9a6da320b2e22db5672f5fc4546a4919edc3915dbd6e9b1cec69beff947b16006f76a55727c147946dd08cec4f2aeaad4be31df6e9a606de27190ed6d
-  data.tar.gz: f696a2b2f0b5de5eb7b9932f4a121f0b1e94e988284eb0123e79c45bef8e59dee1c3b089ab5e24ddd448ab17e22acfe367cbb52e8b3130e7745307c3bd4ae638
+  metadata.gz: f227b5d8d874414e8ff7ab1dea7295cf1cd212f9a7cdebd8df90cb2e74ff95ff07bda966df03ccc205abdf13397990de16988ccc011d9a025ab2964ac3e08a5e
+  data.tar.gz: 4b2742b75bc5e1d8c089bcf653bb7b37c2c0a6757a754d97cace15b1b13a1dc2744dbc294641bf4790d238a7e9832d3f01c031d0f74fad043086fef251cb1148

data/aliastable.gemspec

@@ -1,13 +1,13 @@
 # -*- ruby -*-
-_VERSION = "3.0.3"
+_VERSION = "3.1.0"
 
 Gem::Specification.new do |s|
   s.name = "aliastable"
   s.version = _VERSION
-  s.date = "2015-09-10"
+  s.date = "2018-01-16"
   s.summary = "Efficiently generate random outcomes from an arbitrary categorical distribution."
   s.email = "pjs@alum.mit.edu"
-  s.description = "If a categorical distribution has k distinct values, traditional approaches will require O(k) work to pick an outcome with the correct probabilities.  This algorithm uses conditional probability to construct a table which will yield outcomes with the correct probabilities, but in O(1) time."
+  s.description = "If a categorical distribution has k distinct values, traditional approaches will require O(k) work to pick an outcome with the correct probabilities.  This algorithm uses conditional probability to construct a table which will yield outcomes with the correct probabilities. Table generation requires O(k) time, but subsequent generation is done in O(1) time."
   s.author = "Paul J Sanchez"
   s.files = %w[
     aliastable.gemspec
@@ -19,8 +19,9 @@ Gem::Specification.new do |s|
     test/infile.good.1
     test/infile.good.2
     test/infile.good.3
+    test/infile.good.4
     test/test_alias.rb
   ]
-  s.required_ruby_version = '>= 1.9.3'
+  s.required_ruby_version = '>= 2.0.0'
   s.license = 'LGPL'
 end

data/lib/aliastable.rb

@@ -26,11 +26,9 @@ class AliasTable
   #   - RuntimeError if +p_value+s don't sum to one. Rationals will avoid this.
   #
   def initialize(x_set, p_value)
-    if x_set.length != p_value.length
-      fail 'Args to AliasTable must be vectors of the same length.'
-    end
+    fail 'x_set & p_value must have same length.' if x_set.size != p_value.size
     fail 'p_values must be positive' unless p_value.all? { |value| value > 0 }
-    @p_primary = p_value.map(&:to_r)
+    @p_primary = p_value.map(&:rationalize)
     fail 'p_values must sum to 1' unless @p_primary.reduce(:+) == Rational(1)
     @x = x_set.clone.freeze
     @alias = Array.new(@x.length)

data/test/infile.good.3

@@ -8,7 +8,7 @@
 8,8/253
 9,9/253
 10,10/253
-11,1/23
+11,11/253
 12,12/253
 13,13/253
 14,14/253
@@ -19,4 +19,4 @@
 19,19/253
 20,20/253
 21,21/253
-22,2/23
+22,22/253

data/test/infile.good.4

@@ -0,0 +1,3 @@
+1,0.333333
+3,0.333333
+7,0.333334

data/test/test_alias.rb

@@ -20,12 +20,14 @@ Dir['test/infile.*'].each do |f_name|
     inputs = line.strip.split(/[\s,;:]+/)
     x << inputs[0]
     counts[inputs[0]] = 0
-    probs << inputs[1].to_r
+    probs << Rational(inputs[1])
     n_hat = probs[-1] * nvars
     half_width = 2.5 * Math.sqrt(n_hat * (1.0 - probs[-1])) if n_hat > 0
     expected_counts[inputs[0]] = [n_hat, half_width]
   end
   f.close
+  p x
+  p probs
   begin
     at = AliasTable.new(x, probs)
     nvars.times { counts[at.generate] += 1 }

metadata

@@ -1,19 +1,20 @@
 --- !ruby/object:Gem::Specification
 name: aliastable
 version: !ruby/object:Gem::Version
-  version: 3.0.3
+  version: 3.1.0
 platform: ruby
 authors:
 - Paul J Sanchez
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-09-10 00:00:00.000000000 Z
+date: 2018-01-16 00:00:00.000000000 Z
 dependencies: []
 description: If a categorical distribution has k distinct values, traditional approaches
   will require O(k) work to pick an outcome with the correct probabilities.  This
   algorithm uses conditional probability to construct a table which will yield outcomes
-  with the correct probabilities, but in O(1) time.
+  with the correct probabilities. Table generation requires O(k) time, but subsequent
+  generation is done in O(1) time.
 email: pjs@alum.mit.edu
 executables: []
 extensions: []
@@ -28,6 +29,7 @@ files:
 - test/infile.good.1
 - test/infile.good.2
 - test/infile.good.3
+- test/infile.good.4
 - test/test_alias.rb
 homepage: 
 licenses:
@@ -41,7 +43,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 1.9.3
+      version: 2.0.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
@@ -49,7 +51,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.5.1
+rubygems_version: 2.7.4
 signing_key: 
 specification_version: 4
 summary: Efficiently generate random outcomes from an arbitrary categorical distribution.