aliastable 4.0.0 → 4.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 88cae2e262098e88436d41789056946a36ec55270d4e52c33242f5018b687595
-  data.tar.gz: e6b9c4befb4950137807729b171178b0210c794693a1045dbd94ea10606aa593
+  metadata.gz: 8feca45e9779e9e3d95c111939f1d5f7774e4473d79e7964b839e990429be380
+  data.tar.gz: d87f6a2fe3c6fc6bca9b0ffb23e16dbebd833055a1a67b6a939d1eb7a0e89dcf
 SHA512:
-  metadata.gz: 294e9171f62c9602f1eb3fe9886daeb1fb899431d906e26a33d95c0af4398bad147a62b7e2eee8f7d52a736dd4aa57a67bbf2e5b767ed847817eae59409b7bcf
-  data.tar.gz: 545e97af416b1d7ad20f81444811343eafb0d0ec74a30ce2b5b754cfb4336d8aefb337b907fa4b1b7453da796b5d4b48da941b9840bfeb878c3bff4bc7f614e8
+  metadata.gz: fc4b9b8d60a670dfc96ca7a20730140750ab2b573027e088b4abeee5f8b1f09fc3aedcf190cdfeeeb6cc53721ade41cc12554ab8317b0686e6cf782ce9f757e9
+  data.tar.gz: bce9850229bf8f3af2b00dd54da9a707fd762b31354fe20164401e6a568b10939b4dd8ee8c9970648889c30df66060c735439748e3dd9d322b1b9baf1ddc6d92

data/aliastable.gemspec

@@ -1,10 +1,10 @@
 # -*- ruby -*-
-_VERSION = "4.0.0"
+_VERSION = "4.0.1"
 
 Gem::Specification.new do |s|
   s.name = "aliastable"
   s.version = _VERSION
-  s.date = "2023-01-21"
+  s.date = "2023-03-08"
   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. Table generation requires O(k) time, but subsequent generation is done in O(1) time."
@@ -16,5 +16,9 @@ Gem::Specification.new do |s|
   ]
   s.required_ruby_version = '>= 2.6.0'
   s.license = 'MIT'
-  s.metadata["homepage_uri"] = s.homepage
+  s.metadata = {
+    "source_code_uri" => s.homepage,
+    "homepage_uri" => s.homepage,
+    "documentation_uri" => "https://www.rubydoc.info/gems/aliastable"
+  }
 end

data/lib/aliastable.rb

@@ -54,7 +54,7 @@ class AliasTable
         end
       end
       @enum = Enumerator.new do |y|
-        loop do
+        while true
           column = rand(len)
           y << ((rand <= p_primary[column]) ? x[column] : col_alias[column])
         end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: aliastable
 version: !ruby/object:Gem::Version
-  version: 4.0.0
+  version: 4.0.1
 platform: ruby
 authors:
 - Paul J Sanchez
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2023-01-21 00:00:00.000000000 Z
+date: 2023-03-08 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
@@ -26,7 +26,9 @@ homepage: https://bitbucket.org/paul_j_sanchez/aliastable
 licenses:
 - MIT
 metadata:
+  source_code_uri: https://bitbucket.org/paul_j_sanchez/aliastable
   homepage_uri: https://bitbucket.org/paul_j_sanchez/aliastable
+  documentation_uri: https://www.rubydoc.info/gems/aliastable
 post_install_message:
 rdoc_options: []
 require_paths:
@@ -42,7 +44,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.4.3
+rubygems_version: 3.4.7
 signing_key:
 specification_version: 4
 summary: Efficiently generate random outcomes from an arbitrary categorical distribution.