|
using | SubgraphType = typename G::SubgraphType |
|
|
| Match (G &g) |
|
std::vector< SubgraphType > | recursiveMatch (typename G::NodeRef candidateNode, std::vector< typename G::NodeRef > stack, SubgraphType currentSubgraph) |
|
std::vector< SubgraphType > | match (G &g) |
|
template<typename G, typename EqualityClass = NodeEqualityDefault<typename G::NodeRef>>
class nom::Match< G, EqualityClass >
Definition at line 31 of file Match.h.
The documentation for this class was generated from the following file:
- caffe2/core/nomnigraph/include/nomnigraph/Transformations/Match.h