=> Bootstrap dependency digest>=20211023: found digest-20220214 ===> Skipping vulnerability checks. WARNING: No /usr/pkg/pkgdb/pkg-vulnerabilities file found. WARNING: To fix run: `/usr/sbin/pkg_admin -K /usr/pkg/pkgdb fetch-pkg-vulnerabilities'. ===> Building for hs-fgl-5.7.0.3nb4 Preprocessing library for fgl-5.7.0.3.. Building library for fgl-5.7.0.3.. [ 1 of 29] Compiling Data.Graph.Inductive.Graph ( Data/Graph/Inductive/Graph.hs, dist/build/Data/Graph/Inductive/Graph.o, dist/build/Data/Graph/Inductive/Graph.dyn_o ) Data/Graph/Inductive/Graph.hs:161:22: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(MContext a b, gr a b)' not matched: (Nothing, _) | 161 | (Just c,g') = match v g | ^^^^^^^^^^^^^^^^^^^^^^^ [ 2 of 29] Compiling Data.Graph.Inductive.Internal.Heap ( Data/Graph/Inductive/Internal/Heap.hs, dist/build/Data/Graph/Inductive/Internal/Heap.o, dist/build/Data/Graph/Inductive/Internal/Heap.dyn_o ) [ 3 of 29] Compiling Data.Graph.Inductive.Internal.Queue ( Data/Graph/Inductive/Internal/Queue.hs, dist/build/Data/Graph/Inductive/Internal/Queue.o, dist/build/Data/Graph/Inductive/Internal/Queue.dyn_o ) [ 4 of 29] Compiling Data.Graph.Inductive.Internal.RootPath ( Data/Graph/Inductive/Internal/RootPath.hs, dist/build/Data/Graph/Inductive/Internal/RootPath.o, dist/build/Data/Graph/Inductive/Internal/RootPath.dyn_o ) Data/Graph/Inductive/Internal/RootPath.hs:32:30: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a lambda abstraction: Patterns of type `[Node]' not matched: [] | 32 | getPath v = reverse . first (\(w:_)->w==v) | ^^^^^^^^^^^^ [ 5 of 29] Compiling Data.Graph.Inductive.Internal.Thread ( Data/Graph/Inductive/Internal/Thread.hs, dist/build/Data/Graph/Inductive/Internal/Thread.o, dist/build/Data/Graph/Inductive/Internal/Thread.dyn_o ) [ 6 of 29] Compiling Data.Graph.Inductive.Basic ( Data/Graph/Inductive/Basic.hs, dist/build/Data/Graph/Inductive/Basic.o, dist/build/Data/Graph/Inductive/Basic.dyn_o ) [ 7 of 29] Compiling Data.Graph.Inductive.Monad ( Data/Graph/Inductive/Monad.hs, dist/build/Data/Graph/Inductive/Monad.o, dist/build/Data/Graph/Inductive/Monad.dyn_o ) [ 8 of 29] Compiling Data.Graph.Inductive.Monad.IOArray ( Data/Graph/Inductive/Monad/IOArray.hs, dist/build/Data/Graph/Inductive/Monad/IOArray.o, dist/build/Data/Graph/Inductive/Monad/IOArray.dyn_o ) [ 9 of 29] Compiling Data.Graph.Inductive.Monad.STArray ( Data/Graph/Inductive/Monad/STArray.hs, dist/build/Data/Graph/Inductive/Monad/STArray.o, dist/build/Data/Graph/Inductive/Monad/STArray.dyn_o ) Data/Graph/Inductive/Monad/STArray.hs:64:10: error: * No instance for (MonadFail (ST s)) arising from the superclasses of an instance declaration * In the instance declaration for `GraphM (ST s) (SGr s)' | 64 | instance GraphM (ST s) (SGr s) where | ^^^^^^^^^^^^^^^^^^^^^ [10 of 29] Compiling Data.Graph.Inductive.NodeMap ( Data/Graph/Inductive/NodeMap.hs, dist/build/Data/Graph/Inductive/NodeMap.o, dist/build/Data/Graph/Inductive/NodeMap.dyn_o ) Data/Graph/Inductive/NodeMap.hs:117:9: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe (LEdge b)' not matched: Nothing | 117 | let (Just e') = mkEdge m e | ^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/NodeMap.hs:127:9: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe (LEdge ())' not matched: Nothing | 127 | let Just (n1', n2', _) = mkEdge m (n1, n2, ()) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/NodeMap.hs:142:9: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe [LEdge b]' not matched: Nothing | 142 | let Just es' = mkEdges m es | ^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/NodeMap.hs:152:9: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe [LEdge ()]' not matched: Nothing | 152 | let Just ns' = mkEdges m $ P.map (\(a, b) -> (a, b, ())) ns | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/NodeMap.hs:159:9: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe [LEdge b]' not matched: Nothing | 159 | Just es' = mkEdges m' es | ^^^^^^^^^^^^^^^^^^^^^^^^ [11 of 29] Compiling Data.Graph.Inductive.PatriciaTree ( Data/Graph/Inductive/PatriciaTree.hs, dist/build/Data/Graph/Inductive/PatriciaTree.o, dist/build/Data/Graph/Inductive/PatriciaTree.dyn_o ) [12 of 29] Compiling Data.Graph.Inductive.Example ( Data/Graph/Inductive/Example.hs, dist/build/Data/Graph/Inductive/Example.o, dist/build/Data/Graph/Inductive/Example.dyn_o ) [13 of 29] Compiling Data.Graph.Inductive.Query.ArtPoint ( Data/Graph/Inductive/Query/ArtPoint.hs, dist/build/Data/Graph/Inductive/Query/ArtPoint.o, dist/build/Data/Graph/Inductive/Query/ArtPoint.dyn_o ) [14 of 29] Compiling Data.Graph.Inductive.Query.BFS ( Data/Graph/Inductive/Query/BFS.hs, dist/build/Data/Graph/Inductive/Query/BFS.o, dist/build/Data/Graph/Inductive/Query/BFS.dyn_o ) Data/Graph/Inductive/Query/BFS.hs:113:16: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(Path, Queue Path)' not matched: ([], _) | 113 | where (p@(v:_),q') = queueGet q | ^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/BFS.hs:135:16: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(LPath b, Queue (LPath b))' not matched: ((LP []), _) | 135 | where (LP (p@((v,_):_)),q') = queueGet q | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [15 of 29] Compiling Data.Graph.Inductive.Query.DFS ( Data/Graph/Inductive/Query/DFS.hs, dist/build/Data/Graph/Inductive/Query/DFS.o, dist/build/Data/Graph/Inductive/Query/DFS.dyn_o ) [16 of 29] Compiling Data.Graph.Inductive.Query.BCC ( Data/Graph/Inductive/Query/BCC.hs, dist/build/Data/Graph/Inductive/Query/BCC.o, dist/build/Data/Graph/Inductive/Query/BCC.dyn_o ) Data/Graph/Inductive/Query/BCC.hs:49:31: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(Decomp gr a b, [gr a b])' not matched: ((Nothing, _), _) | 49 | ((Just c,g'), gs''') = findGraph v gs | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [17 of 29] Compiling Data.Graph.Inductive.Query.Dominators ( Data/Graph/Inductive/Query/Dominators.hs, dist/build/Data/Graph/Inductive/Query/Dominators.o, dist/build/Data/Graph/Inductive/Query/Dominators.dyn_o ) Data/Graph/Inductive/Query/Dominators.hs:55:5: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `[Tree Node]' not matched: [] (_:_:_) | 55 | trees@(~[tree]) = dff [root] g | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [18 of 29] Compiling Data.Graph.Inductive.Query.Indep ( Data/Graph/Inductive/Query/Indep.hs, dist/build/Data/Graph/Inductive/Query/Indep.o, dist/build/Data/Graph/Inductive/Query/Indep.dyn_o ) Data/Graph/Inductive/Query/Indep.hs:31:5: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(MContext a b, gr a b)' not matched: (Nothing, _) | 31 | (Just c,g') = match v g | ^^^^^^^^^^^^^^^^^^^^^^^ [19 of 29] Compiling Data.Graph.Inductive.Query.MST ( Data/Graph/Inductive/Query/MST.hs, dist/build/Data/Graph/Inductive/Query/MST.o, dist/build/Data/Graph/Inductive/Query/MST.dyn_o ) Data/Graph/Inductive/Query/MST.hs:26:11: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(b, LPath b, H.Heap b (LPath b))' not matched: (_, (LP []), _) | 26 | where (_,p@(LP ((v,_):_)),h') = H.splitMin h | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [20 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow ( Data/Graph/Inductive/Query/MaxFlow.hs, dist/build/Data/Graph/Inductive/Query/MaxFlow.o, dist/build/Data/Graph/Inductive/Query/MaxFlow.dyn_o ) Data/Graph/Inductive/Query/MaxFlow.hs:69:5: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `([((b, b, b), Node)], [((b, b, b), Node)])' not matched: (_, []) | 69 | (rs, ((x,y,z),w):rs') = break ((v==) . snd) s | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [21 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow2 ( Data/Graph/Inductive/Query/MaxFlow2.hs, dist/build/Data/Graph/Inductive/Query/MaxFlow2.o, dist/build/Data/Graph/Inductive/Query/MaxFlow2.dyn_o ) Data/Graph/Inductive/Query/MaxFlow2.hs:80:13: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a lambda abstraction: Patterns of type `[(Node, Direction)]' not matched: [] | 80 | filter (\((u,_):_) -> u==t) tree | ^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/MaxFlow2.hs:103:11: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(DirPath, Queue DirPath)' not matched: ([], _) | 103 | where (p@((v,_):_), q1)=queueGet q | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/MaxFlow2.hs:115:15: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe ((Double, Double), Gr () (Double, Double))' not matched: Nothing | 115 | Just (l, newg) = extractEdge g u v (uncurry (>)) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/MaxFlow2.hs:119:15: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `Maybe ((Double, Double), Gr () (Double, Double))' not matched: Nothing | 119 | Just (l, newg) = extractEdge g v u (\(_,f)->(f>0)) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/MaxFlow2.hs:145:53: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a lambda abstraction: Patterns of type `[Node]' not matched: [] | 145 | augPath g s t = listToMaybe $ map reverse $ filter (\(u:_) -> u==t) tree | ^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/MaxFlow2.hs:174:11: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(MContext a b, Gr a b)' not matched: (Nothing, _) | 174 | where (Just (p', node, l, s), newg) = match u g | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [22 of 29] Compiling Data.Graph.Inductive.Query.Monad ( Data/Graph/Inductive/Query/Monad.hs, dist/build/Data/Graph/Inductive/Query/Monad.o, dist/build/Data/Graph/Inductive/Query/Monad.dyn_o ) Data/Graph/Inductive/Query/Monad.hs:81:5: warning: [-Wnoncanonical-monad-instances] Noncanonical `pure = return' definition detected in the instance declaration for `Applicative (GT m g)'. Move definition from `return' to `pure' See also: https://gitlab.haskell.org/ghc/ghc/-/wikis/proposal/monad-of-no-return | 81 | pure = return | ^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/Monad.hs:85:3: warning: [-Wnoncanonical-monad-instances] Noncanonical `return' definition detected in the instance declaration for `Monad (GT m g)'. `return' will eventually be removed in favour of `pure' 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 | 85 | return x = MGT (\mg->do {g<-mg; return (x,g)}) | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Data/Graph/Inductive/Query/Monad.hs:222:21: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `[Node]' not matched: [] | 222 | let (v:vs') = vs in | ^^^^^^^^^^^^ [23 of 29] Compiling Data.Graph.Inductive.Query.SP ( Data/Graph/Inductive/Query/SP.hs, dist/build/Data/Graph/Inductive/Query/SP.o, dist/build/Data/Graph/Inductive/Query/SP.dyn_o ) Data/Graph/Inductive/Query/SP.hs:34:11: warning: [-Wincomplete-uni-patterns] Pattern match(es) are non-exhaustive In a pattern binding: Patterns of type `(b, LPath b, H.Heap b (LPath b))' not matched: (_, (LP []), _) | 34 | where (_,p@(LP ((v,d):_)),h') = H.splitMin h | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [24 of 29] Compiling Data.Graph.Inductive.Query.GVD ( Data/Graph/Inductive/Query/GVD.hs, dist/build/Data/Graph/Inductive/Query/GVD.o, dist/build/Data/Graph/Inductive/Query/GVD.dyn_o ) [25 of 29] Compiling Data.Graph.Inductive.Query.TransClos ( Data/Graph/Inductive/Query/TransClos.hs, dist/build/Data/Graph/Inductive/Query/TransClos.o, dist/build/Data/Graph/Inductive/Query/TransClos.dyn_o ) [26 of 29] Compiling Data.Graph.Inductive.Query ( Data/Graph/Inductive/Query.hs, dist/build/Data/Graph/Inductive/Query.o, dist/build/Data/Graph/Inductive/Query.dyn_o ) [27 of 29] Compiling Data.Graph.Inductive.Tree ( Data/Graph/Inductive/Tree.hs, dist/build/Data/Graph/Inductive/Tree.o, dist/build/Data/Graph/Inductive/Tree.dyn_o ) [28 of 29] Compiling Paths_fgl ( dist/build/autogen/Paths_fgl.hs, dist/build/Paths_fgl.o, dist/build/Paths_fgl.dyn_o ) [29 of 29] Compiling Data.Graph.Inductive ( Data/Graph/Inductive.hs, dist/build/Data/Graph/Inductive.o, dist/build/Data/Graph/Inductive.dyn_o ) *** Error code 1 Stop. make[1]: stopped in /amd/pkgsrc/CHROOT/P/pkgsrc/devel/hs-fgl *** Error code 1 Stop. make: stopped in /amd/pkgsrc/CHROOT/P/pkgsrc/devel/hs-fgl