- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for welcome (0.19 sec)
-
doc/go_spec.html
Type unification recursively compares the LHS and RHS types of an equation, where either or both types may be or contain bound type parameters, and looks for type arguments for those type parameters such that the LHS and RHS match (become identical or assignment-compatible, depending on context). To that effect, type inference maintains a map of bound type parameters to inferred type arguments; this map is consulted and updated during type unification.
HTML - Registered: Tue Apr 16 11:13:10 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 279.3K bytes - Viewed (0)