{"name":"aliastable","downloads":26673,"version":"4.0.1","version_created_at":"2023-03-08T23:03:09.554Z","version_downloads":1341,"platform":"ruby","authors":"Paul J Sanchez","info":"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.","licenses":["MIT"],"metadata":{"homepage_uri":"https://bitbucket.org/paul_j_sanchez/aliastable","source_code_uri":"https://bitbucket.org/paul_j_sanchez/aliastable","documentation_uri":"https://www.rubydoc.info/gems/aliastable"},"yanked":false,"sha":"7bf602fa42d19ca149a9adb5d8cf76aedcd102fa05869c0dcc4116eed5b63194","spec_sha":"20dd41db5b048da0519a0b8aa5593f0e22f377215ac7787a84030fadfbafd42f","project_uri":"https://rubygems.org/gems/aliastable","gem_uri":"https://rubygems.org/gems/aliastable-4.0.1.gem","homepage_uri":"https://bitbucket.org/paul_j_sanchez/aliastable","wiki_uri":null,"documentation_uri":"https://www.rubydoc.info/gems/aliastable","mailing_list_uri":null,"source_code_uri":"https://bitbucket.org/paul_j_sanchez/aliastable","bug_tracker_uri":null,"changelog_uri":null,"funding_uri":null,"dependencies":{"development":[],"runtime":[]}}