- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for finished (0.29 sec)
-
doc/go_mem.html
Worse, there is no guarantee that the write to <code>done</code> will ever be observed by <code>main</code>, since there are no synchronization events between the two threads. The loop in <code>main</code> is not guaranteed to finish. </p> <p> There are subtler variants on this theme, such as this program. </p> <pre> type T struct { msg string } var g *T func setup() { t := new(T)
HTML - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0) -
doc/go1.17_spec.html
</li> </ul> <p> For example, given the declarations </p> <pre> var ( a = c + b // == 9 b = f() // == 4 c = f() // == 5 d = 3 // == 5 after initialization has finished ) func f() int { d++ return d } </pre> <p> the initialization order is <code>d</code>, <code>b</code>, <code>c</code>, <code>a</code>.
HTML - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 211.6K bytes - Viewed (0) -
doc/go_spec.html
<code>string</code> takes the place of <code>P</code>. And since <code>string</code> is identical to <code>string</code>, this unification step succeeds as well. Unification of the LHS and RHS of the equation is now finished. Type inference succeeds because there is only one type equation, no unification step failed, and the map is fully populated. </p> <p> Unification uses a combination of <i>exact</i> and <i>loose</i>
HTML - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Apr 26 00:39:16 GMT 2024 - 279.6K bytes - Viewed (0)