Search Options

Results per page
Sort
Preferred Languages
Advance

Results 51 - 55 of 55 for simultaneously (0.2 sec)

  1. CHANGELOG/CHANGELOG-1.2.md

    container is built.
         * Turnkey Deployments (Deployment API (Beta) in the Extensions API group)
    automate deployment and rolling updates of applications, specified
    declaratively. It handles versioning, multiple simultaneous rollouts,
    aggregating status across all pods, maintaining application availability, and
    rollback.
      * <strong>Automated cluster management: </strong>
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Fri Dec 04 06:36:19 UTC 2020
    - 41.4K bytes
    - Viewed (0)
  2. src/archive/zip/reader_test.go

    	}
    
    	// test read of each file
    	for i, ft := range zt.File {
    		readTestFile(t, zt, ft, z.File[i], raw)
    	}
    	if t.Failed() {
    		return
    	}
    
    	// test simultaneous reads
    	n := 0
    	done := make(chan bool)
    	for i := 0; i < 5; i++ {
    		for j, ft := range zt.File {
    			go func(j int, ft ZipTestFile) {
    				readTestFile(t, zt, ft, z.File[j], raw)
    				done <- true
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Fri Oct 17 20:10:27 UTC 2025
    - 56.5K bytes
    - Viewed (0)
  3. CHANGELOG/CHANGELOG-1.27.md

    - Fixed incorrect watch events when a watch is initialized simultanously with a reinitializing watchcache. ([#116436](https://github.com/kubernetes/kubernetes/pull/116436), [@wojtek-t](https://github.com/wojtek-t))
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Jul 17 07:48:22 UTC 2024
    - 466.3K bytes
    - Viewed (2)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    r4 r3 r2 r1 r0 // // We can then use the reduction identity (a * 2²⁵⁵ + b = a * 19 + b) to // reduce the limbs that would overflow 255 bits. r5 * 2²⁵⁵ becomes 19 * r5, // r6 * 2³⁰⁶ becomes 19 * r6 * 2⁵¹, etc. // // Reduction can be carried out simultaneously to multiplication. For // example, we do not compute r5: whenever the result of a multiplication // belongs to r5, like a1b4, we multiply it by 19 and add the result to r0. // // a4b0 a3b0 a2b0 a1b0 a0b0 + // a3b1 a2b1 a1b1 a0b1 19×a4b1 + // a2b2...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  5. lib/fips140/v1.1.0-rc1.zip

    r4 r3 r2 r1 r0 // // We can then use the reduction identity (a * 2²⁵⁵ + b = a * 19 + b) to // reduce the limbs that would overflow 255 bits. r5 * 2²⁵⁵ becomes 19 * r5, // r6 * 2³⁰⁶ becomes 19 * r6 * 2⁵¹, etc. // // Reduction can be carried out simultaneously to multiplication. For // example, we do not compute r5: whenever the result of a multiplication // belongs to r5, like a1b4, we multiply it by 19 and add the result to r0. // // a4b0 a3b0 a2b0 a1b0 a0b0 + // a3b1 a2b1 a1b1 a0b1 19×a4b1 + // a2b2...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
Back to top