The Quipper System

Safe HaskellNone

Algorithms.CL.Test

Description

Test the Class Number algorithm, and its components, using classical computation

Synopsis

Documentation

periodOfIdeals :: (IdDist -> IdDist) -> IdDist -> (CLReal, [IdDist])Source

Classical period finding (just compare the "next" ideal to O and see if it is the same). Takes in the O ideal with appropriate Δ, and returns the circle length (sum δ(I)) and the list of ideals in the first iteration.

showPeriodForBigD :: CLIntP -> StringSource

Show period string for a given Δ.

showPeriodForManyDs :: Int -> IO ()Source

Show the period for the first n valid Δ's.

showPeriodForSomeBigD :: CLIntP -> IO ()Source

Show period string and the list of ideals for a given Δ.

showBigDs :: Int -> IO ()Source

Show a list of valid Δ's.

firstFew :: IO ()Source

Explicitly compute first few ideals for some Δ.

opAllIdeals :: (IdDist -> IdDist -> IdDist) -> String -> CLIntP -> IO ()Source

Perform an operation on all ideal pairs that are generated by Δ.

dotAllIdeals :: CLIntP -> IO ()Source

The the product of all pairs of ideals for a given Δ.

starAllIdeals :: CLIntP -> IO ()Source

Take the star product of all pairs of ideals for a given Δ.

testBoundedWhile :: (Show int, Integral int) => int -> int -> IO ()Source

Test the boundedWhile functionality.

main :: IO ()Source

Run classical tests for Class Number algorithm.

testPrimes :: IO ()Source

Test the primes code.