[Debian-science-sagemath] [RFP]: primecount -- count the primes below an integer

[Dima Pasechnik]

On Mon, Jan 31, 2022 at 10:17 AM Tobias Hansen <thansen at debian.org> wrote:
>
> On 1/28/22 10:32, Dima Pasechnik wrote:
> > I'm the main author of primecountpy, let me know if you have problems with it.
> >
> > We're able to build binary wheels for it, see
> > https://pypi.org/project/primecountpy/
> > (this is done using PyPI's cibuildwheel using GitHub Actions:
> > https://github.com/dimpase/primecountpy/blob/master/.github/workflows/wheels.yml)
> >
> > Cheers
> > Dima
> >
>
> Thank you. Jerome uploaded primecount (it's in new) and I already did a successful test build of primecountpy and sagemath 9.5.
>
> Is there a reason why you didn't call the python module primecount? (Of course I understand why the project is called primecountpy.)
> The "import primecountpy as primecount" in the readme suggests that's the module name you really wanted.

"primecount" was taken on PyPI - it's an interface to primecount
library, lacking features etc. in many ways, so I instead created
primecountpy (well, re-using the cython code from Sage).

Dima

>
> @Jerome: Thanks for packaging primecount. While building with sbuild I realized it is missing Build-Depends on primesieve or libprimesieve-dev or both (I checked only that it works with both).
>
> Best,
> Tobias
>
> _______________________________________________
> Debian-science-sagemath mailing list
> Debian-science-sagemath at alioth-lists.debian.net
> https://alioth-lists.debian.net/cgi-bin/mailman/listinfo/debian-science-sagemath