Gentoo Packages

dev-haskell/numbersieves (haskell)

Search

Install

Install this package:

emerge -a dev-haskell/numbersieves

If the package is masked, you can unmask it using the autounmask tool or standard emerge options:

autounmask dev-haskell/numbersieves

Or alternatively:

emerge --autounmask-write -a dev-haskell/numbersieves

Package Information

Description:
This package includes the Sieve of O'Neill and two generalizations of the Sieve of Eratosthenes. The Sieve of O'Neill is a fully incremental primality sieve based on priority queues. The other two are array based, and are not incremental. One sieves the smallest prime factor, and is useful if you want to factor a large quantity of small numbers. The other sieves Euler's Totient, which is the number of positive integers relatively prime and less than a given number.
Homepage:
http://patch-tag.com/r/lpsmith/NumberSieves
License:
BSD

Versions

Version EAPI Keywords Slot
0.1.2 8 ~amd64 0/0.1.2

Metadata

Description

Maintainers

Raw Metadata XML 
<pkgmetadata>
	<maintainer type="project">
		<email>haskell@gentoo.org</email>
		<name>Gentoo Haskell</name>
	</maintainer>
	<longdescription>
		This package includes the Sieve of O&#39;Neill and two generalizations of the Sieve of Eratosthenes.   The Sieve of O&#39;Neill is a fully incremental primality sieve based on priority queues.  The other two are array based, and are not incremental.   One sieves the smallest prime factor,  and is useful if you want to factor a large quantity of small numbers.   The other sieves Euler&#39;s Totient,  which is the number of positive integers relatively prime and less than a given number.
	</longdescription>
</pkgmetadata>

Lint Warnings

Files

Manifest

Type File Size Versions
DIST NumberSieves-0.1.2.tar.gz 7909 bytes 0.1.2
Unmatched Entries
Type File Size