add_local_function(domain:str,name:str,gr:GraphBuilder)[source]¶

Adds a local function.

constant_folding()[source]¶

Folds all constants. Constants are marked during the creation of the graph.There is no need to propagate this information.

is_constant(name:str)→bool[source]¶

Tells if a result is a constant.

make_nodes(builder:GraphBuilder,input_names:List[str],output_names:List[str],prefix:str='')→str|List[str][source]¶

Appends all nodes and initializers from another builder.Handles the renaming of results.The content stored in ‘builder’ is modified inplace to avoid copying.

Parameters:

• builder – other builder

• input_names – input names

• output_names – output names

• prefix – prefix all name from this builder

Returns:

output names

np(index:int|None=None,op_type:str|None=None,name:str|None=None)→NodePattern[source]¶

Returns an instance ofNodePattern.

remove_identity_nodes()[source]¶

Removes identity nodes.

remove_unused()[source]¶

Simple function to remove unused nodes.It does not look into subgraphs and assumes there is none.Everything is done in one pass.

update_attribute(pat:NodePattern,recursive:bool=False,**kwargs:Dict[str,Any])→int[source]¶

Udates attributes for nodes matching the

Parameters:

• pat – returned by methodGraphBuilder.np()

• recursive – walk through subgraph

• kwargs – attributes to modify

Returns:

number of modified nodes

update_node(node:NodeProto,**kwargs)→bool[source]¶

Updates attributes of a node proto.Returns True if the node was updated.

Class defining a matching pattern able to find nodes in a set of nodes.

find(graph:GraphBuilder)→Iterator[source]¶

Iterates on nodes matching the pattern.

match(index,node:NodeProto)→bool[source]¶

Tells if a node is matching this pattern.