- Sort Score
- Num 10 results
- Language All
Results 1 - 6 of 6 for Weigher (0.1 seconds)
-
RELEASE.md
* Note that NumPy's type promotion rules have been changed(See [NEP 50](https://numpy.org/neps/nep-0050-scalar-promotion.html#nep50)for details). This may change the precision at which computations happen, leading either to type errors or to numerical changes to results. * Tensorflow will continue to support NumPy 1.26 until 2025, aligning with community standard deprecation timeline [here](https://scientific-python.org/specs/spec-0000/).
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
lib/fips140/v1.0.0-c2097c7c.zip
continue } if result == millerRabinCOMPOSITE { return false } iterations-- if iterations == 0 { return true } } } // productOfPrimes is the product of the first 74 primes higher than 2. // // The number of primes was selected to be the highest such that the product fit // in 512 bits, so to be usable for 1024 bit RSA keys. // // Higher values cause fewer Miller-Rabin tests of composites (nothing can help // with the final test on the actual prime) but make InverseVarTime take longer. var productOfPrimes...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) -
CHANGELOG/CHANGELOG-1.19.md
found errors. - this required deleting some genfeddoc stuff. the binary no longer exists in k/k repo since we removed federation/, and I don't see it in https://github.com/kubernetes-sigs/kubefed/ either. I'm assuming that it's gone for good now. - bazel: output go_binary rule directly from go_binary_conditional_pure From: [@mikedanese](https://github.com/mikedanese):Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Wed Jan 05 05:42:32 GMT 2022 - 489.7K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
move by // 5 bits at a time and need to finish at -1, so -1 + 5 * 51 = 254. index := 254 sel, sign := boothW5(s.Rsh(index)) // sign is always zero because the boothW5 input here is at // most two bits long, so the top bit is never set. _ = sign // Neither Select nor Add have exceptions for the point at infinity / // selector zero, so we don't need to check for it here or in the loop. table := new(p256Table).Compute(q) table.Select(p, sel) t := NewP256Point() for index >= 4 { index -= 5 p.Double(p)...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
* * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, * either express or implied. See the License for the specific language * governing permissions and limitations under the License. */ package org.codelibs.fess.mylasta.direction;
Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Dec 13 02:21:17 GMT 2025 - 525.7K bytes - Click Count (2) -
docs/en/docs/release-notes.md
* First to FastAPI `0.68.2`, with no breaking changes, but upgrading all the sub-dependencies. * Next to FastAPI `0.69.0`, which upgrades Starlette to `0.15.0`, with AnyIO support, and a higher chance of having breaking changes in your code. * Finally to FastAPI `0.70.0`, just upgrading Starlette to the latest version `0.16.0` with additional bug fixes.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Dec 27 19:06:15 GMT 2025 - 586.7K bytes - Click Count (0)