[Bodigrim#118] Add Eisenstein integer benchmark module

Math/NumberTheory/UniqueFactorisation.hs

@@ -24,6 +24,7 @@ import Data.Coerce
 import qualified Math.NumberTheory.Primes.Factorisation as F (factorise)
 import Math.NumberTheory.Primes.Testing.Probabilistic as T (isPrime)
 import Math.NumberTheory.Primes.Types (Prime, Prm(..), PrimeNat(..))
+import qualified Math.NumberTheory.EisensteinIntegers as E
 import qualified Math.NumberTheory.GaussianIntegers as G
 import Math.NumberTheory.Utils.FromIntegral
 
@@ -76,3 +77,14 @@ instance UniqueFactorisation G.GaussianInteger where
 
   factorise 0 = []
   factorise g = map (coerce *** intToWord) $ G.factorise g
+
+newtype EisensteinPrime = EisensteinPrime { _unEisensteinPrime :: E.EisensteinInteger }
+  deriving (Eq, Show)
+
+type instance Prime E.EisensteinInteger = EisensteinPrime
+
+instance UniqueFactorisation E.EisensteinInteger where
+  unPrime = coerce
+
+  factorise 0 = []
+  factorise e = map (coerce *** intToWord) $ E.factorise e

arithmoi.cabal

@@ -191,6 +191,7 @@ benchmark criterion
       semigroups >=0.8
   other-modules:
     Math.NumberTheory.ArithmeticFunctionsBench
+    Math.NumberTheory.EisensteinIntegersBench
     Math.NumberTheory.GaussianIntegersBench
     Math.NumberTheory.GCDBench
     Math.NumberTheory.JacobiBench

benchmark/Bench.hs

@@ -3,6 +3,7 @@ module Main where
 import Gauge.Main
 
 import Math.NumberTheory.ArithmeticFunctionsBench as ArithmeticFunctions
+import Math.NumberTheory.EisensteinIntegersBench as Eisenstein
 import Math.NumberTheory.GaussianIntegersBench as Gaussian
 import Math.NumberTheory.GCDBench as GCD
 import Math.NumberTheory.JacobiBench as Jacobi
@@ -15,6 +16,7 @@ import Math.NumberTheory.SmoothNumbersBench as SmoothNumbers
 
 main = defaultMain
   [ ArithmeticFunctions.benchSuite
+  , Eisenstein.benchSuite
   , Gaussian.benchSuite
   , GCD.benchSuite
   , Jacobi.benchSuite

benchmark/Math/NumberTheory/EisensteinIntegersBench.hs

@@ -0,0 +1,26 @@
+{-# OPTIONS_GHC -fno-warn-type-defaults #-}
+{-# OPTIONS_GHC -fno-warn-orphans       #-}
+
+module Math.NumberTheory.EisensteinIntegersBench
+  ( benchSuite
+  ) where
+
+import Control.DeepSeq
+import Gauge.Main
+
+import Math.NumberTheory.ArithmeticFunctions (tau)
+import Math.NumberTheory.EisensteinIntegers
+
+instance NFData EisensteinInteger
+
+benchFindPrime :: Integer -> Benchmark
+benchFindPrime n = bench (show n) $ nf findPrime n
+
+benchTau :: Integer -> Benchmark
+benchTau n = bench (show n) $ nf (\m -> sum [tau (x :+ y) | x <- [1..m], y <- [0..m]] :: Word) n
+
+benchSuite :: Benchmark
+benchSuite = bgroup "Eisenstein"
+  [ bgroup "findPrime" $ map benchFindPrime [1000003, 10000141, 100000039, 1000000021, 10000000033, 100000000003, 1000000000039, 10000000000051]
+  , bgroup "tau" $ map benchTau [10, 20, 40, 80]
+  ]

benchmark/Math/NumberTheory/GaussianIntegersBench.hs

@@ -21,6 +21,6 @@ benchTau n = bench (show n) $ nf (\m -> sum [tau (x :+ y) | x <- [1..m], y <- [0
 
 benchSuite :: Benchmark
 benchSuite = bgroup "Gaussian"
-  [ bgroup "findPrime" $ map benchFindPrime [1000033, 10000121, 100000037, 1000000009, 10000000033, 100000000057, 1000000000061, 10000000000037]
+  [ bgroup "findPrime" $ map benchFindPrime [1000033, 10000121, 100000037, 1000000021, 10000000033, 100000000057, 1000000000061, 10000000000037]
   , bgroup "tau" $ map benchTau [10, 20, 40, 80]
   ]