Safe Haskell	Safe
Language	Haskell2010

Data.Numbers.Primes.Type

Synopsis

Documentation

An abstract type for primes.

It will only ever hold a valid prime, together with its zero-based index.

Instances

Integral int => Enum (Prime int) Source #
Methods succ :: Prime int -> Prime int # pred :: Prime int -> Prime int # toEnum :: Int -> Prime int # fromEnum :: Prime int -> Int # enumFrom :: Prime int -> [Prime int] # enumFromThen :: Prime int -> Prime int -> [Prime int] # enumFromTo :: Prime int -> Prime int -> [Prime int] # enumFromThenTo :: Prime int -> Prime int -> Prime int -> [Prime int] #
Eq (Prime int) Source #
Methods (==) :: Prime int -> Prime int -> Bool # (/=) :: Prime int -> Prime int -> Bool #
Ord (Prime int) Source #
Methods compare :: Prime int -> Prime int -> Ordering # (<) :: Prime int -> Prime int -> Bool # (<=) :: Prime int -> Prime int -> Bool # (>) :: Prime int -> Prime int -> Bool # (>=) :: Prime int -> Prime int -> Bool # max :: Prime int -> Prime int -> Prime int # min :: Prime int -> Prime int -> Prime int #
Show int => Show (Prime int) Source #
Methods showsPrec :: Int -> Prime int -> ShowS # show :: Prime int -> String # showList :: [Prime int] -> ShowS #

Given a Prime, give back its value.

Given a Prime, give back its index.

Given a Prime, give back its value and index as a tuple.

If a given number is prime, give its index.

Give n-th prime.

If a given number is prime, give it back wrapped as such.

A list of indexed primes.