HaskellForMaths 0.4.9 → 0.4.10

raw patch · 2 files changed

+31/−27 lines, 2 filesdep ~arraydep ~basedep ~containers

Dependency ranges changed: array, base, containers, random

Files

• HaskellForMaths.cabal +29/−25
• Math/Algebra/LinearAlgebra.hs +2/−2

@@ -1,16 +1,16 @@+   Cabal-Version:       3.4
    Name:                HaskellForMaths
-   Version:             0.4.9
+   Version:             0.4.10
    Category:            Math
    Description:         A library of maths code in the areas of combinatorics, group theory, commutative algebra, and non-commutative algebra. The library is mainly intended as an educational resource, but does have efficient implementations of several fundamental algorithms.
    Synopsis:            Combinatorics, group theory, commutative algebra, non-commutative algebra
-   License:             BSD3
+   License:             BSD-3-Clause
    License-file:        license.txt
    Author:              David Amos
    Maintainer:          haskellformaths-at-gmail-dot-com
    Homepage:            http://haskellformaths.blogspot.com/
    Stability:           experimental
    Build-Type:          Simple
-   Cabal-Version:       >=1.2
 
    Extra-source-files:
         Math/Test/TDesign.hs,
@@ -21,31 +21,35 @@         Math/Test/TPermutationGroup.hs,
         Math/Test/TRootSystem.hs,
         Math/Test/TSubquotients.hs,
-        Math/Test/TestAll.hs
-        Math/Test/TAlgebras/TVectorSpace.hs
-        Math/Test/TAlgebras/TTensorProduct.hs
-        Math/Test/TAlgebras/TStructures.hs
-        Math/Test/TAlgebras/TQuaternions.hs
-        Math/Test/TAlgebras/TOctonions.hs
-        Math/Test/TAlgebras/TMatrix.hs
-        Math/Test/TAlgebras/TGroupAlgebra.hs
-        Math/Test/TCombinatorics/TCombinatorialHopfAlgebra.hs
-        Math/Test/TCombinatorics/TDigraph.hs
-        Math/Test/TCombinatorics/TFiniteGeometry.hs
-        Math/Test/TCombinatorics/TGraphAuts.hs
-        Math/Test/TCombinatorics/TIncidenceAlgebra.hs
-        Math/Test/TCombinatorics/TMatroid.hs
-        Math/Test/TCombinatorics/TPoset.hs
-        Math/Test/TCommutativeAlgebra/TPolynomial.hs
-        Math/Test/TCommutativeAlgebra/TGroebnerBasis.hs
-        Math/Test/TCore/TField.hs
-        Math/Test/TCore/TUtils.hs
-        Math/Test/TNumberTheory/TPrimeFactor.hs
-        Math/Test/TNumberTheory/TQuadraticField.hs
+        Math/Test/TestAll.hs,
+        Math/Test/TAlgebras/TVectorSpace.hs,
+        Math/Test/TAlgebras/TTensorProduct.hs,
+        Math/Test/TAlgebras/TStructures.hs,
+        Math/Test/TAlgebras/TQuaternions.hs,
+        Math/Test/TAlgebras/TOctonions.hs,
+        Math/Test/TAlgebras/TMatrix.hs,
+        Math/Test/TAlgebras/TGroupAlgebra.hs,
+        Math/Test/TCombinatorics/TCombinatorialHopfAlgebra.hs,
+        Math/Test/TCombinatorics/TDigraph.hs,
+        Math/Test/TCombinatorics/TFiniteGeometry.hs,
+        Math/Test/TCombinatorics/TGraphAuts.hs,
+        Math/Test/TCombinatorics/TIncidenceAlgebra.hs,
+        Math/Test/TCombinatorics/TMatroid.hs,
+        Math/Test/TCombinatorics/TPoset.hs,
+        Math/Test/TCommutativeAlgebra/TPolynomial.hs,
+        Math/Test/TCommutativeAlgebra/TGroebnerBasis.hs,
+        Math/Test/TCore/TField.hs,
+        Math/Test/TCore/TUtils.hs,
+        Math/Test/TNumberTheory/TPrimeFactor.hs,
+        Math/Test/TNumberTheory/TQuadraticField.hs,
         Math/Test/TProjects/TMiniquaternionGeometry.hs
 
    Library
-     Build-Depends:     base >= 2 && < 5, containers, array, random
+     Build-Depends:
+         array >= 0.5.4 && < 0.6,
+         base >= 4.17.2 && < 4.18,
+         containers >= 0.6.7 && < 0.7,
+         random >= 1.2.1 && < 1.3,
      Exposed-modules:
         Math.Algebra.LinearAlgebra,
         Math.Algebra.Field.Base, Math.Algebra.Field.Extension,

@@ -219,7 +219,7 @@         is = findLeadingCols 1 (L.transpose m) -- these are the indices of the columns which have a leading 1
         js = [1..nc] L.\\ is
         freeCols = let m' = take (length is) m -- discard zero rows
-                   in zip is $ L.transpose [map (negate . (!j)) m' | j <- js]
+                   in zip is $ L.transpose [map (negate . (! j)) m' | j <- js]
         boundCols = zip js (idMx $ length js)
     in L.transpose $ map snd $ L.sort $ freeCols ++ boundCols
     where
@@ -254,4 +254,4 @@ data S a
 instance IntegerAsType a => IntegerAsType (S a) where
     value _ = value (undefined :: a) + 1
--}+-}