Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 201 - 210 of 375 for Computed (0.05 seconds)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/CertificatePinner.kt

      ) {
        val pins = findMatchingPins(hostname)
        if (pins.isEmpty()) return
    
        val peerCertificates = cleanedPeerCertificatesFn()
    
        for (peerCertificate in peerCertificates) {
          // Lazily compute the hashes for each certificate.
          var sha1: ByteString? = null
          var sha256: ByteString? = null
    
          for (pin in pins) {
            when (pin.hashAlgorithm) {
              "sha256" -> {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 14.2K bytes
    - Click Count (1)
  2. build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/info/GlobalBuildInfoPlugin.java

        private static String getJavaHomeEnvVarName(String version) {
            return "JAVA" + version + "_HOME";
        }
    
        private static int findDefaultParallel(Project project) {
            // Since it costs IO to compute this, and is done at configuration time we want to cache this if possible
            // It's safe to store this in a static variable since it's just a primitive so leaking memory isn't an issue
            if (_defaultParallel == null) {
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Tue Aug 17 10:02:58 GMT 2021
    - 18.1K bytes
    - Click Count (0)
  3. tensorflow/c/c_api.h

                                        TF_Status* status, TF_Output* dy);
    
    // Adds operations to compute the partial derivatives of sum of `y`s w.r.t `x`s,
    // i.e., d(y_1 + y_2 + ...)/dx_1, d(y_1 + y_2 + ...)/dx_2...
    // This is a variant of TF_AddGradients that allows to caller to pass a custom
    // name prefix to the operations added to a graph to compute the gradients.
    //
    // `dx` are used as initial gradients (which represent the symbolic partial
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Thu Oct 26 21:08:15 GMT 2023
    - 82.3K bytes
    - Click Count (0)
  4. LICENSE

          result of this License or out of the use or inability to use the
          Work (including but not limited to damages for loss of goodwill,
          work stoppage, computer failure or malfunction, or any and all
          other commercial damages or losses), even if such Contributor
          has been advised of the possibility of such damages.
    
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Nov 29 17:31:56 GMT 2021
    - 13.3K bytes
    - Click Count (0)
  5. go.mod

    	cel.dev/expr v0.23.1 // indirect
    	cloud.google.com/go v0.120.1 // indirect
    	cloud.google.com/go/auth v0.16.0 // indirect
    	cloud.google.com/go/auth/oauth2adapt v0.2.8 // indirect
    	cloud.google.com/go/compute/metadata v0.6.0 // indirect
    	cloud.google.com/go/iam v1.5.2 // indirect
    	cloud.google.com/go/monitoring v1.24.2 // indirect
    	filippo.io/edwards25519 v1.1.0 // indirect
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Oct 10 18:57:03 GMT 2025
    - 12.2K bytes
    - Click Count (0)
  6. LICENSES/vendor/cel.dev/expr/LICENSE

          result of this License or out of the use or inability to use the
          Work (including but not limited to damages for loss of goodwill,
          work stoppage, computer failure or malfunction, or any and all
          other commercial damages or losses), even if such Contributor
          has been advised of the possibility of such damages.
    
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Nov 06 20:53:17 GMT 2024
    - 11.2K bytes
    - Click Count (0)
  7. LICENSE

          result of this License or out of the use or inability to use the
          Work (including but not limited to damages for loss of goodwill,
          work stoppage, computer failure or malfunction, or any and all
          other commercial damages or losses), even if such Contributor
          has been advised of the possibility of such damages.
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Feb 22 18:59:39 GMT 2023
    - 11.1K bytes
    - Click Count (0)
  8. src/test/java/jcifs/smb/SmbTransportImplTest.java

                assertThrows(SmbUnsupportedOperationException.class, () -> transport.calculatePreauthHash(new byte[] { 1, 2, 3 }, 0, 3, null));
            }
    
            @Test
            @DisplayName("calculatePreauthHash computes SHA-512 chain for SMB 3.1.1")
            void preauthHash_happyPath() throws Exception {
                setField(transport, "smb2", true);
                Smb2NegotiateResponse nego = new Smb2NegotiateResponse(cfg);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 17.6K bytes
    - Click Count (0)
  9. cmd/erasure-metadata-utils.go

    	}
    	if partSize == 0 {
    		return 0, errPartSizeZero
    	}
    	if partIndex < 1 {
    		return 0, errPartSizeIndex
    	}
    	if totalSize == -1 {
    		return -1, nil
    	}
    	if totalSize > 0 {
    		// Compute the total count of parts
    		partsCount := totalSize/partSize + 1
    		// Return the part's size
    		switch {
    		case int64(partIndex) < partsCount:
    			currPartSize = partSize
    		case int64(partIndex) == partsCount:
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 11.7K bytes
    - Click Count (0)
  10. internal/rest/client.go

    }
    
    // LastError returns previous error
    func (c *Client) LastError() error {
    	c.RLock()
    	defer c.RUnlock()
    	return fmt.Errorf("[%s] %w", c.lastErrTime.Format(time.RFC3339), c.lastErr)
    }
    
    // computes the exponential backoff duration according to
    // https://www.awsarchitectureblog.com/2015/03/backoff.html
    func exponentialBackoffWait(r *rand.Rand, unit, maxSleep time.Duration) func(uint) time.Duration {
    	if unit > time.Hour {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 14.7K bytes
    - Click Count (0)
Back to Top