- Sort Score
- Num 10 results
- Language All
Results 21 - 23 of 23 for simultaneously (0.07 seconds)
-
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 <- trueCreated: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Oct 17 20:10:27 GMT 2025 - 56.5K bytes - Click Count (0) -
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...
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) -
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...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)