- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for costly (0.23 sec)
-
doc/go_mem.html
while still insisting that races are errors and that tools can diagnose and report them. </p> <h2 id="model">Memory Model</h2> <p> The following formal definition of Go's memory model closely follows the approach presented by Hans-J. Boehm and Sarita V. Adve in “<a href="https://www.hpl.hp.com/techreports/2008/HPL-2008-56.pdf">Foundations of the C++ Concurrency Memory Model</a>”, published in PLDI 2008.
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) -
doc/asm.html
represents the bitwise and instruction, <code>AND</code> (without the leading <code>A</code>), and is written in assembly source as <code>AND</code>. The enumeration is mostly in alphabetical order. (The architecture-independent <code>AXXX</code>, defined in the <code>cmd/internal/obj</code> package, represents an invalid instruction).
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0) -
doc/go_spec.html
a compiler reports a type inference or other error), and may explain why type inference fails in unusual code situations. But by and large these rules can be ignored when writing Go code: type inference is designed to mostly "work as expected", and the unification rules are fine-tuned accordingly. </p> <p> Type unification is controlled by a <i>matching mode</i>, which may be <i>exact</i> or <i>loose</i>.
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K bytes - Viewed (0)