- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for show (0.17 sec)
-
doc/go_mem.html
then any read <i>r</i> on <i>x</i> has only one possible <i>W</i>(<i>r</i>): the single <i>w</i> that immediately precedes it in the happens before order. </p> <p> More generally, it can be shown that any Go program that is data-race-free, meaning it has no program executions with read-write or write-write data races, can only have outcomes explained by some sequentially consistent interleaving of the goroutine executions.
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0)