Without it cabal tries to build hiedbwith the new algebraic-graphs-0.7.
Please add the upper bound to all versions of hiedb otherwise cabal is will have to choose between using and old hiedb and using an old algebraic-graphs and it is likely to choose badly.
Here is the error that we get with algebraic-graphs-0.7.
src/HieDb/Query.hs:270:54: error:
• Couldn't match expected type ‘AdjacencyMap a1’
with actual type ‘[a]’
• In the first argument of ‘dfs’, namely ‘vs’
In the first argument of ‘Set.fromList’, namely ‘(dfs vs m)’
In the expression: Set.fromList (dfs vs m)
• Relevant bindings include
s :: Set a1 (bound at src/HieDb/Query.hs:270:32)
vs :: [a] (bound at src/HieDb/Query.hs:270:23)
m :: AdjacencyMap a (bound at src/HieDb/Query.hs:270:21)
splitByReachability :: AdjacencyMap a -> [a] -> (Set a, Set a)
(bound at src/HieDb/Query.hs:270:1)
|
270 | splitByReachability m vs = let s = Set.fromList (dfs vs m) in (s, vertexSet m Set.\\ s)
| ^^
src/HieDb/Query.hs:270:57: error:
• Couldn't match expected type ‘[a1]’
with actual type ‘AdjacencyMap a’
• In the second argument of ‘dfs’, namely ‘m’
In the first argument of ‘Set.fromList’, namely ‘(dfs vs m)’
In the expression: Set.fromList (dfs vs m)
• Relevant bindings include
s :: Set a1 (bound at src/HieDb/Query.hs:270:32)
vs :: [a] (bound at src/HieDb/Query.hs:270:23)
m :: AdjacencyMap a (bound at src/HieDb/Query.hs:270:21)
splitByReachability :: AdjacencyMap a -> [a] -> (Set a, Set a)
(bound at src/HieDb/Query.hs:270:1)
|
270 | splitByReachability m vs = let s = Set.fromList (dfs vs m) in (s, vertexSet m Set.\\ s)
| ^
Without it
cabal
tries to buildhiedb
with the newalgebraic-graphs-0.7
.Please add the upper bound to all versions of
hiedb
otherwisecabal
is will have to choose between using and oldhiedb
and using an oldalgebraic-graphs
and it is likely to choose badly.Here is the error that we get with
algebraic-graphs-0.7
.