Resolving dependencies... Configuring data-accessor-0.2.3.1... Preprocessing library for data-accessor-0.2.3.1.. Building library for data-accessor-0.2.3.1.. [ 1 of 11] Compiling Data.Accessor.ByteSource ( src-fail/from-4.13/Data/Accessor/ByteSource.hs, dist/build/Data/Accessor/ByteSource.o, dist/build/Data/Accessor/ByteSource.dyn_o ) [ 2 of 11] Compiling Data.Accessor.Private ( src-4/Data/Accessor/Private.hs, dist/build/Data/Accessor/Private.o, dist/build/Data/Accessor/Private.dyn_o ) [ 3 of 11] Compiling Data.Accessor.Basic ( src/Data/Accessor/Basic.hs, dist/build/Data/Accessor/Basic.o, dist/build/Data/Accessor/Basic.dyn_o ) [ 4 of 11] Compiling Data.Accessor.MonadStatePrivate ( src/Data/Accessor/MonadStatePrivate.hs, dist/build/Data/Accessor/MonadStatePrivate.o, dist/build/Data/Accessor/MonadStatePrivate.dyn_o ) [ 5 of 11] Compiling Data.Accessor.MonadState ( src/Data/Accessor/MonadState.hs, dist/build/Data/Accessor/MonadState.o, dist/build/Data/Accessor/MonadState.dyn_o ) [ 6 of 11] Compiling Data.Accessor.Container ( src/Data/Accessor/Container.hs, dist/build/Data/Accessor/Container.o, dist/build/Data/Accessor/Container.dyn_o ) [ 7 of 11] Compiling Data.Accessor.BinaryRead ( src/Data/Accessor/BinaryRead.hs, dist/build/Data/Accessor/BinaryRead.o, dist/build/Data/Accessor/BinaryRead.dyn_o ) [ 8 of 11] Compiling Data.Accessor ( src/Data/Accessor.hs, dist/build/Data/Accessor.o, dist/build/Data/Accessor.dyn_o ) [ 9 of 11] Compiling Data.Accessor.Show ( src/Data/Accessor/Show.hs, dist/build/Data/Accessor/Show.o, dist/build/Data/Accessor/Show.dyn_o ) [10 of 11] Compiling Data.Accessor.Tuple ( src/Data/Accessor/Tuple.hs, dist/build/Data/Accessor/Tuple.o, dist/build/Data/Accessor/Tuple.dyn_o ) [11 of 11] Compiling Data.Accessor.Example ( src/Data/Accessor/Example.hs, dist/build/Data/Accessor/Example.o, dist/build/Data/Accessor/Example.dyn_o ) Preprocessing library for data-accessor-0.2.3.1.. Running Haddock on library for data-accessor-0.2.3.1.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [ 1 of 11] Compiling Data.Accessor.ByteSource ( src-fail/from-4.13/Data/Accessor/ByteSource.hs, nothing ) [ 2 of 11] Compiling Data.Accessor.Private ( src-4/Data/Accessor/Private.hs, nothing ) [ 3 of 11] Compiling Data.Accessor.Basic ( src/Data/Accessor/Basic.hs, nothing ) [ 4 of 11] Compiling Data.Accessor.MonadStatePrivate ( src/Data/Accessor/MonadStatePrivate.hs, nothing ) [ 5 of 11] Compiling Data.Accessor.MonadState ( src/Data/Accessor/MonadState.hs, nothing ) [ 6 of 11] Compiling Data.Accessor.Container ( src/Data/Accessor/Container.hs, nothing ) [ 7 of 11] Compiling Data.Accessor.BinaryRead ( src/Data/Accessor/BinaryRead.hs, nothing ) [ 8 of 11] Compiling Data.Accessor ( src/Data/Accessor.hs, nothing ) [ 9 of 11] Compiling Data.Accessor.Show ( src/Data/Accessor/Show.hs, nothing ) [10 of 11] Compiling Data.Accessor.Tuple ( src/Data/Accessor/Tuple.hs, nothing ) [11 of 11] Compiling Data.Accessor.Example ( src/Data/Accessor/Example.hs, nothing ) Haddock coverage: 89% ( 17 / 19) in 'Data.Accessor.Basic' Missing documentation for: fromSetGet (src/Data/Accessor/Basic.hs:24) fromLens (src/Data/Accessor/Basic.hs:28) 50% ( 5 / 10) in 'Data.Accessor.MonadState' Missing documentation for: get (src/Data/Accessor/MonadStatePrivate.hs:14) lift (src/Data/Accessor/MonadStatePrivate.hs:57) modify (src/Data/Accessor/MonadStatePrivate.hs:17) set (src/Data/Accessor/MonadStatePrivate.hs:11) liftT (src/Data/Accessor/MonadStatePrivate.hs:65) 57% ( 4 / 7) in 'Data.Accessor.Container' Missing documentation for: array (src/Data/Accessor/Container.hs:28) intMapDefault (src/Data/Accessor/Container.hs:59) intMapMaybe (src/Data/Accessor/Container.hs:63) 11% ( 1 / 9) in 'Data.Accessor.BinaryRead' Missing documentation for: Stream (src/Data/Accessor/BinaryRead.hs:30) C (src/Data/Accessor/BinaryRead.hs:32) ByteSource (src-fail/from-4.13/Data/Accessor/ByteSource.hs:26) ByteStream (src-fail/from-4.13/Data/Accessor/ByteSource.hs:16) ByteCompatible (src-fail/from-4.13/Data/Accessor/ByteSource.hs:9) Parser (src/Data/Accessor/BinaryRead.hs:53) field (src/Data/Accessor/BinaryRead.hs:58) record (src/Data/Accessor/BinaryRead.hs:64) 100% ( 16 / 16) in 'Data.Accessor' 33% ( 1 / 3) in 'Data.Accessor.Show' Missing documentation for: field (src/Data/Accessor/Show.hs:21) showsPrec (src/Data/Accessor/Show.hs:29) 85% ( 6 / 7) in 'Data.Accessor.Tuple' Missing documentation for: Module header Warning: 'get' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Warning: 'modify' is out of scope. If you qualify the identifier, haddock can try to link it anyway. Documentation created: dist/doc/html/data-accessor/, dist/doc/html/data-accessor/data-accessor.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/data-accessor-0.2.3.1-AfcJeWceIA8Iaavuxhbqnn Completed data-accessor-0.2.3.1 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 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 data-ref-0.1... Preprocessing library for data-ref-0.1.. Building library for data-ref-0.1.. [1 of 1] Compiling Data.Ref ( src/Data/Ref.hs, dist/build/Data/Ref.o, dist/build/Data/Ref.dyn_o ) src/Data/Ref.hs:38: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() | 38 | import Data.Monoid (Monoid) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ Preprocessing library for data-ref-0.1.. Running Haddock on library for data-ref-0.1.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [1 of 1] Compiling Data.Ref ( src/Data/Ref.hs, nothing ) src/Data/Ref.hs:38: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() | 38 | import Data.Monoid (Monoid) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ Haddock coverage: 11% ( 1 / 9) in 'Data.Ref' Missing documentation for: T (src/Data/Ref.hs:43) modify (src/Data/Ref.hs:46) focus (src/Data/Ref.hs:49) newCons (src/Data/Ref.hs:57) C (src/Data/Ref.hs:60) lift (src/Data/Ref.hs:79) liftIO (src/Data/Ref.hs:82) newLifted (src/Data/Ref.hs:85) Documentation created: dist/doc/html/data-ref/, dist/doc/html/data-ref/data-ref.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/data-ref-0.1-BoLnbtZEacGEXZkAs6HaCO Completed data-ref-0.1 Downloading unique-logic-tf-0.5.1.1 Downloaded unique-logic-tf-0.5.1.1 Configuring unique-logic-tf-0.5.1.1... Preprocessing library for unique-logic-tf-0.5.1.1.. Building library for unique-logic-tf-0.5.1.1.. [ 1 of 13] Compiling UniqueLogic.ST.TF.MonadTrans ( src/UniqueLogic/ST/TF/MonadTrans.hs, dist/build/UniqueLogic/ST/TF/MonadTrans.o, dist/build/UniqueLogic/ST/TF/MonadTrans.dyn_o ) src/UniqueLogic/ST/TF/MonadTrans.hs:12:1: warning: [GHC-38856] [-Wunused-imports] The import of <*>, Applicative, pure from module Control.Applicative is redundant | 12 | import Control.Applicative (Applicative, pure, (<*>), Const(Const)) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/MonadTrans.hs:14: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() | 14 | import Data.Monoid (Monoid, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/MonadTrans.hs:62:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical pure = return definition detected in the instance declaration for Applicative (Wrap t m). Suggested fix: Move definition from return to pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 62 | pure = return | ^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/MonadTrans.hs:66:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical return definition detected in the instance declaration for Monad (Wrap t m). return will eventually be removed in favour of pure Suggested fix: Either remove definition for return (recommended) or define as return = pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 66 | return = wrap . point | ^^^^^^^^^^^^^^^^^^^^^ [ 2 of 13] Compiling UniqueLogic.ST.TF.System ( src/UniqueLogic/ST/TF/System.hs, dist/build/UniqueLogic/ST/TF/System.o, dist/build/UniqueLogic/ST/TF/System.dyn_o ) src/UniqueLogic/ST/TF/System.hs:40: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() | 40 | import Control.Applicative (Applicative, liftA2, pure, (<*>), (<$>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:45: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() | 45 | import Data.Monoid (Monoid, mempty, mappend, mconcat, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:46: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() | 46 | import Data.Semigroup (Semigroup, (<>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:66:4: warning: [GHC-50928] [-Wnoncanonical-monoid-instances] Noncanonical mappend definition detected in the instance declaration for Monoid (Updates w s). 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 | 66 | mappend (Updates x) (Updates y) = Updates $ mappend x y | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:91:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical return definition detected in the instance declaration for Monad (T w s). return will eventually be removed in favour of pure Suggested fix: Either remove definition for return (recommended) or define as return = pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 91 | return = Cons . return | ^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:192:32: 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. | 192 | data ValueConstraint w a :: * | ^ [ 3 of 13] Compiling UniqueLogic.ST.TF.System.Label ( src/UniqueLogic/ST/TF/System/Label.hs, dist/build/UniqueLogic/ST/TF/System/Label.o, dist/build/UniqueLogic/ST/TF/System/Label.dyn_o ) src/UniqueLogic/ST/TF/System/Label.hs:25: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() | 25 | import Data.Monoid (Monoid, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System/Label.hs:26:1: warning: [GHC-66111] [-Wunused-imports] The import of Data.Traversable is redundant except perhaps to import instances from Data.Traversable To import instances alone, use: import Data.Traversable() | 26 | import Data.Traversable (traverse, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [ 4 of 13] Compiling UniqueLogic.ST.TF.System.Simple ( src/UniqueLogic/ST/TF/System/Simple.hs, dist/build/UniqueLogic/ST/TF/System/Simple.o, dist/build/UniqueLogic/ST/TF/System/Simple.dyn_o ) [ 5 of 13] Compiling UniqueLogic.ST.TF.ZeroFractional ( src/UniqueLogic/ST/TF/ZeroFractional.hs, dist/build/UniqueLogic/ST/TF/ZeroFractional.o, dist/build/UniqueLogic/ST/TF/ZeroFractional.dyn_o ) [ 6 of 13] Compiling UniqueLogic.ST.TF.Rule ( src/UniqueLogic/ST/TF/Rule.hs, dist/build/UniqueLogic/ST/TF/Rule.o, dist/build/UniqueLogic/ST/TF/Rule.dyn_o ) src/UniqueLogic/ST/TF/Rule.hs:14: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() | 14 | import Control.Applicative (liftA2, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [ 7 of 13] Compiling UniqueLogic.ST.TF.Example.Rule ( src/UniqueLogic/ST/TF/Example/Rule.hs, dist/build/UniqueLogic/ST/TF/Example/Rule.o, dist/build/UniqueLogic/ST/TF/Example/Rule.dyn_o ) [ 8 of 13] Compiling UniqueLogic.ST.TF.Example.Incremental ( src/UniqueLogic/ST/TF/Example/Incremental.hs, dist/build/UniqueLogic/ST/TF/Example/Incremental.o, dist/build/UniqueLogic/ST/TF/Example/Incremental.dyn_o ) [ 9 of 13] Compiling UniqueLogic.ST.TF.Expression ( src/UniqueLogic/ST/TF/Expression.hs, dist/build/UniqueLogic/ST/TF/Expression.o, dist/build/UniqueLogic/ST/TF/Expression.dyn_o ) src/UniqueLogic/ST/TF/Expression.hs:25:1: warning: [GHC-38856] [-Wunused-imports] The import of <*>, Applicative, liftA2, pure from module Control.Applicative is redundant | 25 | import Control.Applicative (Applicative, pure, liftA, liftA2, (<*>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [10 of 13] Compiling UniqueLogic.ST.TF.Example.Expression ( src/UniqueLogic/ST/TF/Example/Expression.hs, dist/build/UniqueLogic/ST/TF/Example/Expression.o, dist/build/UniqueLogic/ST/TF/Example/Expression.dyn_o ) [11 of 13] Compiling UniqueLogic.ST.TF.Example.Term ( src/UniqueLogic/ST/TF/Example/Term.hs, dist/build/UniqueLogic/ST/TF/Example/Term.o, dist/build/UniqueLogic/ST/TF/Example/Term.dyn_o ) [12 of 13] Compiling UniqueLogic.ST.TF.Example.Verify ( src/UniqueLogic/ST/TF/Example/Verify.hs, dist/build/UniqueLogic/ST/TF/Example/Verify.o, dist/build/UniqueLogic/ST/TF/Example/Verify.dyn_o ) src/UniqueLogic/ST/TF/Example/Verify.hs:23: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() | 23 | import Control.Applicative (Applicative, pure, (<*>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/Example/Verify.hs:74:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical pure = return definition detected in the instance declaration for Applicative (Track m). Suggested fix: Move definition from return to pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 74 | pure = return | ^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/Example/Verify.hs:78:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical return definition detected in the instance declaration for Monad (Track m). return will eventually be removed in favour of pure Suggested fix: Either remove definition for return (recommended) or define as return = pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 78 | return = Track . UMT.point | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [13 of 13] Compiling UniqueLogic.ST.TF.Example.Label ( src/UniqueLogic/ST/TF/Example/Label.hs, dist/build/UniqueLogic/ST/TF/Example/Label.o, dist/build/UniqueLogic/ST/TF/Example/Label.dyn_o ) Preprocessing library for unique-logic-tf-0.5.1.1.. Running Haddock on library for unique-logic-tf-0.5.1.1.. Warning: --source-* options are ignored when --hyperlinked-source is enabled. [ 1 of 13] Compiling UniqueLogic.ST.TF.MonadTrans ( src/UniqueLogic/ST/TF/MonadTrans.hs, nothing ) src/UniqueLogic/ST/TF/MonadTrans.hs:12:1: warning: [GHC-38856] [-Wunused-imports] The import of <*>, Applicative, pure from module Control.Applicative is redundant | 12 | import Control.Applicative (Applicative, pure, (<*>), Const(Const)) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/MonadTrans.hs:14: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() | 14 | import Data.Monoid (Monoid, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/MonadTrans.hs:62:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical pure = return definition detected in the instance declaration for Applicative (Wrap t m). Suggested fix: Move definition from return to pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 62 | pure = return | ^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/MonadTrans.hs:66:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical return definition detected in the instance declaration for Monad (Wrap t m). return will eventually be removed in favour of pure Suggested fix: Either remove definition for return (recommended) or define as return = pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 66 | return = wrap . point | ^^^^^^^^^^^^^^^^^^^^^ [ 2 of 13] Compiling UniqueLogic.ST.TF.System ( src/UniqueLogic/ST/TF/System.hs, nothing ) src/UniqueLogic/ST/TF/System.hs:40: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() | 40 | import Control.Applicative (Applicative, liftA2, pure, (<*>), (<$>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:45: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() | 45 | import Data.Monoid (Monoid, mempty, mappend, mconcat, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:46: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() | 46 | import Data.Semigroup (Semigroup, (<>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:66:4: warning: [GHC-50928] [-Wnoncanonical-monoid-instances] Noncanonical mappend definition detected in the instance declaration for Monoid (Updates w s). 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 | 66 | mappend (Updates x) (Updates y) = Updates $ mappend x y | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:91:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical return definition detected in the instance declaration for Monad (T w s). return will eventually be removed in favour of pure Suggested fix: Either remove definition for return (recommended) or define as return = pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 91 | return = Cons . return | ^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System.hs:192:32: 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. | 192 | data ValueConstraint w a :: * | ^ [ 3 of 13] Compiling UniqueLogic.ST.TF.System.Label ( src/UniqueLogic/ST/TF/System/Label.hs, nothing ) src/UniqueLogic/ST/TF/System/Label.hs:25: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() | 25 | import Data.Monoid (Monoid, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/System/Label.hs:26:1: warning: [GHC-66111] [-Wunused-imports] The import of Data.Traversable is redundant except perhaps to import instances from Data.Traversable To import instances alone, use: import Data.Traversable() | 26 | import Data.Traversable (traverse, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [ 4 of 13] Compiling UniqueLogic.ST.TF.System.Simple ( src/UniqueLogic/ST/TF/System/Simple.hs, nothing ) [ 5 of 13] Compiling UniqueLogic.ST.TF.ZeroFractional ( src/UniqueLogic/ST/TF/ZeroFractional.hs, nothing ) [ 6 of 13] Compiling UniqueLogic.ST.TF.Rule ( src/UniqueLogic/ST/TF/Rule.hs, nothing ) src/UniqueLogic/ST/TF/Rule.hs:14: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() | 14 | import Control.Applicative (liftA2, ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [ 7 of 13] Compiling UniqueLogic.ST.TF.Example.Rule ( src/UniqueLogic/ST/TF/Example/Rule.hs, nothing ) [ 8 of 13] Compiling UniqueLogic.ST.TF.Example.Incremental ( src/UniqueLogic/ST/TF/Example/Incremental.hs, nothing ) [ 9 of 13] Compiling UniqueLogic.ST.TF.Expression ( src/UniqueLogic/ST/TF/Expression.hs, nothing ) src/UniqueLogic/ST/TF/Expression.hs:25:1: warning: [GHC-38856] [-Wunused-imports] The import of <*>, Applicative, liftA2, pure from module Control.Applicative is redundant | 25 | import Control.Applicative (Applicative, pure, liftA, liftA2, (<*>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [10 of 13] Compiling UniqueLogic.ST.TF.Example.Expression ( src/UniqueLogic/ST/TF/Example/Expression.hs, nothing ) [11 of 13] Compiling UniqueLogic.ST.TF.Example.Term ( src/UniqueLogic/ST/TF/Example/Term.hs, nothing ) [12 of 13] Compiling UniqueLogic.ST.TF.Example.Verify ( src/UniqueLogic/ST/TF/Example/Verify.hs, nothing ) src/UniqueLogic/ST/TF/Example/Verify.hs:23: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() | 23 | import Control.Applicative (Applicative, pure, (<*>), ) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/Example/Verify.hs:74:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical pure = return definition detected in the instance declaration for Applicative (Track m). Suggested fix: Move definition from return to pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 74 | pure = return | ^^^^^^^^^^^^^ src/UniqueLogic/ST/TF/Example/Verify.hs:78:4: warning: [GHC-22705] [-Wnoncanonical-monad-instances] Noncanonical return definition detected in the instance declaration for Monad (Track m). return will eventually be removed in favour of pure Suggested fix: Either remove definition for return (recommended) or define as return = pure See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 78 | return = Track . UMT.point | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [13 of 13] Compiling UniqueLogic.ST.TF.Example.Label ( src/UniqueLogic/ST/TF/Example/Label.hs, nothing ) Haddock coverage: Warning: 'Const' is ambiguous. It is defined * in Data.Functor.Const * in Data.Functor.Const 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.Functor.Const 33% ( 2 / 6) in 'UniqueLogic.ST.TF.MonadTrans' Missing documentation for: Module header wrap (src/UniqueLogic/ST/TF/MonadTrans.hs:49) unwrap (src/UniqueLogic/ST/TF/MonadTrans.hs:52) lift (src/UniqueLogic/ST/TF/MonadTrans.hs:55) 23% ( 7 / 30) in 'UniqueLogic.ST.TF.System' Missing documentation for: Module header Variable (src/UniqueLogic/ST/TF/System.hs:51) globalVariable (src/UniqueLogic/ST/TF/System.hs:101) C (src/UniqueLogic/ST/TF/System.hs:196) update simpleUpdate (src/UniqueLogic/ST/TF/System.hs:225) updateIfNew (src/UniqueLogic/ST/TF/System.hs:158) updateAndCheck (src/UniqueLogic/ST/TF/System.hs:179) Fragile (src/UniqueLogic/ST/TF/System.hs:172) Value (src/UniqueLogic/ST/TF/System.hs:191) ValueConstraint valueConstraint T (src/UniqueLogic/ST/TF/System.hs:80) localVariable (src/UniqueLogic/ST/TF/System.hs:104) constant (src/UniqueLogic/ST/TF/System.hs:109) Apply (src/UniqueLogic/ST/TF/System.hs:266) runApply (src/UniqueLogic/ST/TF/System.hs:300) runApplyMaybe (src/UniqueLogic/ST/TF/System.hs:306) runApplyM (src/UniqueLogic/ST/TF/System.hs:314) solve (src/UniqueLogic/ST/TF/System.hs:127) solveDepthFirst (src/UniqueLogic/ST/TF/System.hs:132) solveBreadthFirst (src/UniqueLogic/ST/TF/System.hs:133) query (src/UniqueLogic/ST/TF/System.hs:154) 37% ( 6 / 16) in 'UniqueLogic.ST.TF.System.Label' Missing documentation for: Module header Variable (src/UniqueLogic/ST/TF/System/Label.hs:32) globalVariable (src/UniqueLogic/ST/TF/System/Label.hs:37) T (src/UniqueLogic/ST/TF/System/Label.hs:31) localVariable (src/UniqueLogic/ST/TF/System.hs:104) constant (src/UniqueLogic/ST/TF/System.hs:109) Apply (src/UniqueLogic/ST/TF/System.hs:266) runApply (src/UniqueLogic/ST/TF/System.hs:300) solve (src/UniqueLogic/ST/TF/System.hs:127) query (src/UniqueLogic/ST/TF/System.hs:154) 37% ( 6 / 16) in 'UniqueLogic.ST.TF.System.Simple' Missing documentation for: Module header Variable (src/UniqueLogic/ST/TF/System/Simple.hs:25) globalVariable (src/UniqueLogic/ST/TF/System/Simple.hs:29) T (src/UniqueLogic/ST/TF/System/Simple.hs:23) localVariable (src/UniqueLogic/ST/TF/System/Simple.hs:33) constant (src/UniqueLogic/ST/TF/System/Simple.hs:36) Apply (src/UniqueLogic/ST/TF/System.hs:266) runApply (src/UniqueLogic/ST/TF/System.hs:300) solve (src/UniqueLogic/ST/TF/System/Simple.hs:39) query (src/UniqueLogic/ST/TF/System/Simple.hs:42) 16% ( 1 / 6) in 'UniqueLogic.ST.TF.ZeroFractional' Missing documentation for: C (src/UniqueLogic/ST/TF/ZeroFractional.hs:16) multiply divide multiplyDefault (src/UniqueLogic/ST/TF/ZeroFractional.hs:38) divideDefault (src/UniqueLogic/ST/TF/ZeroFractional.hs:41) 66% ( 8 / 12) in 'UniqueLogic.ST.TF.Rule' Missing documentation for: Module header generic2 (src/UniqueLogic/ST/TF/Rule.hs:24) generic3 (src/UniqueLogic/ST/TF/Rule.hs:34) equ (src/UniqueLogic/ST/TF/Rule.hs:45) 50% ( 1 / 2) in 'UniqueLogic.ST.TF.Example.Rule' Missing documentation for: Module header 66% ( 2 / 3) in 'UniqueLogic.ST.TF.Example.Incremental' Missing documentation for: incQuery (src/UniqueLogic/ST/TF/Example/Incremental.hs:57) 45% ( 10 / 22) in 'UniqueLogic.ST.TF.Expression' Missing documentation for: Module header fromVariable (src/UniqueLogic/ST/TF/Expression.hs:50) fromRule1 (src/UniqueLogic/ST/TF/Expression.hs:57) fromRule2 (src/UniqueLogic/ST/TF/Expression.hs:66) fromRule3 (src/UniqueLogic/ST/TF/Expression.hs:76) Apply (src/UniqueLogic/ST/TF/Expression.hs:84) runApply (src/UniqueLogic/ST/TF/Expression.hs:115) =:= (src/UniqueLogic/ST/TF/Expression.hs:163) =!= (src/UniqueLogic/ST/TF/Expression.hs:154) sqr (src/UniqueLogic/ST/TF/Expression.hs:145) sqrt (src/UniqueLogic/ST/TF/Expression.hs:148) maximum (src/UniqueLogic/ST/TF/Expression.hs:178) 0% ( 0 / 3) in 'UniqueLogic.ST.TF.Example.Expression' Missing documentation for: Module header example (src/UniqueLogic/ST/TF/Example/Expression.hs:14) exampleZero (src/UniqueLogic/ST/TF/Example/Expression.hs:29) 25% ( 1 / 4) in 'UniqueLogic.ST.TF.Example.Term' Missing documentation for: T (src/UniqueLogic/ST/TF/Example/Term.hs:11) Name (src/UniqueLogic/ST/TF/Example/Term.hs:23) isZero (src/UniqueLogic/ST/TF/Example/Term.hs:43) 0% ( 0 / 15) in 'UniqueLogic.ST.TF.Example.Verify' Missing documentation for: Module header Assign (src/UniqueLogic/ST/TF/Example/Verify.hs:31) Assigns (src/UniqueLogic/ST/TF/Example/Verify.hs:34) TrackedNumber (src/UniqueLogic/ST/TF/Example/Verify.hs:36) tn1 (src/UniqueLogic/ST/TF/Example/Verify.hs:44) tn2 (src/UniqueLogic/ST/TF/Example/Verify.hs:47) ToTrackedNumber (src/UniqueLogic/ST/TF/Example/Verify.hs:89) Track (src/UniqueLogic/ST/TF/Example/Verify.hs:111) Exception (src/UniqueLogic/ST/TF/Example/Verify.hs:115) Variable (src/UniqueLogic/ST/TF/Example/Verify.hs:120) globalVariable (src/UniqueLogic/ST/TF/Example/Verify.hs:123) match (src/UniqueLogic/ST/TF/Example/Verify.hs:129) inconsistency (src/UniqueLogic/ST/TF/Example/Verify.hs:137) logUpdate (src/UniqueLogic/ST/TF/Example/Verify.hs:146) example (src/UniqueLogic/ST/TF/Example/Verify.hs:157) 12% ( 1 / 8) in 'UniqueLogic.ST.TF.Example.Label' Missing documentation for: Module header Assign (src/UniqueLogic/ST/TF/Example/Label.hs:23) Assigns (src/UniqueLogic/ST/TF/Example/Label.hs:26) Variable (src/UniqueLogic/ST/TF/Example/Label.hs:28) globalVariable (src/UniqueLogic/ST/TF/Example/Label.hs:31) constant (src/UniqueLogic/ST/TF/Example/Label.hs:36) expression (src/UniqueLogic/ST/TF/Example/Label.hs:68) Warning: UniqueLogic.ST.TF.System: could not find link destinations for: - UniqueLogic.ST.TF.System.Inconsistency - UniqueLogic.ST.TF.System.SimpleUpdater - UniqueLogic.ST.TF.System.Updater - UniqueLogic.ST.TF.System.Updates - UniqueLogic.ST.TF.System.ExceptionConstraint - UniqueLogic.ST.TF.System.WriterConstraint - UniqueLogic.ST.TF.System.IdentityConstraint - UniqueLogic.ST.TF.System.D:R:ValueConstraintExceptTa0 - UniqueLogic.ST.TF.System.D:R:ValueConstraintWriterTa0 - UniqueLogic.ST.TF.System.D:R:ValueConstraintIdentityTa0 - UniqueLogic.ST.TF.Example.Verify.VerifyConstraint - UniqueLogic.ST.TF.Example.Verify.D:R:ValueConstraintTracktn0 Warning: UniqueLogic.ST.TF.Example.Verify: could not find link destinations for: - UniqueLogic.ST.TF.System.Updater - UniqueLogic.ST.TF.System.Updates - UniqueLogic.ST.TF.Example.Verify.VerifyConstraint - UniqueLogic.ST.TF.Example.Verify.D:R:ValueConstraintTracktn0 Documentation created: dist/doc/html/unique-logic-tf/, dist/doc/html/unique-logic-tf/unique-logic-tf.txt Installing library in /var/lib/hackage-doc-builder/build-cache/tmp-install/lib/x86_64-linux-ghc-9.8.4/unique-logic-tf-0.5.1.1-EWrxpobHH9c7aj4sWMeJQy Completed unique-logic-tf-0.5.1.1