Skip to content

Nomnigraph - Refactor SubtreeMatchCriteria to become a Graph of MatchNode#10512

Closed
duc0 wants to merge 2 commits intopytorch:masterfrom
duc0:export-D9321695
Closed

Nomnigraph - Refactor SubtreeMatchCriteria to become a Graph of MatchNode#10512
duc0 wants to merge 2 commits intopytorch:masterfrom
duc0:export-D9321695

Conversation

@duc0
Copy link
Contributor

@duc0 duc0 commented Aug 14, 2018

Summary:
SubtreeMatchCriteria now becomes a graph of MatchNode

MatchNode consists of NodeMatchCriteria, nonTerminal and count. This is a cleaner internal representation of the data structure and will bring us much closer to DAG matching.

Note that I still keep the debugString method because convertToDotGraph doesn't currently work with Subgraph.

Differential Revision: D9321695

@duc0 duc0 force-pushed the export-D9321695 branch from 38be574 to 04150ed Compare August 14, 2018 20:59
duc0 added 2 commits August 14, 2018 14:59
Summary: isSubtreeMatch now returns a SubtreeMatchResult which contains a match flag and a debugMessage string that contains the reason why a subtree is not matched (if requested).

Differential Revision: D9182429

fbshipit-source-id: 27aee29587df9aadf0dfbadec59e90aae250e4a2
…Node (pytorch#10512)

Summary:
Pull Request resolved: pytorch#10512

SubtreeMatchCriteria now becomes a graph of MatchNode

MatchNode consists of NodeMatchCriteria, nonTerminal and count. This is a cleaner internal representation of the data structure and will bring us much closer to DAG matching.

Note that I still keep the debugString method because convertToDotGraph doesn't currently work with Subgraph.

Differential Revision: D9321695

fbshipit-source-id: 2e6a0b3a4cd99f9c9baf66790f0ea05434245cf4
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants