name: factor
version: 1.1
category: Number Theory
synopsis: Factoring integers and polynomials
license: MIT
license-file: LICENSE
cabal-version: >= 1.10
build-type: Simple
extra-source-files: README.md
author: Joe Leslie-Hurd <joe@gilith.com>
maintainer: Joe Leslie-Hurd <joe@gilith.com>
description:
  This package implements a library of factoring algorithms, including
  the number field sieve for factoring arbitrary integers, the
  elliptic curve method for finding small factors of integers, the
  Miller-Rabin probabilistic primality test for integers, the
  Berlekamp-Zassenhaus algorithm for factoring integer polynomials,
  the Berlekamp algorithm for factoring polynomials over GF(p) (for
  small primes p), and the Cantor–Zassenhaus algorithm for factoring
  polynomials over GF(p) (for arbitrary odd primes p).

Library
  build-depends:
    base >= 4.0 && < 5.0,
    containers >= 0.5.7.1,
    parsec >= 3.1,
    pretty >= 1.1,
    random >= 1.0.1.1,
    time >= 1.6.0.1
  default-language: Haskell2010
  hs-source-dirs: src
  ghc-options: -Wall
  exposed-modules:
    Factor,
    Factor.Bz,
    Factor.Ec,
    Factor.Gaussian,
    Factor.Gfpx,
    Factor.Nfs,
    Factor.Nfzw,
    Factor.Prime,
    Factor.Term,
    Factor.Util,
    Factor.Value,
    Factor.Zx

executable factor
  build-depends:
    base >= 4.0 && < 5.0,
    containers >= 0.5.7.1,
    parsec >= 3.1,
    pretty >= 1.1,
    random >= 1.0.1.1,
    time >= 1.6.0.1,
    factor
  default-language: Haskell2010
  hs-source-dirs: src
  ghc-options: -Wall
  main-is: Main.hs

test-suite factor-test
  type: exitcode-stdio-1.0
  build-depends:
    base >= 4.0 && < 5.0,
    containers >= 0.5.7.1,
    parsec >= 3.1,
    pretty >= 1.1,
    QuickCheck >= 2.4,
    random >= 1.0.1.1,
    time >= 1.6.0.1
  default-language: Haskell2010
  hs-source-dirs: src
  ghc-options: -Wall -fno-warn-orphans
  main-is: Test.hs

source-repository head
  type: git
  location: git://github.com/gilith/factor.git