omidb / dgraph Goto Github PK

res53: dgraph.DGraph[dgraph.NodeMatchAND[String],dgraph.EdgeMatch[String]] = DGraph(Map(0 -> Node(NodeMatchAND(<function1>),0), 1 -> Node(NodeMatchAND(<function1>),1), 2 -> Node(NodeMatchAND(<function1>),2)),Map((0,1) -> DEdge(EdgeMatch(<function1>),0,1), (0,2) -> DEdge(EdgeMatch(<function1>),0,2)),Map(2 -> Vector(0), 1 -> Vector(0), 0 -> Vector()),Map(2 -> Vector(), 1 -> Vector(), 0 -> Vector(1, 2)))

res54: dgraph.DGraph[String,String] = DGraph(Map(0 -> Node(a,0), 1 -> Node(b,1), 2 -> Node(c,2)),Map((0,1) -> DEdge(1,0,1), (0,2) -> DEdge(2,0,2)),Map(2 -> Vector(0), 1 -> Vector(0), 0 -> Vector()),Map(2 -> Vector(), 1 -> Vector(), 0 -> Vector(1, 2)))

scala> res54.filter(res43)
<console>:32: error: type mismatch;
 found   : dgraph.DGraph[dgraph.NodeMatchAND[String],dgraph.EdgeMatch[String]]
 required: dgraph.DGraph[dgraph.NodeMatchLike[String],dgraph.EdgeMatchLike[String]]
Note: dgraph.NodeMatchAND[String] <: dgraph.NodeMatchLike[String], but class DGraph is invariant in type N.
You may wish to define N as +N instead. (SLS 4.5)
Note: dgraph.EdgeMatch[String] <: dgraph.EdgeMatchLike[String], but class DGraph is invariant in type E.
You may wish to define E as +E instead. (SLS 4.5)