- Sort Score
- Result 10 results
- Languages All
Results 51 - 57 of 57 for Width (0.08 sec)
-
docs/ja/docs/index.md
--- ## **Typer**, the FastAPI of CLIs <a href="https://typer.tiangolo.com" target="_blank"><img src="https://typer.tiangolo.com/img/logo-margin/logo-margin-vector.svg" style="width: 20%;"></a> もし Web API の代わりにターミナルで使用する<abbr title="Command Line Interface">CLI</abbr>アプリを構築する場合は、<a href="https://typer.tiangolo.com/" class="external-link" target="_blank">**Typer**</a>を確認してください。
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 10:49:48 UTC 2025 - 21.3K bytes - Viewed (0) -
cmd/erasure-multipart.go
var buffer []byte switch size := data.Size(); { case size == 0: buffer = make([]byte, 1) // Allocate at least a byte to reach EOF case size >= fi.Erasure.BlockSize || size == -1: if int64(globalBytePoolCap.Load().Width()) < fi.Erasure.BlockSize { buffer = make([]byte, fi.Erasure.BlockSize, 2*fi.Erasure.BlockSize) } else { buffer = globalBytePoolCap.Load().Get() defer globalBytePoolCap.Load().Put(buffer) }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Sep 07 16:13:09 UTC 2025 - 47.3K bytes - Viewed (0) -
src/bufio/bufio_test.go
// While not recommended, it is valid to append to a shifted buffer. // This forces Write to copy the input. if rn.Intn(8) == 0 && cap(b) > 0 { b = b[1:1:cap(b)] } // Append a random integer of varying width. n := int64(rn.Intn(1 << rn.Intn(30))) want = append(strconv.AppendInt(want, n, 10), ' ') b = append(strconv.AppendInt(b, n, 10), ' ') w.Write(b) } w.Flush() if !bytes.Equal(got.Bytes(), want) {
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 07 01:08:54 UTC 2025 - 51.6K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
w < 2 { panic("w must be at least 2 by the definition of NAF") } else if w > 8 { panic("NAF digits must fit in int8") } var naf [256]int8 var digits [5]uint64 for i := 0; i < 4; i++ { digits[i] = byteorder.LEUint64(b[i*8:]) } width := uint64(1 << w) windowMask := uint64(width - 1) pos := uint(0) carry := uint64(0) for pos < 256 { indexU64 := pos / 64 indexBit := pos % 64 var bitBuf uint64 if indexBit < 64-w { // This window's bits are contained in a single u64 bitBuf = digits[indexU64] >> indexBit...Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
api/go1.txt
pkg fmt, type ScanState interface, Read([]uint8) (int, error) pkg fmt, type ScanState interface, ReadRune() (int32, int, error) pkg fmt, type ScanState interface, SkipSpace() pkg fmt, type ScanState interface, Token(bool, func(int32) bool) ([]uint8, error) pkg fmt, type ScanState interface, UnreadRune() error pkg fmt, type ScanState interface, Width() (int, bool)
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0) -
RELEASE.md
* `tf.scatter_update` now no longer guarantees that lexicographically largest index be used for update when duplicate entries exist. * `tf.image.random_crop(image, [height, width])` is now `tf.random_crop(image, [height, width, depth])`, and `tf.random_crop` works for any rank (not just 3-D images). The C++ `RandomCrop` op has been replaced with pure Python.Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (3) -
doc/go_spec.html
<p> For <a href="#Numeric_types">unsigned integer</a> values, the operations <code>+</code>, <code>-</code>, <code>*</code>, and <code><<</code> are computed modulo 2<sup><i>n</i></sup>, where <i>n</i> is the bit width of the unsigned integer's type. Loosely speaking, these unsigned integer operations discard high bits upon overflow, and programs may rely on "wrap around". </p> <p>
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (1)