Searched refs:Worst (Results 1 – 24 of 24) sorted by relevance
88 Testing collisions (high 19-26 bits) - Worst is 22 bits: 320/611 (0.52x)92 Testing collisions (low 19-26 bits) - Worst is 20 bits: 1168/2445 (0.48x)95 Testing distribution - Worst bias is the 13-bit window at bit 4 - 0.462%100 Testing collisions (high 24-36 bits) - Worst is 35 bits: 26/47 (0.55x)104 Testing collisions (low 24-36 bits) - Worst is 34 bits: 52/94 (0.55x)107 Testing distribution - Worst bias is the 17-bit window at bit 8 - 0.085%112 Testing collisions (high 26-39 bits) - Worst is 39 bits: 24/37 (0.65x)116 Testing collisions (low 26-39 bits) - Worst is 34 bits: 630/1186 (0.53x)119 Testing distribution - Worst bias is the 19-bit window at bit 47 - 0.045%124 Testing collisions (high 26-39 bits) - Worst is 34 bits: 639/1230 (0.52x)[all …]
88 Testing collisions (high 19-25 bits) - Worst is 24 bits: 90/76 (1.18x)92 Testing collisions (low 19-25 bits) - Worst is 25 bits: 39/38 (1.02x)95 Testing distribution - Worst bias is the 13-bit window at bit 55 - 0.572%100 Testing collisions (high 24-35 bits) - Worst is 26 bits: 12182/12047 (1.01x)104 Testing collisions (low 24-35 bits) - Worst is 32 bits: 201/188 (1.07x)107 Testing distribution - Worst bias is the 17-bit window at bit 53 - 0.082%112 Testing collisions (high 25-38 bits) - Worst is 30 bits: 9627/9492 (1.01x)116 Testing collisions (low 25-38 bits) - Worst is 30 bits: 9493/9492 (1.00x)119 Testing distribution - Worst bias is the 19-bit window at bit 12 - 0.048%124 Testing collisions (high 25-38 bits) - Worst is 32 bits: 2561/2461 (1.04x)[all …]
223 # Worst case for Miller-Rabin test229 # Worst case for Miller-Rabin test235 # Worst case for Miller-Rabin test241 # Worst case for Miller-Rabin test247 # Worst case for Miller-Rabin test253 # Worst case for Miller-Rabin test259 # Worst case for Miller-Rabin test265 # Worst case for Miller-Rabin test271 # Worst case for Miller-Rabin test277 # Worst case for Miller-Rabin test[all …]
197 // Best/Common/Worst case = 7 / 23 / 27202 // Best/Common/Worst case = 7 / 31 / 35207 // Best/Common/Worst case = 7 / 19 / 23212 // Best/Common/Worst case = 7 / 27 / 31217 // Best/Common/Worst case = 7 / 27 / 27222 // Best/Common/Worst case = 7 / 27 / 31227 // Best/Common/Worst case = 7 / 27 / 31232 // Best/Common/Worst case = 7 / 35 / 39
65 5.2: Worst error at least 1.45 ulp at67 5.3: Worst error 0.96 ulp
26 5.2: Worst error at least 1.45 ulp at28 5.3: Worst error 0.96 ulp
241 // Best/Common/Worst case = 7 / 23 / 27246 // Best/Common/Worst case = 7 / 23 / 27251 // Best/Common/Worst case = 7 / 31 / 35256 // Best/Common/Worst case = 7 / 19 / 23261 // Best/Common/Worst case = 7 / 27 / 31266 // Best/Common/Worst case = 7 / 27 / 27271 // Best/Common/Worst case = 7 / 27 / 31276 // Best/Common/Worst case = 7 / 27 / 31281 // Best/Common/Worst case = 7 / 35 / 39
242 // Best/Common/Worst case = 7 / 23 / 27247 // Best/Common/Worst case = 7 / 23 / 27252 // Best/Common/Worst case = 7 / 31 / 35257 // Best/Common/Worst case = 7 / 19 / 23262 // Best/Common/Worst case = 7 / 27 / 31267 // Best/Common/Worst case = 7 / 27 / 27272 // Best/Common/Worst case = 7 / 27 / 31277 // Best/Common/Worst case = 7 / 27 / 31282 // Best/Common/Worst case = 7 / 35 / 39
65 // Worst case latency is used.
1398 unsigned Worst = 0; in calculateRegionSplitCost() local1404 Worst = i; in calculateRegionSplitCost()1409 GlobalCand[Worst] = GlobalCand[NumCands]; in calculateRegionSplitCost()1411 BestCand = Worst; in calculateRegionSplitCost()
1887 unsigned Worst = 0; in calculateRegionSplitCost() local1893 Worst = i; in calculateRegionSplitCost()1898 GlobalCand[Worst] = GlobalCand[NumCands]; in calculateRegionSplitCost()1900 BestCand = Worst; in calculateRegionSplitCost()
1877 unsigned Worst = 0; in calculateRegionSplitCost() local1883 Worst = CandIndex; in calculateRegionSplitCost()1888 GlobalCand[Worst] = GlobalCand[NumCands]; in calculateRegionSplitCost()1890 BestCand = Worst; in calculateRegionSplitCost()
118 // Worst case is 6 instrs:
117 // Worst case is 6 instrs:
461 let Size = 8; // Worst case. (s_add_u32 + constant)473 let Size = 8; // Worst case. (s_add_u32 + constant)
495 let Size = 8; // Worst case. (s_add_u32 + constant)507 let Size = 8; // Worst case. (s_add_u32 + constant)
1219 // If we exceed the default uniform max size, try to allocate a buffer. Worst case
9328 static ICEDiag Worst(ICEDiag A, ICEDiag B) { return A.Kind >= B.Kind ? A : B; } in Worst() function9606 return Worst(LHSResult, RHSResult); in CheckICE()9622 return Worst(LHSResult, RHSResult); in CheckICE()
699 + Worst case performance for incrementally growing/shrinking reallocation
15033 static ICEDiag Worst(ICEDiag A, ICEDiag B) { return A.Kind >= B.Kind ? A : B; } in Worst() function15324 return Worst(LHSResult, RHSResult); in CheckICE()15340 return Worst(LHSResult, RHSResult); in CheckICE()
4474 printf("Worst run took %.0fx longer than the average latency.\n",
3039 3 bytes per pixel for a color image. Worst case (1x1 sampling) requires
1a 2A 3Aaron 4AARON 5abaissiez 6abandon 7abandoned 8abase 9Abase 10 ...