- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for probe (0.24 sec)
-
src/bufio/bufio_test.go
} // The Reader should have buffered all the content from the io.Reader. if n := len(eofR.buf); n != 0 { t.Fatalf("got %d bytes left in bufio.Reader source; want 0 bytes", n) } // To prove the point, check that there are still 5 bytes available to read. if n := r.Buffered(); n != 5 { t.Fatalf("got %d bytes buffered in bufio.Reader; want 5 bytes", n) } // This is the second read of 0 bytes.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Feb 10 18:56:01 GMT 2023 - 51.5K bytes - Viewed (0) -
doc/go_mem.html
<p> 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 May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0)