- Sort Score
- Result 10 results
- Languages All
Results 31 - 35 of 35 for ceiling (0.07 sec)
-
src/archive/tar/writer.go
} // Write writes to the current file in the tar archive. // Write returns the error [ErrWriteTooLong] if more than // Header.Size bytes are written after [Writer.WriteHeader]. // // Calling Write on special types like [TypeLink], [TypeSymlink], [TypeChar], // [TypeBlock], [TypeDir], and [TypeFifo] returns (0, [ErrWriteTooLong]) regardless // of what the [Header.Size] claims.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Feb 03 16:38:43 UTC 2025 - 19.7K bytes - Viewed (0) -
src/bufio/bufio_test.go
{"byte", iotest.OneByteReader}, {"half", iotest.HalfReader}, {"data+err", iotest.DataErrReader}, {"timeout", iotest.TimeoutReader}, } // Call ReadString (which ends up calling everything else) // to accumulate the text of a file. func readLines(b *Reader) string { s := "" for { s1, err := b.ReadString('\n') if err == io.EOF { break }Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 07 01:08:54 UTC 2025 - 51.6K bytes - Viewed (0) -
src/bytes/bytes.go
// punctuation properly. Use golang.org/x/text/cases instead. func Title(s []byte) []byte { // Use a closure here to remember state. // Hackish but effective. Depends on Map scanning in order and calling // the closure once per rune. prev := ' ' return Map( func(r rune) rune { if isSeparator(prev) { prev = r return unicode.ToTitle(r) } prev = r return r },
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Sep 03 14:04:47 UTC 2025 - 35.5K bytes - Viewed (0) -
doc/go_spec.html
or, for function parameters and results, the signature of a <a href="#Function_declarations">function declaration</a> or <a href="#Function_literals">function literal</a> reserves storage for a named variable. Calling the built-in function <a href="#Allocation"><code>new</code></a> or taking the address of a <a href="#Composite_literals">composite literal</a> allocates storage for a variable at run time.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (1) -
lib/fips140/v1.0.0.zip
whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing is only 1/65537, so it doesn't matter. continue } if e.ExpandFor(λ).Mul(d, λ).IsOne() == 0 { return nil, errors.New("rsa: internal error: e*d != 1 mod λ(N)") } // FIPS 186-5, A.1.1(3) requires checking that d > 2^(nlen / 2). // // The probability of this check failing when d is derived from // (e, p, q) is roughly // // 2^(nlen/2) / 2^nlen = 2^(-nlen/2) // // so less than 2⁻¹²⁸...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)