def replace_op(self, graph: Graph, node: Node): add_node = scalar_ops_replacer(graph, node, Add) return [add_node.id]
def replace_op(self, graph: Graph, node: Node): sub_node = scalar_ops_replacer(graph, node, Sub) return [sub_node.id]
def replace_op(self, graph: Graph, node: Node): mul_node = scalar_ops_replacer(graph, node, Mul) return [mul_node.id]
def replace_op(self, graph: Graph, node: Node): lesser_equal_scalar_node = scalar_ops_replacer(graph, node, LessEqual) return [lesser_equal_scalar_node.id]
def replace_op(self, graph: Graph, node: Node): not_equal_scalar_node = scalar_ops_replacer(graph, node, NotEqual) return [not_equal_scalar_node.id]
def replace_op(self, graph: Graph, node: Node): greater_node = scalar_ops_replacer(graph, node, GreaterEqual) return [greater_node.id]
def replace_op(self, graph: Graph, node: Node): div_node = scalar_ops_replacer(graph, node, Div) return [div_node.id]
def replace_op(self, graph: Graph, node: Node): maximum_scalar_node = scalar_ops_replacer(graph, node, Maximum) return [maximum_scalar_node.id]