grfn 1.0.0.0 → 1.0.0.1

raw patch · 3 files changed

+6/−17 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• CHANGELOG.md +3/−0
• README.md +0/−1
• grfn.cabal +3/−16

@@ -9,3 +9,6 @@ ## Unreleased  ## 0.1.0.0 - YYYY-MM-DD+### Added++- v1.0.0.1 Fixed broken links in Readme.md, verson and typos in cabal, makefile, ci.yml, Changelog

@@ -2,7 +2,6 @@ ![GitHub CI](https://img.shields.io/github/actions/workflow/status/threeeyedgod/GRFN/ci.yml) [![MPL-2.0 license](https://img.shields.io/badge/license-MPL--2.0-blue.svg)](https://github.com/threeeyedgod/GRFN/blob/main/LICENSE) [![Stable Version](https://img.shields.io/github/v/tag/ThreeEyedGod/GRFN)](https://img.shields.io/github/v/tag/ThreeEyedGod/grfn)-[![Latest Release](https://img.shields.io/github/v/release/ThreeEyedGod/GRFN?color=%233D9970)](https://img.shields.io/github/v/release/ThreeEyedGod/grfn?color=%233D9970) [![Hackage](https://img.shields.io/hackage/v/grfn.svg)](https://hackage.haskell.org/package/grfn)  Synopsis

@@ -1,6 +1,6 @@ cabal-version:       3.6 name:                grfn-version:             1.0.0.0+version:             1.0.0.1 homepage:            https://github.com/threeeyedgod/grfn#readme license:             BSD-3-Clause license-file:        LICENSE@@ -9,22 +9,9 @@ copyright:           2024 ThreeEyedGod synopsis:            Uniformly-random pre-factored numbers (Kalai) description:-    @__grfn__@ is an focused library. @grfn@ is an implementation of Adam Kalai's algorithm +    @__grfn__@ is a focused library -- an implementation of Adam Kalai's algorithm      to get uniform pre-factored numbers. -    See [README](https://github.com/threeeyedgod/grfn#grfn) for more details.    --    /Example:/ a single pre-factored number guaranteed with uniform probability may be obtained by one of these 3 calls.  -    preFactoredNumOfBitSizePar is a concurrent parallized implementation and may offer performance --      >>> genARandomPreFactoredNumberLTEn 20 -- will give a pre-factored number less than or equal to 20.-      >>> Right (8,[2,2,2,1])--      >>> preFactoredNumOfBitSize 20 -- will give a pre-factored number in the range [2^20, 2^21 - 1]-      >>> Right (1695177,[17123,11,3,3,1])--      >>> preFactoredNumOfBitSizePar 60 -- will give a pre-factored number in the range [2^60, 2^61 - 1]-      >>> Right (1245467344549977447,[332515759,233924281,179,19,3,3,1])-    +    See [README](https://github.com/threeeyedgod/grfn#grfn) for more details.         category:            Algorithm, Random, Numbers build-type:          Simple stability:           experimental