Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 230 for Bounds (0.08 seconds)

  1. RELEASE.md

        `SparseDenseCwiseMul`
        ([CVE-2021-29567](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29567))
    *   Fixes a heap out of bounds read in `MaxPoolGradWithArgmax`
        ([CVE-2021-29570](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29570))
    *   Fixes a heap out of bounds read in `RequantizationRange`
        ([CVE-2021-29569](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29569))
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. lib/fips140/v1.1.0-rc1.zip

    key directly to its instructions. type blockExpanded struct { rounds int // Round keys, where only the first (rounds + 1) × (128 ÷ 32) words are used. enc [60]uint32 dec [60]uint32 } const ( // AES-128 has 128-bit keys, 10 rounds, and uses 11 128-bit round keys // (11×128÷32 = 44 32-bit words). // AES-192 has 192-bit keys, 12 rounds, and uses 13 128-bit round keys // (13×128÷32 = 52 32-bit words). // AES-256 has 256-bit keys, 14 rounds, and uses 15 128-bit round keys // (15×128÷32 = 60 32-bit words)....
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  3. .bazelrc

    common:linux --copt="-Wno-all"
    common:linux --copt="-Wno-extra"
    common:linux --copt="-Wno-deprecated"
    common:linux --copt="-Wno-deprecated-declarations"
    common:linux --copt="-Wno-ignored-attributes"
    common:linux --copt="-Wno-array-bounds"
    
    # Add unused-result as an error on Linux.
    common:linux --copt="-Wunused-result"
    common:linux --copt="-Werror=unused-result"
    # Add switch as an error on Linux.
    common:linux --copt="-Wswitch"
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Fri Dec 26 23:20:26 GMT 2025
    - 56.8K bytes
    - Click Count (0)
  4. src/cmd/asm/internal/asm/parse.go

    	if !ok {
    		if loName == "EOF" {
    			p.errorf("register list: expected ']', found EOF")
    		} else {
    			p.errorf("register list: bad low register in `[%s`", loName)
    		}
    		return
    	}
    	if tok := p.next().ScanToken; tok != '-' {
    		p.errorf("register list: expected '-' after `[%s`, found %s", loName, tok)
    		return
    	}
    	hiName := p.next().String()
    	hi, ok := p.arch.Register[hiName]
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Nov 12 03:59:40 GMT 2025
    - 37.3K bytes
    - Click Count (0)
  5. tensorflow/c/c_api.cc

        }                                                                     \
        if (index < 0 || index >= list->response.size()) {                    \
          status->status = InvalidArgument("index out of bounds");            \
          return err_val;                                                     \
        }                                                                     \
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Sat Oct 04 05:55:32 GMT 2025
    - 102.4K bytes
    - Click Count (0)
  6. doc/go_spec.html

    (or even be just another bound type parameter).
    In a process of repeated simplification, the bound type parameters in each type
    argument are substituted with the respective type arguments for those type
    parameters until each type argument is free of bound type parameters.
    </p>
    
    <p>
    If type arguments contain cyclic references to themselves
    through bound type parameters, simplification and thus type
    inference fails.
    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)
  7. docs/en/docs/advanced/sub-applications.md

    # Sub Applications - Mounts { #sub-applications-mounts }
    
    If you need to have two independent FastAPI applications, with their own independent OpenAPI and their own docs UIs, you can have a main app and "mount" one (or more) sub-application(s).
    
    ## Mounting a **FastAPI** application { #mounting-a-fastapi-application }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 3K bytes
    - Click Count (0)
  8. cmd/object-api-interface_gen.go

    				return
    			}
    		default:
    			bts, err = msgp.Skip(bts)
    			if err != nil {
    				err = msgp.WrapError(err)
    				return
    			}
    		}
    	}
    	o = bts
    	return
    }
    
    // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
    func (z BucketOptions) Msgsize() (s int) {
    	s = 1 + 8 + msgp.BoolSize + 7 + msgp.BoolSize + 11 + msgp.BoolSize
    	return
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 8.7K bytes
    - Click Count (0)
  9. internal/bucket/bandwidth/monitor_gen.go

    		default:
    			bts, err = msgp.Skip(bts)
    			if err != nil {
    				err = msgp.WrapError(err)
    				return
    			}
    		}
    	}
    	o = bts
    	return
    }
    
    // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
    func (z BucketBandwidthReport) Msgsize() (s int) {
    	s = 1
    	return
    }
    
    // DecodeMsg implements msgp.Decodable
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 5.4K bytes
    - Click Count (0)
  10. internal/dsync/lock-args_gen.go

    				}
    			}
    		default:
    			bts, err = msgp.Skip(bts)
    			if err != nil {
    				err = msgp.WrapError(err)
    				return
    			}
    		}
    	}
    	o = bts
    	return
    }
    
    // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
    func (z *LockArgs) Msgsize() (s int) {
    	s = 1 + 4 + msgp.StringPrefixSize + len(z.UID) + 10 + msgp.ArrayHeaderSize
    	for za0001 := range z.Resources {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 10.2K bytes
    - Click Count (0)
Back to Top