TiSSKJr SSKJrJrJrJr SSKJrJ r J r SSK J r SSK Jr SSKJr SSKJrJrJrJrJrJrJrJrJrJrJrJrJrJrJ r J!r!J"r"J#r#J$r$J%r%J&r&J'r' SSK(J)r)J*r* "S S \5r+g ) ) annotations)OptionalSequenceTypeVarUnion) GraphProtoSparseTensorProto TensorProto) get_schema) TypeAlias)Opset20)BFLOAT16BOOL COMPLEX64 COMPLEX128DOUBLEFLOAT FLOAT8E4M3FNFLOAT8E4M3FNUZ FLOAT8E5M2FLOAT8E5M2FNUZFLOAT16INT4INT8INT16INT32INT64STRINGUINT4UINT8UINT16UINT32UINT64)OpOpsetcP\rSrSr%Sr\"S\\\\ \ \ \ \ \\\\\\\\\\\\5r\\\\\ \ \ \ \ \\\\\\\\\\\\4rS\S'SS.SLSjjr\"S \\\\ \ \ \ \ \\\\\\\\\\\\5r\"S \\\\ \ \ \ \ \\\\\\\\\\\\5r SS.SMS jjr!\\\\"\#\\ \ \ \ \ \\\\\\\\\\\\4r$S\S 'S S S S S S S S S.SNSjjr%\r&S\S'\\\\\ \ \ \ \ \\\\\\\\\\\4r'S\S'S S.SOSjjr(\"S\ \ \ \\\\\\\\5 r)\"S\\ \ 5r*SPSSS.SQSjjjr+\"S\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5r,SS.SRSjjr-\"S\\\ \ 5r.SSS.SSSjjr/\"/S P\0\1\P\0\1\"P\0\1\#P\0\1\P\0\1\ P\0\1\ P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\P\0\"P\0\#P\0\P\0\ P\0\ P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\1\P\1\"P\1\#P\1\P\1\ P\1\ P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\P\P\"P\#P\P\ P\ P\ P\ P\ P\P\P\P\P\P\P\P\P\P\P\P\P76r2STS!jr3\r4S\S"'\/S P\1\P\1\P\1\"P\1\#P\1\P\1\ P\1\ P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\P\P\"P\#P\P\ P\ P\ P\ P\ P\P\P\P\P\P\P\P\P\P\P\P\P\1\ P\1\ P\1\ P\1\P\1\P\1\P7r5S\S#'SUS$jr6\r7S\S%'\r8S\S&'\"/S'P\0\1\P\0\1\P\0\1\"P\0\1\#P\0\1\P\0\1\ P\0\1\ P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\1\P\0\P\0\P\0\"P\0\#P\0\P\0\ P\0\ P\0\ P\0\ P\0\ P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\0\P\1\P\1\P\1\"P\1\#P\1\P\1\ P\1\ P\1\ P\1\ P\1\ P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\1\P\P\P\"P\#P\P\ P\ P\ P\ P\ P\P\P\P\P\P\P\P\P\P\P\P\P76r9SVS(jr:\"S)\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5r;\"S*\\5r<SWS+S,.SXS-jjjr=\"S.\ \ \ \\\5r>\"S/\\ \ 5r?\"S0\ \ \ \\\5r@\"S1\ \ \ \\\5rASYS2jrB\"S3\\ \ \5rC\"S4\ \ \ \\\\\\\5 rDSPSSSSS5.SZS6jjjrE\"S7\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rFSS8.S[S9jjrG\"S:\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rHS S S S S;.S\S<jjrI\"S=\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rJ\rKS\S>'S SS?.S]S@jjrL\"SA\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rM\rNS\SB'S^SCjrO\"SD\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rPSPS_SEjjrQ\"SF\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rRS SG.S`SHjjrS\"SI\\\"\#\\ \ \ \ \ \\\\\\\\\\\\5rTSaSJjrUSKrVg )bOpset211c2[R"USS5$)N)r%__new__)clss b/var/www/html/ai-image-ml/venv/lib/python3.13/site-packages/onnxscript/onnx_opset/_impl/opset21.pyr,Opset21.__new__2s}}S"b))T1_Castr T2_Cast)saturatecd[SSS5n[USU5nU"URXA5X#S.6$)u[🌐 Cast(21)](https://onnx.ai/onnx/operators/onnx__Cast.html#cast-21 "Online Documentation") The operator casts the elements of a given input tensor to a data type specified by the 'to' argument and returns an output tensor of the same size in the converted type. The 'to' argument must be one of the data types specified in the 'DataType' enum field in the TensorProto message. Casting from string tensor in plain (e.g., "3.14" and "1000") and scientific numeric representations (e.g., "1e-5" and "1E8") to float types is supported. For example, converting string "100.5" to an integer may yield result 100. There are some string literals reserved for special floating-point values; "+INF" (and "INF"), "-INF", and "NaN" are positive infinity, negative infinity, and not-a-number, respectively. Any string which can exactly match "+INF" in a case-insensitive way would be mapped to positive infinite. Similarly, this case-insensitive rule is applied to "INF" and "NaN". When casting from numeric tensors to string tensors, plain floating-point representation (such as "314.15926") would be used. Converting non-numerical-literal string such as "Hello World!" is an undefined behavior. Cases of converting string representing floating-point arithmetic value, such as "2.718", to INT is an undefined behavior. Conversion from a numerical type to any numerical type is always allowed. User must be aware of precision loss and value change caused by range difference between two types. For example, a 64-bit float 3.1415926459 may be round to a 32-bit float 3.141592. Similarly, converting an integer 36 to Boolean may produce 1 because we truncate bits which can't be stored in the targeted type. In more detail, the conversion among numerical types should follow these rules if the destination type is not a float 8 type. * Casting from floating point to: * floating point: +/- infinity if OOR (out of range). * fixed point: undefined if OOR. * bool: +/- 0.0 to False; all else to True. * Casting from fixed point to: * floating point: +/- infinity if OOR. (+ infinity in the case of uint) * fixed point: when OOR, discard higher bits and reinterpret (with respect to two's complement representation for signed types). For example, 200 (int16) -> -56 (int8). * bool: zero to False; nonzero to True. * Casting from bool to: * floating point: `{1.0, 0.0}`. * fixed point: `{1, 0}`. * bool: no change. Float 8 type were introduced to speed up the training of deep models. By default the conversion of a float *x* obeys to the following rules. `[x]` means the value rounded to the target mantissa width. | x | E4M3FN | E4M3FNUZ | E5M2 | E5M2FNUZ | | ----------------- | -------- | -------- | -------- | -------- | | 0 | 0 | 0 | 0 | 0 | | -0 | -0 | 0 | -0 | 0 | | NaN | NaN | NaN | NaN | NaN | | Inf | FLT_MAX | NaN | FLT_MAX | NaN | | -Inf | -FLT_MAX | NaN | -FLT_MAX | NaN | | \[x\] > FLT_MAX | FLT_MAX | FLT_MAX | FLT_MAX | FLT_MAX | | \[x\] \< -FLT_MAX | -FLT_MAX | -FLT_MAX | -FLT_MAX | -FLT_MAX | | else | RNE | RNE | RNE | RNE | The behavior changes if the parameter 'saturate' is set to False. The rules then become: | x | E4M3FN | E4M3FNUZ | E5M2 | E5M2FNUZ | | ----------------- | ------ | -------- | ---- | -------- | | 0 | 0 | 0 | 0 | 0 | | -0 | -0 | 0 | -0 | 0 | | NaN | NaN | NaN | NaN | NaN | | -NaN | -NaN | NaN | -NaN | NaN | | Inf | NaN | NaN | Inf | NaN | | -Inf | -NaN | NaN | -Inf | NaN | | \[x\] > FLT_MAX | NaN | NaN | Inf | NaN | | \[x\] \< -FLT_MAX | NaN | NaN | -Inf | NaN | | else | RNE | RNE | RNE | RNE | Args: input: (differentiable) Input tensor to be cast. saturate: The parameter defines how the conversion behaves if an input value is out of range of the destination type. It only applies for float 8 conversion (float8e4m3fn, float8e4m3fnuz, float8e5m2, float8e5m2fnuz). It is true by default. All cases are fully described in two tables inserted in the operator description. to: The data type to which the elements of the input tensor are cast. Strictly must be one of the types from DataType enum in TensorProto Castr+r*)r4tor r$_prepare_inputs)selfinputr4r7schemaops r.r6 Opset21.Castds9lFB+ ff %4''6QQr0 T1_CastLike T2_CastLikecf[SSS5n[USU5nU"URXAU5SU06$)u_[🌐 CastLike(21)](https://onnx.ai/onnx/operators/onnx__CastLike.html#castlike-21 "Online Documentation") The operator casts the elements of a given input tensor (the first input) to the same data type as the elements of the second input tensor. See documentation of the Cast operator for further details. Args: input: (differentiable) Input tensor to be cast. target_type: (non-differentiable) The (first) input tensor will be cast to produce a tensor of the same type as this (second input) tensor. saturate: The parameter defines how the conversion behaves if an input value is out of range of the destination type. It only applies for float 8 conversion (float8e4m3fn, float8e4m3fnuz, float8e5m2, float8e5m2fnuz). It is true by default. Please refer to operator Cast description for further details. CastLiker+r*r4r8)r:r; target_typer4r<r=s r.rBOpset21.CastLikes=0JB/ j& )4''{CWhWWr0 T_ConstantN sparse_valuevalue value_float value_floats value_int value_ints value_string value_stringsc P[SSS5n [USU 5n U "UUUUUUUUS9$)u[🌐 Constant(21)](https://onnx.ai/onnx/operators/onnx__Constant.html#constant-21 "Online Documentation") This operator produces a constant tensor. Exactly one of the provided attributes, either value, sparse_value, or value_* must be specified. Args: sparse_value: The value for the elements of the output tensor in sparse format. value: The value for the elements of the output tensor. value_float: The value for the sole element for the scalar, float32, output tensor. value_floats: The values for the elements for the 1D, float32, output tensor. value_int: The value for the sole element for the scalar, int64, output tensor. value_ints: The values for the elements for the 1D, int64, output tensor. value_string: The value for the sole element for the scalar, UTF-8 string, output tensor. value_strings: The values for the elements for the 1D, UTF-8 string, output tensor. Constantr+r*rF)r r$) r:rGrHrIrJrKrLrMrNr<r=s r.rPOpset21.Constant#sFVJB/ j& )%#%!%'  r0T1_ConstantOfShapeT2_ConstantOfShape)rHcd[SSS5n[USU5nU"URX15SU06$)u[🌐 ConstantOfShape(21)](https://onnx.ai/onnx/operators/onnx__ConstantOfShape.html#constantofshape-21 "Online Documentation") Generate a tensor with given value and shape. Args: input: 1D tensor. The shape of the expected output tensor. If empty tensor is given, the output would be a scalar. All values must be >= 0. value: (Optional) The value of the output elements.Should be a one-element tensor. If not specified, it defaults to a tensor of value 0 and datatype float32 ConstantOfShaper+r*rHr8)r:r;rHr<r=s r.rUOpset21.ConstantOfShapess=$-r26 ' 04''6DeDDr0T1_DequantizeLinearT2_DequantizeLinearraxis block_sizech[SSS5n[USU5nU"URXaX#5UUS.6$)uX[🌐 DequantizeLinear(21)](https://onnx.ai/onnx/operators/onnx__DequantizeLinear.html#dequantizelinear-21 "Online Documentation") The linear dequantization operator. It consumes a quantized tensor, a scale, and a zero point to compute the full-precision tensor. The dequantization formula is `y = (x - x_zero_point) * x_scale`. `x_scale` and `x_zero_point` must have the same shape, determining the quantization's granularity: a scalar for per-tensor/per-layer quantization, a 1-D tensor for per-axis quantization, or have a rank identical to the input for blocked quantization. See QuantizeLinear for details on quantization granularity. `x_zero_point` and `x` must have the same type. `x` and `y` must have the same shape. In the case of dequantizing `int32`, there's no zero point (zero point is supposed to be 0). `zero-point` is usually not used in the case of float8 types quantization, but the dequantization formula remains the same for consistency, and `x_scale` still determines the output type. Args: x: N-D quantized input tensor to be de-quantized. x_scale: Scale for input `x`. For per-tensor/layer dequantization the scale is a scalar, for per per-axis dequantization it is a 1-D Tensor and for blocked dequantization it has the same shape as the input, except for one dimension in which blocking is performed. x_zero_point: (optional) Zero point for input `x`. Shape must match x_scale. It's optional. Zero point is 0 when it's not specified. axis: (Optional) The axis of the dequantizing dimension of the input tensor. Used for per-axis and blocked quantization. Negative value means counting dimensions from the back. Accepted range is `[-r, r-1]` where `r = rank(input)`. block_size: (Optional) The size of the quantization block (number of times every scale is replicated). Used only for blocked quantization. The block size is a positive integer. Given `x` shape `(D0, ..., Di, ..., Dn)`, `y_scale` shape `(S0, ... Si, ...Sn)` and `axis=i`, the accepted range is `[ceil(Di/Si), ceil(Di/(Si-1))-1]` DequantizeLinearr+r*rYr8)r:xx_scale x_zero_pointrZr[r<r=s r.r]Opset21.DequantizeLinearsF\.B7 (& 1  ! !&W C!  r0 T_Flatten)rZcd[SSS5n[USU5nU"URX15SU06$)u[🌐 Flatten(21)](https://onnx.ai/onnx/operators/onnx__Flatten.html#flatten-21 "Online Documentation") Flattens the input tensor into a 2D matrix. If input tensor has shape (d_0, d_1, ... d_n) then the output will have shape (d_0 X d_1 ... d_(axis-1), d_axis X d_(axis+1) ... X dn). Args: input: (differentiable) A tensor of rank >= axis. axis: Indicate up to which input dimensions (exclusive) should be flattened to the outer dimension of the output. The value for axis must be in the range [-r, r], where r is the rank of the input tensor. Negative value means counting dimensions from the back. When axis = 0, the shape of the output tensor is (1, (d_0 X d_1 ... d_n), where the shape of the input tensor is (d_0, d_1, ... d_n). Flattenr+r*rZr8)r:r;rZr<r=s r.rdOpset21.Flattens;(Ir2. i (4''6BTBBr0T_GroupNormalizationg>)epsilon stash_typecj[SSS5n[USU5nU"URXqX#5UUUS.6$)u[🌐 GroupNormalization(21)](https://onnx.ai/onnx/operators/onnx__GroupNormalization.html#groupnormalization-21 "Online Documentation") A GroupNormalization function. Carries out group normalization as described in the paper https://arxiv.org/abs/1803.08494 This operator transforms input according to :: y = scale * (x - mean) / sqrt(variance + epsilon) + bias, where the mean and variance are computed per instance per group of channels, and `scale` and `bias` should be specified for each channel. The number of groups `num_groups` should be divisible by the number of channels so that there are an equal number of channels per group. The overall computation has two stages: the first stage normalizes the elements to have zero mean and unit variance for each instance in each group, and the second stage scales and shifts the results of the first stage. The floating-point precision used in the first stage is determined by the `stash_type` attribute. For example, if `stash_type` is 1, the operator casts all input variables to 32-bit float, performs the computation, and finally casts the normalized results back to the original type of `X`. The second stage does not depend on `stash_type`. When the number of groups is the same as the number of channels, this operator is equivalent to InstanceNormalization. When there is only one group, this operator is equivalent to LayerNormalization. Args: X: (differentiable) Input data tensor. Dimensions for image cases are `(N x C x H x W)`, where `N` is the batch size, `C` is the number of channels, and `H` and `W` are the height and width of the data. Statistics are computed for every group of channels over `C`, `H`, and `W`. For non-image cases, the dimensions are in the form of `(N x C x D1 x D2 ... Dn)`. scale: (differentiable) Scale tensor of shape `(C)`. bias: (differentiable) Bias tensor of shape `(C)`. epsilon: The epsilon value to use to avoid division by zero. num_groups: The number of groups of channels. It should be a divisor of the number of channels `C`. stash_type: The floating-point precision used in stage one of the computation. GroupNormalizationr+r*)rg num_groupsrhr8) r:Xscalebiasrgrkrhr<r=s r.rjOpset21.GroupNormalizationsIz0"b9 *F 3  ! !&U 9!!   r0 V_Identityc^[SSS5n[USU5nU"URX!56$)u[🌐 Identity(21)](https://onnx.ai/onnx/operators/onnx__Identity.html#identity-21 "Online Documentation") Identity operator Args: input: (differentiable) Input tensor Identityr+r*r8)r:r;r<r=s r.rrOpset21.Identitys6JB/ j& )4''677r0B_IfV_Ifcf[SSS5n[USU5nU"URXA5UUS.6$)ug[🌐 If(21)](https://onnx.ai/onnx/operators/onnx__If.html#if-21 "Online Documentation") If conditional Args: cond: Condition for the if. The tensor must contain a single element. else_branch: Graph to run if condition is false. Has N outputs: values you wish to be live-out to the enclosing scope. The number of outputs must match the number of outputs in the then_branch. then_branch: Graph to run if condition is true. Has N outputs: values you wish to be live-out to the enclosing scope. The number of outputs must match the number of outputs in the else_branch. Ifr+r*) else_branch then_branchr8)r:condrxryr<r=s r.rw Opset21.IfsA"D"b) dF #  ! !& /##  r0I_LoopB_LoopV_Loopcj[SSS5n[USU5nU"UR"XQU/UQ76SU06$)u3[🌐 Loop(21)](https://onnx.ai/onnx/operators/onnx__Loop.html#loop-21 "Online Documentation") Generic Looping construct. This loop has multiple termination conditions: 1) Trip count. Iteration count specified at runtime. Set by specifying the input M. Optional. Set to empty string to omit. Note that a static trip count (specified at graph construction time) can be specified by passing in a constant node for input M. 2) Loop termination condition. This is an input to the op that determines whether to run the first iteration and also a loop-carried dependency for the body graph. The body graph must yield a value for the condition variable, whether this input is provided or not. This table summarizes the operating modes of this operator with equivalent C-style code: Operator inputs defined as (max_trip_count, condition_var). * input ("", ""): for (int i=0; ; ++i) { cond = ... // Note this value is ignored, but is required in the body } * input ("", cond) // Note this is analogous to a while loop bool cond = ...; for (int i=0; cond; ++i) { cond = ...; } * input ("", 1) // Note this is analogous to a do-while loop bool cond = true for (int i=0; cond; ++i) { cond = ...; } * input (trip_count, "") // Note this is analogous to a for loop int trip_count = ... for (int i=0; i < trip_count; ++i) { cond = ...; // ignored } * input (trip_count, cond) int trip_count = ...; bool cond = ...; for (int i=0; i < trip_count && cond; ++i) { cond = ...; } *Sample usage - cond as well as trip count* graph predict-net { %a = Constant[value = ]() %b = Constant[value = ]() %keepgoing = Constant[value = ]() %max_trip_count = Constant[value = ]() %keepgoing_out, %b_out, %user_defined_vals = Loop[body = ](%max_trip_count, %keepgoing, %b) return } graph body-net ( %i[INT32, scalar] // iteration number %keepgoing_in[BOOL, scalar] // incoming loop-termination-condition; not used %b_in[INT32, scalar] // incoming value of loop-carried-dependency b ) { %my_local = Add(%a, %b_in) %b_out = Sub(%a, %b_in) // outgoing value of loop-carried-dependency b %keepgoing_out = Greater(%my_local, %b_out) // outgoing loop-termination-condition %user_defined_val = Add(%b_in, %b_in) // scan-output value to be accumulated return %keepgoing_out, %b_out, %user_defined_val } *Sample equivalent C code* { /* User-defined code (enclosing scope) */ int a = 3, b = 6; bool keepgoing = true; // Analogous to input cond /* End user-defined code */ /* Implicitly-defined code */ const int max_trip_count = 10; // Analogous to input M int user_defined_vals[]; // Imagine this is resizable /* End implicitly-defined code */ /* initialize loop-carried variables and scan-output variables */ bool keepgoing_out = keepgoing int b_out = b for (int i=0; i < max_trip_count && keepgoing_out; ++i) { /* Implicitly-defined code: bind actual parameter values to formal parameter variables of loop-body */ bool keepgoing_in = keepgoing_out; bool b_in = b_out; /* User-defined code (loop body) */ int my_local = a + b_in; // Reading value "a" from the enclosing scope is fine b_out = a - b_in; keepgoing_out = my_local > b_out; user_defined_val = b_in + b_in; // b_in and b_out are different variables /* End user-defined code */ /* Implicitly defined-code */ user_defined_vals[i] = user_defined_val // accumulate scan-output values } // int t = my_local; // Can't do this. my_local is not accessible here. // The values below are bound to the output variables of the loop and therefore accessible // b_out; user_defined_vals; keepgoing_out; } There are several things of note in this code snippet: 1) Values from the enclosing scope (i.e. variable "a" here) are in scope and can be referenced in the inputs of the loop. 2) Any values computed in the loop body that needs to be used in a subsequent iteration or after the loop are modelled using a pair of variables in the loop-body, consisting of an input variable (eg., b_in) and an output variable (eg., b_out). These are referred to as loop-carried dependences. The loop operation node supplies the input value of the input variable for the first iteration, and returns the output value of the output variable produced by the final iteration. 3) Scan_output variables are used to implicitly concatenate values computed across all the iterations. In the above example, the value of user_defined_val computed over all iterations are concatenated and returned as the value of user_defined_vals after the loop. 4) Values created in the body cannot be accessed in the enclosing scope, except using the mechanism described above. Note that the semantics of this op support "diagonal" or "wavefront" execution. (See Step 3 here for an example: https://devblogs.nvidia.com/optimizing-recurrent-neural-networks-cudnn-5/). Frontends should emit multi-layer RNNs as a series of While operators (with time being the inner looping dimension), with each successive layer consuming the scan_outputs from the previous layer, possibly going through several point-wise operators (e.g. dropout, residual connections, linear layer). The input/output of subgraph (produced by loop node) matching is based on order instead of name. The implementation will figure out the names based on this order. Args: M: (optional) A maximum trip-count for the loop specified at runtime. Optional. Pass empty string to skip. cond: (optional) A boolean termination condition. Optional. Pass empty string to skip. v_initial: (variadic, heterogeneous) The initial values of any loop-carried dependencies (values that change across loop iterations) body: The graph run each iteration. It has 2+N inputs: (iteration_num, condition, loop carried dependencies...). It has 1+N+K outputs: (condition, loop carried dependencies..., scan_outputs...). Each scan_output is created by concatenating the value of the specified output value at the end of each iteration of the loop. It is an error if the dimensions or data type of these scan_outputs change across loop iterations. Loopr+r*bodyr8)r:Mrzr v_initialr<r=s r.r Opset21.LoopCsCLFB+ ff %4''4D)DP4PPr0T_PadTind_Padconstant)modec h[SSS5n[USU5nU"URXaX#U5SU06$)u; [🌐 Pad(21)](https://onnx.ai/onnx/operators/onnx__Pad.html#pad-21 "Online Documentation") Given a tensor containing the data to be padded (`data`), a tensor containing the number of start and end pad values for axis (`pads`), (optionally) a `mode`, and (optionally) `constant_value`, a padded tensor (`output`) is generated. The three supported `modes` are (similar to corresponding modes supported by `numpy.pad`): 1) `constant`(default) - pads with a given constant value as specified by `constant_value` (which defaults to 0, empty string, or False) 2) `reflect` - pads with the reflection of the vector mirrored on the first and last values of the vector along each axis 3) `edge` - pads with the edge values of array 4) `wrap` - wrap-around padding as if the data tensor forms a torus Example 1 (`constant` mode): Insert 0 pads to the beginning of the second dimension. :: data = [ [1.0, 1.2], [2.3, 3.4], [4.5, 5.7], ] pads = [0, 2, 0, 0] mode = 'constant' constant_value = 0.0 output = [ [0.0, 0.0, 1.0, 1.2], [0.0, 0.0, 2.3, 3.4], [0.0, 0.0, 4.5, 5.7], ] Example 2 (`reflect` mode): :: data = [ [1.0, 1.2], [2.3, 3.4], [4.5, 5.7], ] pads = [0, 2, 0, 0] mode = 'reflect' output = [ [1.0, 1.2, 1.0, 1.2], [2.3, 3.4, 2.3, 3.4], [4.5, 5.7, 4.5, 5.7], ] Example 3 (`edge` mode): :: data = [ [1.0, 1.2], [2.3, 3.4], [4.5, 5.7], ] pads = [0, 2, 0, 0] mode = 'edge' output = [ [1.0, 1.0, 1.0, 1.2], [2.3, 2.3, 2.3, 3.4], [4.5, 4.5, 4.5, 5.7], ] Example 4 (`wrap` mode): :: data = [ [1.0, 1.2], [2.3, 3.4], [4.5, 5.7], ] pads = [2, 1, 1, 1] mode = 'wrap' output = [ [3.4, 2.3, 3.4, 2.3], [5.7, 4.5, 5.7, 4.5], [1.2, 1.0, 1.2, 1.0], [3.4, 2.3, 3.4, 2.3], [5.7, 4.5, 5.7, 4.5], [1.2, 1.0, 1.2, 1.0], ] Args: data: (differentiable) Input tensor. pads: (non-differentiable) Tensor of integers indicating the number of padding elements to add or remove (if negative) at the beginning and end of each axis. For 2D input tensor, it is the number of pixels. `pads` should be a 1D tensor of shape [2 * num_axes] where `num_axes` refers to the number of elements in the `axes` input or the input rank if `axes` are not provided explicitly. `pads` format should be: [x1_begin, x2_begin, ..., x1_end, x2_end,...], where xi_begin is the number of pad values added at the beginning of axis `axes[i]` and xi_end, the number of pad values added at the end of axis `axes[i]`. constant_value: (optional, non-differentiable) (Optional) A scalar value to be used if the mode chosen is `constant` (by default it is 0, empty string or False). axes: (optional, non-differentiable) 1-D tensor of axes that `pads` apply to. Negative value means counting dimensions from the back. Accepted range is [-r, r-1] where r = rank(data). Behavior is undefined if an axis is repeated. If not provided, all axes are assumed (`[0, 1, ..., input_rank-1]`). mode: Supported modes: `constant`(default), `reflect`, `edge`, `wrap` Padr+r*rr8)r:datapadsconstant_valueaxesrr<r=s r.r Opset21.Pad sAhE2r* eV $4''dDQ]X\]]r0T1_QLinearMatMulTS_QLinearMatMulT2_QLinearMatMulT3_QLinearMatMulc n[SSS5n [USU 5n U "URU UUUUUUUU5 6$)u9[🌐 QLinearMatMul(21)](https://onnx.ai/onnx/operators/onnx__QLinearMatMul.html#qlinearmatmul-21 "Online Documentation") Matrix product that behaves like [numpy.matmul](https://numpy.org/doc/stable/reference/generated/numpy.matmul.html). It consumes two quantized input tensors, their scales and zero points, scale and zero point of output, and computes the quantized output. The quantization formula is y = saturate((x / y_scale) + y_zero_point). For (x / y_scale), it is rounding to nearest ties to even. Refer to https://en.wikipedia.org/wiki/Rounding for details. Scale and zero point must have same shape. They must be either scalar (per tensor) or N-D tensor (per row for 'a' and per column for 'b'). Scalar refers to per tensor quantization whereas N-D refers to per row or per column quantization. If the input is 2D of shape [M, K] then zero point and scale tensor may be an M element vector [v_1, v_2, ..., v_M] for per row quantization and K element vector of shape [v_1, v_2, ..., v_K] for per column quantization. If the input is N-D tensor with shape [D1, D2, M, K] then zero point and scale tensor may have shape [D1, D2, M, 1] for per row quantization and shape [D1, D2, 1, K] for per column quantization. Production must never overflow, and accumulation may overflow if and only if in 32 bits. Args: a: (non-differentiable) N-dimensional quantized matrix a a_scale: (non-differentiable) scale of quantized input a a_zero_point: (non-differentiable) zero point of quantized input a b: (non-differentiable) N-dimensional quantized matrix b b_scale: (non-differentiable) scale of quantized input b b_zero_point: (non-differentiable) zero point of quantized input b y_scale: (non-differentiable) scale of quantized output y y_zero_point: (non-differentiable) zero point of quantized output y QLinearMatMulr+r*r8) r:aa_scale a_zero_pointbb_scale b_zero_pointy_scale y_zero_pointr<r=s r.rOpset21.QLinearMatMulsWZOR4 ov .  ! !   r0T1_QuantizeLinearT2_QuantizeLinearrZr[ output_dtyper4cl[SSS5n[USU5n U "URXX#5UUUUS.6$)uX[🌐 QuantizeLinear(21)](https://onnx.ai/onnx/operators/onnx__QuantizeLinear.html#quantizelinear-21 "Online Documentation") The linear quantization operator consumes a high-precision tensor, a scale, and a zero point to compute the low-precision/quantized tensor. The scale factor and zero point must have the same shape, determining the quantization granularity. The quantization formula is `y = saturate((x / y_scale) + y_zero_point)`. Saturation is done according to: - uint16: [0, 65535] - int16: [-32768, 32767] - uint8: [0, 255] - int8: [-128, 127] - uint4: [0, 15] - int4: [-8, 7] For `(x / y_scale)`, it rounds to the nearest even. Refer to https://en.wikipedia.org/wiki/Rounding for details. `y_zero_point` and `y` must have the same type. `y_zero_point` is usually not used for quantization to float8 types, but the quantization formula remains the same for consistency, and the type of the attribute `y_zero_point` still determines the quantization type. There are three supported quantization granularities, determined by the shape of `y_scale`. In all cases, `y_zero_point` must have the same shape as `y_scale`. - Per-tensor (per-layer) quantization: `y_scale` is a scalar. - Per-axis quantization: The scale must be a 1-D tensor, with the length of the quantization axis. For an input shape `(D0, ..., Di, ..., Dn)` and `axis=i`, `y_scale` is a 1-D tensor of length `Di`. - Blocked quantization: The scale's shape is identical to the input's shape, except for one dimension, in which blocking is performed. Given `x` shape `(D0, ..., Di, ..., Dn)`, `axis=i`, and block size `B`: `y_scale` shape is `(D0, ..., ceil(Di/B), ..., Dn)`. Args: x: N-D full precision Input tensor to be quantized. y_scale: Scale for doing quantization to get `y`. For per-tensor/layer quantization the scale is a scalar, for per-axis quantization it is a 1-D Tensor and for blocked quantization it has the same shape as the input, except for one dimension in which blocking is performed. y_zero_point: (optional) Zero point for doing quantization to get `y`. Shape must match `y_scale`.Default is uint8 with zero point of 0 if it's not specified. axis: (Optional) The axis of the dequantizing dimension of the input tensor. Used only for per-axis and blocked quantization. Negative value means counting dimensions from the back. Accepted range is `[-r, r-1]` where `r = rank(input)`. When the rank of the input is 1, per-tensor quantization is applied, rendering the axis unnecessary in this scenario. block_size: (Optional) The size of the quantization block (number of times every scale is replicated). Used only for blocked quantization. The block size is a positive integer. Given `x` shape `(D0, ..., Di, ..., Dn)`, `y_scale` shape `(S0, ... Si, ...Sn)` and `axis=i`, the accepted range is `[ceil(Di/Si), ceil(Di/(Si-1))-1]` output_dtype: (Optional) The output data type. If not supplied, the output data type is inferred from `y_zero_point` data type (`T2`). If neither `output_dtype` nor `y_zero_point` are supplied, output data type is uint8. If both `output_dtype` and `y_zero_point` are specified, `output_dtype` must be `T2`. saturate: The parameter defines how the conversion behaves if an input value is out of range of the destination type. It only applies for float 8 quantization (float8e4m3fn, float8e4m3fnuz, float8e5m2, float8e5m2fnuz). It is true by default. All cases are fully described in two tables inserted in the operator description. QuantizeLinearr+r*rr8) r:r^rrrZr[rr4r<r=s r.rOpset21.QuantizeLinearsLV,b"5 & /  ! !&W C!%   r0 T_Reshape) allowzerocf[SSS5n[USU5nU"URXAU5SU06$)u[🌐 Reshape(21)](https://onnx.ai/onnx/operators/onnx__Reshape.html#reshape-21 "Online Documentation") Reshape the input tensor similar to numpy.reshape. First input is the data tensor, second input is a shape tensor which specifies the output shape. It outputs the reshaped tensor. At most one dimension of the new shape can be -1. In this case, the value is inferred from the size of the tensor and the remaining dimensions. A dimension could also be 0, in which case the actual dimension value is unchanged (i.e. taken from the input tensor). If 'allowzero' is set, and the new shape includes 0, the dimension will be set explicitly to zero (i.e. not taken from input tensor). Shape (second input) could be an empty shape, which means converting to a scalar. The input tensor's shape and the output tensor's shape are required to have the same number of elements. If the attribute 'allowzero' is set, it is invalid for the specified shape to contain both a zero value and -1, as the value of the dimension corresponding to -1 cannot be determined uniquely. Args: data: (differentiable) An input tensor. shape: (non-differentiable) Specified shape for output. allowzero: (Optional) By default, when any value in the 'shape' input is equal to zero the corresponding dimension value is copied from the input tensor dynamically. allowzero=1 indicates that if any value in the 'shape' input is set to zero, the zero value is honored, similar to NumPy. Reshaper+r*rr8)r:rshaperr<r=s r.rOpset21.Reshape}s=>Ir2. i (4''e<R RRr0V_Scan)scan_input_axesscan_input_directionsscan_output_axesscan_output_directionsc r[SSS5n[USU5n U "UR"U/UQ76UUUUUUS.6$)u[🌐 Scan(21)](https://onnx.ai/onnx/operators/onnx__Scan.html#scan-21 "Online Documentation") Scan can be used to iterate over one or more scan_input tensors, constructing zero or more scan_output tensors. It combines ideas from general recurrences, functional programming constructs such as scan, fold, map, and zip, and is intended to enable generalizations of RNN-like constructs for sequence-to-sequence processing. Other tensors (referred to as state_variables here) can be used to carry a state when iterating from one element to another (similar to hidden-state in RNNs, also referred to as loop-carried dependences in the context of loops). Many common usages involve a single scan_input tensor (where functionality similar to scan, fold and map can be obtained). When more than one scan_input is used, a behavior similar to zip is obtained. The attribute body must be a graph, specifying the computation to be performed in every iteration. It takes as input the current values of the state_variables and the current iterated element of the scan_inputs. It must return the (updated) values of the state_variables and zero or more scan_output_element tensors. The values of the scan_output_element tensors are concatenated over all the iterations to produce the scan_output values of the scan construct (similar to the concatenated intermediate hidden-state values of RNN-like constructs). All the output tensors (state_variables as well as scan_output_element tensors) are required to have the same shape in each iteration of the loop (a restriction imposed to enable efficient memory allocation). Note that the iterated element passed to the body subgraph does not have a sequence axis. It will have a rank one less than the rank of the corresponding scan_input. The scan operation returns the final values of the state_variables as well as the scan_outputs. The optional attribute scan_input_directions specifies the direction (forward or backward) for each scan input. If this attribute is omitted, all sequences are scanned in the forward direction. A bidirectional scan may be performed by specifying the same tensor input twice in the scan_inputs, once with a forward direction, and once with a backward direction. The scan_output of the operation is produced by concatenating the scan_output_element values produced by the body in each iteration. The optional attribute scan_output_directions specifies the direction in which scan_output is constructed (by appending or prepending the scan_output_element to scan_output in each iteration) for each scan_output. If this attribute is omitted, the scan_output_element is appended to the scan_output in each iteration. The optional attribute scan_input_axes specifies the axis to be scanned for each scan_input. If omitted, every scan_input will be scanned in axis 0. For example, if axis 0 is the batch axis and axis 1 is the time axis (to be scanned), specify an axis value of 1. Note that scanning a non-zero axis may be less efficient than scanning axis zero. The optional attribute scan_output_axes specifies the axis along which the scan_outputs are accumulated for each scan_output. For example, if axis 1 is the time axis (to be scanned) for both inputs and outputs, specify a scan_input axis and scan_output axis value of 1. Note that because of the ONNX restriction that only the last parameter of an operator can be variadic, the initial-states and scan-inputs are listed together as one input parameter. Similarly, the final-states and scan-outputs are listed together as one output parameter. The attribute num_scan_inputs indicates the number M of scan-inputs. The behavior of Scan < num_scan_inputs = m, body = loop-body, scan_input_axes = [axis_1, ..., axis_m] > (init_1, ..., init_n, scan_1, ..., scan_m) is equivalent to the following pseudo-code: // scan_i.shape[axis_i] denotes the (max) sequence-length of scan_i // scan_i.shape[axis_i] is required to be equal to scan_j.shape[axis_j] for all i,j. sequence_length = scan_1.shape[axis_1]; // initialize state-variables st_1 = init_1; ... st_n = init_n; // initialize scan-output variables: [] denotes an empty tensor scan_out_1 = []; ...; scan_out_k = []; // identify number of iterations: // execute loop for (int t = 0; t < sequence_length; ++t) { // generate the scan-input elements: the notation T[t] indicates the sub-tensor // of rank one less than T obtained by indexing T at position t along axis k. si_1 = scan_1[t]; ... ; si_m = scan_m[t]; // execute loop-body st_1, ..., st_n, so_1, ..., so_k = loop-body(st_1, ..., st_n, si_1, ..., si_m) // accumulate the scan-output elements scan_out_1 = Concat(scan_out_1, so_1); ... ; scan_out_k = Concat(scan_out_k, so_k); } return st_1, ..., st_n, scan_out_1, ..., scan_out_k; *Sample usage: Encoding RNN using a Scan* The following example shows how a simple RNN over an input tensor %X, with weight tensor %Wi, recurrence weight tensor %Ri, bias tensors %Wbi and %Rbi, and initial hidden-state %H_0 can be encoded as a ScanLoop. Note that the loop-body is a nested graph, and it directly computes %Wi, %Ri, %Wbi, and %Rbi (typically constants or initializers in the body graph). If these values are computed in the outer graph, they need to be passed in as extra state_variables. graph rnn-encoding { %H_0 = ... %X = ... %Y_h, %Y = Scan[body = , num_scan_inputs=1](%H_0, %X) return %Y, %Y_h } graph rnn-cell-1 ( %H_tminus1[FLOAT, tensor] %X_t[FLOAT, tensor] ) { %Wi = ... %Ri = ... %Wbi = ... %Rbi = ... %t1 = X_t * (Wi^T) %t2 = H_tminus1*(Ri^T) %t3 = Add(%t1, %t2) %t4 = Add(%t3, %Wbi) %t5 = Add(%t4, %Rbi) %Ht = Tanh(%t5) %Accumulate = Identity(%Ht) return %Ht, %Accumulate } Args: initial_state_and_scan_inputs: (variadic, heterogeneous) Initial values of the loop's N state variables followed by M scan_inputs body: The graph run each iteration. It has N+M inputs: (loop state variables..., scan_input_elts...). It has N+K outputs: (loop state variables..., scan_output_elts...). Each scan_output is created by concatenating the value of the specified scan_output_elt value at the end of each iteration of the loop. It is an error if the dimensions of these values change across loop iterations. num_scan_inputs: An attribute specifying the number of scan_inputs M. scan_input_axes: An optional list of M flags. The i-th element of the list specifies the axis to be scanned (the sequence axis) for the i-th scan_input. If omitted, 0 will be used as the scan axis for every scan_input. Negative value for an axis means counting dimensions from the back. Accepted range is [-r, r-1] where r = rank(input). scan_input_directions: An optional list of M flags. The i-th element of the list specifies the direction to be scanned for the i-th scan_input tensor: 0 indicates forward direction and 1 indicates reverse direction. If omitted, all scan_input tensors will be scanned in the forward direction. scan_output_axes: An optional list of K flags. The i-th element of the list specifies the axis for the i-th scan_output. The scan outputs are accumulated along the specified axis. If omitted, 0 will be used as the scan axis for every scan_output. Negative value for an axis means counting dimensions from the back. Accepted range is [-r, r-1]. scan_output_directions: An optional list of K flags, one for each scan_output. The i-th element of the list specifies whether the i-th scan_output should be constructed by appending or prepending a new value in each iteration: 0 indicates appending and 1 indicates prepending. If omitted, all scan_output tensors will be produced by appending a value in each iteration. Scanr+r*)rnum_scan_inputsrrrrr8) r:rrrrrrinitial_state_and_scan_inputsr<r=s r.r Opset21.ScansT^FB+ ff %  ! !& I+H I++"7-#9  r0T_ShapeT1_Shapeendstartcd[SSS5n[USU5nU"URXA5X#S.6$)u[🌐 Shape(21)](https://onnx.ai/onnx/operators/onnx__Shape.html#shape-21 "Online Documentation") Takes a tensor as input and outputs an 1D int64 tensor containing the shape of the input tensor. Optional attributes start and end can be used to compute a slice of the input tensor's shape. If start axis is omitted, the slice starts from axis 0. The end axis, if specified, is exclusive (and the returned value will not include the size of that axis). If the end axis is omitted, the axes upto the last one will be included. Negative axes indicate counting back from the last axis. Note that axes will be clamped to the range [0, r], where r is the rank of the input tensor if they are out-of-range (after adding r in the case of negative axis). Thus, specifying any end value > r is equivalent to specifying an end value of r, and specifying any start value < -r is equivalent to specifying a start value of 0. If start > end, the result will be an empty shape. Examples: :: Input tensor with shape: [2, 3, 4] No attributes specified. Output: [2, 3, 4] :: Input tensor with shape: [2, 3, 4] start: -1 Output: [4] :: Input tensor with shape: [2, 3, 4] end: -1 Output: [2, 3] :: Input tensor with shape: [2, 3, 4] start: 1 end: 2 Output: [3] Args: data: (non-differentiable) An input tensor. end: (Optional) Ending axis for slicing the shape. Negative value means counting dimensions from the back. If omitted, sizes of all axes upto (including) the last one will be included. start: (Optional) Starting axis for slicing the shape. Default value is 0.Negative value means counting dimensions from the back. Shaper+r*rr8)r:rrrr<r=s r.r Opset21.Shapes9~GR, gv &4''53LLr0T_SizeT1_Sizec^[SSS5n[USU5nU"URX!56$)u [🌐 Size(21)](https://onnx.ai/onnx/operators/onnx__Size.html#size-21 "Online Documentation") Takes a tensor as input and outputs a int64 scalar that equals to the total number of elements of the input tensor. Args: data: (non-differentiable) An input tensor. Sizer+r*r8)r:rr<r=s r.r Opset21.Sizes6FB+ ff %4''566r0 T_Squeezec`[SSS5n[USU5nU"URX1U56$)u[🌐 Squeeze(21)](https://onnx.ai/onnx/operators/onnx__Squeeze.html#squeeze-21 "Online Documentation") Remove single-dimensional entries from the shape of a tensor. Takes an input `axes` with a list of axes to squeeze. If `axes` is not provided, all the single dimensions will be removed from the shape. If an axis is selected with shape entry not equal to one, an error is raised. Args: data: (differentiable) Tensors with at least max(dims) dimensions. axes: (optional, non-differentiable) List of integers indicating the dimensions to squeeze. Negative value means counting dimensions from the back. Accepted range is [-r, r-1] where r = rank(data). Squeezer+r*r8r:rrr<r=s r.rOpset21.Squeezes8$Ir2. i (4''d;< ?E@ AEB CED EEF GEH IEJ KEL MEN OEP QER SET UEV WEX YEZ [E\ ]E^ _E` aEb cEd eEf gEh iEj kEl mEn oEp qEr sEt uEv wEx yEz {E| }E~ E@ AEB CED EEF GEH IEJN 8D), , , ,  ,   ,   ,   ,  ,  ,  ,  ,  ,  ,  ,  ,  ,  !, " #, $ %, & ', ( ), * +, , -, . /, 0 1, 2 3, 4 5, 6 7, 8 9, : ;, < =, > ?, @ A, B C, D E, F G, H I, J K, L M, N O, P  Q, R S, T  U, V W, X Y, .D).` 2FIFI TT(#$T $ T *%& T )$% T &!" T %!T '"#T %!T %!T %!T $ T &!"T &!"T &!"T &!"!T" %!#T$ %T& 'T( )T* +T, -T. /T0 1T2 3T4  5T6 7T8  9T: ;T< =T> ?T@ ATB CTD ETF GTH ITJ KTL MTN OTP QTR STT UTV WTX YTZ [T\ ]T^ _T`  aTb cTd  eTf gTh iTj kTl mTn oTp qTr sTt uTv wTx yTz {T| }T~ T@ ATB CTD ETF GTH ITJ KTL MTN OTP QTR STT UTV WTX YTZ [T\ ]T^ _T` aTb cTd eTf gTFlhQ hQhQ hQ  hQ  hQT          / E4z5%0H +/#' V^V^V^V^( V^ ! V^V^ V^p  18UGL    ; ; "; ' ;  ; " ; '; "; ';  ; z 3XuguU      $59 S S S #S 2 S  S S S S  S j         /I4JK!SF         /F>489=48:>y (.y y  y 1 y 7 y 2y !8y  y v         /G4 Hi;?aAMF         /F4GY 7         /I4=,         /K6EIBB*AB B.         /K4=r0r'N), __future__rtypingrrrronnxrr r onnx.defsr typing_extensionsr #onnxscript.onnx_opset._impl.opset20r onnxscript.onnx_typesrrrrrrrrrrrrrrrrrrr r!r"r#onnxscript.valuesr$r%r'rr0r.rsP#55;; '70(c=gc=r0