Build #1 for species-0.4.1
| Package | species-0.4.1 |
|---|
| Install | InstallOk |
|---|---|
| Docs | Ok |
| Tests | NotTried |
| Time submitted | 2025-09-30 23:27:59.142799598 UTC |
|---|---|
| Compiler | ghc-9.8.4 |
| OS | linux |
| Arch | x86_64 |
| Dependencies | base-4.19.2.0, containers-0.6.8, multiset-comb-0.2.4.2, np-extras-0.3.1.3, numeric-prelude-0.4.4 |
| Flags | none |
Code Coverage
No Code Coverage was submitted for this report.
Build log
[view raw]
Resolving dependencies...
Downloading multiset-comb-0.2.4.2
Downloaded multiset-comb-0.2.4.2
Configuring multiset-comb-0.2.4.2...
Preprocessing library for multiset-comb-0.2.4.2..
Building library for multiset-comb-0.2.4.2..
[1 of 1] Compiling Math.Combinatorics.Multiset ( Math/Combinatorics/Multiset.hs, dist/build/Math/Combinatorics/Multiset.o, dist/build/Math/Combinatorics/Multiset.dyn_o )
Math/Combinatorics/Multiset.hs:126:30: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
126 | fromList = fromCounts . map (head &&& length) . group . sort
| ^^^^
Math/Combinatorics/Multiset.hs:514:36: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
514 | | (n1 < n2 && (null rle1 || fst (head rle1) < a2)) || (n1 > n2 && not (null rle2) && a1 < fst (head rle2)) = LT
| ^^^^
Math/Combinatorics/Multiset.hs:514:98: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
514 | | (n1 < n2 && (null rle1 || fst (head rle1) < a2)) || (n1 > n2 && not (null rle2) && a1 < fst (head rle2)) = LT
| ^^^^
Preprocessing library for multiset-comb-0.2.4.2..
Running Haddock on library for multiset-comb-0.2.4.2..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 1] Compiling Math.Combinatorics.Multiset ( Math/Combinatorics/Multiset.hs, nothing )
Math/Combinatorics/Multiset.hs:126:30: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
126 | fromList = fromCounts . map (head &&& length) . group . sort
| ^^^^
Math/Combinatorics/Multiset.hs:514:36: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
514 | | (n1 < n2 && (null rle1 || fst (head rle1) < a2)) || (n1 > n2 && not (null rle2) && a1 < fst (head rle2)) = LT
| ^^^^
Math/Combinatorics/Multiset.hs:514:98: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
514 | | (n1 < n2 && (null rle1 || fst (head rle1) < a2)) || (n1 > n2 && not (null rle2) && a1 < fst (head rle2)) = LT
| ^^^^
Haddock coverage:
Warning: 'a' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'b' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'v2' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'v1' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'v' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'm' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 's' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'e' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
97% ( 34 / 35) in 'Math.Combinatorics.Multiset'
Missing documentation for:
Count (Math/Combinatorics/Multiset.hs:68)
Warning: Math.Combinatorics.Multiset: could not find link destinations for:
- Math.Combinatorics.Multiset.Bracelet
Documentation created: dist/doc/html/multiset-comb/,
dist/doc/html/multiset-comb/multiset-comb.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/multiset-comb-0.2.4.2-4iBAWHmbzjN1n7UmexRFPW
Completed multiset-comb-0.2.4.2
Configuring primes-0.2.1.0...
Preprocessing library for primes-0.2.1.0..
Building library for primes-0.2.1.0..
[1 of 1] Compiling Data.Numbers.Primes ( Data/Numbers/Primes.hs, dist/build/Data/Numbers/Primes.o, dist/build/Data/Numbers/Primes.dyn_o )
Data/Numbers/Primes.hs:48:34: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
48 | wheelSieve k = reverse ps ++ map head (sieve p (cycle ns))
| ^^^^
Data/Numbers/Primes.hs:49:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type ([int], [int]) not matched: ([], _)
|
49 | where (p:ps,ns) = wheel k
| ^^^^^^^^^^^^^^^^^^^
Data/Numbers/Primes.hs:132:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type ([int], Queue int) not matched: ([], _)
|
132 | where (z:zs,queue') = dequeue queue
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Data/Numbers/Primes.hs:196:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [int] not matched: []
|
196 | where (y:ys) = cycle xs
| ^^^^^^^^^^^^^^^^^
Preprocessing library for primes-0.2.1.0..
Running Haddock on library for primes-0.2.1.0..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 1] Compiling Data.Numbers.Primes ( Data/Numbers/Primes.hs, nothing )
Data/Numbers/Primes.hs:48:34: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
48 | wheelSieve k = reverse ps ++ map head (sieve p (cycle ns))
| ^^^^
Haddock coverage:
100% ( 5 / 5) in 'Data.Numbers.Primes'
Documentation created: dist/doc/html/primes/, dist/doc/html/primes/primes.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/primes-0.2.1.0-86rh66qYZew1GSTJqTZc6P
Completed primes-0.2.1.0
Configuring semigroups-0.20...
Preprocessing library for semigroups-0.20..
Building library for semigroups-0.20..
[1 of 1] Compiling Data.Semigroup.Generic ( src/Data/Semigroup/Generic.hs, dist/build/Data/Semigroup/Generic.o, dist/build/Data/Semigroup/Generic.dyn_o )
Preprocessing library for semigroups-0.20..
Running Haddock on library for semigroups-0.20..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 1] Compiling Data.Semigroup.Generic ( src/Data/Semigroup/Generic.hs, nothing )
Haddock coverage:
Warning: 'GenericSemigroupMonoid' is ambiguous. It is defined
* at src/Data/Semigroup/Generic.hs:111:3
* at src/Data/Semigroup/Generic.hs:110:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Data/Semigroup/Generic.hs:110:1
77% ( 7 / 9) in 'Data.Semigroup.Generic'
Missing documentation for:
GSemigroup (src/Data/Semigroup/Generic.hs:54)
GMonoid (src/Data/Semigroup/Generic.hs:84)
Warning: Data.Semigroup.Generic: could not find link destinations for:
- Data.Semigroup.Generic.gmempty'
- Data.Semigroup.Generic.gmappend'
Documentation created: dist/doc/html/semigroups/,
dist/doc/html/semigroups/semigroups.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/semigroups-0.20-FhfuFxVvP7ZBtA37SUthhH
Completed semigroups-0.20
Configuring splitmix-0.1.3.1...
Preprocessing library for splitmix-0.1.3.1..
Building library for splitmix-0.1.3.1..
[1 of 4] Compiling Data.Bits.Compat ( src-compat/Data/Bits/Compat.hs, dist/build/Data/Bits/Compat.o, dist/build/Data/Bits/Compat.dyn_o )
[2 of 4] Compiling System.Random.SplitMix.Init ( src/System/Random/SplitMix/Init.hs, dist/build/System/Random/SplitMix/Init.o, dist/build/System/Random/SplitMix/Init.dyn_o )
[3 of 4] Compiling System.Random.SplitMix ( src/System/Random/SplitMix.hs, dist/build/System/Random/SplitMix.o, dist/build/System/Random/SplitMix.dyn_o )
[4 of 4] Compiling System.Random.SplitMix32 ( src/System/Random/SplitMix32.hs, dist/build/System/Random/SplitMix32.o, dist/build/System/Random/SplitMix32.dyn_o )
Preprocessing library for splitmix-0.1.3.1..
Running Haddock on library for splitmix-0.1.3.1..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 4] Compiling Data.Bits.Compat ( src-compat/Data/Bits/Compat.hs, nothing )
[2 of 4] Compiling System.Random.SplitMix.Init ( src/System/Random/SplitMix/Init.hs, nothing )
[3 of 4] Compiling System.Random.SplitMix ( src/System/Random/SplitMix.hs, nothing )
[4 of 4] Compiling System.Random.SplitMix32 ( src/System/Random/SplitMix32.hs, nothing )
Haddock coverage:
Warning: 'SMGen' is ambiguous. It is defined
* at src/System/Random/SplitMix.hs:77:14
* at src/System/Random/SplitMix.hs:77:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/SplitMix.hs:77:1
100% ( 22 / 22) in 'System.Random.SplitMix'
Warning: 'SMGen' is ambiguous. It is defined
* at src/System/Random/SplitMix32.hs:61:14
* at src/System/Random/SplitMix32.hs:61:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/SplitMix32.hs:61:1
100% ( 22 / 22) in 'System.Random.SplitMix32'
Documentation created: dist/doc/html/splitmix/,
dist/doc/html/splitmix/splitmix.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/splitmix-0.1.3.1-FLXrwOMCBr82OHyMQoNXPe
Completed splitmix-0.1.3.1
Configuring utility-ht-0.0.17.2...
Preprocessing library for utility-ht-0.0.17.2..
Building library for utility-ht-0.0.17.2..
[ 1 of 33] Compiling Control.Monad.HT ( src/Control/Monad/HT.hs, dist/build/Control/Monad/HT.o, dist/build/Control/Monad/HT.dyn_o )
[ 2 of 33] Compiling Data.Bits.HT ( src/Data/Bits/HT.hs, dist/build/Data/Bits/HT.o, dist/build/Data/Bits/HT.dyn_o )
[ 3 of 33] Compiling Data.Bool.HT.Private ( src/Data/Bool/HT/Private.hs, dist/build/Data/Bool/HT/Private.o, dist/build/Data/Bool/HT/Private.dyn_o )
[ 4 of 33] Compiling Data.Bool.HT ( src/Data/Bool/HT.hs, dist/build/Data/Bool/HT.o, dist/build/Data/Bool/HT.dyn_o )
[ 5 of 33] Compiling Data.Either.HT ( src/Data/Either/HT.hs, dist/build/Data/Either/HT.o, dist/build/Data/Either/HT.dyn_o )
[ 6 of 33] Compiling Data.Ix.Enum ( src/Data/Ix/Enum.hs, dist/build/Data/Ix/Enum.o, dist/build/Data/Ix/Enum.dyn_o )
[ 7 of 33] Compiling Data.Maybe.HT ( src/Data/Maybe/HT.hs, dist/build/Data/Maybe/HT.o, dist/build/Data/Maybe/HT.dyn_o )
[ 8 of 33] Compiling Data.Monoid.HT ( src/Data/Monoid/HT.hs, dist/build/Data/Monoid/HT.o, dist/build/Data/Monoid/HT.dyn_o )
[ 9 of 33] Compiling Data.Strictness.HT ( src/Data/Strictness/HT.hs, dist/build/Data/Strictness/HT.o, dist/build/Data/Strictness/HT.dyn_o )
[10 of 33] Compiling Data.Tuple.Lazy ( src/Data/Tuple/Lazy.hs, dist/build/Data/Tuple/Lazy.o, dist/build/Data/Tuple/Lazy.dyn_o )
[11 of 33] Compiling Data.Tuple.HT ( src/Data/Tuple/HT.hs, dist/build/Data/Tuple/HT.o, dist/build/Data/Tuple/HT.dyn_o )
[12 of 33] Compiling Data.List.Reverse.StrictSpine ( src/Data/List/Reverse/StrictSpine.hs, dist/build/Data/List/Reverse/StrictSpine.o, dist/build/Data/List/Reverse/StrictSpine.dyn_o )
[13 of 33] Compiling Data.String.HT ( src/Data/String/HT.hs, dist/build/Data/String/HT.o, dist/build/Data/String/HT.dyn_o )
[14 of 33] Compiling Data.List.Reverse.StrictElement ( src/Data/List/Reverse/StrictElement.hs, dist/build/Data/List/Reverse/StrictElement.o, dist/build/Data/List/Reverse/StrictElement.dyn_o )
[15 of 33] Compiling Data.Function.HT.Private ( src/Data/Function/HT/Private.hs, dist/build/Data/Function/HT/Private.o, dist/build/Data/Function/HT/Private.dyn_o )
[16 of 33] Compiling Data.Function.HT ( src/Data/Function/HT.hs, dist/build/Data/Function/HT.o, dist/build/Data/Function/HT.dyn_o )
[17 of 33] Compiling Data.Ord.HT ( src/Data/Ord/HT.hs, dist/build/Data/Ord/HT.o, dist/build/Data/Ord/HT.dyn_o )
[18 of 33] Compiling Data.List.Key.Private ( src/Data/List/Key/Private.hs, dist/build/Data/List/Key/Private.o, dist/build/Data/List/Key/Private.dyn_o )
[19 of 33] Compiling Data.List.Key ( src/Data/List/Key.hs, dist/build/Data/List/Key.o, dist/build/Data/List/Key.dyn_o )
[20 of 33] Compiling Data.Eq.HT ( src/Data/Eq/HT.hs, dist/build/Data/Eq/HT.o, dist/build/Data/Eq/HT.dyn_o )
[21 of 33] Compiling Control.Functor.HT ( src/Control/Functor/HT.hs, dist/build/Control/Functor/HT.o, dist/build/Control/Functor/HT.dyn_o )
[22 of 33] Compiling Data.List.Match.Private ( src/Data/List/Match/Private.hs, dist/build/Data/List/Match/Private.o, dist/build/Data/List/Match/Private.dyn_o )
src/Data/List/Match/Private.hs:78:10: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
78 | snd $ head $
| ^^^^
[23 of 33] Compiling Data.List.Match ( src/Data/List/Match.hs, dist/build/Data/List/Match.o, dist/build/Data/List/Match.dyn_o )
[24 of 33] Compiling Data.List.HT.Private ( src/Data/List/HT/Private.hs, dist/build/Data/List/HT/Private.o, dist/build/Data/List/HT/Private.dyn_o )
src/Data/List/HT/Private.hs:9:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
9 | import Control.Applicative ((<$>), (<*>), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/List/HT/Private.hs:90:42: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
90 | tails' = fst . breakAfter null . iterate tail
| ^^^^
src/Data/List/HT/Private.hs:259:35: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
259 | takeUntil (p . fst) $ zip xs $ tail $ tails xs
| ^^^^
src/Data/List/HT/Private.hs:300:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [[a]] not matched: []
|
300 | foldr (\ x ~yt@(y:ys) -> if p x then [x]:yt else (x:y):ys) [[]]
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/List/HT/Private.hs:345:7: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [[a]] not matched: []
|
345 | case xst of
| ^^^^^^^^^^^...
src/Data/List/HT/Private.hs:347:13: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
347 | tail xs : xss) .
| ^^^^
src/Data/List/HT/Private.hs:674:45: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
674 | unfoldr (\xs -> toMaybe (not (null xs)) (head xs, drop k xs))
| ^^^^
src/Data/List/HT/Private.hs:677:16: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
677 | sieve' k = map head . sliceVertical k
| ^^^^
src/Data/List/HT/Private.hs:683:18: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
683 | sieve''' k = map head . takeWhile (not . null) . iterate (drop k)
| ^^^^
src/Data/List/HT/Private.hs:713:21: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [[a]] not matched: []
|
713 | reverse . foldr (\x ~(y:ys) -> ys ++ [x:y]) (replicate n [])
| ^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/List/HT/Private.hs:860:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type ([[a]], [[a]]) not matched: ([], _)
|
860 | let (y:ys,zs) = unzip (map (splitAt 1) xs)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/List/HT/Private.hs:943:19: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
943 | concatMap fst (tail
| ^^^^
src/Data/List/HT/Private.hs:1051:13: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1051 | zip (tail as) (concatMap (\ai->[ai,ai]) as)
| ^^^^
src/Data/List/HT/Private.hs:1067:23: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1067 | zip as (pairs (tail as))
| ^^^^
src/Data/List/HT/Private.hs:1157:34: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1157 | mapAdjacent f xs = zipWith f xs (tail xs)
| ^^^^
src/Data/List/HT/Private.hs:1165:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1165 | mapAdjacentPointfree f = zipWith f <*> tail
| ^^^^
[25 of 33] Compiling Data.List.HT ( src/Data/List/HT.hs, dist/build/Data/List/HT.o, dist/build/Data/List/HT.dyn_o )
[26 of 33] Compiling Data.Record.HT.Private ( src/Data/Record/HT/Private.hs, dist/build/Data/Record/HT/Private.o, dist/build/Data/Record/HT/Private.dyn_o )
src/Data/Record/HT/Private.hs:3:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
3 | import Data.Monoid (mconcat, )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/Record/HT/Private.hs:26:4: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
26 | head $ dropWhile (EQ==) (map (\c -> c x y) cs) ++ [EQ]
| ^^^^
[27 of 33] Compiling Data.Record.HT ( src/Data/Record/HT.hs, dist/build/Data/Record/HT.o, dist/build/Data/Record/HT.dyn_o )
[28 of 33] Compiling Data.List.Reverse.Private ( src/Data/List/Reverse/Private.hs, dist/build/Data/List/Reverse/Private.o, dist/build/Data/List/Reverse/Private.dyn_o )
[29 of 33] Compiling Control.Applicative.HT ( src/Control/Applicative/HT.hs, dist/build/Control/Applicative/HT.o, dist/build/Control/Applicative/HT.dyn_o )
src/Control/Applicative/HT.hs:5:1: warning: [GHC-38856] [-Wunused-imports]
The import of <$>, <*>, Applicative, liftA2
from module Control.Applicative is redundant
|
5 | import Control.Applicative (Applicative, liftA2, liftA3, (<$>), (<*>), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[30 of 33] Compiling Data.Tuple.Strict ( src/Data/Tuple/Strict.hs, dist/build/Data/Tuple/Strict.o, dist/build/Data/Tuple/Strict.dyn_o )
[31 of 33] Compiling Data.Tuple.Example ( src/Data/Tuple/Example.hs, dist/build/Data/Tuple/Example.o, dist/build/Data/Tuple/Example.dyn_o )
[32 of 33] Compiling Text.Read.HT ( src/Text/Read/HT.hs, dist/build/Text/Read/HT.o, dist/build/Text/Read/HT.dyn_o )
[33 of 33] Compiling Text.Show.HT ( src/Text/Show/HT.hs, dist/build/Text/Show/HT.o, dist/build/Text/Show/HT.dyn_o )
Preprocessing library for utility-ht-0.0.17.2..
Running Haddock on library for utility-ht-0.0.17.2..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 33] Compiling Control.Monad.HT ( src/Control/Monad/HT.hs, nothing )
[ 2 of 33] Compiling Data.Bits.HT ( src/Data/Bits/HT.hs, nothing )
[ 3 of 33] Compiling Data.Bool.HT.Private ( src/Data/Bool/HT/Private.hs, nothing )
[ 4 of 33] Compiling Data.Bool.HT ( src/Data/Bool/HT.hs, nothing )
[ 5 of 33] Compiling Data.Either.HT ( src/Data/Either/HT.hs, nothing )
[ 6 of 33] Compiling Data.Ix.Enum ( src/Data/Ix/Enum.hs, nothing )
[ 7 of 33] Compiling Data.Maybe.HT ( src/Data/Maybe/HT.hs, nothing )
[ 8 of 33] Compiling Data.Monoid.HT ( src/Data/Monoid/HT.hs, nothing )
[ 9 of 33] Compiling Data.Strictness.HT ( src/Data/Strictness/HT.hs, nothing )
[10 of 33] Compiling Data.Tuple.Lazy ( src/Data/Tuple/Lazy.hs, nothing )
[11 of 33] Compiling Data.Tuple.HT ( src/Data/Tuple/HT.hs, nothing )
[12 of 33] Compiling Data.List.Reverse.StrictSpine ( src/Data/List/Reverse/StrictSpine.hs, nothing )
[13 of 33] Compiling Data.String.HT ( src/Data/String/HT.hs, nothing )
[14 of 33] Compiling Data.List.Reverse.StrictElement ( src/Data/List/Reverse/StrictElement.hs, nothing )
[15 of 33] Compiling Data.Function.HT.Private ( src/Data/Function/HT/Private.hs, nothing )
[16 of 33] Compiling Data.Function.HT ( src/Data/Function/HT.hs, nothing )
[17 of 33] Compiling Data.Ord.HT ( src/Data/Ord/HT.hs, nothing )
[18 of 33] Compiling Data.List.Key.Private ( src/Data/List/Key/Private.hs, nothing )
[19 of 33] Compiling Data.List.Key ( src/Data/List/Key.hs, nothing )
[20 of 33] Compiling Data.Eq.HT ( src/Data/Eq/HT.hs, nothing )
[21 of 33] Compiling Control.Functor.HT ( src/Control/Functor/HT.hs, nothing )
[22 of 33] Compiling Data.List.Match.Private ( src/Data/List/Match/Private.hs, nothing )
src/Data/List/Match/Private.hs:78:10: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
78 | snd $ head $
| ^^^^
[23 of 33] Compiling Data.List.Match ( src/Data/List/Match.hs, nothing )
[24 of 33] Compiling Data.List.HT.Private ( src/Data/List/HT/Private.hs, nothing )
src/Data/List/HT/Private.hs:9:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
9 | import Control.Applicative ((<$>), (<*>), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/List/HT/Private.hs:90:42: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
90 | tails' = fst . breakAfter null . iterate tail
| ^^^^
src/Data/List/HT/Private.hs:259:35: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
259 | takeUntil (p . fst) $ zip xs $ tail $ tails xs
| ^^^^
src/Data/List/HT/Private.hs:347:13: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
347 | tail xs : xss) .
| ^^^^
src/Data/List/HT/Private.hs:674:45: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
674 | unfoldr (\xs -> toMaybe (not (null xs)) (head xs, drop k xs))
| ^^^^
src/Data/List/HT/Private.hs:677:16: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
677 | sieve' k = map head . sliceVertical k
| ^^^^
src/Data/List/HT/Private.hs:683:18: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
683 | sieve''' k = map head . takeWhile (not . null) . iterate (drop k)
| ^^^^
src/Data/List/HT/Private.hs:943:19: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
943 | concatMap fst (tail
| ^^^^
src/Data/List/HT/Private.hs:1051:13: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1051 | zip (tail as) (concatMap (\ai->[ai,ai]) as)
| ^^^^
src/Data/List/HT/Private.hs:1067:23: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1067 | zip as (pairs (tail as))
| ^^^^
src/Data/List/HT/Private.hs:1157:34: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1157 | mapAdjacent f xs = zipWith f xs (tail xs)
| ^^^^
src/Data/List/HT/Private.hs:1165:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
1165 | mapAdjacentPointfree f = zipWith f <*> tail
| ^^^^
[25 of 33] Compiling Data.List.HT ( src/Data/List/HT.hs, nothing )
[26 of 33] Compiling Data.Record.HT.Private ( src/Data/Record/HT/Private.hs, nothing )
src/Data/Record/HT/Private.hs:3:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
3 | import Data.Monoid (mconcat, )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Data/Record/HT/Private.hs:26:4: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from Prelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
26 | head $ dropWhile (EQ==) (map (\c -> c x y) cs) ++ [EQ]
| ^^^^
[27 of 33] Compiling Data.Record.HT ( src/Data/Record/HT.hs, nothing )
[28 of 33] Compiling Data.List.Reverse.Private ( src/Data/List/Reverse/Private.hs, nothing )
[29 of 33] Compiling Control.Applicative.HT ( src/Control/Applicative/HT.hs, nothing )
src/Control/Applicative/HT.hs:5:1: warning: [GHC-38856] [-Wunused-imports]
The import of <$>, <*>, Applicative, liftA2
from module Control.Applicative is redundant
|
5 | import Control.Applicative (Applicative, liftA2, liftA3, (<$>), (<*>), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[30 of 33] Compiling Data.Tuple.Strict ( src/Data/Tuple/Strict.hs, nothing )
[31 of 33] Compiling Data.Tuple.Example ( src/Data/Tuple/Example.hs, nothing )
[32 of 33] Compiling Text.Read.HT ( src/Text/Read/HT.hs, nothing )
[33 of 33] Compiling Text.Show.HT ( src/Text/Show/HT.hs, nothing )
Haddock coverage:
Warning: 'base' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
33% ( 9 / 27) in 'Control.Monad.HT'
Missing documentation for:
Module header
nest (src/Control/Monad/HT.hs:25)
void (src/Control/Monad/HT.hs:86)
for (src/Control/Monad/HT.hs:89)
map (src/Control/Monad/HT.hs:92)
zipWith (src/Control/Monad/HT.hs:95)
chain (src/Control/Monad/HT.hs:98)
filter (src/Control/Monad/HT.hs:102)
replicate (src/Control/Monad/HT.hs:105)
lift (src/Control/Monad/HT.hs:108)
lift2 (src/Control/Monad/HT.hs:112)
lift3 (src/Control/Monad/HT.hs:116)
lift4 (src/Control/Monad/HT.hs:121)
lift5 (src/Control/Monad/HT.hs:127)
liftJoin2 (src/Control/Monad/HT.hs:139)
liftJoin3 (src/Control/Monad/HT.hs:143)
liftJoin4 (src/Control/Monad/HT.hs:150)
liftJoin5 (src/Control/Monad/HT.hs:157)
66% ( 2 / 3) in 'Data.Bits.HT'
Missing documentation for:
Module header
83% ( 5 / 6) in 'Data.Bool.HT'
Missing documentation for:
Module header
0% ( 0 / 7) in 'Data.Either.HT'
Missing documentation for:
Module header
mapLeft (src/Data/Either/HT.hs:12)
mapRight (src/Data/Either/HT.hs:15)
mapBoth (src/Data/Either/HT.hs:18)
maybeLeft (src/Data/Either/HT.hs:21)
maybeRight (src/Data/Either/HT.hs:24)
swap (src/Data/Either/HT.hs:27)
Warning: 'Ix' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 7 / 7) in 'Data.Ix.Enum'
Warning: '(:)' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
60% ( 3 / 5) in 'Data.Maybe.HT'
Missing documentation for:
Module header
alternatives (src/Data/Maybe/HT.hs:53)
Warning: 'powerAssociative' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
80% ( 4 / 5) in 'Data.Monoid.HT'
Missing documentation for:
Module header
0% ( 0 / 6) in 'Data.Strictness.HT'
Missing documentation for:
Module header
arguments1 (src/Data/Strictness/HT.hs:5)
arguments2 (src/Data/Strictness/HT.hs:9)
arguments3 (src/Data/Strictness/HT.hs:13)
arguments4 (src/Data/Strictness/HT.hs:17)
arguments5 (src/Data/Strictness/HT.hs:21)
Warning: 'partition' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
31% ( 5 / 16) in 'Data.Tuple.Lazy'
Missing documentation for:
Module header
zipPair (src/Data/Tuple/Lazy.hs:37)
zipWithPair (src/Data/Tuple/Lazy.hs:41)
swap (src/Data/Tuple/Lazy.hs:46)
forcePair (src/Data/Tuple/Lazy.hs:50)
mapTriple (src/Data/Tuple/Lazy.hs:57)
mapFst3 (src/Data/Tuple/Lazy.hs:61)
mapSnd3 (src/Data/Tuple/Lazy.hs:65)
mapThd3 (src/Data/Tuple/Lazy.hs:69)
zipWithTriple (src/Data/Tuple/Lazy.hs:74)
uncurry3 (src/Data/Tuple/Lazy.hs:78)
Warning: 'Arrow' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
35% ( 7 / 20) in 'Data.Tuple.HT'
Missing documentation for:
Module header
swap (src/Data/Tuple/Lazy.hs:46)
forcePair (src/Data/Tuple/Lazy.hs:50)
fst3 (src/Data/Tuple/HT.hs:40)
snd3 (src/Data/Tuple/HT.hs:44)
thd3 (src/Data/Tuple/HT.hs:48)
mapTriple (src/Data/Tuple/Lazy.hs:57)
mapFst3 (src/Data/Tuple/Lazy.hs:61)
mapSnd3 (src/Data/Tuple/Lazy.hs:65)
mapThd3 (src/Data/Tuple/Lazy.hs:69)
curry3 (src/Data/Tuple/HT.hs:52)
uncurry3 (src/Data/Tuple/Lazy.hs:78)
triple (src/Data/Tuple/HT.hs:36)
100% ( 5 / 5) in 'Data.List.Reverse.StrictSpine'
50% ( 1 / 2) in 'Data.String.HT'
Missing documentation for:
Module header
100% ( 5 / 5) in 'Data.List.Reverse.StrictElement'
80% ( 4 / 5) in 'Data.Function.HT'
Missing documentation for:
Module header
50% ( 2 / 4) in 'Data.Ord.HT'
Missing documentation for:
Module header
comparing (src/Data/Ord/HT.hs:7)
Warning: 'on' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'on' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
57% ( 4 / 7) in 'Data.List.Key'
Missing documentation for:
nub (src/Data/List/Key/Private.hs:70)
sort (src/Data/List/Key/Private.hs:60)
merge (src/Data/List/Key/Private.hs:63)
0% ( 0 / 2) in 'Data.Eq.HT'
Missing documentation for:
Module header
equating (src/Data/Eq/HT.hs:7)
35% ( 5 / 14) in 'Control.Functor.HT'
Missing documentation for:
Module header
void (src/Control/Functor/HT.hs:11)
map (src/Control/Functor/HT.hs:14)
for (src/Control/Functor/HT.hs:17)
mapFst (src/Control/Functor/HT.hs:50)
mapSnd (src/Control/Functor/HT.hs:53)
mapFst3 (src/Control/Functor/HT.hs:57)
mapSnd3 (src/Control/Functor/HT.hs:60)
mapThd3 (src/Control/Functor/HT.hs:63)
90% ( 10 / 11) in 'Data.List.Match'
Missing documentation for:
Module header
Warning: 'b' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'a' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
82% ( 60 / 73) in 'Data.List.HT'
Missing documentation for:
Module header
group (src/Data/List/HT/Private.hs:121)
segmentAfterMaybe (src/Data/List/HT.hs:92)
segmentBeforeMaybe (src/Data/List/HT.hs:88)
dropWhileRev (src/Data/List/HT.hs:80)
takeWhileRev (src/Data/List/HT.hs:84)
dropWhileNothing (src/Data/List/HT/Private.hs:612)
spanJust (src/Data/List/HT/Private.hs:650)
unzipEithers (src/Data/List/HT/Private.hs:660)
search (src/Data/List/HT/Private.hs:739)
isAscendingLazy (src/Data/List/HT/Private.hs:1139)
padLeft (src/Data/List/HT/Private.hs:1237)
padRight (src/Data/List/HT/Private.hs:1242)
66% ( 2 / 3) in 'Data.Record.HT'
Missing documentation for:
Module header
0% ( 0 / 14) in 'Control.Applicative.HT'
Missing documentation for:
Module header
mapPair (src/Control/Applicative/HT.hs:8)
mapTriple (src/Control/Applicative/HT.hs:12)
curry (src/Control/Applicative/HT.hs:16)
curry3 (src/Control/Applicative/HT.hs:19)
lift (src/Control/Applicative/HT.hs:24)
lift2 (src/Control/Applicative/HT.hs:29)
lift3 (src/Control/Applicative/HT.hs:34)
lift4 (src/Control/Applicative/HT.hs:40)
lift5 (src/Control/Applicative/HT.hs:47)
lift6 (src/Control/Applicative/HT.hs:54)
liftA4 (src/Control/Applicative/HT.hs:62)
liftA5 (src/Control/Applicative/HT.hs:69)
liftA6 (src/Control/Applicative/HT.hs:76)
13% ( 2 / 15) in 'Data.Tuple.Strict'
Missing documentation for:
Module header
mapPair (src/Data/Tuple/Strict.hs:7)
mapFst (src/Data/Tuple/Strict.hs:11)
mapSnd (src/Data/Tuple/Strict.hs:15)
zipPair (src/Data/Tuple/Strict.hs:19)
zipWithPair (src/Data/Tuple/Strict.hs:23)
swap (src/Data/Tuple/Strict.hs:28)
mapTriple (src/Data/Tuple/Strict.hs:35)
mapFst3 (src/Data/Tuple/Strict.hs:39)
mapSnd3 (src/Data/Tuple/Strict.hs:43)
mapThd3 (src/Data/Tuple/Strict.hs:47)
zipWithTriple (src/Data/Tuple/Strict.hs:52)
uncurry3 (src/Data/Tuple/Strict.hs:56)
40% ( 2 / 5) in 'Text.Read.HT'
Missing documentation for:
Module header
readMany (src/Text/Read/HT.hs:23)
maybeRead (src/Text/Read/HT.hs:30)
33% ( 1 / 3) in 'Text.Show.HT'
Missing documentation for:
Module header
concatS (src/Text/Show/HT.hs:16)
Documentation created: dist/doc/html/utility-ht/,
dist/doc/html/utility-ht/utility-ht.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/utility-ht-0.0.17.2-H7ist9Z1pSu3VUEtQixbtA
Completed utility-ht-0.0.17.2
Configuring random-1.3.1...
Preprocessing library for random-1.3.1..
Building library for random-1.3.1..
[1 of 6] Compiling System.Random.Array ( src/System/Random/Array.hs, dist/build/System/Random/Array.o, dist/build/System/Random/Array.dyn_o )
[2 of 6] Compiling System.Random.GFinite ( src/System/Random/GFinite.hs, dist/build/System/Random/GFinite.o, dist/build/System/Random/GFinite.dyn_o )
[3 of 6] Compiling System.Random.Internal ( src/System/Random/Internal.hs, dist/build/System/Random/Internal.o, dist/build/System/Random/Internal.dyn_o )
[4 of 6] Compiling System.Random.Seed ( src/System/Random/Seed.hs, dist/build/System/Random/Seed.o, dist/build/System/Random/Seed.dyn_o )
[5 of 6] Compiling System.Random ( src/System/Random.hs, dist/build/System/Random.o, dist/build/System/Random.dyn_o )
[6 of 6] Compiling System.Random.Stateful ( src/System/Random/Stateful.hs, dist/build/System/Random/Stateful.o, dist/build/System/Random/Stateful.dyn_o )
Preprocessing library for random-1.3.1..
Running Haddock on library for random-1.3.1..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 6] Compiling System.Random.Array ( src/System/Random/Array.hs, nothing )
[2 of 6] Compiling System.Random.GFinite ( src/System/Random/GFinite.hs, nothing )
[3 of 6] Compiling System.Random.Internal ( src/System/Random/Internal.hs, nothing )
[4 of 6] Compiling System.Random.Seed ( src/System/Random/Seed.hs, nothing )
[5 of 6] Compiling System.Random ( src/System/Random.hs, nothing )
[6 of 6] Compiling System.Random.Stateful ( src/System/Random/Stateful.hs, nothing )
Haddock coverage:
Warning: 'ST' is ambiguous. It is defined
* in GHC.ST
* in GHC.ST
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in GHC.ST
Warning: 'StateGenM' is ambiguous. It is defined
* at src/System/Random/Internal.hs:606:20
* at src/System/Random/Internal.hs:606:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:606:1
Warning: 'StateGen' is ambiguous. It is defined
* at src/System/Random/Internal.hs:612:22
* at src/System/Random/Internal.hs:612:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:612:1
Warning: 'ByteArray' is ambiguous. It is defined
* in Data.Array.Byte
* in Data.Array.Byte
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in Data.Array.Byte
Warning: 'StdGen' is ambiguous. It is defined
* at src/System/Random/Internal.hs:749:18
* at src/System/Random/Internal.hs:749:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:749:1
Warning: 'MutableByteArray' is ambiguous. It is defined
* in Data.Array.Byte
* in Data.Array.Byte
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in Data.Array.Byte
Warning: 'ST' is ambiguous. It is defined
* in GHC.ST
* in GHC.ST
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in GHC.ST
Warning: 'StateT' is ambiguous. It is defined
* in Control.Monad.Trans.State.Strict
* in Control.Monad.Trans.State.Strict
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in Control.Monad.Trans.State.Strict
Warning: 'Seed' is ambiguous. It is defined
* at src/System/Random/Internal.hs:134:18
* at src/System/Random/Internal.hs:134:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:134:1
Warning: 'StdGen' is ambiguous. It is defined
* at src/System/Random/Internal.hs:749:18
* at src/System/Random/Internal.hs:749:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:749:1
Warning: 'ByteArray' is ambiguous. It is defined
* in Data.Array.Byte
* in Data.Array.Byte
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in Data.Array.Byte
Warning: 'ByteString' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'uniformByteStringM' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'ShortByteString' is ambiguous. It is defined
* in Data.ByteString.Short.Internal
* in Data.ByteString.Short.Internal
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in Data.ByteString.Short.Internal
Warning: 'StdGen' is ambiguous. It is defined
* at src/System/Random/Internal.hs:749:18
* at src/System/Random/Internal.hs:749:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:749:1
100% ( 71 / 71) in 'System.Random'
Warning: 'TGenM' is ambiguous. It is defined
* at src/System/Random/Stateful.hs:719:19
* at src/System/Random/Stateful.hs:719:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Stateful.hs:719:1
Warning: 'STGenM' is ambiguous. It is defined
* at src/System/Random/Stateful.hs:618:22
* at src/System/Random/Stateful.hs:618:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Stateful.hs:618:1
Warning: 'StateGenM' is ambiguous. It is defined
* at src/System/Random/Internal.hs:606:20
* at src/System/Random/Internal.hs:606:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:606:1
Warning: 'IOGenM' is ambiguous. It is defined
* at src/System/Random/Stateful.hs:542:20
* at src/System/Random/Stateful.hs:542:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Stateful.hs:542:1
Warning: 'AtomicGenM' is ambiguous. It is defined
* at src/System/Random/Stateful.hs:428:24
* at src/System/Random/Stateful.hs:428:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Stateful.hs:428:1
Warning: 'Seed' is ambiguous. It is defined
* at src/System/Random/Internal.hs:134:18
* at src/System/Random/Internal.hs:134:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:134:1
Warning: 'StdGen' is ambiguous. It is defined
* at src/System/Random/Internal.hs:749:18
* at src/System/Random/Internal.hs:749:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Internal.hs:749:1
Warning: 'IOGen' is ambiguous. It is defined
* at src/System/Random/Stateful.hs:547:19
* at src/System/Random/Stateful.hs:547:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Stateful.hs:547:1
Warning: 'STGenM' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'STM' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'STGen' is ambiguous. It is defined
* at src/System/Random/Stateful.hs:623:19
* at src/System/Random/Stateful.hs:623:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/System/Random/Stateful.hs:623:1
Warning: 'clearBit' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'testBit' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% (137 /137) in 'System.Random.Stateful'
Warning: System.Random: could not find link destinations for:
- System.Random.GFinite.cardinality
- System.Random.GFinite.toFinite
- System.Random.GFinite.fromFinite
- System.Random.GFinite.Cardinality
- System.Random.Seed.D:R:SeedSizeSMGen
- System.Random.Seed.D:R:SeedSizeSMGen0
- System.Random.Seed.D:R:SeedSizeStateGen
- System.Random.Seed.D:R:SeedSizeStdGen
- System.Random.Stateful.D:R:SeedSizeAtomicGen
- System.Random.Stateful.D:R:SeedSizeIOGen
- System.Random.Stateful.D:R:SeedSizeSTGen
- System.Random.Stateful.D:R:SeedSizeTGen
Warning: System.Random.Stateful: could not find link destinations for:
- System.Random.GFinite.GFinite
- System.Random.GFinite.cardinality
- System.Random.GFinite.toFinite
- System.Random.GFinite.fromFinite
- System.Random.GFinite.Cardinality
- System.Random.Internal.GUniformRange
- System.Random.Internal.GUniform
- System.Random.Internal.D:R:MutableGenStateGenm
- System.Random.Seed.D:R:SeedSizeSMGen
- System.Random.Seed.D:R:SeedSizeSMGen0
- System.Random.Seed.D:R:SeedSizeStateGen
- System.Random.Seed.D:R:SeedSizeStdGen
- System.Random.Stateful.D:R:MutableGenAtomicGenm
- System.Random.Stateful.D:R:SeedSizeAtomicGen
- System.Random.Stateful.D:R:MutableGenIOGenm
- System.Random.Stateful.D:R:SeedSizeIOGen
- System.Random.Stateful.D:R:MutableGenSTGenST
- System.Random.Stateful.D:R:SeedSizeSTGen
- System.Random.Stateful.D:R:MutableGenTGenSTM
- System.Random.Stateful.D:R:SeedSizeTGen
Documentation created: dist/doc/html/random/, dist/doc/html/random/random.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/random-1.3.1-3HmCudIQHVrG4RNMrw37d7
Completed random-1.3.1
Configuring QuickCheck-2.16.0.0...
Preprocessing library for QuickCheck-2.16.0.0..
Building library for QuickCheck-2.16.0.0..
[ 1 of 17] Compiling Test.QuickCheck.Exception ( src/Test/QuickCheck/Exception.hs, dist/build/Test/QuickCheck/Exception.o, dist/build/Test/QuickCheck/Exception.dyn_o )
[ 2 of 17] Compiling Test.QuickCheck.Random ( src/Test/QuickCheck/Random.hs, dist/build/Test/QuickCheck/Random.o, dist/build/Test/QuickCheck/Random.dyn_o )
src/Test/QuickCheck/Random.hs:50:37: warning: [GHC-68441] [-Wdeprecations]
In the use of genShortByteString
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `System.Random.uniformShortByteString`"
|
50 | genShortByteString n = wrapQCGen (genShortByteString n)
| ^^^^^^^^^^^^^^^^^^
src/Test/QuickCheck/Random.hs:83:16: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
83 | left = fst . split
| ^^^^^
src/Test/QuickCheck/Random.hs:84:17: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
84 | right = snd . split
| ^^^^^
[ 3 of 17] Compiling Test.QuickCheck.Gen ( src/Test/QuickCheck/Gen.hs, dist/build/Test/QuickCheck/Gen.o, dist/build/Test/QuickCheck/Gen.dyn_o )
src/Test/QuickCheck/Gen.hs:92:12: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
92 | case split r of
| ^^^^^
[ 4 of 17] Compiling Test.QuickCheck.Gen.Unsafe ( src/Test/QuickCheck/Gen/Unsafe.hs, dist/build/Test/QuickCheck/Gen/Unsafe.o, dist/build/Test/QuickCheck/Gen/Unsafe.dyn_o )
[ 5 of 17] Compiling Test.QuickCheck.Arbitrary ( src/Test/QuickCheck/Arbitrary.hs, dist/build/Test/QuickCheck/Arbitrary.o, dist/build/Test/QuickCheck/Arbitrary.dyn_o )
[ 6 of 17] Compiling Test.QuickCheck.Poly ( src/Test/QuickCheck/Poly.hs, dist/build/Test/QuickCheck/Poly.o, dist/build/Test/QuickCheck/Poly.dyn_o )
[ 7 of 17] Compiling Test.QuickCheck.Modifiers ( src/Test/QuickCheck/Modifiers.hs, dist/build/Test/QuickCheck/Modifiers.o, dist/build/Test/QuickCheck/Modifiers.dyn_o )
[ 8 of 17] Compiling Test.QuickCheck.Function ( src/Test/QuickCheck/Function.hs, dist/build/Test/QuickCheck/Function.o, dist/build/Test/QuickCheck/Function.dyn_o )
[ 9 of 17] Compiling Test.QuickCheck.Text ( src/Test/QuickCheck/Text.hs, dist/build/Test/QuickCheck/Text.o, dist/build/Test/QuickCheck/Text.dyn_o )
[10 of 17] Compiling Test.QuickCheck.State ( src/Test/QuickCheck/State.hs, dist/build/Test/QuickCheck/State.o, dist/build/Test/QuickCheck/State.dyn_o )
[11 of 17] Compiling Test.QuickCheck.Property ( src/Test/QuickCheck/Property.hs, dist/build/Test/QuickCheck/Property.o, dist/build/Test/QuickCheck/Property.dyn_o )
[12 of 17] Compiling Test.QuickCheck.Test ( src/Test/QuickCheck/Test.hs, dist/build/Test/QuickCheck/Test.o, dist/build/Test/QuickCheck/Test.dyn_o )
src/Test/QuickCheck/Test.hs:501:17: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
501 | (rnd1,rnd2) = split (randomSeed st)
| ^^^^^
[13 of 17] Compiling Test.QuickCheck.Monoids ( src/Test/QuickCheck/Monoids.hs, dist/build/Test/QuickCheck/Monoids.o, dist/build/Test/QuickCheck/Monoids.dyn_o )
[14 of 17] Compiling Test.QuickCheck.Monadic ( src/Test/QuickCheck/Monadic.hs, dist/build/Test/QuickCheck/Monadic.o, dist/build/Test/QuickCheck/Monadic.dyn_o )
[15 of 17] Compiling Test.QuickCheck.All ( src/Test/QuickCheck/All.hs, dist/build/Test/QuickCheck/All.o, dist/build/Test/QuickCheck/All.dyn_o )
[16 of 17] Compiling Test.QuickCheck.Features ( src/Test/QuickCheck/Features.hs, dist/build/Test/QuickCheck/Features.o, dist/build/Test/QuickCheck/Features.dyn_o )
[17 of 17] Compiling Test.QuickCheck ( src/Test/QuickCheck.hs, dist/build/Test/QuickCheck.o, dist/build/Test/QuickCheck.dyn_o )
Preprocessing library for QuickCheck-2.16.0.0..
Running Haddock on library for QuickCheck-2.16.0.0..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 17] Compiling Test.QuickCheck.Exception ( src/Test/QuickCheck/Exception.hs, nothing )
[ 2 of 17] Compiling Test.QuickCheck.Random ( src/Test/QuickCheck/Random.hs, nothing )
src/Test/QuickCheck/Random.hs:50:37: warning: [GHC-68441] [-Wdeprecations]
In the use of genShortByteString
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `System.Random.uniformShortByteString`"
|
50 | genShortByteString n = wrapQCGen (genShortByteString n)
| ^^^^^^^^^^^^^^^^^^
src/Test/QuickCheck/Random.hs:83:16: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
83 | left = fst . split
| ^^^^^
src/Test/QuickCheck/Random.hs:84:17: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
84 | right = snd . split
| ^^^^^
[ 3 of 17] Compiling Test.QuickCheck.Gen ( src/Test/QuickCheck/Gen.hs, nothing )
src/Test/QuickCheck/Gen.hs:92:12: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
92 | case split r of
| ^^^^^
[ 4 of 17] Compiling Test.QuickCheck.Gen.Unsafe ( src/Test/QuickCheck/Gen/Unsafe.hs, nothing )
[ 5 of 17] Compiling Test.QuickCheck.Arbitrary ( src/Test/QuickCheck/Arbitrary.hs, nothing )
[ 6 of 17] Compiling Test.QuickCheck.Poly ( src/Test/QuickCheck/Poly.hs, nothing )
[ 7 of 17] Compiling Test.QuickCheck.Modifiers ( src/Test/QuickCheck/Modifiers.hs, nothing )
[ 8 of 17] Compiling Test.QuickCheck.Function ( src/Test/QuickCheck/Function.hs, nothing )
[ 9 of 17] Compiling Test.QuickCheck.Text ( src/Test/QuickCheck/Text.hs, nothing )
[10 of 17] Compiling Test.QuickCheck.State ( src/Test/QuickCheck/State.hs, nothing )
[11 of 17] Compiling Test.QuickCheck.Property ( src/Test/QuickCheck/Property.hs, nothing )
[12 of 17] Compiling Test.QuickCheck.Test ( src/Test/QuickCheck/Test.hs, nothing )
src/Test/QuickCheck/Test.hs:501:17: warning: [GHC-68441] [-Wdeprecations]
In the use of split
(imported from System.Random, but defined in System.Random.Internal):
Deprecated: "In favor of `splitGen`"
|
501 | (rnd1,rnd2) = split (randomSeed st)
| ^^^^^
[13 of 17] Compiling Test.QuickCheck.Monoids ( src/Test/QuickCheck/Monoids.hs, nothing )
[14 of 17] Compiling Test.QuickCheck.Monadic ( src/Test/QuickCheck/Monadic.hs, nothing )
[15 of 17] Compiling Test.QuickCheck.All ( src/Test/QuickCheck/All.hs, nothing )
[16 of 17] Compiling Test.QuickCheck.Features ( src/Test/QuickCheck/Features.hs, nothing )
[17 of 17] Compiling Test.QuickCheck ( src/Test/QuickCheck.hs, nothing )
Haddock coverage:
92% ( 35 / 38) in 'Test.QuickCheck.Gen'
Missing documentation for:
chooseWord64 (src/Test/QuickCheck/Gen.hs:211)
chooseInt64 (src/Test/QuickCheck/Gen.hs:220)
chooseUpTo (src/Test/QuickCheck/Gen.hs:230)
80% ( 4 / 5) in 'Test.QuickCheck.Gen.Unsafe'
Missing documentation for:
Capture (src/Test/QuickCheck/Gen/Unsafe.hs:52)
Warning: '(:*:)' is ambiguous. It is defined
* in GHC.Generics
* in GHC.Generics
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in GHC.Generics
Warning: 'Version' is ambiguous. It is defined
* in Data.Version
* in Data.Version
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined in Data.Version
88% ( 45 / 51) in 'Test.QuickCheck.Arbitrary'
Missing documentation for:
arbitrary1 (src/Test/QuickCheck/Arbitrary.hs:298)
shrink1 (src/Test/QuickCheck/Arbitrary.hs:301)
arbitrary2 (src/Test/QuickCheck/Arbitrary.hs:310)
shrink2 (src/Test/QuickCheck/Arbitrary.hs:313)
RecursivelyShrink (src/Test/QuickCheck/Arbitrary.hs:325)
GSubterms (src/Test/QuickCheck/Arbitrary.hs:356)
Warning: 'A' is ambiguous. It is defined
* at src/Test/QuickCheck/Poly.hs:29:13
* at src/Test/QuickCheck/Poly.hs:29:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Poly.hs:29:1
Warning: 'B' is ambiguous. It is defined
* at src/Test/QuickCheck/Poly.hs:44:13
* at src/Test/QuickCheck/Poly.hs:44:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Poly.hs:44:1
Warning: 'C' is ambiguous. It is defined
* at src/Test/QuickCheck/Poly.hs:59:13
* at src/Test/QuickCheck/Poly.hs:59:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Poly.hs:59:1
Warning: 'OrdA' is ambiguous. It is defined
* at src/Test/QuickCheck/Poly.hs:77:16
* at src/Test/QuickCheck/Poly.hs:77:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Poly.hs:77:1
Warning: 'OrdB' is ambiguous. It is defined
* at src/Test/QuickCheck/Poly.hs:112:16
* at src/Test/QuickCheck/Poly.hs:112:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Poly.hs:112:1
Warning: 'OrdC' is ambiguous. It is defined
* at src/Test/QuickCheck/Poly.hs:146:16
* at src/Test/QuickCheck/Poly.hs:146:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Poly.hs:146:1
14% ( 1 / 7) in 'Test.QuickCheck.Poly'
Missing documentation for:
A (src/Test/QuickCheck/Poly.hs:29)
B (src/Test/QuickCheck/Poly.hs:44)
C (src/Test/QuickCheck/Poly.hs:59)
OrdA (src/Test/QuickCheck/Poly.hs:77)
OrdB (src/Test/QuickCheck/Poly.hs:112)
OrdC (src/Test/QuickCheck/Poly.hs:146)
Warning: 'Blind' is ambiguous. It is defined
* at src/Test/QuickCheck/Modifiers.hs:94:19
* at src/Test/QuickCheck/Modifiers.hs:94:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Modifiers.hs:94:1
Warning: 'NonNegative' is ambiguous. It is defined
* at src/Test/QuickCheck/Modifiers.hs:312:25
* at src/Test/QuickCheck/Modifiers.hs:312:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Modifiers.hs:312:1
Warning: 'Large' is ambiguous. It is defined
* at src/Test/QuickCheck/Modifiers.hs:351:19
* at src/Test/QuickCheck/Modifiers.hs:351:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Modifiers.hs:351:1
95% ( 22 / 23) in 'Test.QuickCheck.Modifiers'
Missing documentation for:
ShrinkState (src/Test/QuickCheck/Modifiers.hs:487)
Warning: 'Fun' is ambiguous. It is defined
* at src/Test/QuickCheck/Function.hs:546:16
* at src/Test/QuickCheck/Function.hs:546:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Function.hs:546:1
100% ( 22 / 22) in 'Test.QuickCheck.Function'
Warning: 'Discard' is ambiguous. It is defined
* at src/Test/QuickCheck/Property.hs:114:16
* at src/Test/QuickCheck/Property.hs:114:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Property.hs:114:1
Warning: 'Confidence' is ambiguous. It is defined
* at src/Test/QuickCheck/State.hs:68:3
* at src/Test/QuickCheck/State.hs:67:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/State.hs:67:1
66% ( 2 / 3) in 'Test.QuickCheck.Monoids'
Missing documentation for:
Module header
83% ( 20 / 24) in 'Test.QuickCheck.Monadic'
Missing documentation for:
stop (src/Test/QuickCheck/Monadic.hs:163)
monadic (src/Test/QuickCheck/Monadic.hs:272)
monadic' (src/Test/QuickCheck/Monadic.hs:275)
runSTGen (src/Test/QuickCheck/Monadic.hs:314)
100% ( 10 / 10) in 'Test.QuickCheck.All'
Warning: 'Fun' is ambiguous. It is defined
* at src/Test/QuickCheck/Function.hs:546:16
* at src/Test/QuickCheck/Function.hs:546:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Function.hs:546:1
Warning: 'Blind' is ambiguous. It is defined
* at src/Test/QuickCheck/Modifiers.hs:94:19
* at src/Test/QuickCheck/Modifiers.hs:94:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Modifiers.hs:94:1
Warning: 'NonNegative' is ambiguous. It is defined
* at src/Test/QuickCheck/Modifiers.hs:312:25
* at src/Test/QuickCheck/Modifiers.hs:312:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Test/QuickCheck/Modifiers.hs:312:1
96% (203 /211) in 'Test.QuickCheck'
Missing documentation for:
arbitrary1 (src/Test/QuickCheck/Arbitrary.hs:298)
shrink1 (src/Test/QuickCheck/Arbitrary.hs:301)
arbitrary2 (src/Test/QuickCheck/Arbitrary.hs:310)
shrink2 (src/Test/QuickCheck/Arbitrary.hs:313)
ShrinkState (src/Test/QuickCheck/Modifiers.hs:487)
Witness (src/Test/QuickCheck/Property.hs:262)
coerceWitness (src/Test/QuickCheck/Property.hs:268)
castWitness (src/Test/QuickCheck/Property.hs:273)
Warning: Test.QuickCheck.Gen: could not find link destinations for:
- Test.QuickCheck.Random.QCGen
Warning: Test.QuickCheck.Arbitrary: could not find link destinations for:
- Test.QuickCheck.Arbitrary.GCoArbitrary
- Test.QuickCheck.Arbitrary.GSubtermsIncl
- Test.QuickCheck.Arbitrary.gSubterms
- Test.QuickCheck.Arbitrary.grecursivelyShrink
Warning: Test.QuickCheck.Modifiers: could not find link destinations for:
- Test.QuickCheck.Modifiers.InfiniteListInternalData
Warning: Test.QuickCheck.Function: could not find link destinations for:
- Test.QuickCheck.Function.Shrunk
- Test.QuickCheck.Function.GFunction
Warning: Test.QuickCheck: could not find link destinations for:
- Test.QuickCheck.Exception.AnException
- Test.QuickCheck.Random.QCGen
- Test.QuickCheck.Arbitrary.GCoArbitrary
- Test.QuickCheck.Modifiers.InfiniteListInternalData
- Test.QuickCheck.Function.Shrunk
- Test.QuickCheck.Function.GFunction
- Test.QuickCheck.Property.Result
Documentation created: dist/doc/html/QuickCheck/,
dist/doc/html/QuickCheck/QuickCheck.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/QuickCheck-2.16.0.0-KAwywA1qBiHBj0KysskoJQ
Completed QuickCheck-2.16.0.0
Configuring storable-record-0.0.7...
Preprocessing library for storable-record-0.0.7..
Building library for storable-record-0.0.7..
[1 of 8] Compiling Foreign.Storable.FixedArray ( src/Foreign/Storable/FixedArray.hs, dist/build/Foreign/Storable/FixedArray.o, dist/build/Foreign/Storable/FixedArray.dyn_o )
[2 of 8] Compiling Foreign.Storable.Newtype ( src/Foreign/Storable/Newtype.hs, dist/build/Foreign/Storable/Newtype.o, dist/build/Foreign/Storable/Newtype.dyn_o )
[3 of 8] Compiling Foreign.Storable.Record ( src/Foreign/Storable/Record.hs, dist/build/Foreign/Storable/Record.o, dist/build/Foreign/Storable/Record.dyn_o )
src/Foreign/Storable/Record.hs:70:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
70 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/Record.hs:72:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
72 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/Record.hs:73:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
73 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[4 of 8] Compiling Foreign.Storable.Record.Tuple ( src/Foreign/Storable/Record/Tuple.hs, dist/build/Foreign/Storable/Record/Tuple.o, dist/build/Foreign/Storable/Record/Tuple.dyn_o )
[5 of 8] Compiling Foreign.Storable.RecordMinimalSize ( src/Foreign/Storable/RecordMinimalSize.hs, dist/build/Foreign/Storable/RecordMinimalSize.o, dist/build/Foreign/Storable/RecordMinimalSize.dyn_o )
src/Foreign/Storable/RecordMinimalSize.hs:73:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
73 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordMinimalSize.hs:75:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
75 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordMinimalSize.hs:76:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
76 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[6 of 8] Compiling Foreign.Storable.RecordReaderPtr ( src/Foreign/Storable/RecordReaderPtr.hs, dist/build/Foreign/Storable/RecordReaderPtr.o, dist/build/Foreign/Storable/RecordReaderPtr.dyn_o )
src/Foreign/Storable/RecordReaderPtr.hs:73:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
73 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordReaderPtr.hs:75:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
75 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordReaderPtr.hs:76:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
76 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[7 of 8] Compiling Foreign.Storable.Traversable ( src/Foreign/Storable/Traversable.hs, dist/build/Foreign/Storable/Traversable.o, dist/build/Foreign/Storable/Traversable.dyn_o )
[8 of 8] Compiling Foreign.Storable.TraversableUnequalSizes ( src/Foreign/Storable/TraversableUnequalSizes.hs, dist/build/Foreign/Storable/TraversableUnequalSizes.o, dist/build/Foreign/Storable/TraversableUnequalSizes.dyn_o )
Preprocessing library for storable-record-0.0.7..
Running Haddock on library for storable-record-0.0.7..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 8] Compiling Foreign.Storable.FixedArray ( src/Foreign/Storable/FixedArray.hs, nothing )
[2 of 8] Compiling Foreign.Storable.Newtype ( src/Foreign/Storable/Newtype.hs, nothing )
[3 of 8] Compiling Foreign.Storable.Record ( src/Foreign/Storable/Record.hs, nothing )
src/Foreign/Storable/Record.hs:70:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
70 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/Record.hs:72:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
72 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/Record.hs:73:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
73 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[4 of 8] Compiling Foreign.Storable.Record.Tuple ( src/Foreign/Storable/Record/Tuple.hs, nothing )
[5 of 8] Compiling Foreign.Storable.RecordMinimalSize ( src/Foreign/Storable/RecordMinimalSize.hs, nothing )
src/Foreign/Storable/RecordMinimalSize.hs:73:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
73 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordMinimalSize.hs:75:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
75 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordMinimalSize.hs:76:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
76 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[6 of 8] Compiling Foreign.Storable.RecordReaderPtr ( src/Foreign/Storable/RecordReaderPtr.hs, nothing )
src/Foreign/Storable/RecordReaderPtr.hs:73:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
73 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordReaderPtr.hs:75:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
75 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Foreign/Storable/RecordReaderPtr.hs:76:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
76 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[7 of 8] Compiling Foreign.Storable.Traversable ( src/Foreign/Storable/Traversable.hs, nothing )
[8 of 8] Compiling Foreign.Storable.TraversableUnequalSizes ( src/Foreign/Storable/TraversableUnequalSizes.hs, nothing )
Haddock coverage:
0% ( 0 / 6) in 'Foreign.Storable.FixedArray'
Missing documentation for:
Module header
roundUp (src/Foreign/Storable/FixedArray.hs:13)
sizeOfArray (src/Foreign/Storable/FixedArray.hs:17)
pokeNext (src/Foreign/Storable/FixedArray.hs:22)
peekNext (src/Foreign/Storable/FixedArray.hs:30)
run (src/Foreign/Storable/FixedArray.hs:37)
20% ( 1 / 5) in 'Foreign.Storable.Newtype'
Missing documentation for:
sizeOf (src/Foreign/Storable/Newtype.hs:24)
alignment (src/Foreign/Storable/Newtype.hs:27)
peek (src/Foreign/Storable/Newtype.hs:32)
poke (src/Foreign/Storable/Newtype.hs:37)
11% ( 1 / 9) in 'Foreign.Storable.Record'
Missing documentation for:
Dictionary (src/Foreign/Storable/Record.hs:82)
Access (src/Foreign/Storable/Record.hs:89)
element (src/Foreign/Storable/Record.hs:147)
run (src/Foreign/Storable/Record.hs:162)
alignment (src/Foreign/Storable/Record.hs:170)
sizeOf (src/Foreign/Storable/Record.hs:175)
peek (src/Foreign/Storable/Record.hs:180)
poke (src/Foreign/Storable/Record.hs:185)
33% ( 1 / 3) in 'Foreign.Storable.Record.Tuple'
Missing documentation for:
Storable (src/Foreign/Storable/Record/Tuple.hs:42)
Tuple (src/Foreign/Storable/Record/Tuple.hs:22)
66% ( 4 / 6) in 'Foreign.Storable.Traversable'
Missing documentation for:
alignment (src/Foreign/Storable/Traversable.hs:66)
poke (src/Foreign/Storable/Traversable.hs:133)
Documentation created: dist/doc/html/storable-record/,
dist/doc/html/storable-record/storable-record.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/storable-record-0.0.7-AQ76a4nB8M48XEOyOwz4Pf
Completed storable-record-0.0.7
Configuring non-negative-0.1.2...
Preprocessing library for non-negative-0.1.2..
Building library for non-negative-0.1.2..
[1 of 4] Compiling Numeric.NonNegative.Class ( src/Numeric/NonNegative/Class.hs, dist/build/Numeric/NonNegative/Class.o, dist/build/Numeric/NonNegative/Class.dyn_o )
src/Numeric/NonNegative/Class.hs:33:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
33 | import Data.Monoid (Monoid, )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[2 of 4] Compiling Numeric.NonNegative.ChunkyPrivate ( src/Numeric/NonNegative/ChunkyPrivate.hs, dist/build/Numeric/NonNegative/ChunkyPrivate.o, dist/build/Numeric/NonNegative/ChunkyPrivate.dyn_o )
src/Numeric/NonNegative/ChunkyPrivate.hs:21:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
21 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/ChunkyPrivate.hs:22:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
22 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/ChunkyPrivate.hs:202:4: warning: [GHC-50928] [-Wnoncanonical-monoid-instances]
Noncanonical mappend definition detected
in the instance declaration for Monoid (T a).
mappend will eventually be removed in favour of (<>)
Suggested fix:
Either remove definition for mappend (recommended) or define as mappend = (<>)
See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
|
202 | mappend = lift2 (++)
| ^^^^^^^^^^^^^^^^^^^^
[3 of 4] Compiling Numeric.NonNegative.Chunky ( src/Numeric/NonNegative/Chunky.hs, dist/build/Numeric/NonNegative/Chunky.o, dist/build/Numeric/NonNegative/Chunky.dyn_o )
[4 of 4] Compiling Numeric.NonNegative.Wrapper ( src/Numeric/NonNegative/Wrapper.hs, dist/build/Numeric/NonNegative/Wrapper.o, dist/build/Numeric/NonNegative/Wrapper.dyn_o )
src/Numeric/NonNegative/Wrapper.hs:18:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
18 | import Data.Monoid (Monoid(mempty, mappend, mconcat))
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/Wrapper.hs:19:1: warning: [GHC-38856] [-Wunused-imports]
The import of <> from module Data.Semigroup is redundant
|
19 | import Data.Semigroup (Semigroup(sconcat, (<>)))
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/Wrapper.hs:115:4: warning: [GHC-50928] [-Wnoncanonical-monoid-instances]
Noncanonical mappend definition detected
in the instance declaration for Monoid (T a).
mappend will eventually be removed in favour of (<>)
Suggested fix:
Either remove definition for mappend (recommended) or define as mappend = (<>)
See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
|
115 | mappend (Cons x) (Cons y) = Cons (x+y)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Preprocessing library for non-negative-0.1.2..
Running Haddock on library for non-negative-0.1.2..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 4] Compiling Numeric.NonNegative.Class ( src/Numeric/NonNegative/Class.hs, nothing )
src/Numeric/NonNegative/Class.hs:33:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
33 | import Data.Monoid (Monoid, )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[2 of 4] Compiling Numeric.NonNegative.ChunkyPrivate ( src/Numeric/NonNegative/ChunkyPrivate.hs, nothing )
src/Numeric/NonNegative/ChunkyPrivate.hs:21:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
21 | import Data.Monoid (Monoid(mempty, mappend), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/ChunkyPrivate.hs:22:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Semigroup is redundant
except perhaps to import instances from Data.Semigroup
To import instances alone, use: import Data.Semigroup()
|
22 | import Data.Semigroup (Semigroup((<>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/ChunkyPrivate.hs:202:4: warning: [GHC-50928] [-Wnoncanonical-monoid-instances]
Noncanonical mappend definition detected
in the instance declaration for Monoid (T a).
mappend will eventually be removed in favour of (<>)
Suggested fix:
Either remove definition for mappend (recommended) or define as mappend = (<>)
See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
|
202 | mappend = lift2 (++)
| ^^^^^^^^^^^^^^^^^^^^
[3 of 4] Compiling Numeric.NonNegative.Chunky ( src/Numeric/NonNegative/Chunky.hs, nothing )
[4 of 4] Compiling Numeric.NonNegative.Wrapper ( src/Numeric/NonNegative/Wrapper.hs, nothing )
src/Numeric/NonNegative/Wrapper.hs:18:1: warning: [GHC-66111] [-Wunused-imports]
The import of Data.Monoid is redundant
except perhaps to import instances from Data.Monoid
To import instances alone, use: import Data.Monoid()
|
18 | import Data.Monoid (Monoid(mempty, mappend, mconcat))
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/Wrapper.hs:19:1: warning: [GHC-38856] [-Wunused-imports]
The import of <> from module Data.Semigroup is redundant
|
19 | import Data.Semigroup (Semigroup(sconcat, (<>)))
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Numeric/NonNegative/Wrapper.hs:115:4: warning: [GHC-50928] [-Wnoncanonical-monoid-instances]
Noncanonical mappend definition detected
in the instance declaration for Monoid (T a).
mappend will eventually be removed in favour of (<>)
Suggested fix:
Either remove definition for mappend (recommended) or define as mappend = (<>)
See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/semigroup-monoid
|
115 | mappend (Cons x) (Cons y) = Cons (x+y)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Haddock coverage:
70% ( 7 / 10) in 'Numeric.NonNegative.Class'
Missing documentation for:
zero (src/Numeric/NonNegative/Class.hs:99)
add (src/Numeric/NonNegative/Class.hs:105)
sum (src/Numeric/NonNegative/Class.hs:108)
36% ( 4 / 11) in 'Numeric.NonNegative.Chunky'
Missing documentation for:
fromChunks (src/Numeric/NonNegative/ChunkyPrivate.hs:43)
fromNumber (src/Numeric/NonNegative/ChunkyPrivate.hs:46)
toNumber (src/Numeric/NonNegative/ChunkyPrivate.hs:56)
zero (src/Numeric/NonNegative/ChunkyPrivate.hs:69)
isNull (src/Numeric/NonNegative/ChunkyPrivate.hs:81)
isPositive (src/Numeric/NonNegative/ChunkyPrivate.hs:85)
divModStrict (src/Numeric/NonNegative/ChunkyPrivate.hs:187)
30% ( 4 / 13) in 'Numeric.NonNegative.Wrapper'
Missing documentation for:
T (src/Numeric/NonNegative/Wrapper.hs:31)
fromNumberMsg (src/Numeric/NonNegative/Wrapper.hs:51)
toNumber (src/Numeric/NonNegative/Wrapper.hs:89)
Int (src/Numeric/NonNegative/Wrapper.hs:191)
Integer (src/Numeric/NonNegative/Wrapper.hs:192)
Float (src/Numeric/NonNegative/Wrapper.hs:195)
Double (src/Numeric/NonNegative/Wrapper.hs:196)
Ratio (src/Numeric/NonNegative/Wrapper.hs:193)
Rational (src/Numeric/NonNegative/Wrapper.hs:194)
Documentation created: dist/doc/html/non-negative/,
dist/doc/html/non-negative/non-negative.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/non-negative-0.1.2-6EK7anow1WP7FW9yXIhe6V
Completed non-negative-0.1.2
Downloading numeric-prelude-0.4.4
Downloaded numeric-prelude-0.4.4
Configuring numeric-prelude-0.4.4...
Preprocessing library for numeric-prelude-0.4.4..
Building library for numeric-prelude-0.4.4..
[ 1 of 97] Compiling Algebra.DimensionTerm ( src/Algebra/DimensionTerm.hs, dist/build/Algebra/DimensionTerm.o, dist/build/Algebra/DimensionTerm.dyn_o )
[ 2 of 97] Compiling Algebra.Indexable ( src/Algebra/Indexable.hs, dist/build/Algebra/Indexable.o, dist/build/Algebra/Indexable.dyn_o )
[ 3 of 97] Compiling Algebra.Laws ( src/Algebra/Laws.hs, dist/build/Algebra/Laws.o, dist/build/Algebra/Laws.dyn_o )
[ 4 of 97] Compiling Algebra.RealRing98 ( src/Algebra/RealRing98.hs, dist/build/Algebra/RealRing98.o, dist/build/Algebra/RealRing98.dyn_o )
[ 5 of 97] Compiling MathObj.Permutation ( src/MathObj/Permutation.hs, dist/build/MathObj/Permutation.o, dist/build/MathObj/Permutation.dyn_o )
[ 6 of 97] Compiling NumericPrelude.Base ( src/NumericPrelude/Base.hs, dist/build/NumericPrelude/Base.o, dist/build/NumericPrelude/Base.dyn_o )
[ 7 of 97] Compiling MathObj.Permutation.Table ( src/MathObj/Permutation/Table.hs, dist/build/MathObj/Permutation/Table.o, dist/build/MathObj/Permutation/Table.dyn_o )
src/MathObj/Permutation/Table.hs:58:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
58 | p // zipWith (\i j -> (j,p!i)) cyc (tail (cyc++cyc))
| ^^^^
[ 8 of 97] Compiling NumericPrelude.Elementwise ( src/NumericPrelude/Elementwise.hs, dist/build/NumericPrelude/Elementwise.o, dist/build/NumericPrelude/Elementwise.dyn_o )
src/NumericPrelude/Elementwise.hs:3:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
3 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[ 9 of 97] Compiling Algebra.EqualityDecision ( src/Algebra/EqualityDecision.hs, dist/build/Algebra/EqualityDecision.o, dist/build/Algebra/EqualityDecision.dyn_o )
src/Algebra/EqualityDecision.hs:25:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
25 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[10 of 97] Compiling Algebra.OrderDecision ( src/Algebra/OrderDecision.hs, dist/build/Algebra/OrderDecision.o, dist/build/Algebra/OrderDecision.dyn_o )
src/Algebra/OrderDecision.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
28 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[11 of 97] Compiling Algebra.Additive ( src/Algebra/Additive.hs, dist/build/Algebra/Additive.o, dist/build/Algebra/Additive.dyn_o )
[12 of 97] Compiling Algebra.ZeroTestable ( src/Algebra/ZeroTestable.hs, dist/build/Algebra/ZeroTestable.o, dist/build/Algebra/ZeroTestable.dyn_o )
[13 of 97] Compiling NumericPrelude.List ( src/NumericPrelude/List.hs, dist/build/NumericPrelude/List.o, dist/build/NumericPrelude/List.dyn_o )
[14 of 97] Compiling Algebra.Ring ( src/Algebra/Ring.hs, dist/build/Algebra/Ring.o, dist/build/Algebra/Ring.dyn_o )
[15 of 97] Compiling Algebra.Vector ( src/Algebra/Vector.hs, dist/build/Algebra/Vector.o, dist/build/Algebra/Vector.dyn_o )
[16 of 97] Compiling Algebra.RightModule ( src/Algebra/RightModule.hs, dist/build/Algebra/RightModule.o, dist/build/Algebra/RightModule.dyn_o )
[17 of 97] Compiling Algebra.Monoid ( src/Algebra/Monoid.hs, dist/build/Algebra/Monoid.o, dist/build/Algebra/Monoid.dyn_o )
[18 of 97] Compiling MathObj.Algebra ( src/MathObj/Algebra.hs, dist/build/MathObj/Algebra.o, dist/build/MathObj/Algebra.dyn_o )
[19 of 97] Compiling Algebra.NonNegative ( src/Algebra/NonNegative.hs, dist/build/Algebra/NonNegative.o, dist/build/Algebra/NonNegative.dyn_o )
[20 of 97] Compiling Algebra.IntegralDomain ( src/Algebra/IntegralDomain.hs, dist/build/Algebra/IntegralDomain.o, dist/build/Algebra/IntegralDomain.dyn_o )
[21 of 97] Compiling Algebra.Units ( src/Algebra/Units.hs, dist/build/Algebra/Units.o, dist/build/Algebra/Units.dyn_o )
[22 of 97] Compiling Algebra.PrincipalIdealDomain ( src/Algebra/PrincipalIdealDomain.hs, dist/build/Algebra/PrincipalIdealDomain.o, dist/build/Algebra/PrincipalIdealDomain.dyn_o )
[23 of 97] Compiling MathObj.Monoid ( src/MathObj/Monoid.hs, dist/build/MathObj/Monoid.o, dist/build/MathObj/Monoid.dyn_o )
[24 of 97] Compiling Algebra.Differential ( src/Algebra/Differential.hs, dist/build/Algebra/Differential.o, dist/build/Algebra/Differential.dyn_o )
[25 of 97] Compiling Algebra.Absolute ( src/Algebra/Absolute.hs, dist/build/Algebra/Absolute.o, dist/build/Algebra/Absolute.dyn_o )
[26 of 97] Compiling Number.Ratio ( src/Number/Ratio.hs, dist/build/Number/Ratio.o, dist/build/Number/Ratio.dyn_o )
[27 of 97] Compiling Algebra.Field ( src/Algebra/Field.hs, dist/build/Algebra/Field.o, dist/build/Algebra/Field.dyn_o )
[28 of 97] Compiling Algebra.ToRational ( src/Algebra/ToRational.hs, dist/build/Algebra/ToRational.o, dist/build/Algebra/ToRational.dyn_o )
[29 of 97] Compiling Algebra.RealIntegral ( src/Algebra/RealIntegral.hs, dist/build/Algebra/RealIntegral.o, dist/build/Algebra/RealIntegral.dyn_o )
[30 of 97] Compiling Algebra.ToInteger ( src/Algebra/ToInteger.hs, dist/build/Algebra/ToInteger.o, dist/build/Algebra/ToInteger.dyn_o )
[31 of 97] Compiling Algebra.Module ( src/Algebra/Module.hs, dist/build/Algebra/Module.o, dist/build/Algebra/Module.dyn_o )
[32 of 97] Compiling Algebra.VectorSpace ( src/Algebra/VectorSpace.hs, dist/build/Algebra/VectorSpace.o, dist/build/Algebra/VectorSpace.dyn_o )
[33 of 97] Compiling Algebra.DivisibleSpace ( src/Algebra/DivisibleSpace.hs, dist/build/Algebra/DivisibleSpace.o, dist/build/Algebra/DivisibleSpace.dyn_o )
[34 of 97] Compiling Algebra.ModuleBasis ( src/Algebra/ModuleBasis.hs, dist/build/Algebra/ModuleBasis.o, dist/build/Algebra/ModuleBasis.dyn_o )
[35 of 97] Compiling Algebra.Algebraic ( src/Algebra/Algebraic.hs, dist/build/Algebra/Algebraic.o, dist/build/Algebra/Algebraic.dyn_o )
[36 of 97] Compiling Algebra.Transcendental ( src/Algebra/Transcendental.hs, dist/build/Algebra/Transcendental.o, dist/build/Algebra/Transcendental.dyn_o )
[37 of 97] Compiling Algebra.RealRing ( src/Algebra/RealRing.hs, dist/build/Algebra/RealRing.o, dist/build/Algebra/RealRing.dyn_o )
src/Algebra/RealRing.hs:639:5: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type ([(a, b)], [(a, b)]) not matched: (_, [])
|
639 | (\(ps,u:_) ->
| ^^^^^^^^^^^^...
[38 of 97] Compiling Algebra.RealField ( src/Algebra/RealField.hs, dist/build/Algebra/RealField.o, dist/build/Algebra/RealField.dyn_o )
[39 of 97] Compiling Algebra.RealTranscendental ( src/Algebra/RealTranscendental.hs, dist/build/Algebra/RealTranscendental.o, dist/build/Algebra/RealTranscendental.dyn_o )
[40 of 97] Compiling Algebra.FloatingPoint ( src/Algebra/FloatingPoint.hs, dist/build/Algebra/FloatingPoint.o, dist/build/Algebra/FloatingPoint.dyn_o )
[41 of 97] Compiling MathObj.Wrapper.Haskell98 ( src/MathObj/Wrapper/Haskell98.hs, dist/build/MathObj/Wrapper/Haskell98.o, dist/build/MathObj/Wrapper/Haskell98.dyn_o )
[42 of 97] Compiling NumericPrelude.List.Checked ( src/NumericPrelude/List/Checked.hs, dist/build/NumericPrelude/List/Checked.o, dist/build/NumericPrelude/List/Checked.dyn_o )
[43 of 97] Compiling NumericPrelude.List.Generic ( src/NumericPrelude/List/Generic.hs, dist/build/NumericPrelude/List/Generic.o, dist/build/NumericPrelude/List/Generic.dyn_o )
[44 of 97] Compiling NumericPrelude.Numeric ( src/NumericPrelude/Numeric.hs, dist/build/NumericPrelude/Numeric.o, dist/build/NumericPrelude/Numeric.dyn_o )
[45 of 97] Compiling Number.ResidueClass ( src/Number/ResidueClass.hs, dist/build/Number/ResidueClass.o, dist/build/Number/ResidueClass.dyn_o )
[46 of 97] Compiling Number.ResidueClass.Reader ( src/Number/ResidueClass/Reader.hs, dist/build/Number/ResidueClass/Reader.o, dist/build/Number/ResidueClass/Reader.dyn_o )
[47 of 97] Compiling Number.ResidueClass.Maybe ( src/Number/ResidueClass/Maybe.hs, dist/build/Number/ResidueClass/Maybe.o, dist/build/Number/ResidueClass/Maybe.dyn_o )
[48 of 97] Compiling Number.ResidueClass.Func ( src/Number/ResidueClass/Func.hs, dist/build/Number/ResidueClass/Func.o, dist/build/Number/ResidueClass/Func.dyn_o )
[49 of 97] Compiling Number.ResidueClass.Check ( src/Number/ResidueClass/Check.hs, dist/build/Number/ResidueClass/Check.o, dist/build/Number/ResidueClass/Check.dyn_o )
[50 of 97] Compiling Number.Peano ( src/Number/Peano.hs, dist/build/Number/Peano.o, dist/build/Number/Peano.dyn_o )
[51 of 97] Compiling Number.PartiallyTranscendental ( src/Number/PartiallyTranscendental.hs, dist/build/Number/PartiallyTranscendental.o, dist/build/Number/PartiallyTranscendental.dyn_o )
src/Number/PartiallyTranscendental.hs:62:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {0}
|
62 | exp = \0 -> 1
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:63:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {0}
|
63 | sin = \0 -> 0
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:64:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {0}
|
64 | cos = \0 -> 1
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:65:11: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {0}
|
65 | tan = \0 -> 0
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:69:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {1}
|
69 | log = \1 -> 0
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:70:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {0}
|
70 | asin = \0 -> 0
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:71:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {1}
|
71 | acos = \1 -> 0
| ^^^^^^^
src/Number/PartiallyTranscendental.hs:72:12: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type T a not matched: p where p is not one of {0}
|
72 | atan = \0 -> 0
| ^^^^^^^
[52 of 97] Compiling Number.NonNegativeChunky ( src/Number/NonNegativeChunky.hs, dist/build/Number/NonNegativeChunky.o, dist/build/Number/NonNegativeChunky.dyn_o )
[53 of 97] Compiling Number.NonNegative ( src/Number/NonNegative.hs, dist/build/Number/NonNegative.o, dist/build/Number/NonNegative.dyn_o )
[54 of 97] Compiling Number.GaloisField2p32m5 ( src/Number/GaloisField2p32m5.hs, dist/build/Number/GaloisField2p32m5.o, dist/build/Number/GaloisField2p32m5.dyn_o )
[55 of 97] Compiling MathObj.Polynomial.Core ( src/MathObj/Polynomial/Core.hs, dist/build/MathObj/Polynomial/Core.o, dist/build/MathObj/Polynomial/Core.dyn_o )
src/MathObj/Polynomial/Core.hs:156:30: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [a] not matched: []
|
156 | mul xs = foldr (\y zs -> let (v:vs) = scale y xs in v : add vs zs) []
| ^^^^^^^^^^^^^^^^^^^
src/MathObj/Polynomial/Core.hs:201:25: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [a] not matched: []
|
201 | let (x0:xs) = xs'
| ^^^^^^^^^^^^^
[56 of 97] Compiling MathObj.PowerSeries.Core ( src/MathObj/PowerSeries/Core.hs, dist/build/MathObj/PowerSeries/Core.o, dist/build/MathObj/PowerSeries/Core.dyn_o )
src/MathObj/PowerSeries/Core.hs:167:30: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
167 | in if null y0 || isZero (head y0)
| ^^^^
src/MathObj/PowerSeries/Core.hs:224:28: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
224 | let y = integrate (f0 (head x)) y'
| ^^^^
src/MathObj/PowerSeries/Core.hs:244:28: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
244 | y = integrate (f0 (head x)) (mul y x')
| ^^^^
src/MathObj/PowerSeries/Core.hs:249:29: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
249 | let (y0Sin, y0Cos) = f0 (head x)
| ^^^^
src/MathObj/PowerSeries/Core.hs:294:27: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
294 | log f0 x = integrate (f0 (head x)) (derivedLog x)
| ^^^^
src/MathObj/PowerSeries/Core.hs:310:23: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
310 | in integrate (f0 (head x)) (divide x' ([1] + mul x x))
| ^^^^
src/MathObj/PowerSeries/Core.hs:320:23: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
320 | in integrate (f0 (head x))
| ^^^^
src/MathObj/PowerSeries/Core.hs:403:52: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
403 | let y' = divide [1] (compose (differentiate x) (tail y))
| ^^^^
src/MathObj/PowerSeries/Core.hs:406:9: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
406 | in (head x, y)
| ^^^^
[57 of 97] Compiling MathObj.PowerSeries.Example ( src/MathObj/PowerSeries/Example.hs, dist/build/MathObj/PowerSeries/Example.o, dist/build/MathObj/PowerSeries/Example.dyn_o )
src/MathObj/PowerSeries/Example.hs:71:38: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
71 | sinExpl = zero : PS.holes2alternate (tail expExpl)
| ^^^^
src/MathObj/PowerSeries/Example.hs:85:28: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
85 | (PS.divide (sieve 2 (tail sin)) (sieve 2 cos))
| ^^^^
src/MathObj/PowerSeries/Example.hs:96:31: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
96 | sinhExpl = zero : PS.holes2 (tail expExpl)
| ^^^^
src/MathObj/PowerSeries/Example.hs:153:19: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
153 | let tan2 = map head (iterate (drop 2) (tail tanODESieve))
| ^^^^
src/MathObj/PowerSeries/Example.hs:153:43: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
153 | let tan2 = map head (iterate (drop 2) (tail tanODESieve))
| ^^^^
[58 of 97] Compiling Number.FixedPoint ( src/Number/FixedPoint.hs, dist/build/Number/FixedPoint.o, dist/build/Number/FixedPoint.dyn_o )
src/Number/FixedPoint.hs:135:24: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
135 | initial = fst (head (dropWhile ((<= xden) . snd)
| ^^^^
src/Number/FixedPoint.hs:136:50: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
136 | (zip magnitudes (tail (tail magnitudes)))))
| ^^^^
src/Number/FixedPoint.hs:136:56: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
136 | (zip magnitudes (tail (tail magnitudes)))))
| ^^^^
src/Number/FixedPoint.hs:139:8: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
139 | in head (dropWhile (not . isRoot) approxs)
| ^^^^
src/Number/FixedPoint.hs:146:24: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
146 | initial = fst (head (dropWhile ((\y -> y^n <= xden) . snd)
| ^^^^
src/Number/FixedPoint.hs:147:50: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
147 | (zip magnitudes (tail magnitudes))))
| ^^^^
src/Number/FixedPoint.hs:150:8: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
150 | in head (dropWhile (not . isRoot) approxs)
| ^^^^
[59 of 97] Compiling Number.FixedPoint.Check ( src/Number/FixedPoint/Check.hs, dist/build/Number/FixedPoint/Check.o, dist/build/Number/FixedPoint/Check.dyn_o )
[60 of 97] Compiling MathObj.PowerSeries.DifferentialEquation ( src/MathObj/PowerSeries/DifferentialEquation.hs, dist/build/MathObj/PowerSeries/DifferentialEquation.o, dist/build/MathObj/PowerSeries/DifferentialEquation.dyn_o )
[61 of 97] Compiling MathObj.PowerSeries ( src/MathObj/PowerSeries.hs, dist/build/MathObj/PowerSeries.o, dist/build/MathObj/PowerSeries.dyn_o )
[62 of 97] Compiling MathObj.PowerSeries2.Core ( src/MathObj/PowerSeries2/Core.hs, dist/build/MathObj/PowerSeries2/Core.o, dist/build/MathObj/PowerSeries2/Core.dyn_o )
src/MathObj/PowerSeries2/Core.hs:59:29: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type [a] not matched:
[]
(_:_:_)
|
59 | PSCore.sqrt (PS.const . (\[x] -> fSqRt x) . PS.coeffs)
| ^^^^^^^^^^^^^^^
src/MathObj/PowerSeries2/Core.hs:65:28: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type [a] not matched:
[]
(_:_:_)
|
65 | PSCore.pow (PS.const . (\[x] -> fPow x) . PS.coeffs) (PS.const expon)
| ^^^^^^^^^^^^^^
[63 of 97] Compiling MathObj.PowerSeries2 ( src/MathObj/PowerSeries2.hs, dist/build/MathObj/PowerSeries2.o, dist/build/MathObj/PowerSeries2.dyn_o )
[64 of 97] Compiling MathObj.PowerSeries.Mean ( src/MathObj/PowerSeries/Mean.hs, dist/build/MathObj/PowerSeries/Mean.o, dist/build/MathObj/PowerSeries/Mean.dyn_o )
src/MathObj/PowerSeries/Mean.hs:78:29: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
78 | map sum (shearTranspose (tail (zipWith PSCore.scale ys
| ^^^^
src/MathObj/PowerSeries/Mean.hs:79:26: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
79 | (map tail (iterate (PSCore.mul x) [1])))))
| ^^^^
src/MathObj/PowerSeries/Mean.hs:93:24: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
93 | (tail (zipWith (*) (iterate (2*) 1) PSE.log))
| ^^^^
src/MathObj/PowerSeries/Mean.hs:94:34: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
94 | fDiffFracLn = diffComp f (tail fracLn)
| ^^^^
src/MathObj/PowerSeries/Mean.hs:103:32: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
103 | fDiffRoot = diffComp f (tail root)
| ^^^^
src/MathObj/PowerSeries/Mean.hs:123:26: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type a not matched: p where p is not one of {1}
|
123 | quadratic = PSCore.sqrt (\1 -> 1) [1,1,1/2]
| ^^^^^^^
src/MathObj/PowerSeries/Mean.hs:143:20: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
143 | let divDiffPS = tail quadraticMVF -- (f(1+t)-f(1))/((1+t)-1)
| ^^^^
src/MathObj/PowerSeries/Mean.hs:144:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type (a, [a]) not matched:
(p, _) where p is not one of {1}
|
144 | (1, invPS) = PSCore.inv (PSCore.differentiate quadraticMVF)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/MathObj/PowerSeries/Mean.hs:145:44: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type a not matched: p where p is not one of {1}
|
145 | meanValuePS = PSCore.composeTaylor (\1 -> invPS) divDiffPS
| ^^^^^^^^^^^
src/MathObj/PowerSeries/Mean.hs:158:18: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type a not matched: p where p is not one of {1}
|
158 | PS2Core.sqrt (\1 -> 1) [[1],[1,1],[1/2,0,1/2]]
| ^^^^^^^
src/MathObj/PowerSeries/Mean.hs:217:18: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type a not matched: p where p is not one of {1}
|
217 | PS2Core.sqrt (\1 -> 1) [[1],[1,1],[0,1,0]]
| ^^^^^^^
src/MathObj/PowerSeries/Mean.hs:231:37: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
231 | zipWith replicate [1..] $ tail curve
| ^^^^
src/MathObj/PowerSeries/Mean.hs:233:57: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
233 | PS2Core.compose (PSCore.differentiate curve) (tail mean2)
| ^^^^
[65 of 97] Compiling MathObj.Polynomial ( src/MathObj/Polynomial.hs, dist/build/MathObj/Polynomial.o, dist/build/MathObj/Polynomial.dyn_o )
[66 of 97] Compiling MathObj.RefinementMask2 ( src/MathObj/RefinementMask2.hs, dist/build/MathObj/RefinementMask2.o, dist/build/MathObj/RefinementMask2.dyn_o )
src/MathObj/RefinementMask2.hs:188:8: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
188 | in head (Poly.coeffs refined) / (1 - sum (coeffs mask))
| ^^^^
src/MathObj/RefinementMask2.hs:201:28: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
201 | c = head (Poly.coeffs (refinePolynomial mask ip))
| ^^^^
[67 of 97] Compiling MathObj.PowerSum ( src/MathObj/PowerSum.hs, dist/build/MathObj/PowerSum.o, dist/build/MathObj/PowerSum.dyn_o )
src/MathObj/PowerSum.hs:111:47: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
111 | let s' = PolyCore.mul (PolyCore.alternate (tail p)) s
| ^^^^
src/MathObj/PowerSum.hs:117:47: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
117 | let s' = PolyCore.mul (PolyCore.alternate (tail p)) s
| ^^^^
[68 of 97] Compiling MathObj.RootSet ( src/MathObj/RootSet.hs, dist/build/MathObj/RootSet.o, dist/build/MathObj/RootSet.dyn_o )
src/MathObj/RootSet.hs:93:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
93 | Match.take (undefined : liftM2 (,) (tail x) (tail y))
| ^^^^
src/MathObj/RootSet.hs:93:49: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
93 | Match.take (undefined : liftM2 (,) (tail x) (tail y))
| ^^^^
[69 of 97] Compiling Number.Root ( src/Number/Root.hs, dist/build/Number/Root.o, dist/build/Number/Root.dyn_o )
[70 of 97] Compiling MathObj.Permutation.CycleList ( src/MathObj/Permutation/CycleList.hs, dist/build/MathObj/Permutation/CycleList.o, dist/build/MathObj/Permutation/CycleList.dyn_o )
src/MathObj/Permutation/CycleList.hs:53:34: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
53 | case dropWhile (x/=) (cyc ++ [head cyc]) of
| ^^^^
[71 of 97] Compiling MathObj.Permutation.CycleList.Check ( src/MathObj/Permutation/CycleList/Check.hs, dist/build/MathObj/Permutation/CycleList/Check.o, dist/build/MathObj/Permutation/CycleList/Check.dyn_o )
[72 of 97] Compiling MathObj.PartialFraction ( src/MathObj/PartialFraction.hs, dist/build/MathObj/PartialFraction.o, dist/build/MathObj/PartialFraction.dyn_o )
src/MathObj/PartialFraction.hs:207:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [a] not matched: []
|
207 | (prod:partProdRight) = scanr (*) one denomPowers
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/MathObj/PartialFraction.hs:247:33: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a lambda abstraction:
Patterns of type a, [a] not matched: _ []
|
247 | let m1 = indexMapMapWithKey (\x (y:ys) -> let (q,r) = divMod y x in (q,r:ys)) m0
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/MathObj/PartialFraction.hs:378:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type [a] not matched:
[]
[_]
[_, _]
(_:_:_:_:_)
|
378 | [a,b,c] =
| ^^^^^^^^^...
[73 of 97] Compiling MathObj.Matrix ( src/MathObj/Matrix.hs, dist/build/MathObj/Matrix.o, dist/build/MathObj/Matrix.dyn_o )
[74 of 97] Compiling Algebra.OccasionallyScalar ( src/Algebra/OccasionallyScalar.hs, dist/build/Algebra/OccasionallyScalar.o, dist/build/Algebra/OccasionallyScalar.dyn_o )
[75 of 97] Compiling Number.OccasionallyScalarExpression ( src/Number/OccasionallyScalarExpression.hs, dist/build/Number/OccasionallyScalarExpression.o, dist/build/Number/OccasionallyScalarExpression.dyn_o )
[76 of 97] Compiling Number.DimensionTerm ( src/Number/DimensionTerm.hs, dist/build/Number/DimensionTerm.o, dist/build/Number/DimensionTerm.dyn_o )
[77 of 97] Compiling Algebra.NormedSpace.Sum ( src/Algebra/NormedSpace/Sum.hs, dist/build/Algebra/NormedSpace/Sum.o, dist/build/Algebra/NormedSpace/Sum.dyn_o )
[78 of 97] Compiling Algebra.NormedSpace.Maximum ( src/Algebra/NormedSpace/Maximum.hs, dist/build/Algebra/NormedSpace/Maximum.o, dist/build/Algebra/NormedSpace/Maximum.dyn_o )
[79 of 97] Compiling Algebra.NormedSpace.Euclidean ( src/Algebra/NormedSpace/Euclidean.hs, dist/build/Algebra/NormedSpace/Euclidean.o, dist/build/Algebra/NormedSpace/Euclidean.dyn_o )
[80 of 97] Compiling Number.Complex ( src/Number/Complex.hs, dist/build/Number/Complex.o, dist/build/Number/Complex.dyn_o )
[81 of 97] Compiling Number.Quaternion ( src/Number/Quaternion.hs, dist/build/Number/Quaternion.o, dist/build/Number/Quaternion.dyn_o )
src/Number/Quaternion.hs:217:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type [a] not matched:
[]
[_]
[_, _]
[_, _, _]
...
|
217 | [ar,br,cr,dr] = map Complex.real xs
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Number/Quaternion.hs:218:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type [a] not matched:
[]
[_]
[_, _]
[_, _, _]
...
|
218 | [ai,bi,ci,di] = map Complex.imag xs
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[82 of 97] Compiling MathObj.LaurentPolynomial ( src/MathObj/LaurentPolynomial.hs, dist/build/MathObj/LaurentPolynomial.o, dist/build/MathObj/LaurentPolynomial.dyn_o )
src/MathObj/LaurentPolynomial.hs:52:11: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
52 | else head (drop (n-xt) x ++ [zero])
| ^^^^
src/MathObj/LaurentPolynomial.hs:116:14: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
116 | in Cons (head es) (addShiftedMany ds xs)
| ^^^^
[83 of 97] Compiling Number.Positional ( src/Number/Positional.hs, dist/build/Number/Positional.o, dist/build/Number/Positional.dyn_o )
src/Number/Positional.hs:118:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type ([Digit], [Digit]) not matched: ([], _)
|
118 | let (hi:his,los) = unzip (map (moveToZero b) xm)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Number/Positional.hs:171:31: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
171 | not (null xm || head xm == 0)) trimOnce
| ^^^^
src/Number/Positional.hs:429:15: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type (Int, Mantissa) not matched: (_, [])
|
429 | let (newMag,y:ys) =
| ^^^^^^^^^^^^^^^...
src/Number/Positional.hs:666:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type ([Exponent], [Mantissa]) not matched: (_, [])
|
666 | let (es,m:ms) = unzip (map (uncurry (align b)) summands)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Number/Positional.hs:686:20: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
686 | in compress b (head es, concat chunks ++ trailingDigits)
| ^^^^
src/Number/Positional.hs:716:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
716 | let (ys, zs) = splitAtMatchPadZero (tail n) xs
| ^^^^
src/Number/Positional.hs:748:55: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
748 | zs = zipWith (\xd e -> scale b xd (e,ym)) xm (tail zes)
| ^^^^
src/Number/Positional.hs:772:39: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
772 | let (ye,ym) = until ((>=b) . abs . head . snd)
| ^^^^
src/Number/Positional.hs:785:21: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
785 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:785:31: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
785 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:802:21: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
802 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:802:31: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
802 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:830:14: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
830 | map fst . tail .
| ^^^^
src/Number/Positional.hs:855:8: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding:
Patterns of type (Exponent, Mantissa) not matched: (_, [])
|
855 | let (exe,ex0:exm) = if odd (fst x) then decreaseExp b x else x
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
src/Number/Positional.hs:901:25: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
901 | let yj = div (head dif + y0) (2*y0)
| ^^^^
src/Number/Positional.hs:962:47: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
962 | y0 (zip basisPowers (tail truncXs))
| ^^^^
src/Number/Positional.hs:985:1: warning: [GHC-62161] [-Wincomplete-uni-patterns]
Pattern match(es) are non-exhaustive
In a pattern binding: Patterns of type [a] not matched: []
|
985 | lazyInits ~(x:xs) = [] : map (x:) (lazyInits xs)
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[84 of 97] Compiling Number.Positional.Check ( src/Number/Positional/Check.hs, dist/build/Number/Positional/Check.o, dist/build/Number/Positional/Check.dyn_o )
src/Number/Positional/Check.hs:72:27: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
72 | in prependDigit (fst (head ys)) (Cons b ex digits)
| ^^^^
[85 of 97] Compiling MathObj.Wrapper.NumericPrelude ( src/MathObj/Wrapper/NumericPrelude.hs, dist/build/MathObj/Wrapper/NumericPrelude.o, dist/build/MathObj/Wrapper/NumericPrelude.dyn_o )
[86 of 97] Compiling MathObj.DiscreteMap ( src/MathObj/DiscreteMap.hs, dist/build/MathObj/DiscreteMap.o, dist/build/MathObj/DiscreteMap.dyn_o )
[87 of 97] Compiling Number.Physical.Unit ( src/Number/Physical/Unit.hs, dist/build/Number/Physical/Unit.o, dist/build/Number/Physical/Unit.dyn_o )
[88 of 97] Compiling Number.Physical.UnitDatabase ( src/Number/Physical/UnitDatabase.hs, dist/build/Number/Physical/UnitDatabase.o, dist/build/Number/Physical/UnitDatabase.dyn_o )
[89 of 97] Compiling Number.SI.Unit ( src/Number/SI/Unit.hs, dist/build/Number/SI/Unit.o, dist/build/Number/SI/Unit.dyn_o )
[90 of 97] Compiling Number.DimensionTerm.SI ( src/Number/DimensionTerm/SI.hs, dist/build/Number/DimensionTerm/SI.o, dist/build/Number/DimensionTerm/SI.dyn_o )
[91 of 97] Compiling Number.Physical ( src/Number/Physical.hs, dist/build/Number/Physical.o, dist/build/Number/Physical.dyn_o )
[92 of 97] Compiling Number.Physical.Show ( src/Number/Physical/Show.hs, dist/build/Number/Physical/Show.o, dist/build/Number/Physical/Show.dyn_o )
[93 of 97] Compiling Number.Physical.Read ( src/Number/Physical/Read.hs, dist/build/Number/Physical/Read.o, dist/build/Number/Physical/Read.dyn_o )
[94 of 97] Compiling Number.SI ( src/Number/SI.hs, dist/build/Number/SI.o, dist/build/Number/SI.dyn_o )
[95 of 97] Compiling Algebra.Lattice ( src/Algebra/Lattice.hs, dist/build/Algebra/Lattice.o, dist/build/Algebra/Lattice.dyn_o )
[96 of 97] Compiling NumericPrelude ( src/NumericPrelude.hs, dist/build/NumericPrelude.o, dist/build/NumericPrelude.dyn_o )
[97 of 97] Compiling Algebra.AffineSpace ( src/Algebra/AffineSpace.hs, dist/build/Algebra/AffineSpace.o, dist/build/Algebra/AffineSpace.dyn_o )
Preprocessing library for numeric-prelude-0.4.4..
Running Haddock on library for numeric-prelude-0.4.4..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 97] Compiling Algebra.DimensionTerm ( src/Algebra/DimensionTerm.hs, nothing )
[ 2 of 97] Compiling Algebra.Indexable ( src/Algebra/Indexable.hs, nothing )
[ 3 of 97] Compiling Algebra.Laws ( src/Algebra/Laws.hs, nothing )
[ 4 of 97] Compiling Algebra.RealRing98 ( src/Algebra/RealRing98.hs, nothing )
[ 5 of 97] Compiling MathObj.Permutation ( src/MathObj/Permutation.hs, nothing )
[ 6 of 97] Compiling NumericPrelude.Base ( src/NumericPrelude/Base.hs, nothing )
[ 7 of 97] Compiling MathObj.Permutation.Table ( src/MathObj/Permutation/Table.hs, nothing )
src/MathObj/Permutation/Table.hs:58:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
58 | p // zipWith (\i j -> (j,p!i)) cyc (tail (cyc++cyc))
| ^^^^
[ 8 of 97] Compiling NumericPrelude.Elementwise ( src/NumericPrelude/Elementwise.hs, nothing )
src/NumericPrelude/Elementwise.hs:3:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
3 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[ 9 of 97] Compiling Algebra.EqualityDecision ( src/Algebra/EqualityDecision.hs, nothing )
src/Algebra/EqualityDecision.hs:25:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
25 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[10 of 97] Compiling Algebra.OrderDecision ( src/Algebra/OrderDecision.hs, nothing )
src/Algebra/OrderDecision.hs:28:1: warning: [GHC-66111] [-Wunused-imports]
The import of Control.Applicative is redundant
except perhaps to import instances from Control.Applicative
To import instances alone, use: import Control.Applicative()
|
28 | import Control.Applicative (Applicative(pure, (<*>)), )
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[11 of 97] Compiling Algebra.Additive ( src/Algebra/Additive.hs, nothing )
[12 of 97] Compiling Algebra.ZeroTestable ( src/Algebra/ZeroTestable.hs, nothing )
[13 of 97] Compiling NumericPrelude.List ( src/NumericPrelude/List.hs, nothing )
[14 of 97] Compiling Algebra.Ring ( src/Algebra/Ring.hs, nothing )
[15 of 97] Compiling Algebra.Vector ( src/Algebra/Vector.hs, nothing )
[16 of 97] Compiling Algebra.RightModule ( src/Algebra/RightModule.hs, nothing )
[17 of 97] Compiling Algebra.Monoid ( src/Algebra/Monoid.hs, nothing )
[18 of 97] Compiling MathObj.Algebra ( src/MathObj/Algebra.hs, nothing )
[19 of 97] Compiling Algebra.NonNegative ( src/Algebra/NonNegative.hs, nothing )
[20 of 97] Compiling Algebra.IntegralDomain ( src/Algebra/IntegralDomain.hs, nothing )
[21 of 97] Compiling Algebra.Units ( src/Algebra/Units.hs, nothing )
[22 of 97] Compiling Algebra.PrincipalIdealDomain ( src/Algebra/PrincipalIdealDomain.hs, nothing )
[23 of 97] Compiling MathObj.Monoid ( src/MathObj/Monoid.hs, nothing )
[24 of 97] Compiling Algebra.Differential ( src/Algebra/Differential.hs, nothing )
[25 of 97] Compiling Algebra.Absolute ( src/Algebra/Absolute.hs, nothing )
[26 of 97] Compiling Number.Ratio ( src/Number/Ratio.hs, nothing )
[27 of 97] Compiling Algebra.Field ( src/Algebra/Field.hs, nothing )
[28 of 97] Compiling Algebra.ToRational ( src/Algebra/ToRational.hs, nothing )
[29 of 97] Compiling Algebra.RealIntegral ( src/Algebra/RealIntegral.hs, nothing )
[30 of 97] Compiling Algebra.ToInteger ( src/Algebra/ToInteger.hs, nothing )
[31 of 97] Compiling Algebra.Module ( src/Algebra/Module.hs, nothing )
[32 of 97] Compiling Algebra.VectorSpace ( src/Algebra/VectorSpace.hs, nothing )
[33 of 97] Compiling Algebra.DivisibleSpace ( src/Algebra/DivisibleSpace.hs, nothing )
[34 of 97] Compiling Algebra.ModuleBasis ( src/Algebra/ModuleBasis.hs, nothing )
[35 of 97] Compiling Algebra.Algebraic ( src/Algebra/Algebraic.hs, nothing )
[36 of 97] Compiling Algebra.Transcendental ( src/Algebra/Transcendental.hs, nothing )
[37 of 97] Compiling Algebra.RealRing ( src/Algebra/RealRing.hs, nothing )
[38 of 97] Compiling Algebra.RealField ( src/Algebra/RealField.hs, nothing )
[39 of 97] Compiling Algebra.RealTranscendental ( src/Algebra/RealTranscendental.hs, nothing )
[40 of 97] Compiling Algebra.FloatingPoint ( src/Algebra/FloatingPoint.hs, nothing )
[41 of 97] Compiling MathObj.Wrapper.Haskell98 ( src/MathObj/Wrapper/Haskell98.hs, nothing )
[42 of 97] Compiling NumericPrelude.List.Checked ( src/NumericPrelude/List/Checked.hs, nothing )
[43 of 97] Compiling NumericPrelude.List.Generic ( src/NumericPrelude/List/Generic.hs, nothing )
[44 of 97] Compiling NumericPrelude.Numeric ( src/NumericPrelude/Numeric.hs, nothing )
[45 of 97] Compiling Number.ResidueClass ( src/Number/ResidueClass.hs, nothing )
[46 of 97] Compiling Number.ResidueClass.Reader ( src/Number/ResidueClass/Reader.hs, nothing )
[47 of 97] Compiling Number.ResidueClass.Maybe ( src/Number/ResidueClass/Maybe.hs, nothing )
[48 of 97] Compiling Number.ResidueClass.Func ( src/Number/ResidueClass/Func.hs, nothing )
[49 of 97] Compiling Number.ResidueClass.Check ( src/Number/ResidueClass/Check.hs, nothing )
[50 of 97] Compiling Number.Peano ( src/Number/Peano.hs, nothing )
[51 of 97] Compiling Number.PartiallyTranscendental ( src/Number/PartiallyTranscendental.hs, nothing )
[52 of 97] Compiling Number.NonNegativeChunky ( src/Number/NonNegativeChunky.hs, nothing )
[53 of 97] Compiling Number.NonNegative ( src/Number/NonNegative.hs, nothing )
[54 of 97] Compiling Number.GaloisField2p32m5 ( src/Number/GaloisField2p32m5.hs, nothing )
[55 of 97] Compiling MathObj.Polynomial.Core ( src/MathObj/Polynomial/Core.hs, nothing )
[56 of 97] Compiling MathObj.PowerSeries.Core ( src/MathObj/PowerSeries/Core.hs, nothing )
src/MathObj/PowerSeries/Core.hs:167:30: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
167 | in if null y0 || isZero (head y0)
| ^^^^
src/MathObj/PowerSeries/Core.hs:224:28: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
224 | let y = integrate (f0 (head x)) y'
| ^^^^
src/MathObj/PowerSeries/Core.hs:244:28: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
244 | y = integrate (f0 (head x)) (mul y x')
| ^^^^
src/MathObj/PowerSeries/Core.hs:249:29: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
249 | let (y0Sin, y0Cos) = f0 (head x)
| ^^^^
src/MathObj/PowerSeries/Core.hs:294:27: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
294 | log f0 x = integrate (f0 (head x)) (derivedLog x)
| ^^^^
src/MathObj/PowerSeries/Core.hs:310:23: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
310 | in integrate (f0 (head x)) (divide x' ([1] + mul x x))
| ^^^^
src/MathObj/PowerSeries/Core.hs:320:23: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
320 | in integrate (f0 (head x))
| ^^^^
src/MathObj/PowerSeries/Core.hs:403:52: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
403 | let y' = divide [1] (compose (differentiate x) (tail y))
| ^^^^
src/MathObj/PowerSeries/Core.hs:406:9: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
406 | in (head x, y)
| ^^^^
[57 of 97] Compiling MathObj.PowerSeries.Example ( src/MathObj/PowerSeries/Example.hs, nothing )
src/MathObj/PowerSeries/Example.hs:71:38: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
71 | sinExpl = zero : PS.holes2alternate (tail expExpl)
| ^^^^
src/MathObj/PowerSeries/Example.hs:85:28: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
85 | (PS.divide (sieve 2 (tail sin)) (sieve 2 cos))
| ^^^^
src/MathObj/PowerSeries/Example.hs:96:31: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
96 | sinhExpl = zero : PS.holes2 (tail expExpl)
| ^^^^
src/MathObj/PowerSeries/Example.hs:153:19: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
153 | let tan2 = map head (iterate (drop 2) (tail tanODESieve))
| ^^^^
src/MathObj/PowerSeries/Example.hs:153:43: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
153 | let tan2 = map head (iterate (drop 2) (tail tanODESieve))
| ^^^^
[58 of 97] Compiling Number.FixedPoint ( src/Number/FixedPoint.hs, nothing )
src/Number/FixedPoint.hs:135:24: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
135 | initial = fst (head (dropWhile ((<= xden) . snd)
| ^^^^
src/Number/FixedPoint.hs:136:50: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
136 | (zip magnitudes (tail (tail magnitudes)))))
| ^^^^
src/Number/FixedPoint.hs:136:56: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
136 | (zip magnitudes (tail (tail magnitudes)))))
| ^^^^
src/Number/FixedPoint.hs:139:8: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
139 | in head (dropWhile (not . isRoot) approxs)
| ^^^^
src/Number/FixedPoint.hs:146:24: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
146 | initial = fst (head (dropWhile ((\y -> y^n <= xden) . snd)
| ^^^^
src/Number/FixedPoint.hs:147:50: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
147 | (zip magnitudes (tail magnitudes))))
| ^^^^
src/Number/FixedPoint.hs:150:8: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
150 | in head (dropWhile (not . isRoot) approxs)
| ^^^^
[59 of 97] Compiling Number.FixedPoint.Check ( src/Number/FixedPoint/Check.hs, nothing )
[60 of 97] Compiling MathObj.PowerSeries.DifferentialEquation ( src/MathObj/PowerSeries/DifferentialEquation.hs, nothing )
[61 of 97] Compiling MathObj.PowerSeries ( src/MathObj/PowerSeries.hs, nothing )
[62 of 97] Compiling MathObj.PowerSeries2.Core ( src/MathObj/PowerSeries2/Core.hs, nothing )
[63 of 97] Compiling MathObj.PowerSeries2 ( src/MathObj/PowerSeries2.hs, nothing )
[64 of 97] Compiling MathObj.PowerSeries.Mean ( src/MathObj/PowerSeries/Mean.hs, nothing )
src/MathObj/PowerSeries/Mean.hs:78:29: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
78 | map sum (shearTranspose (tail (zipWith PSCore.scale ys
| ^^^^
src/MathObj/PowerSeries/Mean.hs:79:26: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
79 | (map tail (iterate (PSCore.mul x) [1])))))
| ^^^^
src/MathObj/PowerSeries/Mean.hs:93:24: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
93 | (tail (zipWith (*) (iterate (2*) 1) PSE.log))
| ^^^^
src/MathObj/PowerSeries/Mean.hs:94:34: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
94 | fDiffFracLn = diffComp f (tail fracLn)
| ^^^^
src/MathObj/PowerSeries/Mean.hs:103:32: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
103 | fDiffRoot = diffComp f (tail root)
| ^^^^
src/MathObj/PowerSeries/Mean.hs:143:20: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
143 | let divDiffPS = tail quadraticMVF -- (f(1+t)-f(1))/((1+t)-1)
| ^^^^
src/MathObj/PowerSeries/Mean.hs:231:37: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
231 | zipWith replicate [1..] $ tail curve
| ^^^^
src/MathObj/PowerSeries/Mean.hs:233:57: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
233 | PS2Core.compose (PSCore.differentiate curve) (tail mean2)
| ^^^^
[65 of 97] Compiling MathObj.Polynomial ( src/MathObj/Polynomial.hs, nothing )
[66 of 97] Compiling MathObj.RefinementMask2 ( src/MathObj/RefinementMask2.hs, nothing )
src/MathObj/RefinementMask2.hs:188:8: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
188 | in head (Poly.coeffs refined) / (1 - sum (coeffs mask))
| ^^^^
src/MathObj/RefinementMask2.hs:201:28: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
201 | c = head (Poly.coeffs (refinePolynomial mask ip))
| ^^^^
[67 of 97] Compiling MathObj.PowerSum ( src/MathObj/PowerSum.hs, nothing )
src/MathObj/PowerSum.hs:111:47: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
111 | let s' = PolyCore.mul (PolyCore.alternate (tail p)) s
| ^^^^
src/MathObj/PowerSum.hs:117:47: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
117 | let s' = PolyCore.mul (PolyCore.alternate (tail p)) s
| ^^^^
[68 of 97] Compiling MathObj.RootSet ( src/MathObj/RootSet.hs, nothing )
src/MathObj/RootSet.hs:93:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
93 | Match.take (undefined : liftM2 (,) (tail x) (tail y))
| ^^^^
src/MathObj/RootSet.hs:93:49: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
93 | Match.take (undefined : liftM2 (,) (tail x) (tail y))
| ^^^^
[69 of 97] Compiling Number.Root ( src/Number/Root.hs, nothing )
[70 of 97] Compiling MathObj.Permutation.CycleList ( src/MathObj/Permutation/CycleList.hs, nothing )
src/MathObj/Permutation/CycleList.hs:53:34: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
53 | case dropWhile (x/=) (cyc ++ [head cyc]) of
| ^^^^
[71 of 97] Compiling MathObj.Permutation.CycleList.Check ( src/MathObj/Permutation/CycleList/Check.hs, nothing )
[72 of 97] Compiling MathObj.PartialFraction ( src/MathObj/PartialFraction.hs, nothing )
[73 of 97] Compiling MathObj.Matrix ( src/MathObj/Matrix.hs, nothing )
[74 of 97] Compiling Algebra.OccasionallyScalar ( src/Algebra/OccasionallyScalar.hs, nothing )
[75 of 97] Compiling Number.OccasionallyScalarExpression ( src/Number/OccasionallyScalarExpression.hs, nothing )
[76 of 97] Compiling Number.DimensionTerm ( src/Number/DimensionTerm.hs, nothing )
[77 of 97] Compiling Algebra.NormedSpace.Sum ( src/Algebra/NormedSpace/Sum.hs, nothing )
[78 of 97] Compiling Algebra.NormedSpace.Maximum ( src/Algebra/NormedSpace/Maximum.hs, nothing )
[79 of 97] Compiling Algebra.NormedSpace.Euclidean ( src/Algebra/NormedSpace/Euclidean.hs, nothing )
[80 of 97] Compiling Number.Complex ( src/Number/Complex.hs, nothing )
[81 of 97] Compiling Number.Quaternion ( src/Number/Quaternion.hs, nothing )
[82 of 97] Compiling MathObj.LaurentPolynomial ( src/MathObj/LaurentPolynomial.hs, nothing )
src/MathObj/LaurentPolynomial.hs:52:11: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
52 | else head (drop (n-xt) x ++ [zero])
| ^^^^
src/MathObj/LaurentPolynomial.hs:116:14: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
116 | in Cons (head es) (addShiftedMany ds xs)
| ^^^^
[83 of 97] Compiling Number.Positional ( src/Number/Positional.hs, nothing )
src/Number/Positional.hs:171:31: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
171 | not (null xm || head xm == 0)) trimOnce
| ^^^^
src/Number/Positional.hs:686:20: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
686 | in compress b (head es, concat chunks ++ trailingDigits)
| ^^^^
src/Number/Positional.hs:716:40: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
716 | let (ys, zs) = splitAtMatchPadZero (tail n) xs
| ^^^^
src/Number/Positional.hs:748:55: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
748 | zs = zipWith (\xd e -> scale b xd (e,ym)) xm (tail zes)
| ^^^^
src/Number/Positional.hs:772:39: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
772 | let (ye,ym) = until ((>=b) . abs . head . snd)
| ^^^^
src/Number/Positional.hs:785:21: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
785 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:785:31: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
785 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:802:21: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
802 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:802:31: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
802 | let z = div (head xm) (head ym)
| ^^^^
src/Number/Positional.hs:830:14: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
830 | map fst . tail .
| ^^^^
src/Number/Positional.hs:901:25: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
901 | let yj = div (head dif + y0) (2*y0)
| ^^^^
src/Number/Positional.hs:962:47: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
962 | y0 (zip basisPowers (tail truncXs))
| ^^^^
[84 of 97] Compiling Number.Positional.Check ( src/Number/Positional/Check.hs, nothing )
src/Number/Positional/Check.hs:72:27: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude.Base, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
72 | in prependDigit (fst (head ys)) (Cons b ex digits)
| ^^^^
[85 of 97] Compiling MathObj.Wrapper.NumericPrelude ( src/MathObj/Wrapper/NumericPrelude.hs, nothing )
[86 of 97] Compiling MathObj.DiscreteMap ( src/MathObj/DiscreteMap.hs, nothing )
[87 of 97] Compiling Number.Physical.Unit ( src/Number/Physical/Unit.hs, nothing )
[88 of 97] Compiling Number.Physical.UnitDatabase ( src/Number/Physical/UnitDatabase.hs, nothing )
[89 of 97] Compiling Number.SI.Unit ( src/Number/SI/Unit.hs, nothing )
[90 of 97] Compiling Number.DimensionTerm.SI ( src/Number/DimensionTerm/SI.hs, nothing )
[91 of 97] Compiling Number.Physical ( src/Number/Physical.hs, nothing )
[92 of 97] Compiling Number.Physical.Show ( src/Number/Physical/Show.hs, nothing )
[93 of 97] Compiling Number.Physical.Read ( src/Number/Physical/Read.hs, nothing )
[94 of 97] Compiling Number.SI ( src/Number/SI.hs, nothing )
[95 of 97] Compiling Algebra.Lattice ( src/Algebra/Lattice.hs, nothing )
[96 of 97] Compiling NumericPrelude ( src/NumericPrelude.hs, nothing )
[97 of 97] Compiling Algebra.AffineSpace ( src/Algebra/AffineSpace.hs, nothing )
Haddock coverage:
Warning: 'Scalar' is ambiguous. It is defined
* at src/Algebra/DimensionTerm.hs:37:16
* at src/Algebra/DimensionTerm.hs:37:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at src/Algebra/DimensionTerm.hs:37:1
14% ( 8 / 56) in 'Algebra.DimensionTerm'
Missing documentation for:
C (src/Algebra/DimensionTerm.hs:27)
noValue (src/Algebra/DimensionTerm.hs:31)
Scalar (src/Algebra/DimensionTerm.hs:37)
Mul (src/Algebra/DimensionTerm.hs:38)
Recip (src/Algebra/DimensionTerm.hs:39)
Sqr (src/Algebra/DimensionTerm.hs:40)
appPrec (src/Algebra/DimensionTerm.hs:43)
scalar (src/Algebra/DimensionTerm.hs:73)
mul (src/Algebra/DimensionTerm.hs:76)
recip (src/Algebra/DimensionTerm.hs:79)
%*% (src/Algebra/DimensionTerm.hs:86)
%/% (src/Algebra/DimensionTerm.hs:89)
applyLeftMul (src/Algebra/DimensionTerm.hs:95)
applyRightMul (src/Algebra/DimensionTerm.hs:97)
applyRecip (src/Algebra/DimensionTerm.hs:99)
commute (src/Algebra/DimensionTerm.hs:102)
associateLeft (src/Algebra/DimensionTerm.hs:104)
associateRight (src/Algebra/DimensionTerm.hs:106)
recipMul (src/Algebra/DimensionTerm.hs:108)
mulRecip (src/Algebra/DimensionTerm.hs:110)
identityLeft (src/Algebra/DimensionTerm.hs:113)
identityRight (src/Algebra/DimensionTerm.hs:115)
cancelLeft (src/Algebra/DimensionTerm.hs:117)
cancelRight (src/Algebra/DimensionTerm.hs:119)
invertRecip (src/Algebra/DimensionTerm.hs:121)
doubleRecip (src/Algebra/DimensionTerm.hs:123)
recipScalar (src/Algebra/DimensionTerm.hs:125)
Length (src/Algebra/DimensionTerm.hs:147)
Time (src/Algebra/DimensionTerm.hs:148)
Mass (src/Algebra/DimensionTerm.hs:149)
Charge (src/Algebra/DimensionTerm.hs:150)
Angle (src/Algebra/DimensionTerm.hs:151)
Temperature (src/Algebra/DimensionTerm.hs:152)
Information (src/Algebra/DimensionTerm.hs:153)
length (src/Algebra/DimensionTerm.hs:156)
time (src/Algebra/DimensionTerm.hs:159)
mass (src/Algebra/DimensionTerm.hs:162)
charge (src/Algebra/DimensionTerm.hs:165)
angle (src/Algebra/DimensionTerm.hs:168)
temperature (src/Algebra/DimensionTerm.hs:171)
information (src/Algebra/DimensionTerm.hs:174)
Frequency (src/Algebra/DimensionTerm.hs:195)
frequency (src/Algebra/DimensionTerm.hs:198)
Voltage (src/Algebra/DimensionTerm.hs:201)
VoltageAnalytical (src/Algebra/DimensionTerm.hs:203)
voltage (src/Algebra/DimensionTerm.hs:207)
unpackVoltage (src/Algebra/DimensionTerm.hs:214)
packVoltage (src/Algebra/DimensionTerm.hs:217)
71% ( 5 / 7) in 'Algebra.Indexable'
Missing documentation for:
toOrd (src/Algebra/Indexable.hs:72)
fromOrd
5% ( 1 / 17) in 'Algebra.Laws'
Missing documentation for:
commutative (src/Algebra/Laws.hs:9)
associative (src/Algebra/Laws.hs:12)
leftIdentity (src/Algebra/Laws.hs:15)
rightIdentity (src/Algebra/Laws.hs:18)
identity (src/Algebra/Laws.hs:21)
leftZero (src/Algebra/Laws.hs:24)
rightZero (src/Algebra/Laws.hs:27)
zero (src/Algebra/Laws.hs:30)
leftInverse (src/Algebra/Laws.hs:33)
rightInverse (src/Algebra/Laws.hs:36)
inverse (src/Algebra/Laws.hs:39)
leftDistributive (src/Algebra/Laws.hs:42)
rightDistributive (src/Algebra/Laws.hs:45)
homomorphism (src/Algebra/Laws.hs:49)
rightCascade (src/Algebra/Laws.hs:53)
leftCascade (src/Algebra/Laws.hs:57)
100% ( 2 / 2) in 'MathObj.Permutation'
96% (120 /124) in 'NumericPrelude.Base'
Missing documentation for:
Bool
fail
Ordering
catch (src/NumericPrelude/Base.hs:138)
15% ( 2 / 13) in 'MathObj.Permutation.Table'
Missing documentation for:
T (src/MathObj/Permutation/Table.hs:29)
fromFunction (src/MathObj/Permutation/Table.hs:34)
toFunction (src/MathObj/Permutation/Table.hs:38)
fromPermutation (src/MathObj/Permutation/Table.hs:45)
fromCycles (src/MathObj/Permutation/Table.hs:50)
identity (src/MathObj/Permutation/Table.hs:54)
cycle (src/MathObj/Permutation/Table.hs:57)
inverse (src/MathObj/Permutation/Table.hs:61)
compose (src/MathObj/Permutation/Table.hs:66)
closure (src/MathObj/Permutation/Table.hs:90)
closureSlow (src/MathObj/Permutation/Table.hs:104)
12% ( 1 / 8) in 'NumericPrelude.Elementwise'
Missing documentation for:
Module header
with (src/NumericPrelude/Elementwise.hs:20)
element (src/NumericPrelude/Elementwise.hs:24)
run2 (src/NumericPrelude/Elementwise.hs:29)
run3 (src/NumericPrelude/Elementwise.hs:33)
run4 (src/NumericPrelude/Elementwise.hs:37)
run5 (src/NumericPrelude/Elementwise.hs:41)
Warning: 'lengthLeft' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'lengthRight' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'Additive' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
64% ( 16 / 25) in 'Algebra.Additive'
Missing documentation for:
Module header
elementSub (src/Algebra/Additive.hs:181)
elementNeg (src/Algebra/Additive.hs:188)
<*>.- (src/Algebra/Additive.hs:210)
<*>.-$ (src/Algebra/Additive.hs:217)
propAssociative (src/Algebra/Additive.hs:417)
propCommutative (src/Algebra/Additive.hs:416)
propIdentity (src/Algebra/Additive.hs:418)
propInverse (src/Algebra/Additive.hs:419)
80% ( 4 / 5) in 'Algebra.ZeroTestable'
Missing documentation for:
Module header
27% ( 6 / 22) in 'Algebra.Ring'
Missing documentation for:
Module header
*
one
fromInteger
sqr (src/Algebra/Ring.hs:99)
product (src/Algebra/Ring.hs:102)
product1 (src/Algebra/Ring.hs:105)
scalarProduct (src/Algebra/Ring.hs:109)
propAssociative (src/Algebra/Ring.hs:230)
propLeftDistributive (src/Algebra/Ring.hs:231)
propRightDistributive (src/Algebra/Ring.hs:232)
propLeftIdentity (src/Algebra/Ring.hs:233)
propRightIdentity (src/Algebra/Ring.hs:234)
propPowerCascade (src/Algebra/Ring.hs:240)
propPowerProduct (src/Algebra/Ring.hs:241)
propPowerDistributive (src/Algebra/Ring.hs:242)
63% ( 7 / 11) in 'Algebra.Vector'
Missing documentation for:
functorScale (src/Algebra/Vector.hs:62)
propCascade (src/Algebra/Vector.hs:92)
propRightDistributive (src/Algebra/Vector.hs:96)
propLeftDistributive (src/Algebra/Vector.hs:100)
0% ( 0 / 2) in 'Algebra.RightModule'
Missing documentation for:
Module header
C (src/Algebra/RightModule.hs:14)
100% ( 2 / 2) in 'Algebra.Monoid'
20% ( 1 / 5) in 'MathObj.Algebra'
Missing documentation for:
T (src/MathObj/Algebra.hs:31)
zipWith (src/MathObj/Algebra.hs:51)
mulMonomial (src/MathObj/Algebra.hs:65)
monomial (src/MathObj/Algebra.hs:74)
57% ( 4 / 7) in 'Algebra.NonNegative'
Missing documentation for:
zero (src/Algebra/NonNegative.hs:99)
add (src/Algebra/NonNegative.hs:105)
sum (src/Algebra/NonNegative.hs:108)
44% ( 13 / 29) in 'Algebra.IntegralDomain'
Missing documentation for:
Module header
div
mod
divides (src/Algebra/IntegralDomain.hs:122)
sameResidueClass (src/Algebra/IntegralDomain.hs:126)
even (src/Algebra/IntegralDomain.hs:187)
odd (src/Algebra/IntegralDomain.hs:188)
decomposeVarPositionalInf (src/Algebra/IntegralDomain.hs:143)
propInverse (src/Algebra/IntegralDomain.hs:336)
propMultipleDiv (src/Algebra/IntegralDomain.hs:338)
propMultipleMod (src/Algebra/IntegralDomain.hs:340)
propProjectAddition (src/Algebra/IntegralDomain.hs:342)
propProjectMultiplication (src/Algebra/IntegralDomain.hs:345)
propUniqueRepresentative (src/Algebra/IntegralDomain.hs:348)
propZeroRepresentative (src/Algebra/IntegralDomain.hs:351)
propSameResidueClass (src/Algebra/IntegralDomain.hs:354)
29% ( 5 / 17) in 'Algebra.Units'
Missing documentation for:
Module header
isUnit
stdAssociate
stdUnit
stdUnitInv
intQuery (src/Algebra/Units.hs:86)
intAssociate (src/Algebra/Units.hs:90)
intStandard (src/Algebra/Units.hs:91)
intStandardInverse (src/Algebra/Units.hs:92)
propComposition (src/Algebra/Units.hs:145)
propInverseUnit (src/Algebra/Units.hs:146)
propUniqueAssociate (src/Algebra/Units.hs:147)
42% ( 14 / 33) in 'Algebra.PrincipalIdealDomain'
Missing documentation for:
Module header
coprime (src/Algebra/PrincipalIdealDomain.hs:150)
euclid (src/Algebra/PrincipalIdealDomain.hs:162)
extendedEuclid (src/Algebra/PrincipalIdealDomain.hs:177)
propMaximalDivisor (src/Algebra/PrincipalIdealDomain.hs:369)
propGCDDiophantine (src/Algebra/PrincipalIdealDomain.hs:371)
propExtendedGCDMulti (src/Algebra/PrincipalIdealDomain.hs:374)
propDiophantine (src/Algebra/PrincipalIdealDomain.hs:381)
propDiophantineMin (src/Algebra/PrincipalIdealDomain.hs:382)
propDiophantineMulti (src/Algebra/PrincipalIdealDomain.hs:387)
propDiophantineMultiMin (src/Algebra/PrincipalIdealDomain.hs:388)
propChineseRemainder (src/Algebra/PrincipalIdealDomain.hs:397)
propDivisibleGCD (src/Algebra/PrincipalIdealDomain.hs:389)
propDivisibleLCM (src/Algebra/PrincipalIdealDomain.hs:390)
propGCDIdentity (src/Algebra/PrincipalIdealDomain.hs:392)
propGCDCommutative (src/Algebra/PrincipalIdealDomain.hs:393)
propGCDAssociative (src/Algebra/PrincipalIdealDomain.hs:394)
propGCDHomogeneous (src/Algebra/PrincipalIdealDomain.hs:395)
propGCD_LCM (src/Algebra/PrincipalIdealDomain.hs:396)
60% ( 3 / 5) in 'MathObj.Monoid'
Missing documentation for:
Module header
LCM (src/MathObj/Monoid.hs:27)
50% ( 1 / 2) in 'Algebra.Differential'
Missing documentation for:
Module header
25% ( 1 / 4) in 'Algebra.Absolute'
Missing documentation for:
Module header
absOrd (src/Algebra/Absolute.hs:70)
signumOrd (src/Algebra/Absolute.hs:73)
40% ( 4 / 10) in 'Number.Ratio'
Missing documentation for:
T (src/Number/Ratio.hs:60)
% (src/Number/Ratio.hs:87)
Rational (src/Number/Ratio.hs:64)
fromValue (src/Number/Ratio.hs:68)
recip (src/Number/Ratio.hs:124)
scale (src/Number/Ratio.hs:71)
45% ( 5 / 11) in 'Algebra.Field'
Missing documentation for:
Module header
/
recip
fromRational'
^-
propReciprocal (src/Algebra/Field.hs:148)
66% ( 2 / 3) in 'Algebra.ToRational'
Missing documentation for:
Module header
100% ( 2 / 2) in 'Algebra.RealIntegral'
60% ( 3 / 5) in 'Algebra.ToInteger'
Missing documentation for:
Module header
fromIntegral (src/Algebra/ToInteger.hs:54)
66% ( 8 / 12) in 'Algebra.Module'
Missing documentation for:
<*>.*> (src/Algebra/Module.hs:70)
propCascade (src/Algebra/Module.hs:171)
propRightDistributive (src/Algebra/Module.hs:174)
propLeftDistributive (src/Algebra/Module.hs:177)
50% ( 2 / 4) in 'Algebra.VectorSpace'
Missing documentation for:
Module header
C (src/Algebra/VectorSpace.hs:16)
50% ( 1 / 2) in 'Algebra.DivisibleSpace'
Missing documentation for:
Module header
71% ( 5 / 7) in 'Algebra.ModuleBasis'
Missing documentation for:
propFlatten (src/Algebra/ModuleBasis.hs:90)
propDimension (src/Algebra/ModuleBasis.hs:93)
Warning: '(^\/)' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
22% ( 2 / 9) in 'Algebra.Algebraic'
Missing documentation for:
Module header
genericRoot (src/Algebra/Algebraic.hs:35)
power (src/Algebra/Algebraic.hs:38)
propSqrSqrt (src/Algebra/Algebraic.hs:57)
propPowerCascade (src/Algebra/Algebraic.hs:63)
propPowerProduct (src/Algebra/Algebraic.hs:64)
propPowerDistributive (src/Algebra/Algebraic.hs:65)
12% ( 3 / 25) in 'Algebra.Transcendental'
Missing documentation for:
Module header
^? (src/Algebra/Transcendental.hs:134)
propExpLog (src/Algebra/Transcendental.hs:147)
propLogExp (src/Algebra/Transcendental.hs:148)
propExpNeg (src/Algebra/Transcendental.hs:149)
propLogRecip (src/Algebra/Transcendental.hs:150)
propExpProduct (src/Algebra/Transcendental.hs:151)
propExpLogPower (src/Algebra/Transcendental.hs:152)
propLogSum (src/Algebra/Transcendental.hs:153)
propPowerCascade (src/Algebra/Transcendental.hs:160)
propPowerProduct (src/Algebra/Transcendental.hs:161)
propPowerDistributive (src/Algebra/Transcendental.hs:162)
propTrigonometricPythagoras (src/Algebra/Transcendental.hs:167)
propSinPeriod (src/Algebra/Transcendental.hs:173)
propCosPeriod (src/Algebra/Transcendental.hs:174)
propTanPeriod (src/Algebra/Transcendental.hs:175)
propSinAngleSum (src/Algebra/Transcendental.hs:180)
propCosAngleSum (src/Algebra/Transcendental.hs:181)
propSinDoubleAngle (src/Algebra/Transcendental.hs:186)
propCosDoubleAngle (src/Algebra/Transcendental.hs:187)
propSinSquare (src/Algebra/Transcendental.hs:192)
propCosSquare (src/Algebra/Transcendental.hs:193)
Warning: 'integral'' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
40% ( 12 / 30) in 'Algebra.RealRing'
Missing documentation for:
Module header
fastSplitFraction (src/Algebra/RealRing.hs:375)
fixSplitFraction (src/Algebra/RealRing.hs:383)
fixFraction (src/Algebra/RealRing.hs:391)
splitFractionInt (src/Algebra/RealRing.hs:400)
floorInt (src/Algebra/RealRing.hs:406)
ceilingInt (src/Algebra/RealRing.hs:414)
roundInt (src/Algebra/RealRing.hs:422)
roundSimpleInt (src/Algebra/RealRing.hs:434)
powersOfTwo (src/Algebra/RealRing.hs:551)
pairsOfPowersOfTwo (src/Algebra/RealRing.hs:554)
genericPosFloor (src/Algebra/RealRing.hs:626)
genericPosCeiling (src/Algebra/RealRing.hs:637)
genericHalfPosFloorDigits (src/Algebra/RealRing.hs:662)
genericPosRound (src/Algebra/RealRing.hs:673)
genericPosFraction (src/Algebra/RealRing.hs:687)
genericPosSplitFraction (src/Algebra/RealRing.hs:696)
decisionPosFractionSqrTime (src/Algebra/RealRing.hs:728)
50% ( 1 / 2) in 'Algebra.RealField'
Missing documentation for:
Module header
50% ( 1 / 2) in 'Algebra.RealTranscendental'
Missing documentation for:
Module header
50% ( 1 / 2) in 'Algebra.FloatingPoint'
Missing documentation for:
Module header
28% ( 2 / 7) in 'MathObj.Wrapper.Haskell98'
Missing documentation for:
lift1 (src/MathObj/Wrapper/Haskell98.hs:56)
lift2 (src/MathObj/Wrapper/Haskell98.hs:60)
unliftF1 (src/MathObj/Wrapper/Haskell98.hs:65)
unliftF2 (src/MathObj/Wrapper/Haskell98.hs:69)
unimplemented (src/MathObj/Wrapper/Haskell98.hs:187)
100% ( 6 / 6) in 'NumericPrelude.List.Checked'
33% ( 4 / 12) in 'NumericPrelude.List.Generic'
Missing documentation for:
replicate (src/NumericPrelude/List/Generic.hs:33)
take (src/NumericPrelude/List/Generic.hs:36)
drop (src/NumericPrelude/List/Generic.hs:43)
splitAt (src/NumericPrelude/List/Generic.hs:50)
findIndex (src/NumericPrelude/List/Generic.hs:78)
elemIndex (src/NumericPrelude/List/Generic.hs:72)
findIndices (src/NumericPrelude/List/Generic.hs:81)
elemIndices (src/NumericPrelude/List/Generic.hs:75)
31% ( 26 / 83) in 'NumericPrelude.Numeric'
Missing documentation for:
Module header
isZero
*
one
fromInteger
sqr (src/Algebra/Ring.hs:99)
product (src/Algebra/Ring.hs:102)
product1 (src/Algebra/Ring.hs:105)
div
mod
divides (src/Algebra/IntegralDomain.hs:122)
even (src/Algebra/IntegralDomain.hs:187)
odd (src/Algebra/IntegralDomain.hs:188)
/
recip
fromRational'
^-
^/
sqrt
pi
exp
log
logBase
**
^? (src/Algebra/Transcendental.hs:134)
sin
cos
tan
asin
acos
atan
sinh
cosh
tanh
asinh
acosh
atanh
abs
signum
quot
rem
quotRem
truncate
round
atan2
toInteger
fromIntegral (src/Algebra/ToInteger.hs:54)
isUnit
stdAssociate
stdUnit
stdUnitInv
euclid (src/Algebra/PrincipalIdealDomain.hs:162)
extendedEuclid (src/Algebra/PrincipalIdealDomain.hs:177)
Rational (src/Number/Ratio.hs:64)
% (src/Number/Ratio.hs:87)
numerator
denominator
12% ( 1 / 8) in 'Number.ResidueClass'
Missing documentation for:
Module header
add (src/Number/ResidueClass.hs:14)
sub (src/Number/ResidueClass.hs:15)
neg (src/Number/ResidueClass.hs:18)
mul (src/Number/ResidueClass.hs:21)
divide (src/Number/ResidueClass.hs:40)
recip (src/Number/ResidueClass.hs:45)
5% ( 1 / 18) in 'Number.ResidueClass.Reader'
Missing documentation for:
Module header
concrete (src/Number/ResidueClass/Reader.hs:27)
fromRepresentative (src/Number/ResidueClass/Reader.hs:30)
getZero (src/Number/ResidueClass/Reader.hs:34)
getOne (src/Number/ResidueClass/Reader.hs:37)
fromInteger (src/Number/ResidueClass/Reader.hs:40)
getAdd (src/Number/ResidueClass/Reader.hs:57)
getSub (src/Number/ResidueClass/Reader.hs:60)
getNeg (src/Number/ResidueClass/Reader.hs:63)
getAdditiveVars (src/Number/ResidueClass/Reader.hs:66)
getMul (src/Number/ResidueClass/Reader.hs:71)
getRingVars (src/Number/ResidueClass/Reader.hs:74)
getDivide (src/Number/ResidueClass/Reader.hs:79)
getRecip (src/Number/ResidueClass/Reader.hs:82)
getFieldVars (src/Number/ResidueClass/Reader.hs:85)
monadExample (src/Number/ResidueClass/Reader.hs:88)
runExample (src/Number/ResidueClass/Reader.hs:99)
Warning: '(\/)' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
42% ( 3 / 7) in 'Number.ResidueClass.Maybe'
Missing documentation for:
Module header
matchMaybe (src/Number/ResidueClass/Maybe.hs:40)
isCompatibleMaybe (src/Number/ResidueClass/Maybe.hs:44)
lift2 (src/Number/ResidueClass/Maybe.hs:54)
7% ( 1 / 14) in 'Number.ResidueClass.Func'
Missing documentation for:
Module header
concrete (src/Number/ResidueClass/Func.hs:34)
fromRepresentative (src/Number/ResidueClass/Func.hs:37)
lift0 (src/Number/ResidueClass/Func.hs:40)
lift1 (src/Number/ResidueClass/Func.hs:43)
lift2 (src/Number/ResidueClass/Func.hs:46)
zero (src/Number/ResidueClass/Func.hs:50)
one (src/Number/ResidueClass/Func.hs:53)
fromInteger (src/Number/ResidueClass/Func.hs:56)
equal (src/Number/ResidueClass/Func.hs:59)
notImplemented (src/Number/ResidueClass/Func.hs:90)
lift98_1 (src/Number/ResidueClass/Func.hs:95)
lift98_2 (src/Number/ResidueClass/Func.hs:99)
23% ( 3 / 13) in 'Number.ResidueClass.Check'
Missing documentation for:
Module header
factorPrec (src/Number/ResidueClass/Check.hs:40)
maybeCompatible (src/Number/ResidueClass/Check.hs:58)
fromRepresentative (src/Number/ResidueClass/Check.hs:65)
lift1 (src/Number/ResidueClass/Check.hs:68)
lift2 (src/Number/ResidueClass/Check.hs:73)
errIncompat (src/Number/ResidueClass/Check.hs:80)
zero (src/Number/ResidueClass/Check.hs:84)
one (src/Number/ResidueClass/Check.hs:87)
fromInteger (src/Number/ResidueClass/Check.hs:90)
27% ( 8 / 29) in 'Number.Peano'
Missing documentation for:
T (src/Number/Peano.hs:43)
infinity (src/Number/Peano.hs:48)
err (src/Number/Peano.hs:51)
add (src/Number/Peano.hs:59)
sub (src/Number/Peano.hs:63)
subNeg (src/Number/Peano.hs:70)
mul (src/Number/Peano.hs:76)
fromPosEnum (src/Number/Peano.hs:81)
toPosEnum (src/Number/Peano.hs:87)
argMinimum (src/Number/Peano.hs:198)
argMaxFull (src/Number/Peano.hs:202)
argMaximum (src/Number/Peano.hs:217)
isAscendingFiniteNumbers (src/Number/Peano.hs:240)
toListMaybe (src/Number/Peano.hs:246)
isAscending (src/Number/Peano.hs:277)
Valuable (src/Number/Peano.hs:289)
increaseCosts (src/Number/Peano.hs:294)
andW (src/Number/Peano.hs:314)
leW (src/Number/Peano.hs:320)
isAscendingW (src/Number/Peano.hs:325)
notImplemented (src/Number/Peano.hs:404)
25% ( 1 / 4) in 'Number.PartiallyTranscendental'
Missing documentation for:
T (src/Number/PartiallyTranscendental.hs:25)
fromValue (src/Number/PartiallyTranscendental.hs:29)
toValue
35% ( 5 / 14) in 'Number.NonNegativeChunky'
Missing documentation for:
fromChunks (src/Number/NonNegativeChunky.hs:69)
toChunks (src/Number/NonNegativeChunky.hs:72)
fromNumber (src/Number/NonNegativeChunky.hs:81)
toNumber (src/Number/NonNegativeChunky.hs:84)
fromChunky98 (src/Number/NonNegativeChunky.hs:75)
toChunky98 (src/Number/NonNegativeChunky.hs:78)
minMaxDiff (src/Number/NonNegativeChunky.hs:149)
isNull (src/Number/NonNegativeChunky.hs:102)
isPositive (src/Number/NonNegativeChunky.hs:106)
30% ( 4 / 13) in 'Number.NonNegative'
Missing documentation for:
T
fromNumberMsg (src/Number/NonNegative.hs:70)
toNumber
Int
Integer
Float
Double
Ratio (src/Number/NonNegative.hs:209)
Rational (src/Number/NonNegative.hs:210)
42% ( 3 / 7) in 'Number.GaloisField2p32m5'
Missing documentation for:
appPrec (src/Number/GaloisField2p32m5.hs:62)
base (src/Number/GaloisField2p32m5.hs:83)
lift2 (src/Number/GaloisField2p32m5.hs:88)
lift2Integer (src/Number/GaloisField2p32m5.hs:93)
37% ( 11 / 29) in 'MathObj.Polynomial.Core'
Missing documentation for:
hornerArgVector (src/MathObj/Polynomial/Core.hs:82)
unShift (src/MathObj/Polynomial/Core.hs:103)
equal (src/MathObj/Polynomial/Core.hs:108)
add (src/MathObj/Polynomial/Core.hs:112)
sub (src/MathObj/Polynomial/Core.hs:113)
negate (src/MathObj/Polynomial/Core.hs:117)
scale (src/MathObj/Polynomial/Core.hs:122)
collinear (src/MathObj/Polynomial/Core.hs:126)
tensorProductAlt (src/MathObj/Polynomial/Core.hs:143)
mulShearTranspose (src/MathObj/Polynomial/Core.hs:169)
stdUnit (src/MathObj/Polynomial/Core.hs:208)
progression (src/MathObj/Polynomial/Core.hs:215)
differentiate (src/MathObj/Polynomial/Core.hs:219)
integrate (src/MathObj/Polynomial/Core.hs:223)
mulLinearFactor (src/MathObj/Polynomial/Core.hs:238)
alternate (src/MathObj/Polynomial/Core.hs:243)
dilate (src/MathObj/Polynomial/Core.hs:251)
shrink (src/MathObj/Polynomial/Core.hs:247)
52% ( 23 / 44) in 'MathObj.PowerSeries.Core'
Missing documentation for:
Module header
evaluate (src/MathObj/PowerSeries/Core.hs:51)
evaluateCoeffVector (src/MathObj/PowerSeries/Core.hs:55)
evaluateArgVector (src/MathObj/PowerSeries/Core.hs:59)
approximate (src/MathObj/PowerSeries/Core.hs:64)
approximateCoeffVector (src/MathObj/PowerSeries/Core.hs:69)
approximateArgVector (src/MathObj/PowerSeries/Core.hs:74)
add (src/MathObj/PowerSeries/Core.hs:120)
sub (src/MathObj/PowerSeries/Core.hs:121)
negate (src/MathObj/PowerSeries/Core.hs:124)
scale (src/MathObj/PowerSeries/Core.hs:127)
mul (src/MathObj/PowerSeries/Core.hs:130)
stripLeadZero (src/MathObj/PowerSeries/Core.hs:134)
divMod (src/MathObj/PowerSeries/Core.hs:142)
progression (src/MathObj/PowerSeries/Core.hs:173)
recipProgression (src/MathObj/PowerSeries/Core.hs:176)
differentiate (src/MathObj/PowerSeries/Core.hs:179)
integrate (src/MathObj/PowerSeries/Core.hs:182)
sinCos (src/MathObj/PowerSeries/Core.hs:248)
sinCosScalar (src/MathObj/PowerSeries/Core.hs:256)
invDiff (src/MathObj/PowerSeries/Core.hs:402)
42% ( 21 / 49) in 'MathObj.PowerSeries.Example'
Missing documentation for:
Module header
recip (src/MathObj/PowerSeries/Example.hs:34)
exp (src/MathObj/PowerSeries/Example.hs:40)
sin (src/MathObj/PowerSeries/Example.hs:41)
cos (src/MathObj/PowerSeries/Example.hs:42)
tan (src/MathObj/PowerSeries/Example.hs:43)
log (src/MathObj/PowerSeries/Example.hs:44)
asin (src/MathObj/PowerSeries/Example.hs:45)
acos (src/MathObj/PowerSeries/Example.hs:46)
atan (src/MathObj/PowerSeries/Example.hs:47)
sinh (src/MathObj/PowerSeries/Example.hs:50)
cosh (src/MathObj/PowerSeries/Example.hs:51)
atanh (src/MathObj/PowerSeries/Example.hs:52)
sqrt (src/MathObj/PowerSeries/Example.hs:58)
recipExpl (src/MathObj/PowerSeries/Example.hs:64)
expODE (src/MathObj/PowerSeries/Example.hs:145)
sinODE (src/MathObj/PowerSeries/Example.hs:146)
cosODE (src/MathObj/PowerSeries/Example.hs:147)
tanODE (src/MathObj/PowerSeries/Example.hs:148)
logODE (src/MathObj/PowerSeries/Example.hs:163)
recipCircle (src/MathObj/PowerSeries/Example.hs:164)
atanODE (src/MathObj/PowerSeries/Example.hs:168)
sqrtODE (src/MathObj/PowerSeries/Example.hs:169)
acosODE (src/MathObj/PowerSeries/Example.hs:172)
sinhODE (src/MathObj/PowerSeries/Example.hs:175)
coshODE (src/MathObj/PowerSeries/Example.hs:176)
atanhODE (src/MathObj/PowerSeries/Example.hs:177)
powODE (src/MathObj/PowerSeries/Example.hs:188)
28% ( 11 / 39) in 'Number.FixedPoint'
Missing documentation for:
fromFloat (src/Number/FixedPoint.hs:43)
showPositionalHex (src/Number/FixedPoint.hs:66)
showPositionalBin (src/Number/FixedPoint.hs:69)
showPositionalBasis (src/Number/FixedPoint.hs:72)
liftShowPosToInt (src/Number/FixedPoint.hs:77)
toPositional (src/Number/FixedPoint.hs:83)
add (src/Number/FixedPoint.hs:91)
sub (src/Number/FixedPoint.hs:94)
mul (src/Number/FixedPoint.hs:100)
divide (src/Number/FixedPoint.hs:106)
recip (src/Number/FixedPoint.hs:109)
magnitudes (src/Number/FixedPoint.hs:119)
sqrt (src/Number/FixedPoint.hs:133)
root (src/Number/FixedPoint.hs:143)
evalPowerSeries (src/Number/FixedPoint.hs:158)
cos (src/Number/FixedPoint.hs:165)
sin (src/Number/FixedPoint.hs:166)
tan (src/Number/FixedPoint.hs:168)
arctanSmall (src/Number/FixedPoint.hs:172)
arctan (src/Number/FixedPoint.hs:176)
piConst (src/Number/FixedPoint.hs:184)
expSmall (src/Number/FixedPoint.hs:195)
eConst (src/Number/FixedPoint.hs:198)
recipEConst (src/Number/FixedPoint.hs:201)
exp (src/Number/FixedPoint.hs:204)
approxLogBase (src/Number/FixedPoint.hs:216)
lnSmall (src/Number/FixedPoint.hs:220)
ln (src/Number/FixedPoint.hs:225)
27% ( 6 / 22) in 'Number.FixedPoint.Check'
Missing documentation for:
Module header
T (src/Number/FixedPoint/Check.hs:26)
cons (src/Number/FixedPoint/Check.hs:32)
fromFloat (src/Number/FixedPoint/Check.hs:37)
fromInteger' (src/Number/FixedPoint/Check.hs:41)
fromRational' (src/Number/FixedPoint/Check.hs:45)
fromFloatBasis (src/Number/FixedPoint/Check.hs:49)
fromIntegerBasis (src/Number/FixedPoint/Check.hs:53)
fromRationalBasis (src/Number/FixedPoint/Check.hs:57)
lift0 (src/Number/FixedPoint/Check.hs:69)
lift1 (src/Number/FixedPoint/Check.hs:72)
lift2 (src/Number/FixedPoint/Check.hs:75)
commonDenominator (src/Number/FixedPoint/Check.hs:79)
appPrec (src/Number/FixedPoint/Check.hs:88)
defltDenominator (src/Number/FixedPoint/Check.hs:98)
defltShow (src/Number/FixedPoint/Check.hs:101)
42% ( 3 / 7) in 'MathObj.PowerSeries.DifferentialEquation'
Missing documentation for:
verifyDiffEq0 (src/MathObj/PowerSeries/DifferentialEquation.hs:52)
propDiffEq0 (src/MathObj/PowerSeries/DifferentialEquation.hs:56)
verifyDiffEq1 (src/MathObj/PowerSeries/DifferentialEquation.hs:78)
propDiffEq1 (src/MathObj/PowerSeries/DifferentialEquation.hs:81)
42% ( 8 / 19) in 'MathObj.PowerSeries'
Missing documentation for:
T (src/MathObj/PowerSeries.hs:41)
fromCoeffs (src/MathObj/PowerSeries.hs:45)
lift0 (src/MathObj/PowerSeries.hs:49)
lift1 (src/MathObj/PowerSeries.hs:53)
lift2 (src/MathObj/PowerSeries.hs:57)
const (src/MathObj/PowerSeries.hs:61)
appPrec (src/MathObj/PowerSeries.hs:73)
truncate (src/MathObj/PowerSeries.hs:82)
evaluateArgVector (src/MathObj/PowerSeries.hs:101)
shrink (src/MathObj/PowerSeries.hs:208)
dilate (src/MathObj/PowerSeries.hs:211)
10% ( 2 / 20) in 'MathObj.PowerSeries2.Core'
Missing documentation for:
Module header
T (src/MathObj/PowerSeries2/Core.hs:16)
lift0fromPowerSeries (src/MathObj/PowerSeries2/Core.hs:20)
lift1fromPowerSeries (src/MathObj/PowerSeries2/Core.hs:24)
lift2fromPowerSeries (src/MathObj/PowerSeries2/Core.hs:29)
add (src/MathObj/PowerSeries2/Core.hs:36)
sub (src/MathObj/PowerSeries2/Core.hs:37)
negate (src/MathObj/PowerSeries2/Core.hs:40)
scale (src/MathObj/PowerSeries2/Core.hs:44)
mul (src/MathObj/PowerSeries2/Core.hs:47)
divide (src/MathObj/PowerSeries2/Core.hs:52)
sqrt (src/MathObj/PowerSeries2/Core.hs:57)
pow (src/MathObj/PowerSeries2/Core.hs:63)
swapVariables (src/MathObj/PowerSeries2/Core.hs:69)
differentiate0 (src/MathObj/PowerSeries2/Core.hs:73)
differentiate1 (src/MathObj/PowerSeries2/Core.hs:77)
integrate0 (src/MathObj/PowerSeries2/Core.hs:80)
integrate1 (src/MathObj/PowerSeries2/Core.hs:84)
15% ( 2 / 13) in 'MathObj.PowerSeries2'
Missing documentation for:
isValid (src/MathObj/PowerSeries2.hs:43)
check (src/MathObj/PowerSeries2.hs:46)
fromCoeffs (src/MathObj/PowerSeries2.hs:55)
fromPowerSeries0 (src/MathObj/PowerSeries2.hs:58)
fromPowerSeries1 (src/MathObj/PowerSeries2.hs:64)
lift0 (src/MathObj/PowerSeries2.hs:71)
lift1 (src/MathObj/PowerSeries2.hs:74)
lift2 (src/MathObj/PowerSeries2.hs:77)
const (src/MathObj/PowerSeries2.hs:81)
truncate (src/MathObj/PowerSeries2.hs:86)
appPrec (src/MathObj/PowerSeries2.hs:93)
5% ( 1 / 19) in 'MathObj.PowerSeries.Mean'
Missing documentation for:
diffComp (src/MathObj/PowerSeries/Mean.hs:77)
logarithmic (src/MathObj/PowerSeries/Mean.hs:90)
elemSym3_2 (src/MathObj/PowerSeries/Mean.hs:100)
quadratic (src/MathObj/PowerSeries/Mean.hs:123)
quadraticMVF (src/MathObj/PowerSeries/Mean.hs:126)
quadraticDiff (src/MathObj/PowerSeries/Mean.hs:142)
quadratic2 (src/MathObj/PowerSeries/Mean.hs:157)
quadraticDiff2 (src/MathObj/PowerSeries/Mean.hs:161)
harmonicMVF (src/MathObj/PowerSeries/Mean.hs:173)
harmonic2 (src/MathObj/PowerSeries/Mean.hs:182)
harmonicDiff2 (src/MathObj/PowerSeries/Mean.hs:190)
arithmeticMVF (src/MathObj/PowerSeries/Mean.hs:196)
arithmetic2 (src/MathObj/PowerSeries/Mean.hs:202)
arithmeticDiff2 (src/MathObj/PowerSeries/Mean.hs:205)
geometricMVF (src/MathObj/PowerSeries/Mean.hs:210)
geometric2 (src/MathObj/PowerSeries/Mean.hs:216)
geometricDiff2 (src/MathObj/PowerSeries/Mean.hs:220)
meanValueDiff2 (src/MathObj/PowerSeries/Mean.hs:228)
27% ( 5 / 18) in 'MathObj.Polynomial'
Missing documentation for:
fromCoeffs (src/MathObj/Polynomial.hs:118)
coeffs
degree (src/MathObj/Polynomial.hs:133)
showsExpressionPrec (src/MathObj/Polynomial.hs:159)
const (src/MathObj/Polynomial.hs:212)
evaluate (src/MathObj/Polynomial.hs:178)
collinear (src/MathObj/Polynomial.hs:216)
integrate (src/MathObj/Polynomial.hs:285)
fromRoots (src/MathObj/Polynomial.hs:291)
reverse (src/MathObj/Polynomial.hs:295)
translate (src/MathObj/Polynomial.hs:298)
dilate (src/MathObj/Polynomial.hs:305)
shrink (src/MathObj/Polynomial.hs:302)
40% ( 4 / 10) in 'MathObj.RefinementMask2'
Missing documentation for:
Module header
T (src/MathObj/RefinementMask2.hs:69)
coeffs
fromCoeffs (src/MathObj/RefinementMask2.hs:74)
toPolynomialFast (src/MathObj/RefinementMask2.hs:192)
convolveTruncatedPowerPolynomials (src/MathObj/RefinementMask2.hs:259)
28% ( 8 / 28) in 'MathObj.PowerSum'
Missing documentation for:
T (src/MathObj/PowerSum.hs:40)
lift0 (src/MathObj/PowerSum.hs:46)
lift1 (src/MathObj/PowerSum.hs:49)
lift2 (src/MathObj/PowerSum.hs:52)
const (src/MathObj/PowerSum.hs:56)
fromElemSym (src/MathObj/PowerSum.hs:91)
divOneFlip (src/MathObj/PowerSum.hs:96)
fromElemSymDenormalized (src/MathObj/PowerSum.hs:104)
toElemSym (src/MathObj/PowerSum.hs:110)
toElemSymInt (src/MathObj/PowerSum.hs:116)
fromPolynomial (src/MathObj/PowerSum.hs:124)
elemSymFromPolynomial (src/MathObj/PowerSum.hs:131)
binomials (src/MathObj/PowerSum.hs:138)
appPrec (src/MathObj/PowerSum.hs:143)
add (src/MathObj/PowerSum.hs:155)
mul (src/MathObj/PowerSum.hs:168)
pow (src/MathObj/PowerSum.hs:171)
root (src/MathObj/PowerSum.hs:201)
approxSeries (src/MathObj/PowerSum.hs:219)
propOp (src/MathObj/PowerSum.hs:226)
28% ( 9 / 32) in 'MathObj.RootSet'
Missing documentation for:
T (src/MathObj/RootSet.hs:39)
lift0 (src/MathObj/RootSet.hs:45)
lift1 (src/MathObj/RootSet.hs:48)
lift2 (src/MathObj/RootSet.hs:51)
const (src/MathObj/RootSet.hs:55)
toPolynomial (src/MathObj/RootSet.hs:59)
fromPolynomial (src/MathObj/RootSet.hs:62)
toPowerSums (src/MathObj/RootSet.hs:67)
fromPowerSums (src/MathObj/RootSet.hs:70)
fromRoots (src/MathObj/RootSet.hs:81)
liftPowerSum1Gen (src/MathObj/RootSet.hs:87)
liftPowerSum2Gen (src/MathObj/RootSet.hs:92)
liftPowerSum1 (src/MathObj/RootSet.hs:99)
liftPowerSum2 (src/MathObj/RootSet.hs:103)
liftPowerSumInt1 (src/MathObj/RootSet.hs:107)
liftPowerSumInt2 (src/MathObj/RootSet.hs:111)
appPrec (src/MathObj/RootSet.hs:119)
add (src/MathObj/RootSet.hs:131)
addInt (src/MathObj/RootSet.hs:134)
mul (src/MathObj/RootSet.hs:145)
mulInt (src/MathObj/RootSet.hs:148)
pow (src/MathObj/RootSet.hs:152)
powInt (src/MathObj/RootSet.hs:155)
28% ( 4 / 14) in 'Number.Root'
Missing documentation for:
Module header
fromNumber (src/Number/Root.hs:38)
toNumber (src/Number/Root.hs:41)
toRootSet (src/Number/Root.hs:44)
commonDegree (src/Number/Root.hs:49)
mul (src/Number/Root.hs:65)
div (src/Number/Root.hs:68)
recip (src/Number/Root.hs:71)
rationalPower (src/Number/Root.hs:91)
sqrt (src/Number/Root.hs:102)
17% ( 3 / 17) in 'MathObj.Permutation.CycleList'
Missing documentation for:
Cycle (src/MathObj/Permutation/CycleList.hs:26)
T (src/MathObj/Permutation/CycleList.hs:27)
fromFunction (src/MathObj/Permutation/CycleList.hs:33)
cycleRightAction (src/MathObj/Permutation/CycleList.hs:45)
cycleLeftAction (src/MathObj/Permutation/CycleList.hs:49)
cycleAction (src/MathObj/Permutation/CycleList.hs:52)
cycleOrbit (src/MathObj/Permutation/CycleList.hs:59)
cyclesOrbit (src/MathObj/Permutation/CycleList.hs:69)
orbit (src/MathObj/Permutation/CycleList.hs:72)
takeUntilRepetitionSlow (src/MathObj/Permutation/CycleList.hs:82)
choose (src/MathObj/Permutation/CycleList.hs:92)
keepEssentials (src/MathObj/Permutation/CycleList.hs:96)
isEssential (src/MathObj/Permutation/CycleList.hs:100)
inverse (src/MathObj/Permutation/CycleList.hs:103)
27% ( 3 / 11) in 'MathObj.Permutation.CycleList.Check'
Missing documentation for:
T (src/MathObj/Permutation/CycleList/Check.hs:37)
toCycles (src/MathObj/Permutation/CycleList/Check.hs:46)
toTable (src/MathObj/Permutation/CycleList/Check.hs:49)
fromTable (src/MathObj/Permutation/CycleList/Check.hs:52)
errIncompat (src/MathObj/Permutation/CycleList/Check.hs:58)
liftCmpTable2 (src/MathObj/Permutation/CycleList/Check.hs:62)
liftTable2 (src/MathObj/Permutation/CycleList/Check.hs:69)
closure (src/MathObj/Permutation/CycleList/Check.hs:73)
65% ( 21 / 32) in 'MathObj.PartialFraction'
Missing documentation for:
toFractionSum (src/MathObj/PartialFraction.hs:137)
appPrec (src/MathObj/PartialFraction.hs:141)
toFraction (src/MathObj/PartialFraction.hs:152)
hornerRev (src/MathObj/PartialFraction.hs:181)
fromValue (src/MathObj/PartialFraction.hs:238)
zipWith (src/MathObj/PartialFraction.hs:293)
mulFrac' (src/MathObj/PartialFraction.hs:338)
mul (src/MathObj/PartialFraction.hs:439)
indexMapMapWithKey (src/MathObj/PartialFraction.hs:469)
indexMapToList (src/MathObj/PartialFraction.hs:472)
indexMapFromList (src/MathObj/PartialFraction.hs:475)
33% ( 7 / 21) in 'MathObj.Matrix'
Missing documentation for:
Dimension (src/MathObj/Matrix.hs:113)
format (src/MathObj/Matrix.hs:174)
rows (src/MathObj/Matrix.hs:128)
columns (src/MathObj/Matrix.hs:133)
index (src/MathObj/Matrix.hs:138)
fromList (src/MathObj/Matrix.hs:163)
dimension (src/MathObj/Matrix.hs:184)
numRows (src/MathObj/Matrix.hs:187)
numColumns (src/MathObj/Matrix.hs:190)
zipWith (src/MathObj/Matrix.hs:204)
one (src/MathObj/Matrix.hs:221)
scale (src/MathObj/Matrix.hs:239)
random (src/MathObj/Matrix.hs:275)
randomR (src/MathObj/Matrix.hs:280)
25% ( 1 / 4) in 'Algebra.OccasionallyScalar'
Missing documentation for:
C (src/Algebra/OccasionallyScalar.hs:37)
toScalarDefault (src/Algebra/OccasionallyScalar.hs:43)
toScalarShow (src/Algebra/OccasionallyScalar.hs:48)
20% ( 2 / 10) in 'Number.OccasionallyScalarExpression'
Missing documentation for:
Term (src/Number/OccasionallyScalarExpression.hs:35)
fromValue (src/Number/OccasionallyScalarExpression.hs:42)
makeLine (src/Number/OccasionallyScalarExpression.hs:46)
showUnitError (src/Number/OccasionallyScalarExpression.hs:49)
lift (src/Number/OccasionallyScalarExpression.hs:76)
fromScalar (src/Number/OccasionallyScalarExpression.hs:80)
scalarMap (src/Number/OccasionallyScalarExpression.hs:84)
scalarMap2 (src/Number/OccasionallyScalarExpression.hs:88)
7% ( 3 / 42) in 'Number.DimensionTerm'
Missing documentation for:
T (src/Number/DimensionTerm.hs:35)
fromNumber (src/Number/DimensionTerm.hs:53)
toNumber (src/Number/DimensionTerm.hs:56)
fromNumberWithDimension (src/Number/DimensionTerm.hs:59)
toNumberWithDimension (src/Number/DimensionTerm.hs:62)
&*& (src/Number/DimensionTerm.hs:102)
&/& (src/Number/DimensionTerm.hs:106)
mulToScalar (src/Number/DimensionTerm.hs:110)
divToScalar (src/Number/DimensionTerm.hs:114)
cancelToScalar (src/Number/DimensionTerm.hs:118)
recip (src/Number/DimensionTerm.hs:124)
unrecip (src/Number/DimensionTerm.hs:128)
sqr (src/Number/DimensionTerm.hs:132)
sqrt (src/Number/DimensionTerm.hs:136)
abs (src/Number/DimensionTerm.hs:140)
absSignum (src/Number/DimensionTerm.hs:143)
scale (src/Number/DimensionTerm.hs:147)
*& (src/Number/DimensionTerm.hs:149)
rewriteDimension (src/Number/DimensionTerm.hs:153)
Scalar (src/Number/DimensionTerm.hs:171)
Length (src/Number/DimensionTerm.hs:172)
Time (src/Number/DimensionTerm.hs:173)
Mass (src/Number/DimensionTerm.hs:174)
Charge (src/Number/DimensionTerm.hs:175)
Angle (src/Number/DimensionTerm.hs:176)
Temperature (src/Number/DimensionTerm.hs:177)
Information (src/Number/DimensionTerm.hs:178)
Frequency (src/Number/DimensionTerm.hs:180)
Voltage (src/Number/DimensionTerm.hs:181)
scalar (src/Number/DimensionTerm.hs:185)
length (src/Number/DimensionTerm.hs:188)
time (src/Number/DimensionTerm.hs:191)
mass (src/Number/DimensionTerm.hs:194)
charge (src/Number/DimensionTerm.hs:197)
frequency (src/Number/DimensionTerm.hs:200)
angle (src/Number/DimensionTerm.hs:203)
temperature (src/Number/DimensionTerm.hs:206)
information (src/Number/DimensionTerm.hs:209)
voltage (src/Number/DimensionTerm.hs:213)
100% ( 4 / 4) in 'Algebra.NormedSpace.Sum'
75% ( 3 / 4) in 'Algebra.NormedSpace.Maximum'
Missing documentation for:
C (src/Algebra/NormedSpace/Maximum.hs:26)
87% ( 7 / 8) in 'Algebra.NormedSpace.Euclidean'
Missing documentation for:
defltNorm (src/Algebra/NormedSpace/Euclidean.hs:70)
74% ( 20 / 27) in 'Number.Complex'
Missing documentation for:
imaginaryUnit (src/Number/Complex.hs:109)
fromReal (src/Number/Complex.hs:113)
signumNorm (src/Number/Complex.hs:205)
magnitude (src/Number/Complex.hs:248)
magnitudeSqr (src/Number/Complex.hs:261)
propPolar (src/Number/Complex.hs:224)
defltPow (src/Number/Complex.hs:489)
76% ( 16 / 21) in 'Number.Quaternion'
Missing documentation for:
fromReal (src/Number/Quaternion.hs:85)
fromRotationMatrix (src/Number/Quaternion.hs:169)
scalarProduct (src/Number/Quaternion.hs:128)
crossProduct (src/Number/Quaternion.hs:132)
norm (src/Number/Quaternion.hs:121)
45% ( 16 / 35) in 'MathObj.LaurentPolynomial'
Missing documentation for:
const (src/MathObj/LaurentPolynomial.hs:46)
! (src/MathObj/LaurentPolynomial.hs:49)
fromCoeffs (src/MathObj/LaurentPolynomial.hs:55)
fromShiftCoeffs (src/MathObj/LaurentPolynomial.hs:58)
fromPolynomial (src/MathObj/LaurentPolynomial.hs:61)
fromPowerSeries (src/MathObj/LaurentPolynomial.hs:64)
bounds (src/MathObj/LaurentPolynomial.hs:67)
shift (src/MathObj/LaurentPolynomial.hs:70)
translate (src/MathObj/LaurentPolynomial.hs:74)
appPrec (src/MathObj/LaurentPolynomial.hs:84)
add (src/MathObj/LaurentPolynomial.hs:95)
series (src/MathObj/LaurentPolynomial.hs:111)
addShifted (src/MathObj/LaurentPolynomial.hs:162)
negate (src/MathObj/LaurentPolynomial.hs:172)
sub (src/MathObj/LaurentPolynomial.hs:175)
mul (src/MathObj/LaurentPolynomial.hs:200)
div (src/MathObj/LaurentPolynomial.hs:211)
divExample (src/MathObj/LaurentPolynomial.hs:221)
identical (src/MathObj/LaurentPolynomial.hs:250)
Warning: 'cheating'' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
43% ( 65 /148) in 'Number.Positional'
Missing documentation for:
T (src/Number/Positional.hs:47)
FixedPoint (src/Number/Positional.hs:48)
Mantissa (src/Number/Positional.hs:49)
Digit (src/Number/Positional.hs:50)
Exponent (src/Number/Positional.hs:51)
Basis (src/Number/Positional.hs:52)
moveToZero (src/Number/Positional.hs:58)
checkPosDigit (src/Number/Positional.hs:64)
checkDigit (src/Number/Positional.hs:70)
prependDigit (src/Number/Positional.hs:152)
trimOnce (src/Number/Positional.hs:174)
decreaseExpFP (src/Number/Positional.hs:200)
pumpFirstFP (src/Number/Positional.hs:204)
fromBaseCardinal (src/Number/Positional.hs:226)
fromBaseInteger (src/Number/Positional.hs:231)
mantissaToNum (src/Number/Positional.hs:237)
mantissaFromCard (src/Number/Positional.hs:242)
mantissaFromInt (src/Number/Positional.hs:248)
mantissaFromFixedInt (src/Number/Positional.hs:254)
fromBaseRational (src/Number/Positional.hs:264)
fromFixedPoint (src/Number/Positional.hs:286)
toDouble (src/Number/Positional.hs:294)
fromDoubleRough (src/Number/Positional.hs:321)
mantLengthDouble (src/Number/Positional.hs:326)
liftDoubleApprox (src/Number/Positional.hs:334)
liftDoubleRough (src/Number/Positional.hs:337)
showHex (src/Number/Positional.hs:349)
showBin (src/Number/Positional.hs:352)
showBasis (src/Number/Positional.hs:355)
fromBasisMant (src/Number/Positional.hs:405)
lessApprox (src/Number/Positional.hs:471)
trunc (src/Number/Positional.hs:477)
equalApprox (src/Number/Positional.hs:483)
withTwoMantissas (src/Number/Positional.hs:555)
align (src/Number/Positional.hs:562)
absolute (src/Number/Positional.hs:578)
absMant (src/Number/Positional.hs:581)
fromLaurent (src/Number/Positional.hs:592)
toLaurent (src/Number/Positional.hs:595)
liftLaurent2 (src/Number/Positional.hs:600)
liftLaurentMany (src/Number/Positional.hs:606)
sub (src/Number/Positional.hs:616)
neg (src/Number/Positional.hs:619)
Series (src/Number/Positional.hs:643)
seriesPlain (src/Number/Positional.hs:664)
splitAtMatchPadZero (src/Number/Positional.hs:713)
scale (src/Number/Positional.hs:729)
scaleSimple (src/Number/Positional.hs:737)
scaleMant (src/Number/Positional.hs:740)
mulSeries (src/Number/Positional.hs:745)
divMant (src/Number/Positional.hs:780)
divMantSlow (src/Number/Positional.hs:798)
reciprocal (src/Number/Positional.hs:808)
divIntMantInf (src/Number/Positional.hs:829)
divInt (src/Number/Positional.hs:835)
sqrt (src/Number/Positional.hs:850)
sqrtDriver (src/Number/Positional.hs:853)
sqrtMant (src/Number/Positional.hs:864)
sqrtNewton (src/Number/Positional.hs:924)
expSeries (src/Number/Positional.hs:998)
expSeriesLazy (src/Number/Positional.hs:1011)
expSmallLazy (src/Number/Positional.hs:1024)
exp (src/Number/Positional.hs:1028)
intPower (src/Number/Positional.hs:1042)
cardPower (src/Number/Positional.hs:1048)
powerSmall (src/Number/Positional.hs:1083)
power (src/Number/Positional.hs:1086)
root (src/Number/Positional.hs:1093)
cosSin (src/Number/Positional.hs:1147)
tan (src/Number/Positional.hs:1163)
cot (src/Number/Positional.hs:1166)
lnSeries (src/Number/Positional.hs:1172)
lnSmall (src/Number/Positional.hs:1179)
lnNewton' (src/Number/Positional.hs:1236)
ln (src/Number/Positional.hs:1258)
arctanSmall (src/Number/Positional.hs:1307)
zero (src/Number/Positional.hs:1378)
one (src/Number/Positional.hs:1381)
minusOne (src/Number/Positional.hs:1384)
eConst (src/Number/Positional.hs:1390)
recipEConst (src/Number/Positional.hs:1393)
piConst (src/Number/Positional.hs:1396)
sliceVertPair (src/Number/Positional.hs:1413)
35% ( 6 / 17) in 'Number.Positional.Check'
Missing documentation for:
prependDigit (src/Number/Positional/Check.hs:76)
lift0 (src/Number/Positional/Check.hs:85)
lift1 (src/Number/Positional/Check.hs:89)
lift2 (src/Number/Positional/Check.hs:93)
commonBasis (src/Number/Positional/Check.hs:105)
fromBaseInteger (src/Number/Positional/Check.hs:111)
fromBaseRational (src/Number/Positional/Check.hs:115)
defltBaseRoot (src/Number/Positional/Check.hs:123)
defltBaseExp (src/Number/Positional/Check.hs:126)
defltBase (src/Number/Positional/Check.hs:130)
defltShow (src/Number/Positional/Check.hs:135)
40% ( 2 / 5) in 'MathObj.Wrapper.NumericPrelude'
Missing documentation for:
lift1 (src/MathObj/Wrapper/NumericPrelude.hs:67)
lift2 (src/MathObj/Wrapper/NumericPrelude.hs:71)
unimplemented (src/MathObj/Wrapper/NumericPrelude.hs:220)
100% ( 2 / 2) in 'MathObj.DiscreteMap'
66% ( 6 / 9) in 'Number.Physical.Unit'
Missing documentation for:
ratScale (src/Number/Physical/Unit.hs:57)
ratScaleMaybe (src/Number/Physical/Unit.hs:62)
ratScaleMaybe2 (src/Number/Physical/Unit.hs:69)
28% ( 7 / 25) in 'Number.Physical.UnitDatabase'
Missing documentation for:
T (src/Number/Physical/UnitDatabase.hs:20)
InitUnitSet (src/Number/Physical/UnitDatabase.hs:24)
InitScale (src/Number/Physical/UnitDatabase.hs:31)
extractOne (src/Number/Physical/UnitDatabase.hs:67)
initScale (src/Number/Physical/UnitDatabase.hs:71)
initUnitSet (src/Number/Physical/UnitDatabase.hs:73)
createScale (src/Number/Physical/UnitDatabase.hs:76)
createUnitSet (src/Number/Physical/UnitDatabase.hs:79)
showableUnit (src/Number/Physical/UnitDatabase.hs:88)
powerOfScale (src/Number/Physical/UnitDatabase.hs:102)
showExp (src/Number/Physical/UnitDatabase.hs:108)
findIndep (src/Number/Physical/UnitDatabase.hs:132)
findClosest (src/Number/Physical/UnitDatabase.hs:135)
evalDist (src/Number/Physical/UnitDatabase.hs:143)
findBestExp (src/Number/Physical/UnitDatabase.hs:149)
distLE (src/Number/Physical/UnitDatabase.hs:170)
distances (src/Number/Physical/UnitDatabase.hs:175)
listMultiples (src/Number/Physical/UnitDatabase.hs:178)
40% ( 30 / 74) in 'Number.SI.Unit'
Missing documentation for:
Dimension (src/Number/SI/Unit.hs:19)
fourth (src/Number/SI/Unit.hs:81)
half (src/Number/SI/Unit.hs:82)
threeFourth (src/Number/SI/Unit.hs:83)
secondsPerHour (src/Number/SI/Unit.hs:87)
secondsPerDay (src/Number/SI/Unit.hs:88)
secondsPerYear (src/Number/SI/Unit.hs:89)
meterPerInch (src/Number/SI/Unit.hs:91)
meterPerFoot (src/Number/SI/Unit.hs:92)
meterPerYard (src/Number/SI/Unit.hs:93)
meterPerAstronomicUnit (src/Number/SI/Unit.hs:94)
meterPerParsec (src/Number/SI/Unit.hs:95)
k2 (src/Number/SI/Unit.hs:97)
deg180 (src/Number/SI/Unit.hs:98)
grad200 (src/Number/SI/Unit.hs:99)
radPerDeg (src/Number/SI/Unit.hs:100)
radPerGrad (src/Number/SI/Unit.hs:101)
bytesize (src/Number/SI/Unit.hs:102)
mach (src/Number/SI/Unit.hs:108)
speedOfLight (src/Number/SI/Unit.hs:109)
electronVolt (src/Number/SI/Unit.hs:110)
calorien (src/Number/SI/Unit.hs:111)
horsePower (src/Number/SI/Unit.hs:112)
zepto (src/Number/SI/Unit.hs:116)
atto (src/Number/SI/Unit.hs:117)
femto (src/Number/SI/Unit.hs:118)
pico (src/Number/SI/Unit.hs:119)
nano (src/Number/SI/Unit.hs:120)
micro (src/Number/SI/Unit.hs:121)
milli (src/Number/SI/Unit.hs:122)
centi (src/Number/SI/Unit.hs:123)
deci (src/Number/SI/Unit.hs:124)
one (src/Number/SI/Unit.hs:125)
deca (src/Number/SI/Unit.hs:126)
hecto (src/Number/SI/Unit.hs:127)
kilo (src/Number/SI/Unit.hs:128)
mega (src/Number/SI/Unit.hs:129)
giga (src/Number/SI/Unit.hs:130)
tera (src/Number/SI/Unit.hs:131)
peta (src/Number/SI/Unit.hs:132)
exa (src/Number/SI/Unit.hs:133)
zetta (src/Number/SI/Unit.hs:134)
yotta (src/Number/SI/Unit.hs:135)
database (src/Number/SI/Unit.hs:147)
4% ( 2 / 41) in 'Number.DimensionTerm.SI'
Missing documentation for:
second (src/Number/DimensionTerm/SI.hs:44)
minute (src/Number/DimensionTerm/SI.hs:46)
hour (src/Number/DimensionTerm/SI.hs:48)
day (src/Number/DimensionTerm/SI.hs:50)
year (src/Number/DimensionTerm/SI.hs:52)
hertz (src/Number/DimensionTerm/SI.hs:54)
meter (src/Number/DimensionTerm/SI.hs:56)
gramm (src/Number/DimensionTerm/SI.hs:60)
tonne (src/Number/DimensionTerm/SI.hs:62)
coulomb (src/Number/DimensionTerm/SI.hs:74)
volt (src/Number/DimensionTerm/SI.hs:78)
kelvin (src/Number/DimensionTerm/SI.hs:84)
bit (src/Number/DimensionTerm/SI.hs:86)
byte (src/Number/DimensionTerm/SI.hs:88)
inch (src/Number/DimensionTerm/SI.hs:95)
foot (src/Number/DimensionTerm/SI.hs:96)
yard (src/Number/DimensionTerm/SI.hs:97)
astronomicUnit (src/Number/DimensionTerm/SI.hs:98)
parsec (src/Number/DimensionTerm/SI.hs:99)
zepto (src/Number/SI/Unit.hs:116)
atto (src/Number/SI/Unit.hs:117)
femto (src/Number/SI/Unit.hs:118)
pico (src/Number/SI/Unit.hs:119)
nano (src/Number/SI/Unit.hs:120)
micro (src/Number/SI/Unit.hs:121)
milli (src/Number/SI/Unit.hs:122)
centi (src/Number/SI/Unit.hs:123)
deci (src/Number/SI/Unit.hs:124)
one (src/Number/SI/Unit.hs:125)
deca (src/Number/SI/Unit.hs:126)
hecto (src/Number/SI/Unit.hs:127)
kilo (src/Number/SI/Unit.hs:128)
mega (src/Number/SI/Unit.hs:129)
giga (src/Number/SI/Unit.hs:130)
tera (src/Number/SI/Unit.hs:131)
peta (src/Number/SI/Unit.hs:132)
exa (src/Number/SI/Unit.hs:133)
zetta (src/Number/SI/Unit.hs:134)
yotta (src/Number/SI/Unit.hs:135)
43% ( 7 / 16) in 'Number.Physical'
Missing documentation for:
fromScalarSingle (src/Number/Physical.hs:47)
lift2 (src/Number/Physical.hs:62)
lift2Maybe (src/Number/Physical.hs:66)
lift2Gen (src/Number/Physical.hs:70)
errorUnitMismatch (src/Number/Physical.hs:76)
scale (src/Number/Physical.hs:93)
ratPow (src/Number/Physical.hs:96)
ratPowMaybe (src/Number/Physical.hs:101)
fromRatio (src/Number/Physical.hs:105)
54% ( 6 / 11) in 'Number.Physical.Show'
Missing documentation for:
mulPrec (src/Number/Physical/Show.hs:25)
showScaled (src/Number/Physical/Show.hs:49)
showUnitPart (src/Number/Physical/Show.hs:71)
defScale (src/Number/Physical/Show.hs:78)
findCloseScale (src/Number/Physical/Show.hs:81)
22% ( 2 / 9) in 'Number.Physical.Read'
Missing documentation for:
mulPrec (src/Number/Physical/Read.hs:21)
readsNat (src/Number/Physical/Read.hs:26)
readUnitPart (src/Number/Physical/Read.hs:37)
parseProductTail (src/Number/Physical/Read.hs:62)
parsePower (src/Number/Physical/Read.hs:73)
ignoreSpace (src/Number/Physical/Read.hs:80)
createDict (src/Number/Physical/Read.hs:87)
2% ( 1 / 47) in 'Number.SI'
Missing documentation for:
T (src/Number/SI.hs:45)
PValue (src/Number/SI.hs:48)
lift (src/Number/SI.hs:71)
lift2 (src/Number/SI.hs:75)
liftGen (src/Number/SI.hs:78)
lift2Gen (src/Number/SI.hs:82)
scale (src/Number/SI.hs:89)
fromScalarSingle (src/Number/SI.hs:92)
showNat (src/Number/SI.hs:103)
readsNat (src/Number/SI.hs:114)
quantity (src/Number/SI.hs:192)
hertz (src/Number/SI.hs:205)
second (src/Number/SI.hs:206)
minute (src/Number/SI.hs:207)
hour (src/Number/SI.hs:208)
day (src/Number/SI.hs:209)
year (src/Number/SI.hs:210)
meter (src/Number/SI.hs:211)
liter (src/Number/SI.hs:212)
gramm (src/Number/SI.hs:213)
tonne (src/Number/SI.hs:214)
newton (src/Number/SI.hs:215)
pascal (src/Number/SI.hs:216)
bar (src/Number/SI.hs:217)
joule (src/Number/SI.hs:218)
watt (src/Number/SI.hs:219)
coulomb (src/Number/SI.hs:220)
ampere (src/Number/SI.hs:221)
volt (src/Number/SI.hs:222)
ohm (src/Number/SI.hs:223)
farad (src/Number/SI.hs:224)
kelvin (src/Number/SI.hs:225)
bit (src/Number/SI.hs:226)
byte (src/Number/SI.hs:227)
baud (src/Number/SI.hs:228)
inch (src/Number/SI.hs:230)
foot (src/Number/SI.hs:231)
yard (src/Number/SI.hs:232)
astronomicUnit (src/Number/SI.hs:233)
parsec (src/Number/SI.hs:234)
accelerationOfEarthGravity (src/Number/SI.hs:236)
mach (src/Number/SI.hs:238)
speedOfLight (src/Number/SI.hs:239)
electronVolt (src/Number/SI.hs:240)
calorien (src/Number/SI.hs:241)
horsePower (src/Number/SI.hs:242)
0% ( 0 / 11) in 'Algebra.Lattice'
Missing documentation for:
Module header
C (src/Algebra/Lattice.hs:22)
max (src/Algebra/Lattice.hs:65)
min (src/Algebra/Lattice.hs:66)
abs (src/Algebra/Lattice.hs:69)
propUpCommutative (src/Algebra/Lattice.hs:30)
propDnCommutative (src/Algebra/Lattice.hs:31)
propUpAssociative (src/Algebra/Lattice.hs:35)
propDnAssociative (src/Algebra/Lattice.hs:36)
propUpDnDistributive (src/Algebra/Lattice.hs:40)
propDnUpDistributive (src/Algebra/Lattice.hs:41)
69% (145 /208) in 'NumericPrelude'
Missing documentation for:
Module header
fromIntegral (src/Algebra/ToInteger.hs:54)
toInteger
Rational (src/Number/Ratio.hs:64)
even (src/Algebra/IntegralDomain.hs:187)
fromInteger
*
one
signum
product (src/Algebra/Ring.hs:102)
truncate
round
/
recip
^-
fromRational'
quot
rem
quotRem
div
mod
% (src/Number/Ratio.hs:87)
numerator
denominator
odd (src/Algebra/IntegralDomain.hs:188)
atan2
pi
exp
log
**
logBase
sin
cos
tan
asin
acos
atan
sinh
cosh
tanh
asinh
acosh
atanh
sqrt
^/
isZero
divides (src/Algebra/IntegralDomain.hs:122)
sqr (src/Algebra/Ring.hs:99)
euclid (src/Algebra/PrincipalIdealDomain.hs:162)
extendedEuclid (src/Algebra/PrincipalIdealDomain.hs:177)
stdAssociate
stdUnitInv
isUnit
stdUnit
product1 (src/Algebra/Ring.hs:105)
^? (src/Algebra/Transcendental.hs:134)
Bool
Ordering
catch (src/NumericPrelude/Base.hs:138)
fail
max (src/Algebra/Lattice.hs:65)
min (src/Algebra/Lattice.hs:66)
abs (src/Algebra/Lattice.hs:69)
Warning: NumericPrelude.Base: could not find link destinations for:
- Test.QuickCheck.Random.QCGen
- Test.QuickCheck.Text.Cell
- Test.QuickCheck.Text.Str
- Test.QuickCheck.Property.Rose
- GHC.Generics.SingKind
- GHC.Generics.DemoteRep
- GHC.Generics.fromSing
- GHC.Generics.SingI
- GHC.Generics.sing
- GHC.Generics.Sing
- GHC.Generics.D:R:UReckCharp0
- GHC.Generics.Rep1_Either
- GHC.Generics.Rep1_Maybe
- GHC.Generics.Rep_Ordering
- GHC.Generics.Rep_Bool
- GHC.Generics.Rep_Either
- GHC.Generics.Rep_Maybe
- GHC.Generics.Rep_R:UReckCharp
- GHC.Generics.Rep1_R:UReckCharp
- GHC.IOPort.IOPort
- Text.ParserCombinators.ReadP.P
- Foreign.Storable.Record.Box
- GHC.Generics.D:R:SingBoola0
- GHC.Generics.STrue
- GHC.Generics.D:R:DemoteRepBool
- GHC.Generics.SFalse
- GHC.Generics.D:R:SingMaybeb0
- GHC.Generics.SNothing
- GHC.Generics.SJust
- GHC.Generics.D:R:DemoteRepMaybe
- Test.QuickCheck.Function.Shrunk
- GHC.IOPort.IOPortException
- Text.Printf.UPrintf
- Text.Printf.hspr
- Text.Printf.spr
- Data.Graph.SetM
Warning: Algebra.RealRing: could not find link destinations for:
- Algebra.OrderDecision.C
Warning: NumericPrelude.Numeric: could not find link destinations for:
- GHC.Generics.D:R:UReckIntp0
- GHC.Generics.D:R:UReckFloatp0
- GHC.Generics.D:R:UReckDoublep0
- GHC.Generics.Rep_R:UReckIntp
- GHC.Generics.Rep1_R:UReckIntp
- GHC.Generics.Rep1_R:UReckFloatp
- GHC.Generics.Rep_R:UReckDoublep
- GHC.Generics.Rep1_R:UReckDoublep
- GHC.Generics.Rep_R:UReckFloatp
Warning: NumericPrelude: could not find link destinations for:
- Test.QuickCheck.Random.QCGen
- Test.QuickCheck.Text.Cell
- Test.QuickCheck.Text.Str
- Test.QuickCheck.Property.Rose
- GHC.Generics.SingKind
- GHC.Generics.DemoteRep
- GHC.Generics.fromSing
- GHC.Generics.SingI
- GHC.Generics.sing
- GHC.Generics.Sing
- GHC.Generics.D:R:UReckIntp0
- GHC.Generics.D:R:UReckFloatp0
- GHC.Generics.D:R:UReckDoublep0
- GHC.Generics.D:R:UReckCharp0
- GHC.Generics.Rep1_Either
- GHC.Generics.Rep1_Maybe
- GHC.Generics.Rep_Ordering
- GHC.Generics.Rep_Bool
- GHC.Generics.Rep_Either
- GHC.Generics.Rep_Maybe
- GHC.Generics.Rep_R:UReckIntp
- GHC.Generics.Rep1_R:UReckIntp
- GHC.Generics.Rep1_R:UReckFloatp
- GHC.Generics.Rep_R:UReckDoublep
- GHC.Generics.Rep1_R:UReckDoublep
- GHC.Generics.Rep_R:UReckCharp
- GHC.Generics.Rep1_R:UReckCharp
- GHC.IOPort.IOPort
- Text.ParserCombinators.ReadP.P
- Foreign.Storable.Record.Box
- GHC.Generics.D:R:SingBoola0
- GHC.Generics.STrue
- GHC.Generics.D:R:DemoteRepBool
- GHC.Generics.SFalse
- GHC.Generics.Rep_R:UReckFloatp
- GHC.Generics.D:R:SingMaybeb0
- GHC.Generics.SNothing
- GHC.Generics.SJust
- GHC.Generics.D:R:DemoteRepMaybe
- Test.QuickCheck.Function.Shrunk
- GHC.IOPort.IOPortException
- Text.Printf.UPrintf
- Text.Printf.hspr
- Text.Printf.spr
- Data.Graph.SetM
Documentation created: dist/doc/html/numeric-prelude/,
dist/doc/html/numeric-prelude/numeric-prelude.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/numeric-prelude-0.4.4-EOmfSALwiSL8CXj5rjvAEu
Completed numeric-prelude-0.4.4
Downloading np-extras-0.3.1.3
Downloaded np-extras-0.3.1.3
Configuring np-extras-0.3.1.3...
Preprocessing library for np-extras-0.3.1.3..
Building library for np-extras-0.3.1.3..
[1 of 3] Compiling MathObj.FactoredRational ( MathObj/FactoredRational.hs, dist/build/MathObj/FactoredRational.o, dist/build/MathObj/FactoredRational.dyn_o )
[2 of 3] Compiling MathObj.Monomial ( MathObj/Monomial.hs, dist/build/MathObj/Monomial.o, dist/build/MathObj/Monomial.dyn_o )
[3 of 3] Compiling MathObj.MultiVarPolynomial ( MathObj/MultiVarPolynomial.hs, dist/build/MathObj/MultiVarPolynomial.o, dist/build/MathObj/MultiVarPolynomial.dyn_o )
Preprocessing library for np-extras-0.3.1.3..
Running Haddock on library for np-extras-0.3.1.3..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[1 of 3] Compiling MathObj.FactoredRational ( MathObj/FactoredRational.hs, nothing )
[2 of 3] Compiling MathObj.Monomial ( MathObj/Monomial.hs, nothing )
[3 of 3] Compiling MathObj.MultiVarPolynomial ( MathObj/MultiVarPolynomial.hs, nothing )
Haddock coverage:
100% ( 8 / 8) in 'MathObj.FactoredRational'
90% ( 10 / 11) in 'MathObj.Monomial'
Missing documentation for:
mkMonomial (MathObj/Monomial.hs:54)
69% ( 9 / 13) in 'MathObj.MultiVarPolynomial'
Missing documentation for:
fromMonomials (MathObj/MultiVarPolynomial.hs:54)
lift0 (MathObj/MultiVarPolynomial.hs:58)
lift1 (MathObj/MultiVarPolynomial.hs:62)
lift2 (MathObj/MultiVarPolynomial.hs:66)
Documentation created: dist/doc/html/np-extras/,
dist/doc/html/np-extras/np-extras.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/np-extras-0.3.1.3-ASkhZysxDoM41aeepquvea
Completed np-extras-0.3.1.3
Downloading species-0.4.1
Downloaded species-0.4.1
Configuring species-0.4.1...
Preprocessing library for species-0.4.1..
Building library for species-0.4.1..
[ 1 of 13] Compiling Math.Combinatorics.Species.Structures ( Math/Combinatorics/Species/Structures.hs, dist/build/Math/Combinatorics/Species/Structures.o, dist/build/Math/Combinatorics/Species/Structures.dyn_o )
Math/Combinatorics/Species/Structures.hs:212:31: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
Math/Combinatorics/Species/Structures.hs:212:36: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
Math/Combinatorics/Species/Structures.hs:212:42: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
Math/Combinatorics/Species/Structures.hs:212:47: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
[ 2 of 13] Compiling Math.Combinatorics.Species.Types ( Math/Combinatorics/Species/Types.hs, dist/build/Math/Combinatorics/Species/Types.o, dist/build/Math/Combinatorics/Species/Types.dyn_o )
[ 3 of 13] Compiling Math.Combinatorics.Species.Util.Interval ( Math/Combinatorics/Species/Util/Interval.hs, dist/build/Math/Combinatorics/Species/Util/Interval.o, dist/build/Math/Combinatorics/Species/Util/Interval.dyn_o )
[ 4 of 13] Compiling Math.Combinatorics.Species.AST ( Math/Combinatorics/Species/AST.hs, dist/build/Math/Combinatorics/Species/AST.o, dist/build/Math/Combinatorics/Species/AST.dyn_o )
Math/Combinatorics/Species/AST.hs:116:24: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
116 | data TSpeciesAST (s :: * -> *) where
| ^
Math/Combinatorics/Species/AST.hs:116:29: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
116 | data TSpeciesAST (s :: * -> *) where
| ^
Math/Combinatorics/Species/AST.hs:141:28: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
141 | data SizedSpeciesAST (s :: * -> *) where
| ^
Math/Combinatorics/Species/AST.hs:141:33: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
141 | data SizedSpeciesAST (s :: * -> *) where
| ^
[ 5 of 13] Compiling Math.Combinatorics.Species.Enumerate ( Math/Combinatorics/Species/Enumerate.hs, dist/build/Math/Combinatorics/Species/Enumerate.o, dist/build/Math/Combinatorics/Species/Enumerate.dyn_o )
Math/Combinatorics/Species/Enumerate.hs:383:49: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
383 | class Typeable (StructTy f) => Enumerable (f :: * -> *) where
| ^
Math/Combinatorics/Species/Enumerate.hs:383:54: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
383 | class Typeable (StructTy f) => Enumerable (f :: * -> *) where
| ^
Math/Combinatorics/Species/Enumerate.hs:386:22: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
386 | type StructTy f :: * -> *
| ^
Math/Combinatorics/Species/Enumerate.hs:386:27: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
386 | type StructTy f :: * -> *
| ^
[ 6 of 13] Compiling Math.Combinatorics.Species.Class ( Math/Combinatorics/Species/Class.hs, dist/build/Math/Combinatorics/Species/Class.o, dist/build/Math/Combinatorics/Species/Class.dyn_o )
[ 7 of 13] Compiling Math.Combinatorics.Species.AST.Instances ( Math/Combinatorics/Species/AST/Instances.hs, dist/build/Math/Combinatorics/Species/AST/Instances.o, dist/build/Math/Combinatorics/Species/AST/Instances.dyn_o )
[ 8 of 13] Compiling Math.Combinatorics.Species.Simplify ( Math/Combinatorics/Species/Simplify.hs, dist/build/Math/Combinatorics/Species/Simplify.o, dist/build/Math/Combinatorics/Species/Simplify.dyn_o )
[ 9 of 13] Compiling Math.Combinatorics.Species.NewtonRaphson ( Math/Combinatorics/Species/NewtonRaphson.hs, dist/build/Math/Combinatorics/Species/NewtonRaphson.o, dist/build/Math/Combinatorics/Species/NewtonRaphson.dyn_o )
[10 of 13] Compiling Math.Combinatorics.Species.Labeled ( Math/Combinatorics/Species/Labeled.hs, dist/build/Math/Combinatorics/Species/Labeled.o, dist/build/Math/Combinatorics/Species/Labeled.dyn_o )
[11 of 13] Compiling Math.Combinatorics.Species.CycleIndex ( Math/Combinatorics/Species/CycleIndex.hs, dist/build/Math/Combinatorics/Species/CycleIndex.o, dist/build/Math/Combinatorics/Species/CycleIndex.dyn_o )
Math/Combinatorics/Species/CycleIndex.hs:171:17: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
171 | . map ((fst . head) &&& (sum . map snd))
| ^^^^
Math/Combinatorics/Species/CycleIndex.hs:294:33: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
294 | where partials = zip (tail $ scanl (\soFar cyc -> soFar + uncurry (*) cyc) 0 p) p
| ^^^^
[12 of 13] Compiling Math.Combinatorics.Species.Unlabeled ( Math/Combinatorics/Species/Unlabeled.hs, dist/build/Math/Combinatorics/Species/Unlabeled.o, dist/build/Math/Combinatorics/Species/Unlabeled.dyn_o )
[13 of 13] Compiling Math.Combinatorics.Species ( Math/Combinatorics/Species.hs, dist/build/Math/Combinatorics/Species.o, dist/build/Math/Combinatorics/Species.dyn_o )
Preprocessing library for species-0.4.1..
Running Haddock on library for species-0.4.1..
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 13] Compiling Math.Combinatorics.Species.Structures ( Math/Combinatorics/Species/Structures.hs, nothing )
Math/Combinatorics/Species/Structures.hs:212:31: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
Math/Combinatorics/Species/Structures.hs:212:36: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
Math/Combinatorics/Species/Structures.hs:212:42: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
Math/Combinatorics/Species/Structures.hs:212:47: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
212 | type family Interp f (self :: * -> *) :: * -> *
| ^
[ 2 of 13] Compiling Math.Combinatorics.Species.Types ( Math/Combinatorics/Species/Types.hs, nothing )
[ 3 of 13] Compiling Math.Combinatorics.Species.Util.Interval ( Math/Combinatorics/Species/Util/Interval.hs, nothing )
[ 4 of 13] Compiling Math.Combinatorics.Species.AST ( Math/Combinatorics/Species/AST.hs, nothing )
Math/Combinatorics/Species/AST.hs:116:24: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
116 | data TSpeciesAST (s :: * -> *) where
| ^
Math/Combinatorics/Species/AST.hs:116:29: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
116 | data TSpeciesAST (s :: * -> *) where
| ^
Math/Combinatorics/Species/AST.hs:141:28: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
141 | data SizedSpeciesAST (s :: * -> *) where
| ^
Math/Combinatorics/Species/AST.hs:141:33: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
141 | data SizedSpeciesAST (s :: * -> *) where
| ^
[ 5 of 13] Compiling Math.Combinatorics.Species.Enumerate ( Math/Combinatorics/Species/Enumerate.hs, nothing )
Math/Combinatorics/Species/Enumerate.hs:383:49: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
383 | class Typeable (StructTy f) => Enumerable (f :: * -> *) where
| ^
Math/Combinatorics/Species/Enumerate.hs:383:54: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
383 | class Typeable (StructTy f) => Enumerable (f :: * -> *) where
| ^
Math/Combinatorics/Species/Enumerate.hs:386:22: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
386 | type StructTy f :: * -> *
| ^
Math/Combinatorics/Species/Enumerate.hs:386:27: warning: [GHC-39567] [-Wstar-is-type]
Using * (or its Unicode variant) to mean Data.Kind.Type
relies on the StarIsType extension, which will become
deprecated in the future.
Suggested fix: Use Type from Data.Kind instead.
|
386 | type StructTy f :: * -> *
| ^
[ 6 of 13] Compiling Math.Combinatorics.Species.Class ( Math/Combinatorics/Species/Class.hs, nothing )
[ 7 of 13] Compiling Math.Combinatorics.Species.AST.Instances ( Math/Combinatorics/Species/AST/Instances.hs, nothing )
[ 8 of 13] Compiling Math.Combinatorics.Species.Simplify ( Math/Combinatorics/Species/Simplify.hs, nothing )
[ 9 of 13] Compiling Math.Combinatorics.Species.NewtonRaphson ( Math/Combinatorics/Species/NewtonRaphson.hs, nothing )
[10 of 13] Compiling Math.Combinatorics.Species.Labeled ( Math/Combinatorics/Species/Labeled.hs, nothing )
[11 of 13] Compiling Math.Combinatorics.Species.CycleIndex ( Math/Combinatorics/Species/CycleIndex.hs, nothing )
Math/Combinatorics/Species/CycleIndex.hs:171:17: warning: [GHC-63394] [-Wx-partial]
In the use of head
(imported from NumericPrelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
171 | . map ((fst . head) &&& (sum . map snd))
| ^^^^
Math/Combinatorics/Species/CycleIndex.hs:294:33: warning: [GHC-63394] [-Wx-partial]
In the use of tail
(imported from NumericPrelude, but defined in GHC.List):
"This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
|
294 | where partials = zip (tail $ scanl (\soFar cyc -> soFar + uncurry (*) cyc) 0 p) p
| ^^^^
[12 of 13] Compiling Math.Combinatorics.Species.Unlabeled ( Math/Combinatorics/Species/Unlabeled.hs, nothing )
[13 of 13] Compiling Math.Combinatorics.Species ( Math/Combinatorics/Species.hs, nothing )
Haddock coverage:
Warning: 'Mu' is ambiguous. It is defined
* at Math/Combinatorics/Species/Structures.hs:207:15
* at Math/Combinatorics/Species/Structures.hs:207:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Structures.hs:207:1
Warning: 'Star' is ambiguous. It is defined
* at Math/Combinatorics/Species/Structures.hs:182:15
* at Math/Combinatorics/Species/Structures.hs:182:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Structures.hs:182:1
Warning: 'Set' is ambiguous. It is defined
* at Math/Combinatorics/Species/Structures.hs:171:17
* at Math/Combinatorics/Species/Structures.hs:171:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Structures.hs:171:1
Warning: 'Bracelet' is ambiguous. It is defined
* at Math/Combinatorics/Species/Structures.hs:160:22
* at Math/Combinatorics/Species/Structures.hs:160:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Structures.hs:160:1
Warning: 'Cycle' is ambiguous. It is defined
* at Math/Combinatorics/Species/Structures.hs:148:19
* at Math/Combinatorics/Species/Structures.hs:148:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Structures.hs:148:1
100% ( 16 / 16) in 'Math.Combinatorics.Species.Structures'
52% ( 10 / 19) in 'Math.Combinatorics.Species.Types'
Missing documentation for:
egfFromCoeffs (Math/Combinatorics/Species/Types.hs:80)
liftEGF (Math/Combinatorics/Species/Types.hs:83)
liftEGF2 (Math/Combinatorics/Species/Types.hs:87)
gfFromCoeffs (Math/Combinatorics/Species/Types.hs:94)
liftGF (Math/Combinatorics/Species/Types.hs:97)
liftGF2 (Math/Combinatorics/Species/Types.hs:101)
ciFromMonomials (Math/Combinatorics/Species/Types.hs:108)
liftCI (Math/Combinatorics/Species/Types.hs:112)
liftCI2 (Math/Combinatorics/Species/Types.hs:116)
100% ( 20 / 20) in 'Math.Combinatorics.Species.Util.Interval'
Warning: 'Species' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
95% ( 22 / 23) in 'Math.Combinatorics.Species.AST'
Missing documentation for:
SizedSpeciesAST (Math/Combinatorics/Species/AST.hs:141)
Warning: 'Species' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
Warning: 'Structure' is ambiguous. It is defined
* at Math/Combinatorics/Species/Enumerate.hs:158:3
* at Math/Combinatorics/Species/Enumerate.hs:157:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Enumerate.hs:157:1
100% ( 18 / 18) in 'Math.Combinatorics.Species.Enumerate'
Warning: 'differentiate' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
75% ( 27 / 36) in 'Math.Combinatorics.Species.Class'
Missing documentation for:
sets (Math/Combinatorics/Species/Class.hs:194)
cycles (Math/Combinatorics/Species/Class.hs:201)
bracelets (Math/Combinatorics/Species/Class.hs:209)
linOrds (Math/Combinatorics/Species/Class.hs:225)
subsets (Math/Combinatorics/Species/Class.hs:250)
ksubsets (Math/Combinatorics/Species/Class.hs:259)
elements (Math/Combinatorics/Species/Class.hs:228)
bag (Math/Combinatorics/Species/Class.hs:197)
bags (Math/Combinatorics/Species/Class.hs:198)
100% ( 6 / 6) in 'Math.Combinatorics.Species.AST.Instances'
100% ( 3 / 3) in 'Math.Combinatorics.Species.Simplify'
100% ( 5 / 5) in 'Math.Combinatorics.Species.NewtonRaphson'
Warning: 'EGF' is ambiguous. It is defined
* at Math/Combinatorics/Species/Types.hs:76:15
* at Math/Combinatorics/Species/Types.hs:76:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Types.hs:76:1
100% ( 3 / 3) in 'Math.Combinatorics.Species.Labeled'
Warning: 'Monomial' is out of scope.
If you qualify the identifier, haddock can try to link it anyway.
100% ( 9 / 9) in 'Math.Combinatorics.Species.CycleIndex'
Warning: 'GF' is ambiguous. It is defined
* at Math/Combinatorics/Species/Types.hs:90:14
* at Math/Combinatorics/Species/Types.hs:90:1
You may be able to disambiguate the identifier by qualifying it or
by specifying the type/value namespace explicitly.
Defaulting to the one defined at Math/Combinatorics/Species/Types.hs:90:1
100% ( 3 / 3) in 'Math.Combinatorics.Species.Unlabeled'
91% ( 73 / 80) in 'Math.Combinatorics.Species'
Missing documentation for:
sets (Math/Combinatorics/Species/Class.hs:194)
cycles (Math/Combinatorics/Species/Class.hs:201)
bracelets (Math/Combinatorics/Species/Class.hs:209)
linOrds (Math/Combinatorics/Species/Class.hs:225)
subsets (Math/Combinatorics/Species/Class.hs:250)
ksubsets (Math/Combinatorics/Species/Class.hs:259)
elements (Math/Combinatorics/Species/Class.hs:228)
Warning: Math.Combinatorics.Species.Structures: could not find link destinations for:
- Math.Combinatorics.Species.Enumerate.D:R:StructTyMu
- Math.Combinatorics.Species.Enumerate.D:R:StructTyStar
- Math.Combinatorics.Species.Enumerate.D:R:StructTySet
- Math.Combinatorics.Species.Enumerate.D:R:StructTyBracelet
- Math.Combinatorics.Species.Enumerate.D:R:StructTyCycle
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:.:
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:*:
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:+:
- Math.Combinatorics.Species.Enumerate.D:R:StructTyId
- Math.Combinatorics.Species.Enumerate.D:R:StructTyConst
- Math.Combinatorics.Species.Enumerate.D:R:StructTyUnit
- Math.Combinatorics.Species.Enumerate.D:R:StructTyVoid
Warning: Math.Combinatorics.Species.Enumerate: could not find link destinations for:
- Math.Combinatorics.Species.Enumerate.D:R:StructTyMaybe
- Math.Combinatorics.Species.Enumerate.D:R:StructTyMu
- Math.Combinatorics.Species.Enumerate.D:R:StructTyStar
- Math.Combinatorics.Species.Enumerate.D:R:StructTySet
- Math.Combinatorics.Species.Enumerate.D:R:StructTyBracelet
- Math.Combinatorics.Species.Enumerate.D:R:StructTyCycle
- Math.Combinatorics.Species.Enumerate.D:R:StructTyList
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:.:
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:*:
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:+:
- Math.Combinatorics.Species.Enumerate.D:R:StructTyId
- Math.Combinatorics.Species.Enumerate.D:R:StructTyConst
- Math.Combinatorics.Species.Enumerate.D:R:StructTyUnit
- Math.Combinatorics.Species.Enumerate.D:R:StructTyVoid
Warning: Math.Combinatorics.Species: could not find link destinations for:
- Math.Combinatorics.Species.Enumerate.D:R:StructTyMaybe
- Math.Combinatorics.Species.Enumerate.D:R:StructTyMu
- Math.Combinatorics.Species.Enumerate.D:R:StructTyStar
- Math.Combinatorics.Species.Enumerate.D:R:StructTySet
- Math.Combinatorics.Species.Enumerate.D:R:StructTyBracelet
- Math.Combinatorics.Species.Enumerate.D:R:StructTyCycle
- Math.Combinatorics.Species.Enumerate.D:R:StructTyList
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:.:
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:*:
- Math.Combinatorics.Species.Enumerate.D:R:StructTy:+:
- Math.Combinatorics.Species.Enumerate.D:R:StructTyId
- Math.Combinatorics.Species.Enumerate.D:R:StructTyConst
- Math.Combinatorics.Species.Enumerate.D:R:StructTyUnit
- Math.Combinatorics.Species.Enumerate.D:R:StructTyVoid
Documentation created: dist/doc/html/species/,
dist/doc/html/species/species.txt
Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/species-0.4.1-DEXoHmSzmIcJPqzwS8MM2S
Completed species-0.4.1
Test log
[view raw]
Resolving dependencies... No tests to run for all the packages in the project