- Sort Score
- Num 10 results
- Language All
Results 31 - 40 of 161 for smaller (0.06 seconds)
-
CONTRIBUTING.md
navigate to the [GitHub "issues" tab](https://github.com/tensorflow/tensorflow/issues) and start looking through interesting issues. If you are not sure of where to start, then start by trying one of the smaller/easier issues here i.e. [issues with the "good first issue" label](https://github.com/tensorflow/tensorflow/labels/good%20first%20issue) and then take a look at the
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Sat Jan 11 04:47:59 GMT 2025 - 15.9K bytes - Click Count (0) -
cmd/common-main.go
} mlimit, err := humanize.ParseBytes(memlimit) if err != nil { return err } if mlimit > memAvailable { logger.Info("WARNING: maximum memory available (%s) smaller than specified --memlimit=%s, ignoring --memlimit value", humanize.IBytes(memAvailable), memlimit) } ctxt.MemLimit = mlimit } else { ctxt.MemLimit = memAvailable }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 32.5K bytes - Click Count (3) -
cmd/encryption-v1.go
endEncOffset := encCumulativeSum + (endPkgNum+1)*sseDAREEncPackageBlockSize // Check if the DARE package containing the end offset is a // full sized package (as the last package in the part may be // smaller) lastPartSize, _ := sio.EncryptedSize(uint64(sizes[partEnd])) if endEncOffset > encCumulativeSum+int64(lastPartSize) { endEncOffset = encCumulativeSum + int64(lastPartSize) } encLength = endEncOffset - encOff
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 38K bytes - Click Count (0) -
src/bytes/bytes.go
if 'A' <= sr && sr <= 'Z' && tr == sr+'a'-'A' { continue } return false } // General case. SimpleFold(x) returns the next equivalent rune > x // or wraps around to smaller values. r := unicode.SimpleFold(sr) for r != sr && r < tr { r = unicode.SimpleFold(r) } if r == tr { continue } return false }
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Sep 16 16:42:15 GMT 2025 - 35.5K bytes - Click Count (0) -
cmd/erasure-multipart.go
buffer = globalBytePoolCap.Load().Get() defer globalBytePoolCap.Load().Put(buffer) } case size < fi.Erasure.BlockSize: // No need to allocate fully fi.Erasure.BlockSize buffer if the incoming data is smaller. buffer = make([]byte, size, 2*size+int64(fi.Erasure.ParityBlocks+fi.Erasure.DataBlocks-1)) } if len(buffer) > int(fi.Erasure.BlockSize) { buffer = buffer[:fi.Erasure.BlockSize] }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 24 04:05:31 GMT 2025 - 47.1K bytes - Click Count (0) -
cmd/api-errors.go
HTTPStatusCode: http.StatusBadRequest, }, ErrEntityTooSmall: { Code: "EntityTooSmall", Description: "Your proposed upload is smaller than the minimum allowed object size.", HTTPStatusCode: http.StatusBadRequest, }, ErrEntityTooLarge: { Code: "EntityTooLarge",Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Wed Apr 16 07:34:24 GMT 2025 - 93K bytes - Click Count (3) -
doc/asm.html
A data symbol with the <code>RODATA</code> flag is allocated in read-only memory and is therefore treated as implicitly marked <code>NOPTR</code>. A data symbol with a total size smaller than a pointer is also treated as implicitly marked <code>NOPTR</code>. It is not possible to define a symbol containing pointers in an assembly source file; such a symbol must be defined in a Go source file instead.
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Nov 14 19:09:46 GMT 2025 - 36.5K bytes - Click Count (0) -
doc/go_spec.html
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Dec 02 23:07:19 GMT 2025 - 286.5K bytes - Click Count (1) -
cmd/erasure-server-pool.go
buffers := bpool.NewBytePoolCap(n, blockSizeV2, blockSizeV2*2) if n >= 16384 { // pre-populate buffers only n >= 16384 which is (32Gi/2Mi) // for all setups smaller than this avoid pre-alloc. buffers.Populate() } globalBytePoolCap.Store(buffers) var localDrives []StorageAPI local := endpointServerPools.FirstLocal() for i, ep := range endpointServerPools {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 89.2K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
following hold: // // u = A*a - B*m // v = D*m - C*a // 0 < u <= a // 0 <= v <= m // 0 <= A < m // 0 <= B <= a // 0 <= C < m // 0 <= D <= a // // After each loop iteration, u and v only get smaller, and at least one of // them shrinks by at least a factor of two. for { // If both u and v are odd, subtract the smaller from the larger. // If u = v, we need to subtract from v to hit the modified exit condition. if u.IsOdd() == yes && v.IsOdd() == yes { if v.cmpGeq(u) == no { u.sub(v) A.Add(C, &Modulus{nat:...Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)