- Sort Score
- Result 10 results
- Languages All
Results 421 - 430 of 2,232 for contents (0.11 sec)
-
tensorflow/c/eager/c_api.h
// Clears the internal caches in the TFE context. Useful when reseeding random // ops. TF_CAPI_EXPORT extern void TFE_ContextClearCaches(TFE_Context* ctx); // Sets a thread-local device placement policy. After this call, other calls to // TFE_Execute in the same thread will use the device policy specified here // instead of the device policy used to construct the context. This has no
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Thu Apr 27 21:07:00 UTC 2023 - 22.8K bytes - Viewed (0) -
licenses/github.com/hashicorp/errwrap/LICENSE
this License. 1.10. “Modifications” means any of the following: a. any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or b. any new file in Source Code Form that contains any Covered Software. 1.11. “Patent Claims” of a Contributor
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Sat Oct 26 02:47:39 UTC 2019 - 15.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMultiset.java
import java.util.function.ToIntFunction; import java.util.stream.Collector; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@link SortedMultiset} whose contents will never change, with many other important properties * detailed at {@link ImmutableCollection}. * * <p><b>Warning:</b> as with any sorted collection, you are strongly advised not to use a {@link
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 16 21:21:17 UTC 2024 - 35.4K bytes - Viewed (0) -
LICENSE
covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does.
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Mon Jan 18 20:25:38 UTC 2016 - 25.8K bytes - Viewed (0) -
common-protos/k8s.io/api/admissionregistration/v1beta1/generated.proto
// // Required. optional string name = 1; // Expression represents the expression which will be evaluated by CEL. Must evaluate to bool. // CEL expressions have access to the contents of the AdmissionRequest and Authorizer, organized into CEL variables: // // 'object' - The object from the incoming request. The value is null for DELETE requests.
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 22.6K bytes - Viewed (0) -
misc/go_android_exec/main.go
} // We use a single recursive 'adb push' of the module root instead of // walking the tree and copying it piecewise. If the directory tree // contains nested modules this could push a lot of unnecessary contents, // but for the golang.org/x repos it seems to be significantly (~2x) // faster than copying one file at a time (via filepath.WalkDir), // apparently due to high latency in 'adb' commands.
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Aug 21 17:46:57 UTC 2023 - 15.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
} for (int i = 0; i < length(); i++) { if (this.get(i) != that.get(i)) { return false; } } return true; } /** Returns an unspecified hash code for the contents of this immutable array. */ @Override public int hashCode() { int hash = 1; for (int i = start; i < end; i++) { hash *= 31; hash += Longs.hashCode(array[i]); } return hash;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 22.3K bytes - Viewed (0) -
guava/src/com/google/common/primitives/ImmutableIntArray.java
} for (int i = 0; i < length(); i++) { if (this.get(i) != that.get(i)) { return false; } } return true; } /** Returns an unspecified hash code for the contents of this immutable array. */ @Override public int hashCode() { int hash = 1; for (int i = start; i < end; i++) { hash *= 31; hash += Ints.hashCode(array[i]); } return hash;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 21.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* PermittedMetaException}. */ protected final class MultiExceptionListIterator implements ListIterator<E> { // TODO: track seen elements when order isn't guaranteed // TODO: verify contents afterward // TODO: something shiny and new instead of Stack // TODO: test whether null is supported (create a Feature) /**
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 20.6K bytes - Viewed (0) -
licenses/github.com/klauspost/compress/LICENSE
documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Tue Nov 30 19:13:15 UTC 2021 - 16.3K bytes - Viewed (0)