name: integer-roots version: 1.0 x-revision: 2 cabal-version: >=1.10 build-type: Simple license: MIT license-file: LICENSE copyright: (c) 2011 Daniel Fischer, 2016-2020 Andrew Lelechenko. maintainer: Andrew Lelechenko andrew dot lelechenko at gmail dot com homepage: https://github.com/Bodigrim/integer-roots bug-reports: https://github.com/Bodigrim/integer-roots/issues synopsis: Integer roots and perfect powers description: Calculating integer roots and testing perfect powers of arbitrary precision. Originally part of package. category: Math, Algorithms, Number Theory author: Daniel Fischer, Andrew Lelechenko tested-with: GHC ==8.0.2 GHC ==8.2.2 GHC ==8.4.4 GHC ==8.6.5 GHC ==8.8.2 extra-source-files: changelog.md README.md source-repository head type: git location: https://github.com/Bodigrim/integer-roots library build-depends: base >=4.9 && <4.16, integer-gmp <1.2 exposed-modules: Math.NumberTheory.Roots other-modules: Math.NumberTheory.Primes.Small Math.NumberTheory.Roots.Cubes Math.NumberTheory.Roots.Fourth Math.NumberTheory.Roots.General Math.NumberTheory.Roots.Squares Math.NumberTheory.Roots.Squares.Internal Math.NumberTheory.Utils.BitMask Math.NumberTheory.Utils.FromIntegral default-language: Haskell2010 ghc-options: -Wall -Widentities test-suite integer-roots-tests build-depends: base >=4.9 && <5, integer-roots, smallcheck >=1.1.3 && <1.2, tasty >=0.10, tasty-hunit >=0.9 && <0.11, tasty-quickcheck >=0.9 && <0.11, tasty-smallcheck >=0.8 && <0.9 other-modules: Math.NumberTheory.Roots.CubesTests Math.NumberTheory.Roots.FourthTests Math.NumberTheory.Roots.GeneralTests Math.NumberTheory.Roots.SquaresTests Math.NumberTheory.TestUtils Math.NumberTheory.TestUtils.Wrappers type: exitcode-stdio-1.0 main-is: Test.hs default-language: Haskell2010 hs-source-dirs: test-suite ghc-options: -Wall -Widentities test-suite integer-roots-doctests type: exitcode-stdio-1.0 main-is: Doctest.hs hs-source-dirs: test-suite build-depends: base, doctest >= 0.8 default-language: Haskell2010 buildable: False