src/Symengine/NumberTheory.hs
Use fewer imports Open
Open
import Control.Monad -- for foldM
- Read upRead up
- Exclude checks
Found
import Control.Monad
import Control.Monad
Perhaps
import Control.Monad
Unused LANGUAGE pragma Open
Open
{-# LANGUAGE FunctionalDependencies #-}
- Read upRead up
- Exclude checks
Found
{-# LANGUAGE FunctionalDependencies #-}
Perhaps
Applying this change:
- may require
{-# LANGUAGE MultiParamTypeClasses #-}
adding to the top of the file
Unused LANGUAGE pragma Open
Open
{-# LANGUAGE RecordWildCards #-}
- Read upRead up
- Exclude checks
Found
{-# LANGUAGE RecordWildCards #-}
Perhaps
Applying this change:
- may require
{-# LANGUAGE DisambiguateRecordFields #-}
adding to the top of the file
Use camelCase Open
Open
gcd_extended a b = unsafePerformIO $ do
g <- basicsym_new
s <- basicsym_new
t <- basicsym_new
- Read upRead up
- Exclude checks
Found
gcd_extended a b = ...
Perhaps
gcdExtended a b = ...
Use camelCase Open
Open
gcd_extended :: BasicSym -> BasicSym -> (BasicSym, BasicSym, BasicSym)
- Read upRead up
- Exclude checks
Found
gcd_extended ::
BasicSym -> BasicSym -> (BasicSym, BasicSym, BasicSym)
Perhaps
gcdExtended ::
BasicSym -> BasicSym -> (BasicSym, BasicSym, BasicSym)
Use camelCase Open
Open
mod_f :: BasicSym -> BasicSym -> Quotient
- Read upRead up
- Exclude checks
Found
mod_f :: BasicSym -> BasicSym -> Quotient
Perhaps
modF :: BasicSym -> BasicSym -> Quotient
Use camelCase Open
Open
mod_f = lift_basicsym_binaryop ntheory_mod_f_ffi
- Read upRead up
- Exclude checks
Found
mod_f = ...
Perhaps
modF = ...
Use camelCase Open
Open
quotient_and_mod a b = unsafePerformIO $ do
quotient <- basicsym_new
modulo <- basicsym_new
with4 quotient modulo a b ntheory_quotient_mod_ffi
return $ (quotient, modulo)
- Read upRead up
- Exclude checks
Found
quotient_and_mod a b = ...
Perhaps
quotientAndMod a b = ...
Use camelCase Open
Open
mod_inverse = lift_basicsym_binaryop ntheory_mod_inverse_ffi
- Read upRead up
- Exclude checks
Found
mod_inverse = ...
Perhaps
modInverse = ...
Use camelCase Open
Open
quotient_f = lift_basicsym_binaryop ntheory_quotient_f_ffi
- Read upRead up
- Exclude checks
Found
quotient_f = ...
Perhaps
quotientF = ...
Use camelCase Open
Open
quotient_and_mod_f a b = unsafePerformIO $ do
quotient <- basicsym_new
modulo <- basicsym_new
with4 quotient modulo a b ntheory_quotient_mod_f_ffi
return $ (quotient, modulo)
- Read upRead up
- Exclude checks
Found
quotient_and_mod_f a b = ...
Perhaps
quotientAndModF a b = ...
Use camelCase Open
Open
next_prime :: BasicSym -> BasicSym
- Read upRead up
- Exclude checks
Found
next_prime :: BasicSym -> BasicSym
Perhaps
nextPrime :: BasicSym -> BasicSym
Redundant $ Open
Open
return $ (quotient, modulo)
- Read upRead up
- Exclude checks
Found
return $ (quotient, modulo)
Perhaps
return (quotient, modulo)
Use camelCase Open
Open
next_prime = lift_basicsym_unaryop ntheory_nextprime_ffi
- Read upRead up
- Exclude checks
Found
next_prime = ...
Perhaps
nextPrime = ...
Use camelCase Open
Open
quotient_f :: BasicSym -> BasicSym -> BasicSym
- Read upRead up
- Exclude checks
Found
quotient_f :: BasicSym -> BasicSym -> BasicSym
Perhaps
quotientF :: BasicSym -> BasicSym -> BasicSym
Use camelCase Open
Open
quotient_and_mod_f :: BasicSym -> BasicSym -> (Quotient, Modulo)
- Read upRead up
- Exclude checks
Found
quotient_and_mod_f :: BasicSym -> BasicSym -> (Quotient, Modulo)
Perhaps
quotientAndModF :: BasicSym -> BasicSym -> (Quotient, Modulo)
Redundant $ Open
Open
return $ (quotient, modulo)
- Read upRead up
- Exclude checks
Found
return $ (quotient, modulo)
Perhaps
return (quotient, modulo)
Use camelCase Open
Open
mod_inverse :: BasicSym -> BasicSym -> Quotient
- Read upRead up
- Exclude checks
Found
mod_inverse :: BasicSym -> BasicSym -> Quotient
Perhaps
modInverse :: BasicSym -> BasicSym -> Quotient
Avoid lambda Open
Open
with b (\b ->
ntheory_gcd_ext_ffi g s t a b))
- Read upRead up
- Exclude checks
Found
\ b -> ntheory_gcd_ext_ffi g s t a b
Perhaps
ntheory_gcd_ext_ffi g s t a
Use camelCase Open
Open
quotient_and_mod :: BasicSym -> BasicSym -> (Quotient, Modulo)
- Read upRead up
- Exclude checks
Found
quotient_and_mod :: BasicSym -> BasicSym -> (Quotient, Modulo)
Perhaps
quotientAndMod :: BasicSym -> BasicSym -> (Quotient, Modulo)