- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for Hancic (0.21 sec)
-
doc/go_mem.html
If <code>list</code> pointed to a cyclic list, then the original program would never access <code>*p</code> or <code>*q</code>, but the rewritten program would. (Moving `*p` ahead would be safe if the compiler can prove `*p` will not panic; moving `*q` ahead would also require the compiler proving that no other goroutine can access `*q`.) </p> <p> Not introducing data races also means not assuming that called functions
HTML - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0) -
doc/go1.22.html
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/go1.17_spec.html
At that point, the program is terminated and the error condition is reported, including the value of the argument to <code>panic</code>. This termination sequence is called <i>panicking</i>. </p> <pre> panic(42) panic("unreachable") panic(Error("cannot parse")) </pre> <p> The <code>recover</code> function allows a program to manage behavior of a panicking goroutine.
HTML - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 211.6K bytes - Viewed (0) -
doc/go_spec.html
At that point, the program is terminated and the error condition is reported, including the value of the argument to <code>panic</code>. This termination sequence is called <i>panicking</i>. </p> <pre> panic(42) panic("unreachable") panic(Error("cannot parse")) </pre> <p> The <code>recover</code> function allows a program to manage behavior of a panicking goroutine.
HTML - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 279.3K bytes - Viewed (0)