Hello @anand thanks for reply.
I have read the docs. In this case what does execution in parralel mean? Also as I know if query depends on a var then execution is sequental.
And in this case does dgraph first fetch all matching nodes, then it iterates on them, filters and assigns to qFunc. Then iterates over its nodes and returns the result. - in this case query will be slower since dgraph basically had to find, then filter, then iterate again to fetch the result whereas in first query dgraph would iterate on func results and filter on spot as well as accumulate result(at least thats the way I think it sortof works).
It would be as fast if its sortof transpiled/desugared to same thing or maybe it does filtering and everything in one iteration.
Sorry if my question is stupid. I just have no idea how Dgraph internals work 