- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for describe (0.18 sec)
-
doc/go_mem.html
published in PLDI 2008. The definition of data-race-free programs and the guarantee of sequential consistency for race-free programs are equivalent to the ones in that work. </p> <p> The memory model describes the requirements on program executions, which are made up of goroutine executions, which in turn are made up of memory operations. </p> <p> A <i>memory operation</i> is modeled by four details: </p> <ul>
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.22.html
The <a href="https://go.dev/wiki/LoopvarExperiment#my-test-fails-with-the-change-how-can-i-debug-it">transition support tooling</a> described in the proposal continues to work in the same way it did in Go 1.21. </li> <li> "For" loops may now range over integers. For <a href="https://go.dev/play/p/ky02zZxgk_r?v=gotip">example</a>: <pre> package main
HTML - Registered: Tue Feb 06 11:13:10 GMT 2024 - Last Modified: Wed Jan 31 20:51:56 GMT 2024 - 45.6K bytes - Viewed (0) -
doc/asm.html
If you plan to write assembly language, you should read that document although much of it is Plan 9-specific. The current document provides a summary of the syntax and the differences with what is explained in that document, and describes the peculiarities that apply when writing assembly code to interact with Go. </p> <p> The most important thing to know about Go's assembler is that it is not a direct representation of the underlying machine.
HTML - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0)