name: urn-random
description: This package implements urns, which are a simple tree-based data structure
that supports sampling from and updating discrete probability distributions in
logarithmic time.  The details are presented in the paper “Ode on a Random Urn
(Functional Pearl)”, by Leonidas Lampropoulos, Antal Spector-Zabusky, and
Kenneth Foner, published in Haskell Symposium ’17.

license_spdx: MIT
version: 0.1.0.0
spec_version: 1.0
download_url: http://hackage.haskell.org/package/urn-random-0.1.0.0/urn-random-0.1.0.0.tar.gz
home_url: 
            
              https://github.com/antalsz/urn-random
            
          
news_url: https://libraries.io/hackage/urn-random/versions.atom
date: 2017-07-14
about_resource: NONE
libraries_io_url: https://libraries.io/hackage/urn-random?number=0.1.0.0
vcs_tool: git
vcs_repository: https://github.com/antalsz/urn-random
vcs_branch: master
