- Sort Score
- Num 10 results
- Language All
Results 31 - 40 of 250 for products (0.21 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
CHANGELOG/CHANGELOG-1.26.md
- The `gcp` and `azure` auth plugins have been removed from `client-go` and `kubectl`. See [kubelogin](https://github.com/Azure/kubelogin) and [Kubectl Auth Changes in GKE](https://cloud.google.com/blog/products/containers-kubernetes/kubectl-auth-changes-in-gke) for details about the cloud-specific replacements. ([#112341](https://github.com/kubernetes/kubernetes/pull/112341), [@enj](https://github.com/enj)) ### API Change
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Sep 02 13:51:56 GMT 2025 - 425.7K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.9.md
* kubeadm now produces error during preflight checks if swap is enabled. Users, who can setup kubelet to run in unsupported environment with enabled swap, will be able to skip that preflight check. ([#55399](https://github.com/kubernetes/kubernetes/pull/55399), [@kad](https://github.com/kad))
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Tue Nov 16 10:46:27 GMT 2021 - 313.7K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier, T[i:n+i] is the shifted // position of the product of that digit, and T[n+i] is the final carry. // Note that T[i] isn't modified after processing the i-th digit. // // Instead of running two...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
millerRabinIteration(mr, b) if err != nil { // b was rejected. 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...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
tensorflow/c/eager/gradients.h
// eager tensors. void DeleteTrace(const AbstractTensorHandle*); // Consumes the internal state of the tape (so cannot be called more than // once unless the tape is persistent) and produces the gradient of the target // tensors with respect to the source tensors. The output gradients are used // if not empty and not null. The result is populated with one tensor per // target element.
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 12 05:11:17 GMT 2024 - 6.9K bytes - Click Count (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/package-info.java
* instances.</p> * * <p><dfn>Project aggregation</dfn> allows building several projects together. This is only * for projects that are built, hence available on the file system. One project, * called the <dfn>aggregator project</dfn> lists one or more <dfn>sub-projects</dfn> * which are relative pointers on the file system to other projects. This is done using
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Mon Dec 15 11:13:42 GMT 2025 - 7.7K bytes - Click Count (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Packaging.java
import org.apache.maven.api.model.PluginContainer; /** * Represents the packaging of a Maven project. * * <p>The {@code Packaging} class defines the type of artifact that a Maven project produces during the build process. * The packaging type determines the structure of the project's output and how Maven will treat the resulting artifact.</p> *Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 3.2K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 160-bit number, * while {@link Hashing#murmur3_32()} yields only 32 bits. Because a {@code long} value is * clearly insufficient to hold all hash code values, this API represents a hash code as an * instance of {@link HashCode}. * <li><b>pure function:</b> the value produced must depend only on the input bytes, in the orderCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
tensorflow/c/eager/c_api_remote_test.cc
ASSERT_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status); float product[4] = {0}; EXPECT_EQ(sizeof(product), TF_TensorByteSize(t)); memcpy(&product[0], TF_TensorData(t), TF_TensorByteSize(t)); TF_DeleteTensor(t); EXPECT_EQ(7, product[0]); EXPECT_EQ(10, product[1]); EXPECT_EQ(15, product[2]); EXPECT_EQ(22, product[3]); TFE_DeleteTensorHandle(h0_task0); TFE_DeleteTensorHandle(h1_task0);
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Wed Aug 12 00:14:22 GMT 2020 - 5.4K bytes - Click Count (0) -
.github/CODEOWNERS
# Release coordination packaging/core-platform/ @gradle/bt-product-operations packaging/distributions-dependencies/ @gradle/bt-product-operations packaging/distributions-full/ @gradle/bt-product-operations packaging/public-api @gradle/bt-product-operations testing/performance/ @gradle/bt-developer-productivity
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Mon Mar 23 18:38:15 GMT 2026 - 10.8K bytes - Click Count (0)