Similarly, type inference uses the fact that a type argument must
<a href="#Satisfying_a_type_constraint">satisfy</a> the constraint of its respective
type parameter.
</p>

<p>
Each such pair of matched types corresponds to a <i>type equation</i> containing
one or multiple type parameters, from one or possibly multiple generic functions.
Inferring the missing type arguments means solving the resulting set of type

      </match>
      <match value="0xBEBAFECA" type="string" offset="0">
        <match value="0x1" type="little32" offset="4"/>
        <match value="0x2" type="little32" offset="4"/>
        <match value="0x3" type="little32" offset="4"/>
        <match value="0x4" type="little32" offset="4"/>
        <match value="0x5" type="little32" offset="4"/>
        <match value="0x6" type="little32" offset="4"/>