Fix adding empty nodes to the graph results in two root nodes #237
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Fixes an issue revealed in
CommandGraphTest.AddNode
where an empty node without dependencies would lead to two root nodes being added to the graph. The first is added in the special Graph case inhandler::finalize()
and the second ingraph_impl::add(const std::vector<std::shared_ptr<node_impl>> &Dep)
. This patch adds a node inhandler::finalize()
only during queue recording. Explicitly added empty nodes use a new command group with none-type and follow the regular kernelgraph_impl::add
path.isEmpty()
is extended to include command groups with none-type.This supersedes #236 which lacked support for record and replay mode.