summaryrefslogtreecommitdiff
path: root/binaries
diff options
context:
space:
mode:
authorDuc Ngo <duc@fb.com>2018-10-18 12:30:31 -0700
committerFacebook Github Bot <facebook-github-bot@users.noreply.github.com>2018-10-18 12:32:40 -0700
commit2c566a17c763ab000ebeba1d3c01762bae814e42 (patch)
treea600faa4bb11fbd5ea76757edfbe05adc27bbba0 /binaries
parent9c617140f79f82628484e7545b228be990994196 (diff)
downloadpytorch-2c566a17c763ab000ebeba1d3c01762bae814e42.tar.gz
pytorch-2c566a17c763ab000ebeba1d3c01762bae814e42.tar.bz2
pytorch-2c566a17c763ab000ebeba1d3c01762bae814e42.zip
nomnigraph - simplify subgraph matching APIs (#12681)
Summary: Pull Request resolved: https://github.com/pytorch/pytorch/pull/12681 - Get rid of NodeMatchCriteria as a template parameter, which was too generic. So MatchNode<NodeMatchCriteria> becomes MatchNode<GraphType>, and MatchStore stores the predicate on GraphType::NodeRef. - Similarly, get rid of NNNodeMatchCriteria Now one can just pass in a function pointer NodeRef -> bool to NNMatchNode constructor directly like this mg.createNode(is<Relu>) - Merge static utilities in SubgraphMatcher class into MatchGraph class - Rename MatchNode to MatchPredicate Change use cases and tests to make it work Reviewed By: ZolotukhinM Differential Revision: D10386907 fbshipit-source-id: 43874bd154e3d7c29ce07b4b74eca8a7a9f3078a
Diffstat (limited to 'binaries')
0 files changed, 0 insertions, 0 deletions