Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 411 - 420 of 434 for xlarge (0.09 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. cmd/api-errors.go

    		HTTPStatusCode: http.StatusPreconditionFailed,
    	},
    	ErrRequestTimeTooSkewed: {
    		Code:           "RequestTimeTooSkewed",
    		Description:    "The difference between the request time and the server's time is too large.",
    		HTTPStatusCode: http.StatusForbidden,
    	},
    	ErrSignatureDoesNotMatch: {
    		Code:           "SignatureDoesNotMatch",
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Apr 16 07:34:24 GMT 2025
    - 93K bytes
    - Click Count (3)
  2. CHANGELOG/CHANGELOG-1.10.md

    * Pass cluster_location argument to Heapster ([#65176](https://github.com/kubernetes/kubernetes/pull/65176), [@kawych](https://github.com/kawych))
    * fixes a memory leak in the kube-controller-manager observed when large numbers of pods with tolerations are created/deleted ([#65339](https://github.com/kubernetes/kubernetes/pull/65339), [@liggitt](https://github.com/liggitt))
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Thu May 05 13:44:43 GMT 2022
    - 341.8K bytes
    - Click Count (0)
  3. docs/changelogs/changelog_3x.md

    Because the release includes breaking API changes, we're changing the project's
    package name from `com.squareup.okhttp` to `okhttp3`. This should make it
    possible for large applications to migrate incrementally. The Maven group ID
    is now `com.squareup.okhttp3`. For an explanation of this strategy, see Jake
    Wharton's post, [Java Interoperability Policy for Major Version
    Updates][major_versions].
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sun Feb 06 14:55:54 GMT 2022
    - 50.8K bytes
    - Click Count (0)
  4. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2B1B..2B1F    ; valid                  ;      ; NV8    # 5.1  BLACK LARGE SQUARE..BLACK PENTAGON
    2B20..2B23    ; valid                  ;      ; NV8    # 5.0  WHITE PENTAGON..HORIZONTAL BLACK HEXAGON
    2B24..2B4C    ; valid                  ;      ; NV8    # 5.1  BLACK LARGE CIRCLE..RIGHTWARDS ARROW ABOVE REVERSE TILDE OPERATOR
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  5. doc/asm.html

    MOVQ	g(CX), AX     // Move g into AX.
    MOVQ	g_m(AX), BX   // Move g.m into BX.
    </pre>
    
    <p>
    Register <code>BP</code> is callee-save.
    The assembler automatically inserts <code>BP</code> save/restore when frame size is larger than zero.
    Using <code>BP</code> as a general purpose register is allowed,
    however it can interfere with sampling-based profiling.
    </p>
    
    <h3 id="arm">ARM</h3>
    
    <p>
    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)
  6. lib/fips140/v1.0.0-c2097c7c.zip

    := signPKCS1v15(k, "SHA-256", hash) if err != nil { return err } return verifyPKCS1v15(k.PublicKey(), "SHA-256", hash, sig) }) } return k, nil } } // errDivisorTooLarge is returned by [totient] when gcd(p-1, q-1) is too large. var errDivisorTooLarge = errors.New("divisor too large") // totient computes the Carmichael totient function λ(N) = lcm(p-1, q-1). func totient(p, q *bigmod.Modulus) (*bigmod.Modulus, error) { a, b := p.Nat().SubOne(p), q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) = a ×...
    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)
  7. lib/fips140/v1.1.0-rc1.zip

    := signPKCS1v15(k, "SHA-256", hash) if err != nil { return err } return verifyPKCS1v15(k.PublicKey(), "SHA-256", hash, sig) }) } return k, nil } } // errDivisorTooLarge is returned by [totient] when gcd(p-1, q-1) is too large. var errDivisorTooLarge = errors.New("divisor too large") // totient computes the Carmichael totient function λ(N) = lcm(p-1, q-1). func totient(p, q *bigmod.Modulus) (*bigmod.Modulus, error) { a, b := p.Nat().SubOne(p), q.Nat().SubOne(q) // lcm(a, b) = a×b / gcd(a, b) = a ×...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  8. cmd/xl-storage_test.go

    							t.Errorf("Case: %d %#v, expected: %s, got: %s", i+1, testCase, testCase.expectedErr, err)
    						}
    					}
    				}
    				// Err unexpected EOF special case, where we verify we have provided a larger
    				// buffer than the data itself, but the results are in-fact valid. So we validate
    				// this error condition specifically treating it as a good condition with valid
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 66K bytes
    - Click Count (0)
  9. CHANGELOG/CHANGELOG-1.23.md

    ## Changes by Kind
    
    ### Bug or Regression
    
    - Kube-apiserver: gzip compression switched from level 4 to level 1 to improve large list call latencies in exchange for higher network bandwidth usage (10-50% higher). This increases the headroom before very large unpaged list calls exceed request timeout limits. ([#112400](https://github.com/kubernetes/kubernetes/pull/112400), [@shyamjvs](https://github.com/shyamjvs)) [SIG API Machinery]
    Created: Fri Dec 26 09:05:12 GMT 2025
    - Last Modified: Tue Feb 28 21:06:52 GMT 2023
    - 424.5K bytes
    - Click Count (0)
  10. src/bytes/bytes_test.go

    		actual := LastIndexByte([]byte(test.a), test.b[0])
    		if actual != test.i {
    			t.Errorf("LastIndexByte(%q,%c) = %v; want %v", test.a, test.b[0], actual, test.i)
    		}
    	}
    }
    
    // test a larger buffer with different sizes and alignments
    func TestIndexByteBig(t *testing.T) {
    	var n = 1024
    	if testing.Short() {
    		n = 128
    	}
    	b := make([]byte, n)
    	for i := 0; i < n; i++ {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 23 23:54:14 GMT 2025
    - 62.9K bytes
    - Click Count (0)
Back to Top