GraphInitializers

class onnx_ir._graph_containers.GraphInitializers(graph, dict=None, /, **kwargs)

The initializers of a Graph as dict[str, Value] with additional mutation methods.

Parameters:

graph (_core.Graph)

add(value)

Add an initializer to the graph.

Parameters:

value (Value)

Return type:

None

tensors()

Iterate over the backing tensors of all initializers.

Mirrors dict.values() but returns each initializer’s const_value instead of its wrapping Value.

Added in version 0.3.0.

Raises:

ValueError – If any initializer has const_value=None. An initializer without a backing tensor is almost always a graph-construction bug – surfacing it loudly here is preferable to silently yielding None.

Return type:

Iterator[TensorProtocol]

tensor_items()

Iterate over (name, tensor) pairs. Mirrors dict.items().

Added in version 0.3.0.

Raises:

ValueError – If any initializer has const_value=None (see tensors()).

Return type:

Iterator[tuple[str, TensorProtocol]]

get_tensor(name, default=None)

Return the backing tensor for name, or default.

Returns default both when name is not an initializer and when it is but its const_value is None. Mirrors dict.get() but at the tensor level.

Added in version 0.3.0.

Parameters:

• name (str)

• default (TensorProtocol | None)

Return type:

TensorProtocol | None

clear() → None.  Remove all items from D.

copy()

classmethod fromkeys(iterable, value=None)

get(k[, d]) → D[k] if k in D, else d.  d defaults to None.

items() → a set-like object providing a view on D's items

keys() → a set-like object providing a view on D's keys

pop(k[, d]) → v, remove specified key and return the corresponding value.

If key is not found, d is returned if given, otherwise KeyError is raised.

popitem() → (k, v), remove and return some (key, value) pair

as a 2-tuple; but raise KeyError if D is empty.

setdefault(k[, d]) → D.get(k,d), also set D[k]=d if k not in D

update([E, ]**F) → None.  Update D from mapping/iterable E and F.

If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v

values() → an object providing a view on D's values